Public report of intel/rohd, published 17 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, 17 November 2026, 20:24 UTC · Survey ID cd_4e8f2ad11cf245609d8807e35af40662

intel/rohd

Measured 17 November 2026, 20:23 UTC, at code version 7909705

First survey, so nothing to compare with yet
CAI score 50.3out of 100 Adequate
CriticalWeakAdequateStrongExemplary

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: 92,571 lines of product code in 8 projects, tests not counted · Estimated rebuild effort: about 1.1 person-years · Weakest lens: Code Health, 34.5

Findings by how serious they are

36 critical 638 serious 53 minor

5 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
17 November 2026, 20:23 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 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 ▸

71of 71 dimensions measured by tools.
713of 727 findings point to an exact file and line, so you can open each one in the code. The other 14 concern the repository as a whole, such as missing documentation.
71dimensions across 7 lenses, read from 92,571 lines of product code in 8 projects.
Chapters

Executive summary

intel/rohd falls short of our standard for a preview release, held back most by its Code Health lens, the quality of the code itself. It scores 50.3 out of 100 and is rated Adequate, and all 36 of its critical findings are security problems in the build pipeline and in the packages it uses.

Code Health, at 34.5, is the weakest lens and counts most in the score. The best first step is splitting the oversized files, worth about 5.9 points. Removing the copied code comes next, worth about 4.2 points. Raising Code Health to 67 would lift the score to about 62.4.

Thirty-two pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Two pipeline steps run downloads nobody checks, and one known security hole in a package the code depends on can be used by attackers. Pinning each tool to an exact version, checking each download against a checksum and updating the vulnerable packages would close these risks. Limiting each secret to its own step would fix the secret exposed to more of the pipeline than needed.

The product code is 92,571 lines, about €160,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.
Code Health 34.5 · counts for 46%Production Readiness 53.7 · counts for 25%Maturity 67.3 · counts for 14%Performance 70.7 · counts for 8%Security and Compliance 70.7 · counts for 4%Architecture 94.7 · counts for 2%Domain Modelling 100.0 · counts for 1%

If Code Health rose from 34.5 to 67, the lowest score rated Strong, the score would rise from 50.3 to about 62.4.

Code composition: what the lines of code are
Product code 56%Tests 44%
Rebuild cost: about €160,000 · Estimate
Cost to rebuild€52,000 to €260,000, for 862 to 2,733 hours of work, about 1.1 person-years for 1 to 3 engineers
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 50. 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: 92,571 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
Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package.
Raises the score by about 5.9 points · Medium effort · Large Files
2
Act on each finding's own remediation rather than one rule: the move depends on what recurs.
Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract.
Raises the score by about 4.2 points · Medium effort · Code Duplication
3
Bring the excluded package(s) back under `dart analyze` — an exclusion at package granularity hides every lint in a tree you publish, not just the generated files it was probably aimed at.
Raises the score by about 4.0 points · Medium effort · Security & performance tooling

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.

Where the investment is most exposed · Value at risk
This code would cost about €160,000 to build again, about 1.1 person-years of work. Its weakest lens is Code Health, at 34.5 (Weak). Code Health is about how easy the code is to read and change safely, and code that is hard to read is slow and risky to change, so every future change costs more than it should. Because the weakest lens counts most in the score, work on Code Health also moves the score most.
Based on: the rebuild estimate · the Code Health grade · how much each lens counts
What to do: Start with the Code Health actions in Top priorities.
If you do one thing first · First action
Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package. Of all the actions in this report, it raises the score most for the work it takes: about 5.9 points for medium effort. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
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 6.0 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 5% to 11% on every change. The history of the code shows how much it changes: about 139,105 lines over the last 90 days, which is about 564,148 lines a year. At that pace, the extra work comes to an estimated 70.2 to 421 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 rohd (npm) rohd (npm) rohd (pub) rohd (pub) rohd_devtools_extension rohd_devtools_extension rohd_devtools_widgets rohd_devtools_widgets rohd_devtools_extension->rohd_devtools_widgets rohd_hierarchy rohd_hierarchy rohd_live_debugger rohd_live_debugger rohd_source_navigator rohd_source_navigator rohd_waveform rohd_waveform

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.

14 modules, with 8 dependencies between them. Every module uses only modules listed above it, so there are no loops.

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 packages.rohd_devtools_widgets.assets.extension2 repository.src3 rohd_devtools_extension.assets.layout_bridge4 rohd_devtools_extension.scripts5 rohd_devtools_extension.shared6 rohd_extension.src.conditional_completions7 rohd_extension.src.debug_tracker8 rohd_extension.src.flc_service9 rohd_extension.src.signal_viewer_registry10 rohd_extension.src.source_navigator11 rohd_extension.src.uri_forwarder12 repository13 rohd_extension.src14 repository.rohd_devtools
1 packages.rohd_devtools_widgets.assets.extension
2 repository.src
3 rohd_devtools_extension.assets.layout_bridge
4 rohd_devtools_extension.scripts
5 rohd_devtools_extension.shared
6 rohd_extension.src.conditional_completions
7 rohd_extension.src.debug_tracker
8 rohd_extension.src.flc_service
9 rohd_extension.src.signal_viewer_registry
10 rohd_extension.src.source_navigator
11 rohd_extension.src.uri_forwarder
12 repository56
13 rohd_extension.src11261
14 repository.rohd_devtools611
Uses a module listed above itPart of a loopThe module itself
1 packages.rohd_devtools_widgets.assets.extension2 repository.src3 rohd_devtools_extension.assets.layout_bridge4 rohd_devtools_extension.scripts5 rohd_devtools_extension.shared6 rohd_extension.src.conditional_completions7 rohd_extension.src.debug_tracker8 rohd_extension.src.flc_service9 rohd_extension.src.signal_viewer_registry10 rohd_extension.src.source_navigator11 rohd_extension.src.uri_forwarder12 repository13 rohd_extension.src14 repository.rohd_devtoolspackages.rohd_devtools_widgets.assets.extension1repository.src2rohd_devtools_extension.assets.layout_bridge3rohd_devtools_extension.scripts4rohd_devtools_extension.shared5rohd_extension.src.conditional_completions6rohd_extension.src.debug_tracker7rohd_extension.src.flc_service8rohd_extension.src.signal_viewer_registry9rohd_extension.src.source_navigator10rohd_extension.src.uri_forwarder11repository12rohd_extension.src13repository.rohd_devtools145611261611

At a glance — Code Health · 34.5 · Weak · gated by D2, R10, R2, R3 ·

At a glance — Architecture · 94.7 · Exemplary ·

At a glance — Maturity · 67.3 · Adequate · gated by M2 ·

At a glance — Readiness · 53.7 · Adequate · gated by P3 ·

At a glance — Security · 70.7 · Adequate · gated by D36 ·

At a glance — Domain Modelling · 100.0 · Exemplary ·

At a glance — Performance · 70.7 · Strong ·

Security & Compliance — OWASP Top-10 mapping

Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).

OWASP categoryFindingsSeverity
A05:2025 — Injection37High / Critical
A03:2025 — Software Supply Chain Failures6High / Critical

Roadmap

Top priorities: Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package; Act on each finding's own remediation rather than one rule: the move depends on what recurs. Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract; Bring the excluded package(s) back under `dart analyze` — an exclusion at package granularity hides every lint in a tree you publish, not just the generated files it was probably aimed at.

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

Do thisHelpsEffortDimension
Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package.+5.9 ptsMediumLarge Files
Act on each finding's own remediation rather than one rule: the move depends on what recurs. Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract.+4.2 ptsMediumCode Duplication
Bring the excluded package(s) back under `dart analyze` — an exclusion at package granularity hides every lint in a tree you publish, not just the generated files it was probably aimed at.+4.0 ptsMediumSecurity & performance tooling
Resolve the 1 No ADRs found finding(s) in ADR Quality — start with main.dart.+1.4 ptsLowADR Quality
Resolve the 12 finding(s) in Cyclomatic Complexity.+2.2 ptsMediumCyclomatic Complexity
Resolve the 1 `_reservedSVKeywords` spells `SV` where 18 names in the project spell it… finding(s) in Naming Consistency — start with sanitizer.dart.+0.9 ptsLowNaming Consistency
Resolve the 1 `sanitizeSV` spells `SV` where 18 names in the project spell it `Sv` finding(s) in Naming Consistency — start with sanitizer.dart.+0.9 ptsLowNaming Consistency
Bring the 3 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with NetlistSynthesizer.synthesize (cyclomatic 159), SystemVerilogSynthModuleDefinition._collapseFullPackedArrayConcats (cyclomatic 80), SourceTracer.traceJsonForHierarchy (cyclomatic 71).+1.7 ptsHighCyclomatic Complexity

File quality

Per-file score 0–10 — a quality signature. Of 126 files carrying findings, judged against the Preview bar: 2% slop · 14% mixed · 84% near-clean.

FileScoreBandWorst signal
REDACTED2.3SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.7SlopStatic Analysis (SAST): High: REDACTED
lib/src/synthesizers/utilities/synth_logic.dart4.2MixedCyclomatic Complexity: SynthLogic.tryMerge (cyclomatic 18)
REDACTED5.1MixedStatic Analysis (SAST): High: REDACTED
lib/src/values/logic_value.dart5.5MixedCyclomatic Complexity: LogicValue.of (cyclomatic 52)
lib/src/module.dart5.5MixedCyclomatic Complexity: Module._traceInputForModuleContents (cyclomatic 38)
rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart5.5MixedCyclomatic Complexity: _CopyableCell._showCopyMenu (cyclomatic 30)
rohd_devtools_extension/lib/rohd_devtools/services/vm_service_waveform_data_source.dart5.5MixedCyclomatic Complexity: VmServiceWaveformDataSource._evaluate (cyclomatic 21)
rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart5.6MixedCognitive Complexity: WellenBackedWaveformDataSource.getSnapshotCompact (cognitive 19)
lib/src/diagnostics/in_process_design_session.dart5.6MixedCognitive Complexity: InProcessRohdDesignSession._matchingPorts (cognitive 16)
rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart5.7MixedCyclomatic Complexity: VmServiceTreeDataSource.evalModuleTree (cyclomatic 16)
REDACTED5.8MixedStatic Analysis (SAST): High: REDACTED
REDACTED5.8MixedStatic Analysis (SAST): High: REDACTED
lib/src/synthesizers/netlist/netlist_service.dart5.9MixedCyclomatic Complexity: NetlistService._buildSlimJson (cyclomatic 21)
lib/src/signals/const.dart5.9MixedCode Duplication: Edited copy of a member (11 corresponding lines)
lib/src/signals/logic_structure.dart6.3MixedGod Classes: TooManyMethods: LogicStructure
lib/src/signals/logic.dart6.3MixedGod Classes: TooManyMethods: Logic
rohd_devtools_extension/lib/rohd_devtools/services/in_process_waveform_data_source.dart6.3MixedCode Duplication: Edited copy of a member (40 corresponding lines)
lib/src/synthesizers/systemc/systemc_service.dart6.3MixedCode Duplication: Duplicated block (13 lines × 2)
rohd_extension/src/flc_service.ts6.7MixedCyclomatic Complexity: flc_service.queryModule (cyclomatic 26)

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

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

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

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

Could not be resolved — 5

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 71 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.9, 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 — 71 dimensions across the health lenses
D1D2D3D4D5D6D12D13D14D15D16D17D19D20D21D24D26D28D29D30D34D35D36D37D43D44AX1AX10AX3AX4AX6AX9DM5GD1IC1M1M2M3M4P1P10P2P3P4P6PF1PF3R1R10R2R3R4R5R6R7R8R9X1X12X13X16X17X18X21X25X27X28X29X3X30X5

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, 713 of 727 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 01a1eb2e-1a02-72a1-8603-62bbfd6f9387.

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.

  • D8 Code Coverage — 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. Coverage NOT MEASURED: this repository's production source spans .py, .dart, and our analyzer cannot run the .dart test suite(s) — so no coverage was collected for the repository as a whole. The Python half did build and run, and its own line coverage came back at 55.9% — but that is a figure for one half of the product, and we do not publish a partial one as if it were complete. This is OUR limitation, not a defect in the repo — coverage is excluded from the score rather than counted as a near-zero.
  • D11 Test Reliability — 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. Test source is present (.dart) but the built-in reliability runner does not support this repository's ecosystem, so flakiness couldn't be assessed. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
  • D14 License Compliance — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares package.json, but the licence verdict published here was taken over its pub package dependencies. Nothing was read about its npm dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
  • D21 Naming Consistency — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
  • D24 Comment Value — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each source language's comment syntax, and the code a comment annotates in it, needs its own proof before D24 judges it. Until then those comments are left unread, not counted as clean.
  • D27 Navigability — 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. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
  • AXB1 Runtime evidence locked — no reproducible boot — 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. Subject: 1 markup document(s) — HTML, Razor, JSX, Vue, Svelte or server templates. The Runtime Evidence tier boots an app only via docker-compose, an Aspire AppHost, a Dockerfile, an npm dev script, a web service's own toolchain entry point (cargo, go, dotnet, Python, Spring Boot), or an Android app's own Gradle wrapper (run on an emulator); an Apple or Flutter app needs a host it lacks. None applied, so no live runtime a11y/egress/header evidence was collected. You can widen what we reach: add a docker-compose.yml (or an Aspire AppHost) that brings the app up with its dependencies. We then boot it in an isolated sandbox and gathers real runtime evidence — you change nothing in your pipeline (no CI step, no SDK).
  • M4 Documentation accuracy — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
  • 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.

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.
  • D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
  • D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
  • D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
  • 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.
  • D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
  • 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.
  • D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
  • 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.
  • D21 Naming Consistency: Naming consistency compares each name with the convention its structural peers follow in this repository: it cannot tell whether a consistently used name is a good one, and languages other than C# and TypeScript are not measured.
  • D24 Comment Value: Comment value is measured as redundancy only: a comment that repeats its code's words is found, but a paraphrase in other words, a vague comment, or one the code contradicts is not, and whether a comment is valuable is not claimed. Comments in other scripts or languages, and outside C#, are not judged.
  • 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.
  • 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").
  • D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
  • D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
  • 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.
  • D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
  • D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a Dockerfile (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
  • 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.
  • AX9 CQS / query purity: Handlers are found by interface/name convention — a query handler using neither is not seen. Mutation is a resolved write/publish invocation (SaveChanges/repository/bus), so a write hidden behind a hand-rolled wrapper, reflection, or a string-keyed service locator resolves to a non-persistence type and isn't flagged; it detects that a query writes state, not whether the write is a legitimate read-side cache update. Clean means "no resolved write/publish in a query body", not a proof of CQS purity.
  • M4 Documentation accuracy: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
  • P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
  • 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.5 / 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.5 / 10 · rule-coverage 100% · ceiling Prevented

114 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was NetlistSynthesizer.synthesize at 159. A further 2 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 RohdDesignSessionProtocolHandler.callSynchronously at 20 — 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: lib/src/diagnostics/design_session_protocol.dart (RohdDesignSessionProtocolHandler.callSynchronously at 20), rohd_devtools_extension/lib/rohd_devtools/services/connection_state_machine.dart (ConnectionStateMachine.handleEvent at 16). 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.

NetlistSynthesizer.synthesize (cyclomatic 159)lib/src/synthesizers/netlist/netlist_synthesizer.dart:94
SystemVerilogSynthModuleDefinition._collapseFullPackedArrayConcats (cyclomatic 80)lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart:1402
SourceTracer.traceJsonForHierarchy (cyclomatic 71)lib/src/utilities/source_tracer.dart:1232
NetlistCellMapper._registerDefaults (cyclomatic 59)lib/src/synthesizers/netlist/netlist_cell_mapper.dart:262
NetlistModuleTranslation.processNetnames (cyclomatic 57)lib/src/synthesizers/netlist/netlist_module_translation.dart:630

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

What to do

  1. Bring the 3 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with NetlistSynthesizer.synthesize (cyclomatic 159), SystemVerilogSynthModuleDefinition._collapseFullPackedArrayConcats (cyclomatic 80), SourceTracer.traceJsonForHierarchy (cyclomatic 71). — 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 3 together lifts Cyclomatic Complexity from 4.5 to about 5.9/10, projected with the scoring formula itself and assuming each lands exactly at 60; 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

201 method(s) exceeded the cognitive complexity threshold of 15; the worst was NetlistSynthesizer.synthesize at 425.

NetlistSynthesizer.synthesize (cognitive 425)lib/src/synthesizers/netlist/netlist_synthesizer.dart:94
NetlistPasses.applyTransparentClustering (cognitive 157)lib/src/synthesizers/netlist/netlist_passes.dart:133
SystemVerilogSynthModuleDefinition._collapseFullPackedArrayConcats (cognitive 135)lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart:1402
SystemVerilogSynthModuleDefinition._collapseAggregateConnections (cognitive 128)lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart:456
SystemCSynthesisResult._buildProcesses (cognitive 127)lib/src/synthesizers/systemc/systemc_synthesis_result.dart:941

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

What to do

  1. Bring the 6 bodies over 120 down to 120 or less in Cognitive Complexity — start with NetlistSynthesizer.synthesize (cognitive 425), NetlistPasses.applyTransparentClustering (cognitive 157), SystemVerilogSynthModuleDefinition._collapseFullPackedArrayConcats (cognitive 135). — 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 6 together lifts Cognitive Complexity from 2.0 to about 2.5/10, projected with the scoring formula itself and assuming each lands exactly at 120; 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

106 god class(es) detected.

MethodTooLong: NetlistSynthesizer.synthesize · ×33lib/src/synthesizers/netlist/netlist_synthesizer.dart:94
ClassTooLong: SynthModuleDefinition · ×25lib/src/synthesizers/utilities/synth_module_definition.dart:195
FileTooLong: utilities/synth_module_definition.dart · ×25lib/src/synthesizers/utilities/synth_module_definition.dart
TooManyMethods: LogicValue · ×23lib/src/values/logic_value.dart:12

What to do

  1. Resolve the 33 MethodTooLong finding(s) in God Classes — start with systemverilog_synth_module_definition.dart (4), synth_module_definition.dart (4), standalone_app_shell.dart (3). — One of this dimension's main actionable groups (33 warning-level).
  2. Resolve the 25 ClassTooLong finding(s) in God Classes — start with synth_module_definition.dart, standalone_app_shell.dart, systemc_synthesis_result.dart. — One of this dimension's main actionable groups (25 warning-level).
  3. Resolve the 25 FileTooLong finding(s) in God Classes — start with synth_module_definition.dart, standalone_app_shell.dart, systemc_synthesis_result.dart. — One of this dimension's main actionable groups (25 warning-level).

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

D4 · Code Duplication8.9 / 10Strong✓ 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 8.9 / 10 · rule-coverage 100% · ceiling Verified

54 duplicated block group(s) detected. 2.8 % of the production lines (2,548 of 92,571) are in a reported copy. A further 43 rows report members as variants of one another; the share counts each copied line once, however many rows cite it. 2 of the 97 are in trees this repository does not ship — vendored, example/demo, project-template, fixture and benchmark code — and are ranked below the shipped groups rather than excluded from them: the duplication there is real and is still counted in this dimension's score. The dimensions that publish a production-file census leave those trees out of theirs, so this count is deliberately drawn over the wider population.

Edited copy of a member (10 corresponding lines) · ×4lib/src/values/big_logic_value.dart:149
Edited copy of a member (12 corresponding lines) · ×4doc/tutorials/chapter_8/counter_interface.dart:23
Duplicated block (12 lines × 2) · ×4rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart:265
Duplicated block (11 lines × 2) · ×4lib/src/utilities/simcompare.dart:762
Duplicated block (10 lines × 2) · ×4doc/tutorials/chapter_5/answers/n_bit_subtractor.dart:17

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

What to do

  1. Resolve the 4 Edited copy of a member (10 corresponding lines) finding(s) in Code Duplication — start with big_logic_value.dart, typed_logic_array.dart, netlist_utils.dart. — One of this dimension's main actionable groups (4 warning-level).
  2. Resolve the 4 Edited copy of a member (12 corresponding lines) finding(s) in Code Duplication — start with counter_interface.dart, in_process_design_session.dart, const.dart. — One of this dimension's main actionable groups (4 warning-level).
  3. Resolve the 4 Duplicated block (12 lines × 2) finding(s) in Code Duplication — start with wellen_backed_waveform_data_source.dart, standalone_app_shell.dart, vm_connection_form.dart. — One of this dimension's main actionable groups (4 warning-level).

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

D5 · Coupling9.0 / 10Stronggated by 1 serious finding✓ 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 9.0 / 10 · rule-coverage 100% · ceiling Prevented

8 production modules (npm+pub), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; 1 module(s) off the main sequence, with abstractness counted on 7 of the 8 (the rest declare no modelled class or interface, export only macros, declare types in source no model reads, or have no source directory of their own).

Off the main sequence: rohd_devtools_widgets

What to do

  1. Resolve the 1 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (1 warning-level).

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

D6 · Cohesion (LCOM4)8.7 / 10Strong✓ 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 8.7 / 10 · rule-coverage 100% · ceiling Verified

26 of 233 classes have LCOM4 above 3.

Low cohesion: LogicStructure (LCOM4 60) · ×26lib/src/signals/logic_structure.dart:81

What to do

  1. Resolve the 26 Low cohesion finding(s) in Cohesion (LCOM4) — start with synth_logic.dart (4), waveform_writer.dart (2), logic_structure.dart. — One of this dimension's main actionable groups (26 warning-level).

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

D12 · Dependency Hygiene10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether dependencies are current, not deprecated, and not bloated. Known vulnerabilities are D30's.

Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (capped-linear for deprecation, prerelease and outdated) per KLoC. Known-vulnerable packages are D30's and are not charged here (rubric-2026.11.2). Exhaustive.

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

1 outdated direct production npm dependency(ies) of 1 graded, 0 pinning defect(s), across 1 package.json (1 of them the product) and 1 committed lockfile(s). Development dependencies are deliberately not graded for currency: that grade is about what SHIPS. 0 direct dependency(ies) — production, development or optional — are marked DEPRECATED by their publisher (the registry's per-version mark, or the lockfile's copy of it when the registry could not be asked); deprecated transitive packages are listed but not charged. Whether any is UNMAINTAINED is not graded — the registry publishes no maintenance status, and release age does not stand in for one. Whether any is UNUSED is not graded either: that is a source question, and the frontend dependency lens (R8) answers it in this same run. Known CVEs in this dependency graph are D30's question, read from the manifest there.

Outdated (npm): ws

✓ On the Gold path — maintain.

Detailed fixes: d12_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.

D14 · License Compliance10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether the licenses of third-party packages are compatible with your policy.

Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.

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

0 of 50 resolved pub package(s) use a banned license. Licences were read from pub.dev's analysis of each package's licence file. ★ This repository commits no pubspec.lock (Dart's guidance for a package), so the graph was closed here: the 6 package(s) its pubspec declares under dependencies, and transitively every package their published pubspecs declare, each at the newest release its constraint admits — the release a fresh `pub get` picks wherever constraints agree; where two disagree the first to reach the package was taken. dev_dependencies are not part of it. ★ COVERAGE OF THIS VERDICT: it grades this repository's pub package dependencies and nothing else. The repository also declares package.json, and the licences of those dependencies were NOT read by this pass — a gap in this engine's coverage, not a statement about them. So this result says the graded closure carries no banned licence; it does NOT say this repository's licensing is clear.

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

D15 · Churn × Complexity Hotspots9.6 / 10Stronggated by 20 serious findings✓ 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 9.6 / 10 · rule-coverage 100% · ceiling Documented

Top hotspots: lib/src/synthesizers/netlist/netlist_synthesizer.dart (6×159=954); lib/src/synthesizers/utilities/synth_module_definition.dart (15×56=840); lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart (9×80=720)

Hotspot: lib/src/synthesizers/netlist/netlist_synthesizer.dart · ×20lib/src/synthesizers/netlist/netlist_synthesizer.dart:94

What to do

  1. Resolve the 20 Hotspot finding(s) in Churn × Complexity Hotspots — start with netlist_synthesizer.dart, synth_module_definition.dart, systemverilog_synth_module_definition.dart. — One of this dimension's main actionable groups (20 warning-level).

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

D16 · Bus Factor8.7 / 10Strong✓ Tool-verified

What it measures: Whether knowledge is concentrated in too few people (the "bus factor").

Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.

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

27 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart. Counted over 206 of the 374 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Off-boarding risk: anonymized user #1
Further sole-owners (lower concentration)

What to do

  1. Resolve the 1 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).
  2. Resolve the 1 Further sole-owners (lower concentration) finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).

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

D17 · Explicit Debt10.0 / 10Exemplary○ Nothing flagged

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 10.0 / 10 · rule-coverage 100% · ceiling Prevented

0 deducted task-comment markers across 92571 LoC (0.0/KLoC) → score 10.0. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.

✓ On the Gold path — maintain.

Detailed fixes: d17_recommendation.md.

D19 · Documentation Quality10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether the project's documentation is clear, complete, and useful.

Method: Every README, docs/ document and root guide parsed by its markup and measured in Unicode letters. Published: a runnable or packaged .NET project whose README (or a document it links, or a root guide) shows no example, and a root README naming none of three or more projects. Overview, licence, boilerplate, wall-of-text, empty-section and XML-doc rows are measured and withheld (counted in gaps) after adjudication. Deterministic, exhaustive, advisory.

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

2 of 2 documentation facets pass in full. 67 document(s) read across 9 unit(s).

✓ On the Gold path — maintain.

Detailed fixes: d19_recommendation.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 foundrohd_devtools_extension/lib/main.dart:28

What to do

  1. Resolve the 1 No ADRs found finding(s) in ADR Quality — start with main.dart. — 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.

D21 · Naming Consistency0.0 / 10Critical✓ Tool-verified

What it measures: Whether names — types, methods, variables — are clear and consistent.

Method: Seven vocabulary-free rules (N1-N7) mine each naming convention from the repository and flag a name that breaks a convention its structural peers in the same unit follow; production C# and TypeScript, each its own population. Deterministic, no model, no sample. Advisory.

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

2 naming inconsistencies among 20 declarations measured against a convention their peers follow.

`sanitizeSV` spells `SV` where 18 names in the project spell it `Sv`lib/src/utilities/sanitizer.dart:20
`_reservedSVKeywords` spells `SV` where 18 names in the project spell it `Sv`lib/src/utilities/sanitizer.dart:160

What to do

  1. Resolve the 1 `sanitizeSV` spells `SV` where 18 names in the project spell it `Sv` finding(s) in Naming Consistency — start with sanitizer.dart. — One of this dimension's main actionable groups (1 recommendation-level).
  2. Resolve the 1 `_reservedSVKeywords` spells `SV` where 18 names in the project spell it… finding(s) in Naming Consistency — start with sanitizer.dart. — One of this dimension's main actionable groups (1 recommendation-level).

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

D24 · Comment Value7.7 7.5 / 10Strong✓ Tool-verified

What it measures: Whether comments are worth it — explaining WHY (valuable) rather than WHAT (redundant).

Method: Every inline C# comment compared word by word with the identifiers, literals and constructs of the code it annotates (taken from the syntax); a comment whose words that code already contains is redundant, as are closing-brace labels and generator template text. Comments giving a reason or a reference are kept; other scripts and languages are not judged. Deterministic, exhaustive, advisory.

Maturity: Documented → Verified → Prevented · effective 7.5 / 10 · rule-coverage 98% · ceiling Documented

2 of 85 judged comments only repeat the code they sit on (2.4 %). 3 comment(s) in another language or script were not judged.

redundant comment · ×2rohd_extension/src/debug_tracker.ts:319

What to do

  1. Resolve the 2 redundant comment finding(s) in Comment Value — start with debug_tracker.ts, flc_service.ts. — One of this dimension's main actionable groups (2 recommendation-level).

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

D26 · Project Cohesion5.0 / 10Adequate✓ 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 5.0 / 10 · rule-coverage 100% · ceiling Documented

2 of 8 build units (npm, pub) flagged as possibly oversized/incoherent.

Projects may be oversized for their cohesion · ×2pubspec.yaml:1

What to do

  1. Resolve the 2 Projects may be oversized for their cohesion finding(s) in Project Cohesion — start with pubspec.yaml (2). — One of this dimension's main actionable groups (2 recommendation-level).

Detailed fixes: d26_recommendation.md · top locations in Appendix A, every location in findings.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)5.4 / 10Adequate✓ Tool-verified

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 5.4 / 10 · rule-coverage 100% · ceiling Documented

37 finding(s): 0 critical, 35 high, 2 medium, 0 low. 32 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 2 file(s) — `rohd_devtools_extension/scripts/verify_elk_distribution.sh` (line 9), `tool/release/local_pub.sh` (lines 6–43) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 2 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.

REDACTED
REDACTED
REDACTED
REDACTED

What to do

  1. Resolve the 2 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 issue-level).
  2. Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
  3. No action in Static Analysis (SAST) — all 32 REDACTED finding(s) are reported here at file:line but scored by D36 (supply-chain provenance), so none is charged to this dimension. — One of this dimension's main actionable groups (32 issue-level, 0 of them charged here).

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

D30 · Dependency Vulnerabilities9.4 / 10Adequategated by 1 critical finding✓ Tool-verified

What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.

Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05. Advisory since rubric-2026.11.2 (CAI decision 0006): every row is a match against a vulnerability database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.

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

1 finding(s): 0 critical, 1 high, 0 medium, 0 low.

REDACTED

What to do

  1. Resolve the 1 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).

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

D34 · Knowledge Freshness10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.

Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.

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

1 of 206 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is lib/src/values/random_logic_value.dart. Counted over 206 of the 374 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Orphaned files with no living knowledge
Orphaned filelib/src/values/random_logic_value.dart:1

✓ On the Gold path — maintain.

Detailed fixes: d34_recommendation.md · top locations in Appendix A, every location in findings.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.

D36 · Supply-chain Provenance & Signing0.0 / 10Critical✓ Tool-verified

What it measures: Whether the build pipeline provides supply-chain integrity — generated provenance/attestation, signed artifacts (cosign/sigstore), an SBOM, and pinned build actions. Presence of the configuration, not a runtime guarantee.

Method: Supply-chain provenance/signing read deterministically from CI/build config (.github/workflows, .gitlab-ci.yml, azure-pipelines, Jenkinsfile, .circleci) + the release surface: four signals — generated provenance/attestation (SLSA/in-toto/actions-attest), artifact signing (cosign/sigstore/gitsign), an SBOM (syft/sbom-action/*.spdx.json/*.cdx.json), and SHA-pinned build actions — scored 10·present/denom. NotApplicable without a build pipeline. Detects configuration presence, not runtime enforcement.

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

0/4 supply-chain integrity signals present (provenance, signing, SBOM, pinned actions).

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

What to do

  1. Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
  2. Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 recommendation-level).
  3. Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 recommendation-level).

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

D37 · Vulnerability-disclosure Policy10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether the repository publishes a coordinated-vulnerability-disclosure policy (SECURITY.md or security.txt) with a reporting contact, so finders know how to report a vulnerability. Presence of a policy file with a contact, not whether the policy is adequate or honoured.

Method: Vulnerability-disclosure policy read deterministically from the repo: a SECURITY.md (root/.github/docs) or .well-known/security.txt / security.txt, regex-checked for a reporting contact (email / URL / mailto). Present + contact → 10; present without a contact → 4; NotApplicable when no policy file exists (it may live off-repo). Detects the policy file's presence + contact, not its adequacy.

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

A vulnerability-disclosure policy (SECURITY.md) is published with a reporting contact.

✓ On the Gold path — maintain.

Detailed fixes: d37_recommendation.md.

D43 · Malicious Dependencies10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Reported apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.

Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. Advisory since rubric-2026.11.2 (CAI decision 0006): the malicious-package feed is a database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.

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

No dependency in any ecosystem this repository declares is published as malicious.

✓ On the Gold path — maintain.

Detailed fixes: d43_recommendation.md.

D44 · Platform End-of-Life10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether anyone still ships security patches for the platform this repository RUNS ON — the runtime it pins and the framework majors its own constraints hold it to. Separate from D12 because the question differs: a current Django on an end-of-life Python is perfectly up to date and completely unsupported, and the fix is a migration rather than a version bump. What the repository says it merely SUPPORTS is never charged.

Method: End-of-life PLATFORM read from the repository's own declarations and graded against a FROZEN, dated table of vendor support dates — no network, no feed, no API, so this dimension answers identically inside a closed scan fence. Two subjects: a RUNTIME the project pins (a single or all-end-of-life TargetFramework, a .nvmrc or .python-version, a requires-python CAP) and a FRAMEWORK major a dependency constraint cannot move off (a caret, tilde or exact version; `vue@^2.7.16` pins Vue 2). A FLOOR is deliberately never charged — `requires-python = ">=3.8"` states what a package SUPPORTS, not what it runs on — and a multi-target project is charged only when EVERY target is out of support. Runtime 4.0/product capped 8.0, framework 1.5 capped 4.5. The table is safe to freeze because a statement about support that ended in the past cannot become false: it loses recall as it ages, never precision, and a test asserts every entry predates the freeze date. Disjoint from D31 (a container image's OS layer) and D29 (the toolchain a CI workflow installs). Abstains when the repository declares no platform this pass reads — never scores it clean.

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

0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 1 platform declaration(s) and 0 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.

✓ On the Gold path — maintain.

Detailed fixes: d44_recommendation.md.

Frontend & cross-cutting dimensions

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

AX1 · Captive dependencies10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether any singleton service captures a scoped/transient dependency — a silent lifetime/threading bug.

Method: Roslyn scan: DI registrations parsed from AddSingleton/Scoped/Transient; each singleton checked for captured shorter-lifetime dependencies. Exhaustive, deterministic.

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.

AX6 · Interface segregation10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether interfaces stay focused rather than fat — the Interface-Segregation principle (SOLID 'I').

Method: Roslyn scan: public interface declared-member counts (accessors fold into their property/event); fat-interface threshold (over 15 declared members) flagged per type. Each finding also reports the distinct-OPERATION count — members counted by name, so an overload group counts once — which decides whether it states the caller-side ISP harm or the implementer-side burden of an overload set. TypeScript: exported interfaces that declare behaviour, counted over their REQUIRED operations (method signatures and function-typed properties with no `?`, once per signature) — data-shape interfaces and ambient .d.ts declarations are outside the population; JavaScript declares no interfaces and is not applicable. Deterministic, type-level.

AX9 · CQS / query purity10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether read (query) handlers stay side-effect-free — a query that writes persistent state or raises events breaks CQS and makes reads unsafe to retry, cache, or route to a read replica.

Method: Roslyn scan: CQRS handlers classified query-vs-command by interface (IQueryHandler/ICommandHandler/IRequestHandler<TQuery,TResult>) and name convention (*Query/Get*/Find* vs *Command); each query handler's body checked for persistent-state writes (SaveChanges/repository Add-Update) or event publishes by resolved invocation. Deterministic, type-level, exhaustive over the detected handlers.

Coverage: Population: CQRS handlers identified by IQueryHandler/ICommandHandler/IRequestHandler interface + *Query/Get*/Find*/*Command NAME convention; query purity then checked exhaustively within that set — a query handler using neither convention is invisible, and mutation is a resolved persistence/publish CALL, not full dataflow.

DM5 · Encapsulated state10.0 / 10Exemplary✓ Tool-verified

Other · Domain Modelling — Whether an entity protects its own invariants — a class whose identity is derived from its fields (value equality) but whose fields are publicly mutable bypasses that invariant. Encapsulated state keeps identity-bearing fields immutable.

Method: Roslyn (DDD-gated): entities scanned for publicly writable state — public setters, and (C#/VB) own mutable collections handed out through an auto-property, a public field or a bare-field expression getter, where a computed/copying getter is never charged. One finding per entity; score softened when Marten/EF rehydration frameworks present. Deterministic, framework-aware.

Coverage: Population: entities by convention; encapsulation (setter shape) checked exhaustively within the set.

GD1 · Unfinished & placeholder code10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Unreviewed-generation residue in this repository's Dart: methods whose whole body still throws UnimplementedError or a "not implemented" error, and placeholder text (lorem ipsum, changeme/replace_me…) left in strings of 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.

IC1 · Incompleteness & stubs10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Unfinished work detected by code SHAPE, not keywords, in this repository's Dart: methods that only throw UnimplementedError or a "not implemented" exception, methods that take inputs and return a constant or do nothing, dead `if (false)` branches, and skeleton classes most of whose methods are holes.

Method: Roslyn syntax scan: incompleteness by code shape (constant-returning methods, async-never-await, #if false branches, guards that return what the code already falls through to, tests an earlier guard already decided, comparisons against NaN, skeleton types), not keyword-gated. Deterministic, code-shape heuristic.

  • `_addParent`'s body only throws an UnsupportedError or an UnimplementedError that gives its reason — sometimes a deliberate refusal, often an unfinished stub. Confirm it's intentional. — lib/src/signals/wire_net.dart:252

What to do

  • Clear the softer debt: re-enable or delete tests marked `skip:`, decide whether each empty method or UnsupportedError is deliberate (and say so in a comment), and replace `// ignore_for_file: type=lint` with targeted, justified ignores.
M1 · Documentation (README)7.8 / 10Strong✓ 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

  • Add a build/run (quick start) section to the root README — the first thing a newcomer needs.
  • 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 documentation2.0 / 10Weak✓ 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.

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.
M3 · Folder & project structure10.0 / 10Exemplary✓ 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.

M4 · Documentation accuracy10.0 / 10Exemplary○ Nothing flagged

Maturity · Maturity — Whether the project's current-state documentation describes the code that exists.

Method: Every current-state document's checkable claims looked up in the tree (links, versions, and artefact counts an order of magnitude off), plus two README checks: an advertised infrastructure product with no footprint, and a module the CHANGELOG records as removed. Deterministic, no model. Advisory.

P1 · CI/CD gates10.0 / 10Exemplary○ Nothing flagged

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.

P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged

Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.

Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language's code model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.

P2 · Observability5.3 / 10Adequate✓ 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.

  • Only 3/7 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `packages/rohd_devtools_widgets`, `packages/rohd_hierarchy`, `packages/rohd_source_navigator`, `packages/rohd_waveform`.

What to do

  • Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.
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.

  • `analysis_options.yaml` excludes `doc/tutorials/chapter_9/rohd_vf_example` from analysis, and `doc/tutorials/chapter_9/rohd_vf_example` is a Dart package this repository ships — it has its own `pubspec.yaml` and 2 Dart file(s). Nothing in that tree is linted, type-checked or reported on by `dart analyze` / `flutter analyze`, locally or in CI. For a published package the excluded tree is usually the example app, which is the code consumers read first and copy from. Remove the exclusion and fix what it surfaces, or narrow it to the generated files it was meant for. — analysis_options.yaml:1
  • `analysis_options.yaml` excludes `packages/rohd_devtools_widgets` from analysis, and `packages/rohd_devtools_widgets` is a Dart package this repository ships — it has its own `pubspec.yaml` and 35 Dart file(s). Nothing in that tree is linted, type-checked or reported on by `dart analyze` / `flutter analyze`, locally or in CI. For a published package the excluded tree is usually the example app, which is the code consumers read first and copy from. Remove the exclusion and fix what it surfaces, or narrow it to the generated files it was meant for. — analysis_options.yaml:1
  • `analysis_options.yaml` excludes `packages/rohd_hierarchy` from analysis, and `packages/rohd_hierarchy` is a Dart package this repository ships — it has its own `pubspec.yaml` and 33 Dart file(s). Nothing in that tree is linted, type-checked or reported on by `dart analyze` / `flutter analyze`, locally or in CI. For a published package the excluded tree is usually the example app, which is the code consumers read first and copy from. Remove the exclusion and fix what it surfaces, or narrow it to the generated files it was meant for. — analysis_options.yaml:1
  • `analysis_options.yaml` excludes `packages/rohd_source_navigator` from analysis, and `packages/rohd_source_navigator` is a Dart package this repository ships — it has its own `pubspec.yaml` and 6 Dart file(s). Nothing in that tree is linted, type-checked or reported on by `dart analyze` / `flutter analyze`, locally or in CI. For a published package the excluded tree is usually the example app, which is the code consumers read first and copy from. Remove the exclusion and fix what it surfaces, or narrow it to the generated files it was meant for. — analysis_options.yaml:1
  • `analysis_options.yaml` excludes `packages/rohd_waveform` from analysis, and `packages/rohd_waveform` is a Dart package this repository ships — it has its own `pubspec.yaml` and 23 Dart file(s). Nothing in that tree is linted, type-checked or reported on by `dart analyze` / `flutter analyze`, locally or in CI. For a published package the excluded tree is usually the example app, which is the code consumers read first and copy from. Remove the exclusion and fix what it surfaces, or narrow it to the generated files it was meant for. — analysis_options.yaml:1
  • `analysis_options.yaml` excludes `rohd_devtools_extension` from analysis, and `rohd_devtools_extension` is a Dart package this repository ships — it has its own `pubspec.yaml` and 176 Dart file(s). Nothing in that tree is linted, type-checked or reported on by `dart analyze` / `flutter analyze`, locally or in CI. For a published package the excluded tree is usually the example app, which is the code consumers read first and copy from. Remove the exclusion and fix what it surfaces, or narrow it to the generated files it was meant for. — analysis_options.yaml:1
  • No static application security testing detected. For this repository's stack, add the Dart analyzer's security lints plus `semgrep --config=auto` as a CI step. What was searched, so you can tell an absence from a miss: the 5 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. — REDACTED:6
  • `rohd_extension/package.json` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`. — rohd_extension/package.json:104

What to do

  • Bring the excluded package(s) back under `dart analyze` — an exclusion at package granularity hides every lint in a tree you publish, not just the generated files it was probably aimed at.
  • Add a SAST step to CI running what this repository's stack ships: the Dart analyzer's security lints plus `semgrep --config=auto` — 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.
P4 · Deployment & Rollback7.0 / 10Strong✓ Tool-verified

Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.

Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.

P6 · Release Hygiene10.0 / 10Exemplary✓ 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.

PF1 · Benchmark discipline8.5 / 10Exemplary✓ Tool-verified

Readiness · Performance — Whether the code protects its performance with benchmarks — a benchmark suite, allocation/memory measurement, and (ideally) a CI gate. Presence is credited as a bonus, never a deduction.

Method: Repo + source scan: BenchmarkDotNet referenced (csproj/source), [Benchmark]/[MemoryDiagnoser] attribute counts, and a benchmark step in CI; off .NET, the same ladder over Go testing.B, Rust criterion/#[bench]/divan, JMH/kotlinx-benchmark, pytest-benchmark/asv/pyperf, tinybench/mitata/vitest bench/benchmark.js and Swift package-benchmark — scored as a bonus ladder (absence is neutral, never a deduction). Deterministic, presence detection.

PF3 · Async & latency hygiene6.0 / 10Adequate✓ Tool-verified

Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.

Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from each language's code model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.

  • `teardown` is async and calls deleteSync — a blocking call inside async code stalls the isolate's event loop — every other event, on Flutter the next frame, waits for as long as it runs. — benchmark/wave_dump_benchmark.dart:46
  • `fs.existsSync` in `resolveFlcPathWithAvailability` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — packages/rohd_devtools_widgets/assets/extension/module_info_helper.js:51
  • `fs.existsSync` in `resolveFlcPath` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — rohd_devtools_extension/shared/module_info_helper.js:41

What to do

  • Dart: await the async dart:io API (readAsString, writeAsString, Process.run, Future.delayed) instead of the *Sync variant or sleep(), or move heavy synchronous work to another isolate with Isolate.run.
  • TypeScript/JavaScript: use the promise APIs (fs/promises, a promisified child_process.execFile, the async zlib/crypto functions) and await them instead of the *Sync variants.
R1 · Type Safety6.7 / 10Adequate✓ Tool-verified

React / JS · Code Health — How much of the frontend is typed TypeScript vs untyped JavaScript.

Method: Frontend file inventory: the share of typed TypeScript vs untyped JavaScript across the source tree. Deterministic, exhaustive over frontend files.

  • 8 typed · 4 plain JS — the untyped files are packages/rohd_devtools_widgets/assets/extension/module_info_helper.js, rohd_devtools_extension/assets/layout_bridge/elk_layout_only.js, rohd_devtools_extension/shared/module_info_helper.js, rohd_extension/tool/test_flc_instance_paths.cjs.
R10 · Code Duplication1.5 / 10Critical✓ Tool-verified

React / JS · Code Health — The share of the scored frontend lines inside a near-exact copy-pasted block of substantial extent (the D4 clone algorithm over JS/TS tokens, D-386; each line once, 10 at none and 0 at a quarter of the lines, as D4): a block is reported only where its copies still agree on most of their own identifiers and literals, or were renamed as they were pasted but kept most of their constants, and where the copies carry enough code to stand on their own or the copied extent reaches 30 lines — so a re-implementation sharing neither names nor values, and a small pasted declaration, are both found and deliberately not reported, and a clean R10 is not a claim that nothing was copied.

Method: Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm run over JS/TS tokens). Masking finds the candidates; a block is reported when its copies still agree on most of their own identifiers and literals, or when a renamed copy still agrees on most of its constants, AND the copies carry enough code to stand on their own — or when the copied extent reaches 30 lines. So a re-implementation sharing neither names nor values, and a small pasted declaration, are deliberately not counted. Scored on the share of the scored frontend lines inside a reported copy, on the same curve as D4. Deterministic.

  • rohd_extension/src/debug_tracker.ts:97 · rohd_extension/src/uri_forwarder.ts:87 — the two spans are one implementation copied and then locally edited — 450 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — rohd_extension/src/debug_tracker.ts:97
  • packages/rohd_devtools_widgets/assets/extension/module_info_helper.js:13 · rohd_devtools_extension/shared/module_info_helper.js:13 — these 2 files are line-for-line copies of one another — 64 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done. — packages/rohd_devtools_widgets/assets/extension/module_info_helper.js:13
  • rohd_extension/src/debug_tracker.ts:34 · rohd_extension/src/uri_forwarder.ts:23 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — rohd_extension/src/debug_tracker.ts:34
  • rohd_extension/src/conditional_completions.ts:80 · rohd_extension/src/conditional_completions.ts:202 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — rohd_extension/src/conditional_completions.ts:80
  • rohd_extension/src/conditional_completions.ts:963 · rohd_extension/src/conditional_completions.ts:979 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — rohd_extension/src/conditional_completions.ts:963
  • rohd_extension/src/conditional_completions.ts:50 · rohd_extension/src/conditional_completions.ts:177 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — rohd_extension/src/conditional_completions.ts:50
  • rohd_extension/src/flc_service.ts:314 · rohd_extension/src/flc_service.ts:420 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — rohd_extension/src/flc_service.ts:314
  • rohd_extension/src/conditional_completions.ts:835 · rohd_extension/src/conditional_completions.ts:876 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — rohd_extension/src/conditional_completions.ts:835
  • rohd_extension/src/dtd_bridge.ts:249 · rohd_extension/src/dtd_bridge.ts:259 · rohd_extension/src/dtd_bridge.ts:269 · rohd_extension/src/dtd_bridge.ts:279 — 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. — rohd_extension/src/dtd_bridge.ts:249
  • rohd_extension/src/flc_service.ts:169 · rohd_extension/src/flc_service.ts:382 — 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. — rohd_extension/src/flc_service.ts:169
  • rohd_devtools_extension/assets/layout_bridge/elk_layout_only.js:47 · rohd_devtools_extension/assets/layout_bridge/elk_layout_only.js:73 — 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. — rohd_devtools_extension/assets/layout_bridge/elk_layout_only.js:47
  • rohd_extension/src/flc_service.ts:366 · rohd_extension/src/flc_service.ts:514 — all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct — the members of a type, or the entries of an object or array literal — with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal's entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or — where the copies are a literal's entries rather than a type's members — one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared — a decorator and its options, an annotation, a registration table's keys — the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases. — rohd_extension/src/flc_service.ts:366

What to do

  • Act on each finding's own remediation rather than one rule: the move depends on what recurs. Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract.
R2 · Cyclomatic Complexity3.7 / 10Weak✓ Tool-verified

React / JS · Code Health — Per-function cyclomatic/cognitive complexity from the token-level function scanner (D-386) — real branching, not a regex heuristic.

Method: Per-function cyclomatic/cognitive complexity from a token-level function scanner (real branching, not a regex heuristic), computed over every frontend function. Deterministic.

  • detectContext has cyclomatic complexity 38 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — rohd_extension/src/conditional_completions.ts:37
  • findEnclosingClassInfo has cyclomatic complexity 36 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — rohd_extension/src/conditional_completions.ts:162
  • queryModule has cyclomatic complexity 26 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — rohd_extension/src/flc_service.ts:137
  • buildModuleInfo has cyclomatic complexity 20 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/rohd_devtools_widgets/assets/extension/module_info_helper.js:80
  • buildModuleInfo has cyclomatic complexity 19 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — rohd_devtools_extension/shared/module_info_helper.js:57
  • parseOutputPositions has cyclomatic complexity 14 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — rohd_extension/src/flc_service.ts:582
  • handleMessage has cyclomatic complexity 14 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — rohd_extension/src/dtd_bridge.ts:50
  • provideCompletionItems has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — rohd_extension/src/conditional_completions.ts:1022
  • elkLayoutOnly has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — rohd_devtools_extension/assets/layout_bridge/elk_layout_only.js:26
  • lookupSignal has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — rohd_extension/src/flc_service.ts:273
  • entryToFrames has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — rohd_extension/src/flc_service.ts:498
  • openSourceLocations has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — rohd_extension/src/source_navigator.ts:77
R3 · Large Files0.0 / 10Critical✓ Tool-verified

React / JS · Code Health — How many source files exceed the large-file threshold.

Method: Components/modules exceeding the large-file threshold, counted exhaustively across the frontend source tree. Deterministic.

  • rohd_extension/src/conditional_completions.ts has 1014 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — rohd_extension/src/conditional_completions.ts:1
  • rohd_extension/src/flc_service.ts has 576 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — rohd_extension/src/flc_service.ts:1
  • rohd_extension/src/source_navigator.ts has 423 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — rohd_extension/src/source_navigator.ts:1

What to do

  • Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package.
R4 · Test Coverage6.4 / 10Strong✓ Tool-verified

React / JS · Readiness — Static test reachability (D-386): the share of production files reachable from any test via the import graph — measured without running anything.

Method: Static test reachability: the share of production files reachable from any test via the import graph — measured without running anything. Deterministic.

  • No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one. (×4) — rohd_extension/src/uri_forwarder.ts:1, packages/rohd_devtools_widgets/assets/extension/module_info_helper.js:1, rohd_devtools_extension/shared/module_info_helper.js:1, …

What to do

  • Add tests that import the unreached modules (directly or through their public entry).
R5 · Dependency Freshness9.9 / 10Exemplary✓ Tool-verified

React / JS · Readiness — How outdated the npm dependencies are (a maturity signal). JS/npm CVEs are scored separately in D30 (JS/npm Dependency Vulnerabilities).

Method: npm dependency staleness from manifest/registry metadata (a maturity signal; JS/npm CVEs are scored separately in D30, which answers dependency vulnerabilities for every ecosystem). Deterministic.

R6 · Tooling6.7 / 10Strong✓ Tool-verified

React / JS · Readiness — Whether the project wires up test, lint and typecheck — detected from each package.json script's COMMAND (eslint / tsc / vitest / jest / playwright), not just its name, and corroborated against CI-workflow invocations so a tool run only in CI still counts.

Method: package.json scanned for test/lint/typecheck script wiring. Deterministic presence check.

  • test ✓ · lint ✗ · typecheck ✓ — read from this repository's package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: `test` for the suite, `lint` or `prettier` for linting, `typecheck`/`type-check`/`tsc` for type checking. ✗ therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline — a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A ✓ means the wiring is DECLARED — a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite.

What to do

  • Add eslint as package.json scripts and run them in CI.
R7 · Dead Code5.5 / 10Adequate✓ Tool-verified

React / JS · Code Health — Files unreachable from every application/tooling/test entry point, and exports nothing imports (module-graph reachability, D-386).

Method: Dead code: files unreachable from every application/tooling/test entry point plus exports nothing imports, via module-graph reachability. Deterministic, exhaustive over the import graph.

  • Unreachable from the 3 application, 0 tooling and 1 test entry point(s) detected in this repo. Gate removals on `npm run compile` — an undetected custom entry would make these reachable.
  • no import path from any entry point (3 application, 0 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make (×2) — rohd_extension/src/uri_forwarder.ts, rohd_devtools_extension/shared/module_info_helper.js
  • Nothing imports this binding — it is safe to review for removal. (×2) — rohd_extension/src/debug_tracker.ts:302, rohd_extension/src/debug_tracker.ts:308

What to do

  • Delete the dead files and unused exports — every line is maintenance cost and rebuild-estimate inflation with zero runtime value.
R8 · Dependency Hygiene10.0 / 10Exemplary✓ Tool-verified

React / JS · Readiness — npm dependency truthfulness (D-386): unused dependencies, imports not declared anywhere, and type-/test-only packages shipped as production deps.

Method: npm dependency truthfulness: unused dependencies, imports declared nowhere, and type-/test-only packages shipped as production deps — from the manifest + import graph. Deterministic.

R9 · Circular Imports10.0 / 10Exemplary✓ Tool-verified

React / JS · Architecture — Import cycles in the module graph (D-386) — files that can only be understood and changed together.

Method: Import cycles in the module graph, detected exhaustively over JS/TS imports (the same cycle detection as the .NET coupling dimension). Deterministic.

X1 · Async correctness10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether the code avoids sync-over-async (deadlock-prone blocking on tasks) and async void.

Method: Roslyn syntax scan: async methods scanned for .Wait()/.GetAwaiter().GetResult() and async-void outside event handlers. Deterministic, hard fact per invocation.

X12 · Unreachable branch10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.

Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.

X13 · Undrained process stream10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.

Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `spawn` imported from `child_process` whose stdout and stderr are both pipes (no options, no `stdio`, or `stdio` of `'pipe'`), bound to a local that never leaves its scope, where exactly one of the two streams is read, the other never, and the child’s `close`/`exit` (or the read stream’s end) is awaited; a shell redirect in the call’s arguments or a `kill` of the child suppresses it. The same rule reads Python’s `subprocess.Popen`, Dart’s `Process.start`, Ruby’s `Open3.popen3`, and Scala’s JDK process starts (`new ProcessBuilder(…).start()` with no `redirectErrorStream`/`redirectError`/`redirectOutput`/`inheritIO`, `Runtime.getRuntime.exec`) where one of `getInputStream`/`getErrorStream` is read and the other never while `waitFor()` is called or the read stream is read to its end. Deterministic, provable per finding. Advisory.

X16 · Unfloored truncation loop10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a loop that shortens a string until it fits a length budget has a floor — one with none grinds the value down to the empty string, or past it into a negative-length `Substring`.

Method: Roslyn syntax + semantics: while/do loops whose body's only effect on a string is to drop its last character, checked for whether anything — a direct comparison on the length, a body guard, a break — bounds that length below. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `while`/`do` loop whose body’s one assignment to a value is `x = x.slice(0, -1)` or `x = x.slice|substring|substr(0, x.length - 1)`, driven by a condition that reads `x.length` only as a term of a larger expression — never compared directly, never tested for truthiness, and with no other read of `x` — and whose body has no `break`, `return`, `throw` or `if` naming `x`. Deterministic, provable per finding. Advisory.

X17 · Uncapped recursion over a caller-supplied document3.5 / 10Weak✓ Tool-verified

Other · Security — Whether a walk that recurses through a JSON/XML tree handed in by its caller bounds how deep it will go — an uncapped walk lets the document's nesting choose the stack depth, and the resulting StackOverflowException cannot be caught.

Method: Roslyn syntax + semantics: methods that take a JSON/XML document node and call themselves with a child of it, reachable from an externally-callable member of the same type that accepts a document, checked for any depth parameter, descent counter or threaded arithmetic anywhere in the walk. On a repository with no .NET source it reads TypeScript off the engine’s own token stream (test, vendored, generated and minified paths and `.d.ts` not) with the same rule: a function or method with a parameter typed as a document value — `unknown`, `any`, `object`, `Record<string, unknown|any>`, a JSON alias (`JsonValue`, `JSONObject`, …) or a DOM node global the file does not rebind — that calls itself (bare, or through `this` for a method, or hands itself to a call over the value as in `value.map(walk)`) with something it took out of that value and never through an ancestor accessor such as `closest()` or `parentElement`, that is exported or reached from an exported function (a public method of the same exported class) taking such a value, and that names no depth, level, nesting, recursion, remaining or budget anywhere and threads no `+`/`-` arithmetic through a self-call. Plain JavaScript is not read: with no annotation nothing tells a parsed document from a tree the code built itself. Deterministic, provable per finding. Advisory.

  • `HierarchyOccurrence.fromJson` is public and takes `Map<String, dynamic> json` from its caller, and it calls itself at line 120 (`HierarchyOccurrence.fromJson`) with a piece of `json` — and nowhere in `HierarchyOccurrence.fromJson` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. `jsonDecode` sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws `StackOverflowError` from about 20,000 levels — 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser's stack). That is an `Error`, not an `Exception`: an `on Exception catch` around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through `HierarchyOccurrence.fromJson` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — packages/rohd_hierarchy/lib/src/hierarchy_occurrence.dart:120

What to do

  • Each finding names the externally-callable member that accepts the document and the self-call that descends, and states that no depth parameter or counter exists anywhere in the walk. Confirm from the two, then thread a depth argument through the walk and reject documents past a fixed maximum, or rewrite it with an explicit stack.
X18 · Disposal-pattern correctness10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a type's disposal matches what it OWNS — releasing what it created, leaving alone what it was handed, and not declaring a finalizer for state that has nothing unmanaged to finalize.

Method: Roslyn syntax + semantics: every assignment to a disposable field is read to decide whether the type CREATED the value or was handed it, and the type's disposal is checked against that answer — an injected interface it disposes, a value it constructed and never releases, a finalizer on a type holding nothing unmanaged, and a disposable local whose every reference is a plain member read. A value handed to a container that disposes its contents (a parent control's `Controls` collection, a component `IContainer`) is released by that container and is not reported; generated code is out of population. On a repository with no .NET source the same ownership questions are read in JavaScript/TypeScript off the engine’s own token stream (test, vendored, generated and minified paths not): a class declaring `dispose()`, `[Symbol.dispose]()` or `[Symbol.asyncDispose]()` that disposes a field it was handed through a constructor parameter typed as a repository interface or resolved by a dependency-injection container; that assigns a field only ever from `new X(…)` of a disposable class and neither releases it anywhere in the class nor names it in its disposal member or a method that member calls, nor hands it to anything else; and a `const`/`let` local built from literals only whose every reference opens a statement operating on a non-release member of it. A class is disposable when every repository declaration of its name declares or inherits a disposal member, or when it is a documented library disposable (`vscode` EventEmitter, CancellationTokenSource and Disposable; three.js geometries, materials, textures, render targets, renderers, controls and composers). The finalizer arm has no JavaScript counterpart: a class cannot declare one. Dart is read for the owned-and-never-released arm: a Flutter `State` (or a class declaring `dispose()`/`close()`) whose library-private field is written only with direct creations of a framework controller, `FocusNode`, `StreamController` or periodic `Timer` (or a `.listen(…)` into a field declared `StreamSubscription`), which nothing in the class or its library releases (`dispose`/`close`/`cancel`) and which is never handed on except as a named argument. Ruby is read for the owned-and-never-released arm and the abandoned-local arm: a class declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose instance variable is written only with a blockless core descriptor creation (`File.open`/`new`, `Tempfile`, `Dir.open`, `IO.popen`, the `socket` and `openssl` socket classes) that no method of the class closes and that is never handed on (passed, returned, stored, exposed by `attr_reader`, delegated) — a class whose superclass or mixin lies outside the repository is not judged — and a blockless creation read through and dropped (`File.open(path).read`) or held in a local that is never closed, returned, passed or stored (a `&:read` block-pass, an `autoclose: false` borrow and a `fileno` hand-over are not abandonment). PHP is read for the same two arms: a class (not a trait, and not one using a trait) declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose `private` property (or a `final` class's `protected` one) is written only with a direct core `fopen`, `tmpfile`, `popen`, `proc_open`, `fsockopen`, `stream_socket_client`/`server` or `opendir` that nothing in the class closes (`fclose`, `pclose`, `closedir`, `unset`, a reset to `null`) and that is never handed on, and a handle held in a function's local, or read through as the argument of a reader, that is never closed, returned, passed, captured or stored; a `php://` stream, `curl_init`, `SplFileObject`, `PDO` and a function the repository declares under the core name are not read. Deterministic, provable per finding. Advisory.

X21 · Side-effecting pattern guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a `when` guard is free of side effects — a guard that increments a counter or assigns while deciding whether its arm matches applies that change during PATTERN MATCHING, on an arm that may not be selected, and skips it entirely when a short-circuit to its left answers first.

Method: Roslyn syntax: `when` guards on case labels and switch-expression arms, read for a mutation (`++`/`--`/assignment) sitting in a position the guard's own `&&`/`||`/`??`/`?:`/`?.` can skip. Deterministic, provable per finding. Advisory.

X25 · Inert configuration knob10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a value the caller is invited to supply is the value the type actually uses — a constructor parameter stored in a private field that nothing ever reads while the default it was given is spelled out a second time at the site that should have read it, a keyed lookup that falls back to a different setting than the one its key names while the same type falls back to the matching one for that same key, or a culture-sensitive parse given no format provider by a type that feeds its own settable culture to the same kind of parse elsewhere, or a number an entry point writes to standard output under the host's culture while the same entry point formats with the invariant culture elsewhere. Either way, every caller who supplies a value silently gets something else.

Method: Roslyn syntax: private instance fields of a non-partial type assigned in a constructor from one of its own parameters with a `??` fallback, checked for whether anything in the type body reads the field and whether that same fallback expression is spelled out again outside the constructor; and `??` fallbacks onto a member access from a lookup call carrying exactly one string literal, grouped by that key across the type and checked for a fallback member whose folded name disagrees with the key while a sibling site for the same key agrees with it. On a repository with no .NET source the first two arms read JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `#x`, `private` or `private` parameter-property instance field filled in the constructor from a parameter (or one member of one) through `??`/`||` or a parameter default, never read anywhere in the file by name, whose constructed default is spelled again in the class body; and `lookup("key") ?? s.member` grouped by key per class, or per module outside every class. The culture arm has no JavaScript counterpart: its parses take no locale. Deterministic, provable per finding. Advisory.

X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a `for` loop leaves the `dict`, `set` or `deque` it is walking alone — CPython's iterators over those check that the collection has not changed size since the loop began, so a body that removes from (or empties) the very collection the loop is walking makes the next step raise `RuntimeError: dictionary changed size during iteration` and the remaining items are never seen. Whether a `for … in` loop leaves the `List`, `Map` or `Set` it is walking alone — Dart's collection iterators check that the collection has not changed since the loop began, so a body that adds to or removes from the very collection the loop is walking (or the map whose `keys`, `values` or `entries` it walks) makes the next step throw `ConcurrentModificationError` and the remaining elements are never seen.

Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.

X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.

Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.

X29 · Per-element action decided by a fixed element10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a decision taken once per element is taken ABOUT that element — a test inside a counted loop that reads a fixed subscript of the very collection its guarded statement indexes by the loop variable applies element zero's answer to all of them, so the elements that differ from it are all handled wrongly, and in the same direction.

Method: Roslyn syntax only, no semantic model: every `for` statement declaring exactly ONE loop variable, and every `if` inside its body that is not under a nested loop or a lambda. A site enters the population when the `if`’s condition never mentions the loop variable while the statement it guards indexes some collection by that variable ALONE (`c[i]`; `c[i + 1]` and `c[i, j]` are outside it). A finding additionally needs the AGREEING TWIN at the same-collection grain: the condition must read THAT SAME collection at a subscript that does not move — written into the condition, or reached through a local declared BEFORE the loop, so an alias bound inside the body is not followed. Both collection expressions must be simple identifiers. On a repository with no .NET source the same rule reads JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `for (let|var|const x = …; …; …)` with one declarator and a braced body, an alias followed only when it is declared before the loop in a block that encloses it and never assigned inside the loop. Deterministic, provable per finding. Advisory.

X3 · Exception handling5.3 / 10Adequate✓ Tool-verified

Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.

Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.

  • `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included. (×3) — rohd_extension/src/dtd_bridge.ts:54, rohd_extension/src/source_navigator.ts:183, rohd_extension/src/source_navigator.ts:449
  • `.catch(() => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it. — rohd_extension/src/dtd_bridge.ts:92
  • `except` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×2) — rohd_devtools_extension/scripts/fix_directives.py:72, rohd_devtools_extension/scripts/fix_types.py:56
  • An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it. (×5) — rohd_devtools_extension/lib/main.dart:114, rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart:1194, lib/src/utilities/systemc_cosim_ffi.dart:1065, …
  • `on Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×16) — rohd_devtools_extension/lib/rohd_devtools/ui/devtools_connection_host.dart:1340, rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart:1487, rohd_devtools_extension/lib/rohd_devtools/services/source_navigation_service.dart:579, …
  • `on Object` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×4) — rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart:318, rohd_devtools_extension/lib/rohd_devtools/services/netlist_const_extractor.dart:194, rohd_devtools_extension/lib/rohd_devtools/services/netlist_evaluator.dart:140, …

What to do

  • Swallowed exception (caught, then discarded)
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a guard written as a NEGATED `||` says what its author meant — `!(a || b || x != k)` is `!a && !b && x == k` by De Morgan, so a bail-out that mixes capabilities the code needs with a fault it refuses turns inside out: it fires only where the capabilities are ABSENT, and lets every value the fault term names walk straight into the body that cannot handle it.

Method: Roslyn syntax only, no semantic model: every logical-not whose operand is a parenthesised `||` chain of two or more disjuncts, flattened (a left-nested `a || b || c` read once would see `(a || b)` as one disjunct). A site enters the population on that shape alone. A finding additionally needs the disjuncts to DISAGREE in polarity: at least one bare boolean read — an identifier or member access, never an invocation, which is a predicate rather than a capability flag — and at least one `x != <constant>`, the only form that negates into an exact-value pin (`== null` negates into a looser requirement and is outside the fault set). Consistently-polarised disjunctions, all-fault or all-capability, are counted and never reported; a negated `&&` is outside the population entirely. No same-receiver gate: it was measured to cost a real defect and remove no false positive. Deterministic, provable per finding. Advisory.

X5 · Nullable reference types8.7 / 10Exemplary✓ Tool-verified

Other · Code Health — Whether Dart's sound null safety is on and is not undermined by null assertions — a package whose `environment: sdk:` lower bound is 2.12 or above is null safe, so `String` cannot hold null and `String?` must be checked before use, and each postfix `!` is a run-time `Null check operator used on a null value` the author has told the analyzer cannot happen.

Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.

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 Health34.5Weak — gated by D2, R10, R2, R3Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture94.7ExemplarySolid.
Maturity67.3Adequate — gated by M2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness53.7Adequate — gated by P3Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security70.7Adequate — gated by D36Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Domain Modelling100.0ExemplaryStrongest area.
Performance70.7StrongSolid.
Unscored — 2 check(s) recorded observations but carry no score

These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.

  • X10 Duplicated predicate — 25 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X7 Silent fallback defaults — 5 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 1 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.

  • P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 60 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 — Frontend below the scale floor (15 DOM element(s) < 25) — too little surface to assess accessibility.
  • AC2 Forms & labels — Frontend below the scale floor (15 DOM element(s) < 25) — too little surface to assess accessibility.
  • AC3 Page structure — Frontend below the scale floor (15 DOM element(s) < 25) — too little surface to assess accessibility.
  • AC4 Keyboard semantics — Frontend below the scale floor (15 DOM element(s) < 25) — too little surface to assess accessibility.
  • AC5 ARIA correctness — Frontend below the scale floor (15 DOM element(s) < 25) — too little surface to assess accessibility.
  • AC6 Visual & motion safety — Frontend below the scale floor (15 DOM element(s) < 25) — too little surface to assess accessibility.
  • AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No function in this Python code is served by a threaded web framework (a Flask, Bottle or FastAPI route, a Django or Pyramid view), so no module is shared between request threads. Dart isolates share no mutable memory, so no two requests write one object at the same instant. TypeScript/JavaScript runs each process's requests on one event loop, so no two requests write a shared object at the same instant (interleaving across an await is a different defect).
  • AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) 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
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AX8 Test isolation — no test/production split to check
  • AXB1 Runtime evidence locked — no reproducible boot — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • C1 Data Protection — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a Drift table, an Isar, ObjectBox, Floor or Hive entity, or a Serverpod table model — and no database or data-store client (sqflite, Drift, Isar, Hive, Realm, Firestore, Supabase, postgres, …) in the source either, so this repository keeps no data at rest for these controls to protect.
  • C2 Access Controls — No access-control surface detected in the analyzed source — this repository stands up no server another machine can reach (no HttpServer or shelf server bound beyond loopback, no dart_frog route, no Serverpod endpoint, no Conduit, Alfred or Angel application) and keeps no data in a hosted backend. Access control is therefore N/A here — a Flutter app or pub package is authorized by the server it calls, not by itself; hiding a screen authorizes nothing. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
  • C3 Audit Trail — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a Drift table, an ObjectBox/Floor @Entity, an Isar @collection, a Hive @HiveType or a Serverpod table model — and no database or data-store client (sqflite, Firestore, Supabase, postgres, …) imported either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a hosted backend configured outside this repository, for instance), the trail belongs to wherever that data is stored.
  • C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a Drift table, an ObjectBox/Floor @Entity, an Isar @collection, a Hive @HiveType or a Serverpod table model — and no database or data-store client (sqflite, Firestore, Supabase, postgres, …) imported either, so this repository keeps no personal data whose lifetime a retention limit would bound.
  • C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a Drift table, an ObjectBox/Floor @Entity, an Isar @collection, a Hive @HiveType or a Serverpod table model — and no database or data-store client (sqflite, Firestore, Supabase, postgres, …) imported either, so this repository keeps no personal data for a data subject to erase, export or consent over.
  • D10 Test Quality — ~73169 lines of test source are present (.dart) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
  • D11 Test Reliability — Test reliability not included — no .dart test runner
  • D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
  • D22 Internal API Consistency — N/A — too few peer members to establish a convention across 1 exposed TypeScript types.
  • D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ sibling projects each declaring an entity of their own or taking another project's integration events. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
  • D25 ADR Conformance — no ADRs to check
  • D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.dart), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
  • 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.
  • D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
  • D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
  • D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
  • D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
  • D8 Code Coverage — Coverage not measured — polyglot repository, one half has no runner
  • DM1 Aggregate boundaries — not scored for Dart: aggregate-vs-value-object classification cannot be told apart in source (every class-holding-class reads alike), and a child COLLECTION (legitimate membership) vs a single embedded aggregate is indistinguishable — reported as guidance rather than measured
  • DM2 Strongly-typed ids — no in-repo typed-id idiom — primitive-obsession recorded as advisory DM8, DM2 not gated
  • DM3 Integration-event coupling — not scored for Dart: a cross-package domain leak cannot be told apart in source from a legitimate shared-kernel package, and most repositories ship a single package — reported as guidance rather than measured
  • DM4 Rich vs anemic domain model — this Dart repository declares no domain-layer entity carrying stored data (every type is a typed-id wrapper, DTO/config, ORM row or presentation container), so DM4's rich-vs-anemic read has no population to be taken over
  • DM6 Domain ↔ infrastructure boundary — this Dart repository maps no type to a persistence framework (drift/floor/isar/objectbox/hive), so DM6's domain↔infrastructure fusion read has no population to be taken over
  • DM7 Repository granularity — not scored for Dart: 'a repository per CHILD entity' needs the aggregate-root structure, which is not source-resolvable — reported as guidance rather than measured
  • ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, which this analysis does not build from source alone for this language. Reported as guidance rather than measured
  • 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
  • P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
  • P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the Dart, JavaScript/TypeScript, Python source, so there is no service whose uptime a failing dependency could take down
  • P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
  • P9 Domain vs controller coverage — coverage data present for 2 file(s), but no domain-layer files were identified: no covered file's path contains any of the markers this check keys on (/domain/, /aggregates/, /valueobjects/, /domainmodel/, .domain/, /entities/), which are matched case-insensitively anywhere in the path. With no domain partition there is nothing to compare the web/controller layer against — if this repository keeps its business rules under a folder named none of those, that naming is what the check cannot see, not the domain logic.
  • 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.
  • R11 Import Boundaries — No recognizable feature-sliced/layered src layout — boundary rules not applicable.
  • S1 Web-Security Posture — No HTTP server of its own: 393 Dart file(s) were read for weak hashes and ciphers, key material fixed in the source and disabled TLS certificate validation, and none was found. This repository serves no HTTP of its own — no server framework among its pubspec dependencies, no `HttpServer` bound and no shelf, dart_frog or serverpod import in its production source or `bin/`. Its Flutter web build (`rohd_devtools_extension/web/index.html`) compiles to static files that run in the browser and are served by whatever hosts them: static files cannot enforce HTTPS, send HSTS or any other response header, set an HttpOnly cookie or validate a request, so those controls are the host's, not this code's. Where this repository commits the host's configuration (an nginx, Caddy or Apache config, a serving Dockerfile, `_headers`, `vercel.json`, `netlify.toml`, `firebase.json`, `staticwebapp.config.json`) it is read for the security response headers it sets, and the shipped page is read for third-party scripts loaded without Subresource Integrity. Neither shows anything to report here. If this codebase starts serving HTTP, the dimension reactivates automatically.
  • SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X14 Bypassable address classification — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X19 Unrestored process-global state — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X2 Cancellation propagation — no C# was loaded; this repository's Dart and Python were read, and no request in it can be cancelled by a caller (Dio, or package:http's Abortable requests) — a Python request takes no token: asyncio cancels the task and trio or anyio the scope that made it, from outside the call, and requests, httpx, aiohttp and gRPC take a timeout, not a cancellation
  • X20 Mistyped argument guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X22 Contradicted release guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X23 Unguarded diagnostic materialisation — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X24 Document value interpolated into markup unescaped — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X26 Unsynchronised callback handoff — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
  • X4 Structured logging — This check asks whether log calls keep a message's values apart from its text, which needs a logger that can carry them as fields. This repository's Dart was read, and it logs through none: package:logging, package:logger, talker and dart:developer take one finished message and no template arguments or fields (as log4net does in C#), so an interpolated message there loses nothing the API could have kept. Sentry's structured logs (`Sentry.logger`) would be judged.
  • X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.

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 — 36 finding(s)
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • + 7 more in this group — see findings.md.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D30 · Dependency Vulnerabilities · High CVE · ×1
  • REDACTED
Serious — 638 finding(s)
D3 · God Classes · MethodTooLong · ×33
  • MethodTooLong: NetlistSynthesizer.synthesize lib/src/synthesizers/netlist/netlist_synthesizer.dart:94 — MethodTooLong — synthesize runs 580 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 480 over it, 5.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: NetlistCellMapper._registerDefaults lib/src/synthesizers/netlist/netlist_cell_mapper.dart:262 — MethodTooLong — _registerDefaults runs 269 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 169 over it, 2.69× 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: _VmConnectionFormState.build rohd_devtools_extension/lib/rohd_devtools/ui/vm_connection_form.dart:361 — MethodTooLong — build runs 263 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 163 over it, 2.63× 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: _SystemCSimCompare.buildSystemCVectorExecutable lib/src/utilities/systemc_simcompare.dart:209 — MethodTooLong — buildSystemCVectorExecutable runs 254 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 154 over it, 2.54× 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: SystemCSynthesisResult._buildProcesses lib/src/synthesizers/systemc/systemc_synthesis_result.dart:941 — MethodTooLong — _buildProcesses runs 234 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 134 over it, 2.34× 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: SystemVerilogSynthModuleDefinition._collapseFullPackedArrayConcats lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart:1402 — MethodTooLong — _collapseFullPackedArrayConcats runs 191 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 91 over it, 1.91× 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: SystemVerilogSynthModuleDefinition._collapseAggregateConnections lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart:456 — MethodTooLong — _collapseAggregateConnections runs 175 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 75 over it, 1.75× 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: NetlistModuleTranslation.processNetnames lib/src/synthesizers/netlist/netlist_module_translation.dart:630 — MethodTooLong — processNetnames runs 167 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 67 over it, 1.67× 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: _StandaloneAppBarState.build rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart:2993 — MethodTooLong — build runs 161 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 61 over it, 1.61× 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: SynthModuleDefinition._pruneUnused lib/src/synthesizers/utilities/synth_module_definition.dart:1499 — MethodTooLong — _pruneUnused runs 160 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 60 over it, 1.60× 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: _SignalTableState._collectSubFieldRows rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart:674 — MethodTooLong — _collectSubFieldRows runs 160 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 60 over it, 1.60× 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: _SystemVerilogSimCompare.iverilogVector lib/src/utilities/systemverilog_simcompare.dart:170 — MethodTooLong — iverilogVector runs 154 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 54 over it, 1.54× 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: _CrossProbeStatusButtonState._showFormatsMenu rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart:3387 — MethodTooLong — _showFormatsMenu runs 146 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 46 over it, 1.46× 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: SystemCSynthesisResult._gateExpression lib/src/synthesizers/systemc/systemc_synthesis_result.dart:676 — MethodTooLong — _gateExpression runs 142 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 42 over it, 1.42× 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: _SignalTableState._generateSignalRow rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart:438 — MethodTooLong — _generateSignalRow runs 139 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 39 over it, 1.39× 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: SystemVerilogSynthModuleDefinition._inlinePackedRangesIntoSubmoduleInputs lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart:214 — MethodTooLong — _inlinePackedRangesIntoSubmoduleInputs runs 129 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 29 over it, 1.29× 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: BaseSignalWaveformApi.getWaveformData rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart:164 — MethodTooLong — getWaveformData runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 24 over it, 1.24× 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: _StandaloneDevToolsPageState._loadModuleTree rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart:1202 — MethodTooLong — _loadModuleTree runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 24 over it, 1.24× 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: SystemVerilogSynthModuleDefinition._forwardPassthroughElementsIntoInlineables lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart:1180 — MethodTooLong — _forwardPassthroughElementsIntoInlineables runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23× 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: SynthModuleDefinition._findChainableModulesToCollapse lib/src/synthesizers/utilities/synth_module_definition.dart:1155 — MethodTooLong — _findChainableModulesToCollapse runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23× 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: SourceTracer.flcHtmlViewer lib/src/utilities/source_tracer.dart:1627 — MethodTooLong — flcHtmlViewer 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: _CopyableCell._showCopyMenu rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart:1503 — MethodTooLong — _showCopyMenu runs 117 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 17 over it, 1.17× 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: SynthModuleDefinition._planConcatRangeRewrite lib/src/synthesizers/utilities/synth_module_definition.dart:3800 — MethodTooLong — _planConcatRangeRewrite runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16× 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: NetlistConstExtractor.extract rohd_devtools_extension/lib/rohd_devtools/services/netlist_const_extractor.dart:22 — MethodTooLong — extract runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16× 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: SystemCFfiCosim._compileAndLoad lib/src/utilities/systemc_cosim_ffi.dart:309 — MethodTooLong — _compileAndLoad runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 15 over it, 1.15× 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.
  • + 8 more in this group — see findings.md.
D6 · Cohesion (LCOM4) · Low cohesion · ×26
  • Low cohesion: LogicStructure (LCOM4 60) lib/src/signals/logic_structure.dart:81 — LogicStructure's methods fall into 60 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 60 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: Logic (LCOM4 17) lib/src/signals/logic.dart:94 — Logic's methods fall into 17 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 17 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: Module (LCOM4 12) lib/src/module.dart:48 — Module's methods fall into 12 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 12 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: Const (LCOM4 10) lib/src/signals/const.dart:47 — Const's methods fall into 10 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 10 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: SynthLogic (LCOM4 10) lib/src/synthesizers/utilities/synth_logic.dart:19 — SynthLogic's methods fall into 10 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 10 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: _WireNetBlasted (LCOM4 9) lib/src/signals/wire_net.dart:132 — _WireNetBlasted's methods fall into 9 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 9 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: SynthLogicArrayElement (LCOM4 7) lib/src/synthesizers/utilities/synth_logic.dart:965 — SynthLogicArrayElement's methods fall into 7 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 7 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: VmServiceWaveformDataSource (LCOM4 6) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_waveform_data_source.dart:19 — VmServiceWaveformDataSource's methods fall into 6 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 6 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: _Wire (LCOM4 6) lib/src/signals/wire.dart:93 — _Wire's methods fall into 6 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 6 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: NetlistService (LCOM4 6) lib/src/synthesizers/netlist/netlist_service.dart:17 — NetlistService's methods fall into 6 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 6 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: SynthLogicArrayStructureElement (LCOM4 6) lib/src/synthesizers/utilities/synth_logic.dart:1074 — SynthLogicArrayStructureElement's methods fall into 6 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 6 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: LogicValue (LCOM4 6) lib/src/values/logic_value.dart:12 — LogicValue's methods fall into 6 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 6 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: InProcessRohdDesignSession (LCOM4 5) lib/src/diagnostics/in_process_design_session.dart:15 — InProcessRohdDesignSession'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: NullExtensionClient (LCOM4 5) packages/rohd_devtools_widgets/lib/src/rohd_extension_client.dart:97 — NullExtensionClient'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: InProcessWaveformDataSource (LCOM4 4) rohd_devtools_extension/lib/rohd_devtools/services/in_process_waveform_data_source.dart:18 — InProcessWaveformDataSource'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: VmServiceTreeDataSource (LCOM4 4) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart:19 — VmServiceTreeDataSource'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: WellenBackedWaveformDataSource (LCOM4 4) rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart:29 — WellenBackedWaveformDataSource'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: _SignalTableState (LCOM4 4) rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart:140 — _SignalTableState'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: ModuleServices (LCOM4 4) lib/src/diagnostics/module_services.dart:15 — ModuleServices'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: TraceService (LCOM4 4) lib/src/diagnostics/trace_service.dart:43 — TraceService'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: VcdWaveformWriter (LCOM4 4) lib/src/diagnostics/waveform_writer.dart:262 — VcdWaveformWriter'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: FstWaveformWriter (LCOM4 4) lib/src/diagnostics/waveform_writer.dart:424 — FstWaveformWriter'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: SynthesisResult (LCOM4 4) lib/src/synthesizers/synthesis_result.dart:13 — SynthesisResult'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: SystemCService (LCOM4 4) lib/src/synthesizers/systemc/systemc_service.dart:20 — SystemCService'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: SystemVerilogService (LCOM4 4) lib/src/synthesizers/systemverilog/system_verilog_service.dart:18 — SystemVerilogService'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.
  • + 1 more in this group — see findings.md.
D3 · God Classes · ClassTooLong · ×25
  • ClassTooLong: SynthModuleDefinition lib/src/synthesizers/utilities/synth_module_definition.dart:195 — ClassTooLong — 2818 significant lines (blank, comment-only and punctuation-only lines excluded), 94 methods. The bar is 400 significant lines; this is 2418 over it, 7.05× 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: _StandaloneDevToolsPageState rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart:156 — ClassTooLong — 1541 significant lines (blank, comment-only and punctuation-only lines excluded), 67 methods. The bar is 400 significant lines; this is 1141 over it, 3.85× 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: SystemCSynthesisResult lib/src/synthesizers/systemc/systemc_synthesis_result.dart:20 — ClassTooLong — 1189 significant lines (blank, comment-only and punctuation-only lines excluded), 51 methods. The bar is 400 significant lines; this is 789 over it, 2.97× 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: SystemVerilogSynthModuleDefinition lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart:18 — ClassTooLong — 1113 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 400 significant lines; this is 713 over it, 2.78× 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: LogicValue lib/src/values/logic_value.dart:12 — ClassTooLong — 913 significant lines (blank, comment-only and punctuation-only lines excluded), 101 methods. The bar is 400 significant lines; this is 513 over it, 2.28× 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: SourceTracer lib/src/utilities/source_tracer.dart:64 — ClassTooLong — 912 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 400 significant lines; this is 512 over it, 2.28× 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: _SignalTableState rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart:140 — ClassTooLong — 831 significant lines (blank, comment-only and punctuation-only lines excluded), 24 methods. The bar is 400 significant lines; this is 431 over it, 2.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.
  • ClassTooLong: WaveformDataService lib/src/diagnostics/waveform_data_service.dart:97 — ClassTooLong — 776 significant lines (blank, comment-only and punctuation-only lines excluded), 42 methods. The bar is 400 significant lines; this is 376 over it, 1.94× 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: NetlistModuleTranslation lib/src/synthesizers/netlist/netlist_module_translation.dart:23 — ClassTooLong — 759 significant lines (blank, comment-only and punctuation-only lines excluded), 20 methods. The bar is 400 significant lines; this is 359 over it, 1.90× 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: BaseSignalWaveformApi rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart:25 — ClassTooLong — 715 significant lines (blank, comment-only and punctuation-only lines excluded), 36 methods. The bar is 400 significant lines; this is 315 over it, 1.79× 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: NetlistSynthesizer lib/src/synthesizers/netlist/netlist_synthesizer.dart:26 — ClassTooLong — 712 significant lines (blank, comment-only and punctuation-only lines excluded), 11 methods. The bar is 400 significant lines; this is 312 over it, 1.78× 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: DevToolsConnectionHostState rohd_devtools_extension/lib/rohd_devtools/ui/devtools_connection_host.dart:282 — ClassTooLong — 704 significant lines (blank, comment-only and punctuation-only lines excluded), 70 methods. The bar is 400 significant lines; this is 304 over it, 1.76× 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: Module lib/src/module.dart:48 — ClassTooLong — 688 significant lines (blank, comment-only and punctuation-only lines excluded), 60 methods. The bar is 400 significant lines; this is 288 over it, 1.72× 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: _SystemCSimCompare lib/src/utilities/systemc_simcompare.dart:15 — ClassTooLong — 661 significant lines (blank, comment-only and punctuation-only lines excluded), 17 methods. The bar is 400 significant lines; this is 261 over it, 1.65× 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: SystemCFfiCosim lib/src/utilities/systemc_cosim_ffi.dart:49 — ClassTooLong — 541 significant lines (blank, comment-only and punctuation-only lines excluded), 27 methods. The bar is 400 significant lines; this is 141 over it, 1.35× 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: VmServiceWaveformDataSource rohd_devtools_extension/lib/rohd_devtools/services/vm_service_waveform_data_source.dart:19 — ClassTooLong — 518 significant lines (blank, comment-only and punctuation-only lines excluded), 37 methods. The bar is 400 significant lines; this is 118 over it, 1.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: VmServiceTransport rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:24 — ClassTooLong — 503 significant lines (blank, comment-only and punctuation-only lines excluded), 36 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: FstWriter lib/src/fst/fst_writer.dart:180 — ClassTooLong — 467 significant lines (blank, comment-only and punctuation-only lines excluded), 38 methods. The bar is 400 significant lines; this is 67 over it, 1.17× 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: NetlistPasses lib/src/synthesizers/netlist/netlist_passes.dart:17 — ClassTooLong — 462 significant lines (blank, comment-only and punctuation-only lines excluded), 17 methods. The bar is 400 significant lines; this is 62 over it, 1.16× 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: TreeStructurePageState rohd_devtools_extension/lib/rohd_devtools/view/tree_structure_page.dart:63 — ClassTooLong — 445 significant lines (blank, comment-only and punctuation-only lines excluded), 16 methods. The bar is 400 significant lines; this is 45 over it, 1.11× 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: SourceNavigationService rohd_devtools_extension/lib/rohd_devtools/services/source_navigation_service.dart:102 — ClassTooLong — 444 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 400 significant lines; this is 44 over it, 1.11× 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: SignalWaveformRepository packages/rohd_waveform/lib/src/waveform_repository.dart:21 — ClassTooLong — 437 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods. The bar is 400 significant lines; this is 37 over it, 1.09× 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: LogicStructure lib/src/signals/logic_structure.dart:81 — ClassTooLong — 436 significant lines (blank, comment-only and punctuation-only lines excluded), 94 methods. The bar is 400 significant lines; this is 36 over it, 1.09× 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: Logic lib/src/signals/logic.dart:94 — ClassTooLong — 428 significant lines (blank, comment-only and punctuation-only lines excluded), 82 methods. The bar is 400 significant lines; this is 28 over it, 1.07× 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: SynthLogic lib/src/synthesizers/utilities/synth_logic.dart:19 — ClassTooLong — 424 significant lines (blank, comment-only and punctuation-only lines excluded), 50 methods. The bar is 400 significant lines; this is 24 over it, 1.06× 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 · FileTooLong · ×25
  • FileTooLong: utilities/synth_module_definition.dart lib/src/synthesizers/utilities/synth_module_definition.dart — FileTooLong — 2922 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: SynthModuleDefinition (197-4522). The bar is 500 significant lines; this is 2422 over it, 5.84× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: ui/standalone_app_shell.dart rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart — FileTooLong — 2248 significant lines (blank, comment-only and punctuation-only lines excluded), about 69% of them inside a single declaration: _StandaloneDevToolsPageState (156-2785). The bar is 500 significant lines; this is 1748 over it, 4.50× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: systemc/systemc_synthesis_result.dart lib/src/synthesizers/systemc/systemc_synthesis_result.dart — FileTooLong — 1282 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: SystemCSynthesisResult (22-1957). The bar is 500 significant lines; this is 782 over it, 2.56× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: systemverilog/systemverilog_synth_module_definition.dart lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart — FileTooLong — 1173 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: SystemVerilogSynthModuleDefinition (19-1874). The bar is 500 significant lines; this is 673 over it, 2.35× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: ui/signal_table.dart rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart — FileTooLong — 1109 significant lines (blank, comment-only and punctuation-only lines excluded), about 75% of them inside a single declaration: _SignalTableState (140-1416). The bar is 500 significant lines; this is 609 over it, 2.22× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: services/netlist_evaluator.dart rohd_devtools_extension/lib/rohd_devtools/services/netlist_evaluator.dart — FileTooLong — 1080 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 580 over it, 2.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.
  • FileTooLong: utilities/source_tracer.dart lib/src/utilities/source_tracer.dart — FileTooLong — 1042 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: SourceTracer (86-1788). The bar is 500 significant lines; this is 542 over it, 2.08× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: values/logic_value.dart lib/src/values/logic_value.dart — FileTooLong — 932 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: LogicValue (19-1852). The bar is 500 significant lines; this is 432 over it, 1.86× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: ui/devtools_connection_host.dart rohd_devtools_extension/lib/rohd_devtools/ui/devtools_connection_host.dart — FileTooLong — 851 significant lines (blank, comment-only and punctuation-only lines excluded), about 83% of them inside a single declaration: DevToolsConnectionHostState (294-1530). The bar is 500 significant lines; this is 351 over it, 1.70× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: src/conditional_completions.ts rohd_extension/src/conditional_completions.ts — FileTooLong — 825 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 325 over it, 1.65× 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: diagnostics/waveform_data_service.dart lib/src/diagnostics/waveform_data_service.dart — FileTooLong — 819 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: WaveformDataService (121-1546). The bar is 500 significant lines; this is 319 over it, 1.64× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: utilities/synth_logic.dart lib/src/synthesizers/utilities/synth_logic.dart — FileTooLong — 812 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 312 over it, 1.62× 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: netlist/netlist_module_translation.dart lib/src/synthesizers/netlist/netlist_module_translation.dart — FileTooLong — 772 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: NetlistModuleTranslation (25-1085). The bar is 500 significant lines; this is 272 over it, 1.54× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: utilities/simcompare.dart lib/src/utilities/simcompare.dart — FileTooLong — 747 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 247 over it, 1.49× 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: netlist/netlist_synthesizer.dart lib/src/synthesizers/netlist/netlist_synthesizer.dart — FileTooLong — 726 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: NetlistSynthesizer (45-1267). The bar is 500 significant lines; this is 226 over it, 1.45× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: services/base_signal_waveform_api.dart rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart — FileTooLong — 723 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: BaseSignalWaveformApi (32-1246). The bar is 500 significant lines; this is 223 over it, 1.45× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: src/module.dart lib/src/module.dart — FileTooLong — 708 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: Module (53-1428). The bar is 500 significant lines; this is 208 over it, 1.42× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: utilities/systemc_simcompare.dart lib/src/utilities/systemc_simcompare.dart — FileTooLong — 700 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: _SystemCSimCompare (15-1007). The bar is 500 significant lines; this is 200 over it, 1.40× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: modules/gates.dart lib/src/modules/gates.dart — FileTooLong — 621 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 121 over it, 1.24× 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: utilities/systemc_cosim_ffi.dart lib/src/utilities/systemc_cosim_ffi.dart — FileTooLong — 580 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: SystemCFfiCosim (94-1070). The bar is 500 significant lines; this is 80 over it, 1.16× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: src/hierarchy_service.dart packages/rohd_hierarchy/lib/src/hierarchy_service.dart — FileTooLong — 558 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 58 over it, 1.12× 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: fst/fst_writer.dart lib/src/fst/fst_writer.dart — FileTooLong — 544 significant lines (blank, comment-only and punctuation-only lines excluded), about 86% of them inside a single declaration: FstWriter (198-1044). The bar is 500 significant lines; this is 44 over it, 1.09× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: systemverilog/systemverilog_synthesis_result.dart lib/src/synthesizers/systemverilog/systemverilog_synthesis_result.dart — FileTooLong — 534 significant lines (blank, comment-only and punctuation-only lines excluded), about 71% of them inside a single declaration: SystemVerilogSynthesisResult (78-704). The bar is 500 significant lines; this is 34 over it, 1.07× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: services/vm_service_waveform_data_source.dart rohd_devtools_extension/lib/rohd_devtools/services/vm_service_waveform_data_source.dart — FileTooLong — 524 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: VmServiceWaveformDataSource (59-1068). The bar is 500 significant lines; this is 24 over it, 1.05× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: services/vm_service_transport.dart rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart — FileTooLong — 509 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: VmServiceTransport (30-820). The bar is 500 significant lines; this is 9 over it, 1.02× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
X3 · Exception handling · Swallowed exception (caught, then discarded) · ×25
  • Swallowed exception (caught, then discarded) rohd_extension/src/dtd_bridge.ts:54 — `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included.
  • Swallowed exception (caught, then discarded) rohd_extension/src/source_navigator.ts:183 — `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included.
  • Swallowed exception (caught, then discarded) rohd_extension/src/source_navigator.ts:449 — `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included.
  • Swallowed exception (caught, then discarded) rohd_devtools_extension/scripts/fix_directives.py:72 — `except` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) rohd_devtools_extension/scripts/fix_types.py:56 — `except` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) rohd_devtools_extension/lib/rohd_devtools/ui/devtools_connection_host.dart:1340 — `on Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart:318 — `on Object` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart:1487 — `on Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) rohd_devtools_extension/lib/rohd_devtools/services/netlist_const_extractor.dart:194 — `on Object` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) rohd_devtools_extension/lib/rohd_devtools/services/netlist_evaluator.dart:140 — `on Object` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) rohd_devtools_extension/lib/rohd_devtools/services/source_navigation_service.dart:579 — `on Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) rohd_devtools_extension/lib/rohd_devtools/services/standalone_tree_service.dart:100 — `on Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) rohd_devtools_extension/lib/rohd_devtools/services/standalone_tree_service.dart:123 — `on Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_signal_value_source.dart:230 — `on Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:126 — `on Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:150 — `on Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:627 — `on Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:767 — `on Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:779 — `on Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:816 — `on Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_waveform_data_source.dart:595 — `on Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_waveform_data_source.dart:724 — `on Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_waveform_data_source.dart:851 — `on Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) rohd_devtools_extension/bin/rohd_shell.dart:807 — `on Object` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) packages/rohd_devtools_widgets/lib/src/logic_type_utils.dart:315 — `on Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
D3 · God Classes · TooManyMethods · ×23
  • TooManyMethods: LogicValue lib/src/values/logic_value.dart:12 — TooManyMethods — 101 methods. The bar is 30 methods; this is 71 over it, 3.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: LogicStructure lib/src/signals/logic_structure.dart:81 — TooManyMethods — 94 methods. The bar is 30 methods; this is 64 over it, 3.13× the bar. Most of these members implement src.Logic (71 of 88 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member.
  • TooManyMethods: SynthModuleDefinition lib/src/synthesizers/utilities/synth_module_definition.dart:195 — TooManyMethods — 94 methods. The bar is 30 methods; this is 64 over it, 3.13× 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: Logic lib/src/signals/logic.dart:94 — TooManyMethods — 82 methods. The bar is 30 methods; this is 52 over it, 2.73× 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: DevToolsConnectionHostState rohd_devtools_extension/lib/rohd_devtools/ui/devtools_connection_host.dart:282 — TooManyMethods — 70 methods. The bar is 30 methods; this is 40 over it, 2.33× 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: _StandaloneDevToolsPageState rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart:156 — TooManyMethods — 67 methods. The bar is 30 methods; this is 37 over it, 2.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: Module lib/src/module.dart:48 — TooManyMethods — 60 methods. The bar is 30 methods; this is 30 over it, 2.00× 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: SystemCSynthesisResult lib/src/synthesizers/systemc/systemc_synthesis_result.dart:20 — TooManyMethods — 51 methods. The bar is 30 methods; this is 21 over it, 1.70× 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: SynthLogic lib/src/synthesizers/utilities/synth_logic.dart:19 — TooManyMethods — 50 methods. The bar is 30 methods; this is 20 over it, 1.67× 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: WaveformDataService lib/src/diagnostics/waveform_data_service.dart:97 — TooManyMethods — 42 methods. The bar is 30 methods; this is 12 over it, 1.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: TypedLogicValueArray lib/src/values/typed_logic_value_array.dart:43 — TooManyMethods — 42 methods. The bar is 30 methods; this is 12 over it, 1.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: TraceService lib/src/diagnostics/trace_service.dart:43 — TooManyMethods — 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: HierarchyService packages/rohd_hierarchy/lib/src/hierarchy_service.dart:12 — TooManyMethods — 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: SignalWaveform packages/rohd_waveform/lib/src/models/signal_waveform.dart:31 — TooManyMethods — 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: InProcessRohdDesignSession lib/src/diagnostics/in_process_design_session.dart:15 — TooManyMethods — 40 methods. The bar is 30 methods; this is 10 over it, 1.33× 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: FstWriter lib/src/fst/fst_writer.dart:180 — TooManyMethods — 38 methods. The bar is 30 methods; this is 8 over it, 1.27× 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: VmServiceWaveformDataSource rohd_devtools_extension/lib/rohd_devtools/services/vm_service_waveform_data_source.dart:19 — TooManyMethods — 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: BaseSignalWaveformApi rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart:25 — TooManyMethods — 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: VmServiceTransport rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:24 — TooManyMethods — 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: SystemVerilogSynthModuleDefinition lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart:18 — TooManyMethods — 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.
  • TooManyMethods: SignalWaveformRepository packages/rohd_waveform/lib/src/waveform_repository.dart:21 — TooManyMethods — 32 methods. The bar is 30 methods; this is 2 over it, 1.07× 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: SourceTracer lib/src/utilities/source_tracer.dart:64 — TooManyMethods — 31 methods. The bar is 30 methods; this is 1 over it, 1.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: SourceNavigationService rohd_devtools_extension/lib/rohd_devtools/services/source_navigation_service.dart:102 — TooManyMethods — 31 methods. The bar is 30 methods; this is 1 over it, 1.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.
D15 · Churn × Complexity Hotspots · Hotspot · ×20
  • Hotspot: lib/src/synthesizers/netlist/netlist_synthesizer.dart lib/src/synthesizers/netlist/netlist_synthesizer.dart:94 — lib/src/synthesizers/netlist/netlist_synthesizer.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 159 in NetlistSynthesizer.synthesize at line 94. 1 of those changes was a fix/bug commit, and the other 5 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:40:27 -08:00' --until='2026-11-16 15:40:27 -08:00' --full-history --no-merges -- lib/src/synthesizers/netlist/netlist_synthesizer.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: lib/src/synthesizers/utilities/synth_module_definition.dart lib/src/synthesizers/utilities/synth_module_definition.dart:504 — lib/src/synthesizers/utilities/synth_module_definition.dart changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in SynthModuleDefinition.SynthModuleDefinition at line 504. 4 of those changes were fix/bug commits, and the other 11 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:40:27 -08:00' --until='2026-11-16 15:40:27 -08:00' --full-history --no-merges -- lib/src/synthesizers/utilities/synth_module_definition.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart:1402 — lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in SystemVerilogSynthModuleDefinition._collapseFullPackedArrayConcats at line 1402. 2 of those changes were fix/bug commits, and the other 7 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:40:27 -08:00' --until='2026-11-16 15:40:27 -08:00' --full-history --no-merges -- lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: lib/src/values/logic_value.dart lib/src/values/logic_value.dart:167 — lib/src/values/logic_value.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in LogicValue.of at line 167. 2 of those changes were fix/bug commits, and the other 6 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:40:27 -08:00' --until='2026-11-16 15:40:27 -08:00' --full-history --no-merges -- lib/src/values/logic_value.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: lib/src/synthesizers/systemverilog/systemverilog_synthesis_result.dart lib/src/synthesizers/systemverilog/systemverilog_synthesis_result.dart:509 — lib/src/synthesizers/systemverilog/systemverilog_synthesis_result.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in SystemVerilogSynthesisResult._buildSvLineMap at line 509. 1 of those changes was a fix/bug commit, and the other 7 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:40:27 -08:00' --until='2026-11-16 15:40:27 -08:00' --full-history --no-merges -- lib/src/synthesizers/systemverilog/systemverilog_synthesis_result.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: lib/src/synthesizers/systemc/systemc_synthesis_result.dart lib/src/synthesizers/systemc/systemc_synthesis_result.dart:676 — lib/src/synthesizers/systemc/systemc_synthesis_result.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in SystemCSynthesisResult._gateExpression at line 676. 1 of those changes was a fix/bug commit, and the other 6 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:40:27 -08:00' --until='2026-11-16 15:40:27 -08:00' --full-history --no-merges -- lib/src/synthesizers/systemc/systemc_synthesis_result.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: lib/src/utilities/simcompare.dart lib/src/utilities/simcompare.dart:433 — lib/src/utilities/simcompare.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in SimCompare.checkVerilatorVector at line 433. 2 of those changes were fix/bug commits, and the other 5 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:40:27 -08:00' --until='2026-11-16 15:40:27 -08:00' --full-history --no-merges -- lib/src/utilities/simcompare.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: lib/src/module.dart lib/src/module.dart:726 — lib/src/module.dart changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Module.addTypedInput at line 726. 2 of those changes were fix/bug commits, and the other 8 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:40:27 -08:00' --until='2026-11-16 15:40:27 -08:00' --full-history --no-merges -- lib/src/module.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: lib/src/synthesizers/utilities/synth_logic.dart lib/src/synthesizers/utilities/synth_logic.dart:416 — lib/src/synthesizers/utilities/synth_logic.dart changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in SynthLogic.tryMerge at line 416. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:40:27 -08:00' --until='2026-11-16 15:40:27 -08:00' --full-history --no-merges -- lib/src/synthesizers/utilities/synth_logic.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart:2993 — rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in _StandaloneAppBarState.build at line 2993. 1 of those changes was a fix/bug commit, and the other 4 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:40:27 -08:00' --until='2026-11-16 15:40:27 -08:00' --full-history --no-merges -- rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: lib/src/synthesizers/netlist/netlist_cell_mapper.dart lib/src/synthesizers/netlist/netlist_cell_mapper.dart:262 — lib/src/synthesizers/netlist/netlist_cell_mapper.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in NetlistCellMapper._registerDefaults at line 262. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:40:27 -08:00' --until='2026-11-16 15:40:27 -08:00' --full-history --no-merges -- lib/src/synthesizers/netlist/netlist_cell_mapper.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: lib/src/modules/conditionals/case.dart lib/src/modules/conditionals/case.dart:272 — lib/src/modules/conditionals/case.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Case.execute at line 272. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:40:27 -08:00' --until='2026-11-16 15:40:27 -08:00' --full-history --no-merges -- lib/src/modules/conditionals/case.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: lib/src/utilities/systemc_simcompare.dart lib/src/utilities/systemc_simcompare.dart:209 — lib/src/utilities/systemc_simcompare.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in _SystemCSimCompare.buildSystemCVectorExecutable at line 209. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:40:27 -08:00' --until='2026-11-16 15:40:27 -08:00' --full-history --no-merges -- lib/src/utilities/systemc_simcompare.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: lib/src/synthesizers/systemverilog/systemverilog_synthesizer.dart lib/src/synthesizers/systemverilog/systemverilog_synthesizer.dart:37 — lib/src/synthesizers/systemverilog/systemverilog_synthesizer.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in SystemVerilogSynthesizer.instantiationVerilogFor at line 37. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:40:27 -08:00' --until='2026-11-16 15:40:27 -08:00' --full-history --no-merges -- lib/src/synthesizers/systemverilog/systemverilog_synthesizer.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: lib/src/utilities/namer.dart lib/src/utilities/namer.dart:288 — lib/src/utilities/namer.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Namer.signalNameOfBest at line 288. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:40:27 -08:00' --until='2026-11-16 15:40:27 -08:00' --full-history --no-merges -- lib/src/utilities/namer.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: lib/src/diagnostics/waveform_service.dart lib/src/diagnostics/waveform_service.dart:207 — lib/src/diagnostics/waveform_service.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in WaveformService._ at line 207. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:40:27 -08:00' --until='2026-11-16 15:40:27 -08:00' --full-history --no-merges -- lib/src/diagnostics/waveform_service.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart:438 — rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in _SignalTableState._generateSignalRow at line 438. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:40:27 -08:00' --until='2026-11-16 15:40:27 -08:00' --full-history --no-merges -- rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: rohd_devtools_extension/lib/rohd_devtools/view/tree_structure_page.dart rohd_devtools_extension/lib/rohd_devtools/view/tree_structure_page.dart:343 — rohd_devtools_extension/lib/rohd_devtools/view/tree_structure_page.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in TreeStructurePageState.build at line 343. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:40:27 -08:00' --until='2026-11-16 15:40:27 -08:00' --full-history --no-merges -- rohd_devtools_extension/lib/rohd_devtools/view/tree_structure_page.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: rohd_extension/src/flc_service.ts rohd_extension/src/flc_service.ts:137 — rohd_extension/src/flc_service.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in flc_service.queryModule at line 137. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:40:27 -08:00' --until='2026-11-16 15:40:27 -08:00' --full-history --no-merges -- rohd_extension/src/flc_service.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: packages/rohd_devtools_widgets/lib/src/markdown_help_button.dart packages/rohd_devtools_widgets/lib/src/markdown_help_button.dart:411 — packages/rohd_devtools_widgets/lib/src/markdown_help_button.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in _HelpContent._parseDetails at line 411. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:40:27 -08:00' --until='2026-11-16 15:40:27 -08:00' --full-history --no-merges -- packages/rohd_devtools_widgets/lib/src/markdown_help_button.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
X3 · Exception handling · Swallowed exception (empty catch) · ×6
  • Swallowed exception (empty catch) rohd_extension/src/dtd_bridge.ts:92 — `.catch(() => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it.
  • Swallowed exception (empty catch) rohd_devtools_extension/lib/main.dart:114 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart:1194 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) lib/src/utilities/systemc_cosim_ffi.dart:1065 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) lib/src/utilities/systemc_simcompare.dart:206 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) lib/src/utilities/systemc_simcompare.dart:1063 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
D4 · Code Duplication · Edited copy of a member (10 corresponding lines) · ×4
  • Edited copy of a member (10 corresponding lines) lib/src/values/big_logic_value.dart:149 — lib/src/values/big_logic_value.dart:149-158 | lib/src/values/small_logic_value.dart:126-135 — 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) lib/src/signals/typed_logic_array.dart:309 — lib/src/signals/typed_logic_array.dart:309-319 | lib/src/signals/typed_logic_array.dart:324-333 — 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) lib/src/synthesizers/netlist/netlist_utils.dart:155 — lib/src/synthesizers/netlist/netlist_utils.dart:155-164 | lib/src/utilities/namer.dart:210-219 — 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) example/example.dart:28 — example/example.dart:28-40 | rohd_devtools_extension/lib/rohd_devtools/examples/rohd_examples.dart:66-75 — 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 (12 corresponding lines) · ×4
  • Edited copy of a member (12 corresponding lines) doc/tutorials/chapter_8/counter_interface.dart:23 — doc/tutorials/chapter_8/counter_interface.dart:23-42 | doc/tutorials/chapter_9/rohd_vf_example/lib/counter.dart:21-32 — 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) lib/src/diagnostics/in_process_design_session.dart:58 — lib/src/diagnostics/in_process_design_session.dart:58-70 | lib/src/diagnostics/in_process_design_session.dart:75-86 — 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) lib/src/signals/const.dart:127 — lib/src/signals/const.dart:127-138 | lib/src/signals/const.dart:140-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) rohd_devtools_extension/lib/rohd_devtools/ui/devtools_help_button.dart:36 — rohd_devtools_extension/lib/rohd_devtools/ui/devtools_help_button.dart:36-48 | rohd_devtools_extension/lib/rohd_devtools/ui/rohd_shell_help_button.dart:37-48 — 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 (12 lines × 2) · ×4
  • Duplicated block (12 lines × 2) rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart:265 — rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart:265-276 | rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart:469-480 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart:265` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, 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 (12 lines × 2) rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart:2006 — rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart:2006-2017 | rohd_devtools_extension/lib/rohd_devtools/view/tree_structure_page.dart:477-488 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart:2006` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, 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 (12 lines × 2) rohd_devtools_extension/lib/rohd_devtools/ui/vm_connection_form.dart:398 — rohd_devtools_extension/lib/rohd_devtools/ui/vm_connection_form.dart:398-409 | rohd_devtools_extension/lib/rohd_devtools/ui/vm_connection_form.dart:587-598 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `rohd_devtools_extension/lib/rohd_devtools/ui/vm_connection_form.dart:398` 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 (12 lines × 2) rohd_devtools_extension/lib/rohd_devtools/services/in_process_transport.dart:73 — rohd_devtools_extension/lib/rohd_devtools/services/in_process_transport.dart:73-84 | rohd_devtools_extension/lib/rohd_devtools/services/in_process_waveform_data_source.dart:60-71 — 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 (11 lines × 2) · ×4
  • Duplicated block (11 lines × 2) lib/src/utilities/simcompare.dart:762 — lib/src/utilities/simcompare.dart:762-772 | lib/src/utilities/systemverilog_simcompare.dart:222-232 — 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 `lib/src/utilities/simcompare.dart:762` it begins part-way through the construct above it, 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) lib/src/utilities/source_tracer.dart:678 — lib/src/utilities/source_tracer.dart:678-688 | lib/src/utilities/source_tracer.dart:691-701 — 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (11 lines × 2) lib/src/values/filled_logic_value.dart:191 — lib/src/values/filled_logic_value.dart:191-201 | lib/src/values/filled_logic_value.dart:221-231 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `lib/src/values/filled_logic_value.dart:191` it begins part-way through the construct above it, 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) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_signal_value_source.dart:157 — rohd_devtools_extension/lib/rohd_devtools/services/vm_service_signal_value_source.dart:157-167 | rohd_devtools_extension/lib/rohd_devtools/services/vm_service_signal_value_source.dart:244-254 — 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 × 2) · ×4
  • Duplicated block (10 lines × 2) doc/tutorials/chapter_5/answers/n_bit_subtractor.dart:17 — doc/tutorials/chapter_5/answers/n_bit_subtractor.dart:17-26 | doc/tutorials/chapter_6/answers/exercise_2_n_bit_subtractor.dart:76-85 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `doc/tutorials/chapter_5/answers/n_bit_subtractor.dart:17` 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 (10 lines × 2) lib/src/synthesizers/netlist/netlist_utils.dart:112 — lib/src/synthesizers/netlist/netlist_utils.dart:112-121 | lib/src/utilities/namer.dart:166-175 — 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) rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart:71 — rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart:71-80 | rohd_devtools_extension/lib/rohd_devtools/services/web_vm_connection_strategy.dart:89-98 — before extracting anything, compare `rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart` and `rohd_devtools_extension/lib/rohd_devtools/services/web_vm_connection_strategy.dart` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 68 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. Read the line range as the matched WINDOW rather than a finished unit: at `rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart:71` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `rohd_devtools_extension/lib/rohd_devtools/services/web_vm_connection_strategy.dart:87` calls `Duration` and `rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart:70` 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 (10 lines × 2) lib/src/values/big_logic_value.dart:78 — lib/src/values/big_logic_value.dart:78-87 | lib/src/values/small_logic_value.dart:69-80 — 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (9 lines × 2) · ×4
  • Duplicated block (9 lines × 2) lib/src/synthesizers/netlist/netlist_synthesizer.dart:356 — lib/src/synthesizers/netlist/netlist_synthesizer.dart:356-364 | lib/src/synthesizers/netlist/netlist_synthesizer.dart:379-387 — 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) lib/src/synthesizers/netlist/netlist_synthesizer.dart:920 — lib/src/synthesizers/netlist/netlist_synthesizer.dart:920-928 | lib/src/synthesizers/netlist/netlist_synthesizer.dart:1020-1028 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `lib/src/synthesizers/netlist/netlist_synthesizer.dart:920` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (9 lines × 2) lib/src/values/big_logic_value.dart:184 — lib/src/values/big_logic_value.dart:184-192 | lib/src/values/small_logic_value.dart:161-169 — 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) rohd_devtools_extension/scripts/fix_directives.py:91 — rohd_devtools_extension/scripts/fix_directives.py:91-99 | rohd_devtools_extension/scripts/fix_types.py:68-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.
D4 · Code Duplication · Duplicated block (8 lines × 2) · ×4
  • Duplicated block (8 lines × 2) lib/src/synthesizers/netlist/netlist_synthesizer.dart:581 — lib/src/synthesizers/netlist/netlist_synthesizer.dart:581-588 | lib/src/synthesizers/netlist/netlist_synthesizer.dart:1014-1021 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `lib/src/synthesizers/netlist/netlist_synthesizer.dart:581` it begins part-way through the construct above it, 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 (8 lines × 2) lib/src/synthesizers/systemc/systemc_service.dart:291 — lib/src/synthesizers/systemc/systemc_service.dart:291-298 | lib/src/synthesizers/systemverilog/system_verilog_service.dart:258-265 — 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (8 lines × 2) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:466 — rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:466-473 | rohd_devtools_extension/lib/rohd_devtools/services/vm_service_waveform_data_source.dart:1059-1067 — 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) lib/src/values/big_logic_value.dart:170 — lib/src/values/big_logic_value.dart:170-177 | lib/src/values/small_logic_value.dart:147-154 — 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (7 lines × 2) · ×4
  • Duplicated block (7 lines × 2) packages/rohd_devtools_widgets/lib/src/bit_field_utils.dart:185 — packages/rohd_devtools_widgets/lib/src/bit_field_utils.dart:185-191 | packages/rohd_devtools_widgets/lib/src/markdown_help_button.dart:503-509 — 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) packages/rohd_devtools_widgets/lib/src/rohd_extension_status.dart:213 — packages/rohd_devtools_widgets/lib/src/rohd_extension_status.dart:213-219 | rohd_devtools_extension/lib/rohd_devtools/services/flc_extension_client.dart:159-165 — 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) rohd_devtools_extension/lib/rohd_devtools/ui/devtools_help_button.dart:50 — rohd_devtools_extension/lib/rohd_devtools/ui/devtools_help_button.dart:50-56 | rohd_devtools_extension/lib/rohd_devtools/ui/rohd_shell_help_button.dart:29-35 — 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) doc/tutorials/chapter_4/answers/exercise_1_sv.dart:92 — doc/tutorials/chapter_4/answers/exercise_1_sv.dart:92-98 | doc/tutorials/chapter_6/combinational_logic.dart:50-56 — 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
R4 · Test Coverage · No test reaches this file · ×4
  • No test reaches this file rohd_extension/src/uri_forwarder.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file packages/rohd_devtools_widgets/assets/extension/module_info_helper.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file rohd_devtools_extension/shared/module_info_helper.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file rohd_devtools_extension/assets/layout_bridge/elk_layout_only.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
D4 · Code Duplication · Edited copy of a member (9 corresponding lines) · ×3
  • Edited copy of a member (9 corresponding lines) lib/src/values/big_logic_value.dart:160 — lib/src/values/big_logic_value.dart:160-168 | lib/src/values/small_logic_value.dart:137-145 — 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) lib/src/modules/gates.dart:222 — lib/src/modules/gates.dart:222-233 | lib/src/modules/gates.dart:1023-1031 — 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) lib/src/signals/logic_array.dart:94 — lib/src/signals/logic_array.dart:94-102 | lib/src/signals/typed_logic_array.dart:272-281 — 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 (13 lines × 2) · ×3
  • Duplicated block (13 lines × 2) doc/tutorials/chapter_3/answers/exercise_sv.dart:18 — doc/tutorials/chapter_3/answers/exercise_sv.dart:18-30 | doc/tutorials/chapter_5/answers/full_subtractor.dart:24-36 — 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
  • Duplicated block (13 lines × 2) lib/src/synthesizers/systemc/systemc_service.dart:216 — lib/src/synthesizers/systemc/systemc_service.dart:216-228 | lib/src/synthesizers/systemverilog/system_verilog_service.dart:140-152 — 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (13 lines × 2) rohd_devtools_extension/lib/rohd_devtools/services/in_process_transport.dart:86 — rohd_devtools_extension/lib/rohd_devtools/services/in_process_transport.dart:86-98 | rohd_devtools_extension/lib/rohd_devtools/services/in_process_waveform_data_source.dart:98-110 — 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 before the matched lines, `rohd_devtools_extension/lib/rohd_devtools/services/in_process_waveform_data_source.dart:95` calls `getSnapshot` and `rohd_devtools_extension/lib/rohd_devtools/services/in_process_transport.dart:84` 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.
PF3 · Async & latency hygiene · Sync-over-async blocking · ×3
  • Sync-over-async blocking benchmark/wave_dump_benchmark.dart:46 — `teardown` is async and calls deleteSync — a blocking call inside async code stalls the isolate's event loop — every other event, on Flutter the next frame, waits for as long as it runs.
  • Sync-over-async blocking packages/rohd_devtools_widgets/assets/extension/module_info_helper.js:51 — `fs.existsSync` in `resolveFlcPathWithAvailability` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking rohd_devtools_extension/shared/module_info_helper.js:41 — `fs.existsSync` in `resolveFlcPath` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Edited copy of a member (15 corresponding lines) · ×2
  • Edited copy of a member (15 corresponding lines) lib/src/diagnostics/design_command_shell.dart:186 — lib/src/diagnostics/design_command_shell.dart:186-204 | lib/src/diagnostics/design_command_shell.dart:206-220 — 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.
  • Edited copy of a member (15 corresponding lines) rohd_devtools_extension/lib/rohd_devtools/ui/module_tree_card.dart:90 — rohd_devtools_extension/lib/rohd_devtools/ui/module_tree_card.dart:90-104 | rohd_devtools_extension/lib/rohd_devtools/ui/module_tree_card.dart:117-136 — 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 · Duplicated block (17 lines × 2) · ×2
  • Duplicated block (17 lines × 2) rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart:131 — rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart:131-147 | rohd_devtools_extension/lib/rohd_devtools/services/web_vm_connection_strategy.dart:149-165 — before extracting anything, compare `rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart` and `rohd_devtools_extension/lib/rohd_devtools/services/web_vm_connection_strategy.dart` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 68 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. Read the line range as the matched WINDOW rather than a finished unit: at `rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart:131` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (17 lines × 2) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:322 — rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:322-338 | rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart:190-206 — before extracting anything, compare `rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart` and `rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 85 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. Read the line range as the matched WINDOW rather than a finished unit: at `rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:322` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, 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.
D4 · Code Duplication · Duplicated block (13–14 lines × 2) · ×2
  • Duplicated block (13–14 lines × 2) rohd_devtools_extension/lib/rohd_devtools/services/in_process_waveform_data_source.dart:191 — rohd_devtools_extension/lib/rohd_devtools/services/in_process_waveform_data_source.dart:191-203 | rohd_devtools_extension/lib/rohd_devtools/services/in_process_waveform_data_source.dart:230-243 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `rohd_devtools_extension/lib/rohd_devtools/services/in_process_waveform_data_source.dart:191` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (13–14 lines × 2) rohd_devtools_extension/lib/rohd_devtools/ui/devtool_appbar.dart:150 — rohd_devtools_extension/lib/rohd_devtools/ui/devtool_appbar.dart:150-163 | rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart:3179-3191 — 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 `rohd_devtools_extension/lib/rohd_devtools/ui/devtool_appbar.dart:150` it begins part-way through the construct above it, 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (5 lines × 2) · ×2
  • Duplicated block (5 lines × 2) lib/src/diagnostics/design_command_shell.dart:335 — lib/src/diagnostics/design_command_shell.dart:335-339 | lib/src/diagnostics/shell_command_registry.dart:329-333 — 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) lib/src/diagnostics/design_session_protocol.dart:323 — lib/src/diagnostics/design_session_protocol.dart:323-327 | rohd_devtools_extension/lib/rohd_devtools/cli/rohd_design_dtd_service.dart:246-250 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `lib/src/diagnostics/design_session_protocol.dart:323` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, 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.
D1 · Cyclomatic Complexity · NetlistSynthesizer.synthesize (cyclomatic 159) · ×1
  • NetlistSynthesizer.synthesize (cyclomatic 159) lib/src/synthesizers/netlist/netlist_synthesizer.dart:94 — NetlistSynthesizer.synthesize has cyclomatic complexity 159 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SystemVerilogSynthModuleDefinition._collapseFullPackedArrayConcats (cyclomatic 80) · ×1
  • SystemVerilogSynthModuleDefinition._collapseFullPackedArrayConcats (cyclomatic 80) lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart:1402 — SystemVerilogSynthModuleDefinition._collapseFullPackedArrayConcats has cyclomatic complexity 80 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SourceTracer.traceJsonForHierarchy (cyclomatic 71) · ×1
  • SourceTracer.traceJsonForHierarchy (cyclomatic 71) lib/src/utilities/source_tracer.dart:1232 — SourceTracer.traceJsonForHierarchy has cyclomatic complexity 71 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · NetlistCellMapper._registerDefaults (cyclomatic 59) · ×1
  • NetlistCellMapper._registerDefaults (cyclomatic 59) lib/src/synthesizers/netlist/netlist_cell_mapper.dart:262 — NetlistCellMapper._registerDefaults has cyclomatic complexity 59 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · NetlistModuleTranslation.processNetnames (cyclomatic 57) · ×1
  • NetlistModuleTranslation.processNetnames (cyclomatic 57) lib/src/synthesizers/netlist/netlist_module_translation.dart:630 — NetlistModuleTranslation.processNetnames has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SystemCSynthesisResult._buildProcesses (cyclomatic 56) · ×1
  • SystemCSynthesisResult._buildProcesses (cyclomatic 56) lib/src/synthesizers/systemc/systemc_synthesis_result.dart:941 — SystemCSynthesisResult._buildProcesses has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SynthModuleDefinition.SynthModuleDefinition (cyclomatic 56) · ×1
  • SynthModuleDefinition.SynthModuleDefinition (cyclomatic 56) lib/src/synthesizers/utilities/synth_module_definition.dart:504 — SynthModuleDefinition.SynthModuleDefinition has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SynthModuleDefinition._pruneUnused (cyclomatic 55) · ×1
  • SynthModuleDefinition._pruneUnused (cyclomatic 55) lib/src/synthesizers/utilities/synth_module_definition.dart:1499 — SynthModuleDefinition._pruneUnused has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · LogicValue.of (cyclomatic 52) · ×1
  • LogicValue.of (cyclomatic 52) lib/src/values/logic_value.dart:167 — LogicValue.of has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · NetlistPasses.applyTransparentClustering (cyclomatic 50) · ×1
  • NetlistPasses.applyTransparentClustering (cyclomatic 50) lib/src/synthesizers/netlist/netlist_passes.dart:133 — NetlistPasses.applyTransparentClustering has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SystemVerilogSynthModuleDefinition._inlinePackedRangesIntoSubmoduleInputs (cyclomatic 50) · ×1
  • SystemVerilogSynthModuleDefinition._inlinePackedRangesIntoSubmoduleInputs (cyclomatic 50) lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart:214 — SystemVerilogSynthModuleDefinition._inlinePackedRangesIntoSubmoduleInputs has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SystemVerilogSynthModuleDefinition._collapseAggregateConnections (cyclomatic 50) · ×1
  • SystemVerilogSynthModuleDefinition._collapseAggregateConnections (cyclomatic 50) lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart:456 — SystemVerilogSynthModuleDefinition._collapseAggregateConnections has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · NetlistEvaluator.collectLeaves (cyclomatic 41) · ×1
  • NetlistEvaluator.collectLeaves (cyclomatic 41) rohd_devtools_extension/lib/rohd_devtools/services/netlist_evaluator.dart:309 — NetlistEvaluator.collectLeaves has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SystemCSynthesisResult._gateExpression (cyclomatic 41) · ×1
  • SystemCSynthesisResult._gateExpression (cyclomatic 41) lib/src/synthesizers/systemc/systemc_synthesis_result.dart:676 — SystemCSynthesisResult._gateExpression has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SystemVerilogSynthesisResult._buildSvLineMap (cyclomatic 40) · ×1
  • SystemVerilogSynthesisResult._buildSvLineMap (cyclomatic 40) lib/src/synthesizers/systemverilog/systemverilog_synthesis_result.dart:509 — SystemVerilogSynthesisResult._buildSvLineMap has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SynthModuleDefinition._planConcatRangeRewrite (cyclomatic 40) · ×1
  • SynthModuleDefinition._planConcatRangeRewrite (cyclomatic 40) lib/src/synthesizers/utilities/synth_module_definition.dart:3800 — SynthModuleDefinition._planConcatRangeRewrite has cyclomatic complexity 40 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · _StandaloneDevToolsPageState._loadModuleTree (cyclomatic 39) · ×1
  • _StandaloneDevToolsPageState._loadModuleTree (cyclomatic 39) rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart:1202 — _StandaloneDevToolsPageState._loadModuleTree has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · FlcData.fromJson (cyclomatic 38) · ×1
  • FlcData.fromJson (cyclomatic 38) packages/rohd_source_navigator/lib/flc_data.dart:101 — FlcData.fromJson has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Module._traceInputForModuleContents (cyclomatic 38) · ×1
  • Module._traceInputForModuleContents (cyclomatic 38) lib/src/module.dart:435 — Module._traceInputForModuleContents has cyclomatic complexity 38 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · SystemVerilogSynthModuleDefinition._forwardPassthroughElementsIntoInlineables (cyclomatic 38) · ×1
  • SystemVerilogSynthModuleDefinition._forwardPassthroughElementsIntoInlineables (cyclomatic 38) lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart:1180 — SystemVerilogSynthModuleDefinition._forwardPassthroughElementsIntoInlineables has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SynthModuleDefinition._findChainableModulesToCollapse (cyclomatic 38) · ×1
  • SynthModuleDefinition._findChainableModulesToCollapse (cyclomatic 38) lib/src/synthesizers/utilities/synth_module_definition.dart:1155 — SynthModuleDefinition._findChainableModulesToCollapse has cyclomatic complexity 38 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · _SystemCSimCompare.buildSystemCVectorExecutable (cyclomatic 38) · ×1
  • _SystemCSimCompare.buildSystemCVectorExecutable (cyclomatic 38) lib/src/utilities/systemc_simcompare.dart:209 — _SystemCSimCompare.buildSystemCVectorExecutable has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · conditional_completions.detectContext (cyclomatic 38) · ×1
  • conditional_completions.detectContext (cyclomatic 38) rohd_extension/src/conditional_completions.ts:37 — conditional_completions.detectContext has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · conditional_completions.findEnclosingClassInfo (cyclomatic 38) · ×1
  • conditional_completions.findEnclosingClassInfo (cyclomatic 38) rohd_extension/src/conditional_completions.ts:162 — conditional_completions.findEnclosingClassInfo has cyclomatic complexity 38 (threshold 15). Of this number, 36 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · BaseSignalWaveformApi.getWaveformData (cyclomatic 36) · ×1
  • BaseSignalWaveformApi.getWaveformData (cyclomatic 36) rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart:164 — BaseSignalWaveformApi.getWaveformData has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SystemVerilogSynthModuleDefinition._collapseWholeNetBuses (cyclomatic 36) · ×1
  • SystemVerilogSynthModuleDefinition._collapseWholeNetBuses (cyclomatic 36) lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart:916 — SystemVerilogSynthModuleDefinition._collapseWholeNetBuses has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Module._traceOutputForModuleContents (cyclomatic 35) · ×1
  • Module._traceOutputForModuleContents (cyclomatic 35) lib/src/module.dart:562 — Module._traceOutputForModuleContents has cyclomatic complexity 35 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · SynthModuleDefinition._collapseConstantBackedRangeIntermediates (cyclomatic 35) · ×1
  • SynthModuleDefinition._collapseConstantBackedRangeIntermediates (cyclomatic 35) lib/src/synthesizers/utilities/synth_module_definition.dart:3295 — SynthModuleDefinition._collapseConstantBackedRangeIntermediates has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · LogicValue.ofRadixString (cyclomatic 35) · ×1
  • LogicValue.ofRadixString (cyclomatic 35) lib/src/values/logic_value.dart:801 — LogicValue.ofRadixString has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SynthModuleDefinition._collapseSimpleRangeAssignments (cyclomatic 31) · ×1
  • SynthModuleDefinition._collapseSimpleRangeAssignments (cyclomatic 31) lib/src/synthesizers/utilities/synth_module_definition.dart:2417 — SynthModuleDefinition._collapseSimpleRangeAssignments has cyclomatic complexity 31 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · _CopyableCell._showCopyMenu (cyclomatic 30) · ×1
  • _CopyableCell._showCopyMenu (cyclomatic 30) rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart:1503 — _CopyableCell._showCopyMenu has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · _StandaloneAppBarState.build (cyclomatic 30) · ×1
  • _StandaloneAppBarState.build (cyclomatic 30) rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart:2993 — _StandaloneAppBarState.build has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · FstBlockReader._decodeSignalChanges (cyclomatic 30) · ×1
  • FstBlockReader._decodeSignalChanges (cyclomatic 30) lib/src/fst/fst_block_reader.dart:427 — FstBlockReader._decodeSignalChanges has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · NetlistPasses.removeTrivialConcatAliases (cyclomatic 30) · ×1
  • NetlistPasses.removeTrivialConcatAliases (cyclomatic 30) lib/src/synthesizers/netlist/netlist_passes.dart:400 — NetlistPasses.removeTrivialConcatAliases has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SynthModuleDefinition._pruneClearedSubsetConstantSources (cyclomatic 30) · ×1
  • SynthModuleDefinition._pruneClearedSubsetConstantSources (cyclomatic 30) lib/src/synthesizers/utilities/synth_module_definition.dart:3411 — SynthModuleDefinition._pruneClearedSubsetConstantSources has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · SynthModuleDefinition._collapseWideArrayElementRangeSources (cyclomatic 29) · ×1
  • SynthModuleDefinition._collapseWideArrayElementRangeSources (cyclomatic 29) lib/src/synthesizers/utilities/synth_module_definition.dart:2758 — SynthModuleDefinition._collapseWideArrayElementRangeSources has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SynthModuleDefinition._collectOutputDrivingConcats (cyclomatic 29) · ×1
  • SynthModuleDefinition._collectOutputDrivingConcats (cyclomatic 29) lib/src/synthesizers/utilities/synth_module_definition.dart:3711 — SynthModuleDefinition._collectOutputDrivingConcats has cyclomatic complexity 29 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · NetlistConstExtractor.extract (cyclomatic 28) · ×1
  • NetlistConstExtractor.extract (cyclomatic 28) rohd_devtools_extension/lib/rohd_devtools/services/netlist_const_extractor.dart:22 — NetlistConstExtractor.extract has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · _VmConnectionFormState.build (cyclomatic 28) · ×1
  • _VmConnectionFormState.build (cyclomatic 28) rohd_devtools_extension/lib/rohd_devtools/ui/vm_connection_form.dart:361 — _VmConnectionFormState.build has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · _SystemVerilogSimCompare.iverilogVector (cyclomatic 27) · ×1
  • _SystemVerilogSimCompare.iverilogVector (cyclomatic 27) lib/src/utilities/systemverilog_simcompare.dart:170 — _SystemVerilogSimCompare.iverilogVector has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · NetlistModuleTranslation.processCells (cyclomatic 26) · ×1
  • NetlistModuleTranslation.processCells (cyclomatic 26) lib/src/synthesizers/netlist/netlist_module_translation.dart:373 — NetlistModuleTranslation.processCells has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · SystemVerilogSynthesisResult._verilogAssignments (cyclomatic 26) · ×1
  • SystemVerilogSynthesisResult._verilogAssignments (cyclomatic 26) lib/src/synthesizers/systemverilog/systemverilog_synthesis_result.dart:291 — SystemVerilogSynthesisResult._verilogAssignments has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SimCompare.checkVerilatorVector (cyclomatic 26) · ×1
  • SimCompare.checkVerilatorVector (cyclomatic 26) lib/src/utilities/simcompare.dart:433 — SimCompare.checkVerilatorVector has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · LogicValue.toRadixString (cyclomatic 26) · ×1
  • LogicValue.toRadixString (cyclomatic 26) lib/src/values/logic_value.dart:657 — LogicValue.toRadixString has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · elk_layout_only.elkLayoutOnly (cyclomatic 26) · ×1
  • elk_layout_only.elkLayoutOnly (cyclomatic 26) rohd_devtools_extension/assets/layout_bridge/elk_layout_only.js:26 — elk_layout_only.elkLayoutOnly has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 12 of the 26 points are its own statements and the rest belongs to 2 function items inside it that branch (saveHidden, restoreHidden). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · flc_service.queryModule (cyclomatic 26) · ×1
  • flc_service.queryModule (cyclomatic 26) rohd_extension/src/flc_service.ts:137 — flc_service.queryModule has cyclomatic complexity 26 (threshold 15). Of this number, 23 points are the body's own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · NetlistPasses.collapseConcatOfAdjacentSlices (cyclomatic 25) · ×1
  • NetlistPasses.collapseConcatOfAdjacentSlices (cyclomatic 25) lib/src/synthesizers/netlist/netlist_passes.dart:511 — NetlistPasses.collapseConcatOfAdjacentSlices has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SynthModuleDefinition._collectOutputSplit (cyclomatic 25) · ×1
  • SynthModuleDefinition._collectOutputSplit (cyclomatic 25) lib/src/synthesizers/utilities/synth_module_definition.dart:885 — SynthModuleDefinition._collectOutputSplit has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · SynthModuleDefinition._collapseAssignments (cyclomatic 25) · ×1
  • SynthModuleDefinition._collapseAssignments (cyclomatic 25) lib/src/synthesizers/utilities/synth_module_definition.dart:4364 — SynthModuleDefinition._collapseAssignments has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · RohdShellOutput._formatResult (cyclomatic 24) · ×1
  • RohdShellOutput._formatResult (cyclomatic 24) rohd_devtools_extension/lib/rohd_devtools/cli/rohd_shell_output.dart:59 — RohdShellOutput._formatResult has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SourceTracer.traceAttributesForModule (cyclomatic 24) · ×1
  • SourceTracer.traceAttributesForModule (cyclomatic 24) lib/src/utilities/source_tracer.dart:1121 — SourceTracer.traceAttributesForModule has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · _FilledLogicValue._equals (cyclomatic 24) · ×1
  • _FilledLogicValue._equals (cyclomatic 24) lib/src/values/filled_logic_value.dart:21 — _FilledLogicValue._equals has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · _CrossProbeStatusButtonState._showFormatsMenu (cyclomatic 23) · ×1
  • _CrossProbeStatusButtonState._showFormatsMenu (cyclomatic 23) rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart:3387 — _CrossProbeStatusButtonState._showFormatsMenu has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · NetlistUtils.collapseAlwaysBlockPorts (cyclomatic 23) · ×1
  • NetlistUtils.collapseAlwaysBlockPorts (cyclomatic 23) lib/src/synthesizers/netlist/netlist_utils.dart:209 — NetlistUtils.collapseAlwaysBlockPorts has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SystemCSynthesisResult._buildScLineMap (cyclomatic 23) · ×1
  • SystemCSynthesisResult._buildScLineMap (cyclomatic 23) lib/src/synthesizers/systemc/systemc_synthesis_result.dart:91 — SystemCSynthesisResult._buildScLineMap has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SynthModuleDefinition._isValidOutputSplit (cyclomatic 23) · ×1
  • SynthModuleDefinition._isValidOutputSplit (cyclomatic 23) lib/src/synthesizers/utilities/synth_module_definition.dart:965 — SynthModuleDefinition._isValidOutputSplit has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · SynthModuleDefinition._composeChainedRangeAssignment (cyclomatic 23) · ×1
  • SynthModuleDefinition._composeChainedRangeAssignment (cyclomatic 23) lib/src/synthesizers/utilities/synth_module_definition.dart:3189 — SynthModuleDefinition._composeChainedRangeAssignment has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · buildModuleInfo (cyclomatic 23) · ×1
  • buildModuleInfo (cyclomatic 23) packages/rohd_devtools_widgets/assets/extension/module_info_helper.js:80 — buildModuleInfo has cyclomatic complexity 23 (threshold 15). Of this number, 20 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · BaseSignalWaveformApi._synthesizeClientSide (cyclomatic 22) · ×1
  • BaseSignalWaveformApi._synthesizeClientSide (cyclomatic 22) rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart:615 — BaseSignalWaveformApi._synthesizeClientSide has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · _StandaloneDevToolsPageState._buildSignalValueLookup (cyclomatic 22) · ×1
  • _StandaloneDevToolsPageState._buildSignalValueLookup (cyclomatic 22) rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart:2662 — _StandaloneDevToolsPageState._buildSignalValueLookup has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SystemVerilogSynthesizer.instantiationVerilogFor (cyclomatic 22) · ×1
  • SystemVerilogSynthesizer.instantiationVerilogFor (cyclomatic 22) lib/src/synthesizers/systemverilog/systemverilog_synthesizer.dart:37 — SystemVerilogSynthesizer.instantiationVerilogFor has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SynthModuleDefinition.getSynthLogic (cyclomatic 22) · ×1
  • SynthModuleDefinition.getSynthLogic (cyclomatic 22) lib/src/synthesizers/utilities/synth_module_definition.dart:305 — SynthModuleDefinition.getSynthLogic has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · LogicValue._doMath (cyclomatic 22) · ×1
  • LogicValue._doMath (cyclomatic 22) lib/src/values/logic_value.dart:1418 — LogicValue._doMath has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · SignalValueFormatRegistry._waveformValue (cyclomatic 22) · ×1
  • SignalValueFormatRegistry._waveformValue (cyclomatic 22) packages/rohd_devtools_widgets/lib/src/signal_value_format_registry.dart:227 — SignalValueFormatRegistry._waveformValue has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · buildModuleInfo (cyclomatic 22) · ×1
  • buildModuleInfo (cyclomatic 22) rohd_devtools_extension/shared/module_info_helper.js:57 — buildModuleInfo has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · BaseSignalWaveformApi._evaluateComputedInSnapshot (cyclomatic 21) · ×1
  • BaseSignalWaveformApi._evaluateComputedInSnapshot (cyclomatic 21) rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart:481 — BaseSignalWaveformApi._evaluateComputedInSnapshot has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · BaseSignalWaveformApi.ensureFullModules (cyclomatic 21) · ×1
  • BaseSignalWaveformApi.ensureFullModules (cyclomatic 21) rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart:1099 — BaseSignalWaveformApi.ensureFullModules has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · VmServiceWaveformDataSource._evaluate (cyclomatic 21) · ×1
  • VmServiceWaveformDataSource._evaluate (cyclomatic 21) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_waveform_data_source.dart:462 — VmServiceWaveformDataSource._evaluate has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · RohdDesignCommandShell.complete (cyclomatic 21) · ×1
  • RohdDesignCommandShell.complete (cyclomatic 21) lib/src/diagnostics/design_command_shell.dart:72 — RohdDesignCommandShell.complete has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · NetlistService._buildSlimJson (cyclomatic 21) · ×1
  • NetlistService._buildSlimJson (cyclomatic 21) lib/src/synthesizers/netlist/netlist_service.dart:437 — NetlistService._buildSlimJson has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Namer.signalNameOfBest (cyclomatic 21) · ×1
  • Namer.signalNameOfBest (cyclomatic 21) lib/src/utilities/namer.dart:288 — Namer.signalNameOfBest has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SimCompare.checkVectors (cyclomatic 21) · ×1
  • SimCompare.checkVectors (cyclomatic 21) lib/src/utilities/simcompare.dart:246 — SimCompare.checkVectors has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · _SystemCSimCompare._runSystemCVectors (cyclomatic 21) · ×1
  • _SystemCSimCompare._runSystemCVectors (cyclomatic 21) lib/src/utilities/systemc_simcompare.dart:587 — _SystemCSimCompare._runSystemCVectors has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · LogicValue._doCompare (cyclomatic 21) · ×1
  • LogicValue._doCompare (cyclomatic 21) lib/src/values/logic_value.dart:1544 — LogicValue._doCompare has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · BaseSignalWaveformApi._resolveFieldBits (cyclomatic 20) · ×1
  • BaseSignalWaveformApi._resolveFieldBits (cyclomatic 20) rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart:879 — BaseSignalWaveformApi._resolveFieldBits has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · TreeStructurePageState.build (cyclomatic 20) · ×1
  • TreeStructurePageState.build (cyclomatic 20) rohd_devtools_extension/lib/rohd_devtools/view/tree_structure_page.dart:343 — TreeStructurePageState.build has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · _TypedLogicArrayBuild.build (cyclomatic 20) · ×1
  • _TypedLogicArrayBuild.build (cyclomatic 20) lib/src/signals/typed_logic_array.dart:357 — _TypedLogicArrayBuild.build has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · NetlistModuleTranslation._emitDynamicSynchronousResetFlipFlop (cyclomatic 20) · ×1
  • NetlistModuleTranslation._emitDynamicSynchronousResetFlipFlop (cyclomatic 20) lib/src/synthesizers/netlist/netlist_module_translation.dart:504 — NetlistModuleTranslation._emitDynamicSynchronousResetFlipFlop has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · SynthModuleDefinition._fullPackedConcatSourceRanges (cyclomatic 20) · ×1
  • SynthModuleDefinition._fullPackedConcatSourceRanges (cyclomatic 20) lib/src/synthesizers/utilities/synth_module_definition.dart:4115 — SynthModuleDefinition._fullPackedConcatSourceRanges has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · HierarchyService.autocompletePortPaths (cyclomatic 20) · ×1
  • HierarchyService.autocompletePortPaths (cyclomatic 20) packages/rohd_hierarchy/lib/src/hierarchy_service.dart:202 — HierarchyService.autocompletePortPaths has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · WaveformService._ (cyclomatic 19) · ×1
  • WaveformService._ (cyclomatic 19) lib/src/diagnostics/waveform_service.dart:207 — WaveformService._ has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Case.execute (cyclomatic 19) · ×1
  • Case.execute (cyclomatic 19) lib/src/modules/conditionals/case.dart:272 — Case.execute has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SynthModuleDefinition._pickNames (cyclomatic 19) · ×1
  • SynthModuleDefinition._pickNames (cyclomatic 19) lib/src/synthesizers/utilities/synth_module_definition.dart:2153 — SynthModuleDefinition._pickNames has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · LogicValue.compareTo (cyclomatic 19) · ×1
  • LogicValue.compareTo (cyclomatic 19) lib/src/values/logic_value.dart:992 — LogicValue.compareTo has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · SignalWaveformRepository._synthesizeBitSlice (cyclomatic 19) · ×1
  • SignalWaveformRepository._synthesizeBitSlice (cyclomatic 19) packages/rohd_waveform/lib/src/waveform_repository.dart:512 — SignalWaveformRepository._synthesizeBitSlice has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SignalWaveformRepository._resolveFieldBits (cyclomatic 19) · ×1
  • SignalWaveformRepository._resolveFieldBits (cyclomatic 19) packages/rohd_waveform/lib/src/waveform_repository.dart:604 — SignalWaveformRepository._resolveFieldBits has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · DevToolsConnectionHostState.handleDtdVmEvent (cyclomatic 18) · ×1
  • DevToolsConnectionHostState.handleDtdVmEvent (cyclomatic 18) rohd_devtools_extension/lib/rohd_devtools/ui/devtools_connection_host.dart:1190 — DevToolsConnectionHostState.handleDtdVmEvent has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · _SignalTableState._generateSignalRow (cyclomatic 18) · ×1
  • _SignalTableState._generateSignalRow (cyclomatic 18) rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart:438 — _SignalTableState._generateSignalRow has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · _StandaloneDevToolsPageState._evaluateForDetailsPane (cyclomatic 18) · ×1
  • _StandaloneDevToolsPageState._evaluateForDetailsPane (cyclomatic 18) rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart:2516 — _StandaloneDevToolsPageState._evaluateForDetailsPane has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Module.addTypedInput (cyclomatic 18) · ×1
  • Module.addTypedInput (cyclomatic 18) lib/src/module.dart:726 — Module.addTypedInput has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · _TypedLogicArrayBuild._sameElementLayout (cyclomatic 18) · ×1
  • _TypedLogicArrayBuild._sameElementLayout (cyclomatic 18) lib/src/signals/typed_logic_array.dart:469 — _TypedLogicArrayBuild._sameElementLayout has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · NetlistPasses.removeUnconsumedTransparentCells (cyclomatic 18) · ×1
  • NetlistPasses.removeUnconsumedTransparentCells (cyclomatic 18) lib/src/synthesizers/netlist/netlist_passes.dart:338 — NetlistPasses.removeUnconsumedTransparentCells has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SynthLogic.tryMerge (cyclomatic 18) · ×1
  • SynthLogic.tryMerge (cyclomatic 18) lib/src/synthesizers/utilities/synth_logic.dart:416 — SynthLogic.tryMerge has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · SynthStructureLayout.fieldNameAt (cyclomatic 18) · ×1
  • SynthStructureLayout.fieldNameAt (cyclomatic 18) lib/src/synthesizers/utilities/synth_structure_layout.dart:77 — SynthStructureLayout.fieldNameAt has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · HierarchyService.autocompletePaths (cyclomatic 18) · ×1
  • HierarchyService.autocompletePaths (cyclomatic 18) packages/rohd_hierarchy/lib/src/hierarchy_service.dart:382 — HierarchyService.autocompletePaths has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · FlcData._parseSymbolString (cyclomatic 17) · ×1
  • FlcData._parseSymbolString (cyclomatic 17) packages/rohd_source_navigator/lib/flc_data.dart:364 — FlcData._parseSymbolString has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · VmServiceTransport.getModuleTree (cyclomatic 17) · ×1
  • VmServiceTransport.getModuleTree (cyclomatic 17) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:224 — VmServiceTransport.getModuleTree has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · _StandaloneDevToolsPageState._tryRefreshDataSource (cyclomatic 17) · ×1
  • _StandaloneDevToolsPageState._tryRefreshDataSource (cyclomatic 17) rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart:1434 — _StandaloneDevToolsPageState._tryRefreshDataSource has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · FlipFlop.scalar (cyclomatic 17) · ×1
  • FlipFlop.scalar (cyclomatic 17) lib/src/modules/conditionals/flop.dart:132 — FlipFlop.scalar has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Simulator.run (cyclomatic 17) · ×1
  • Simulator.run (cyclomatic 17) lib/src/simulator.dart:445 — Simulator.run has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · SynthModuleDefinition._assignmentConnectedSubmoduleMappingSignals (cyclomatic 17) · ×1
  • SynthModuleDefinition._assignmentConnectedSubmoduleMappingSignals (cyclomatic 17) lib/src/synthesizers/utilities/synth_module_definition.dart:1958 — SynthModuleDefinition._assignmentConnectedSubmoduleMappingSignals has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · BitFieldUtils.parseBitFieldDefs (cyclomatic 17) · ×1
  • BitFieldUtils.parseBitFieldDefs (cyclomatic 17) packages/rohd_devtools_widgets/lib/src/bit_field_utils.dart:68 — BitFieldUtils.parseBitFieldDefs has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · _HelpContent._parseDetails (cyclomatic 17) · ×1
  • _HelpContent._parseDetails (cyclomatic 17) packages/rohd_devtools_widgets/lib/src/markdown_help_button.dart:411 — _HelpContent._parseDetails has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · FlcData._parseEmbeddedModule (cyclomatic 16) · ×1
  • FlcData._parseEmbeddedModule (cyclomatic 16) packages/rohd_source_navigator/lib/flc_data.dart:311 — FlcData._parseEmbeddedModule has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · VmServiceTreeDataSource.evalModuleTree (cyclomatic 16) · ×1
  • VmServiceTreeDataSource.evalModuleTree (cyclomatic 16) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart:52 — VmServiceTreeDataSource.evalModuleTree has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · DevToolsConnectionHostState._checkVmLiveness (cyclomatic 16) · ×1
  • DevToolsConnectionHostState._checkVmLiveness (cyclomatic 16) rohd_devtools_extension/lib/rohd_devtools/ui/devtools_connection_host.dart:1345 — DevToolsConnectionHostState._checkVmLiveness has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · DevToolsConnectionHostState.attemptAutoReconnect (cyclomatic 16) · ×1
  • DevToolsConnectionHostState.attemptAutoReconnect (cyclomatic 16) rohd_devtools_extension/lib/rohd_devtools/ui/devtools_connection_host.dart:1390 — DevToolsConnectionHostState.attemptAutoReconnect has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · FstBlockReader._readBlockImpl (cyclomatic 16) · ×1
  • FstBlockReader._readBlockImpl (cyclomatic 16) lib/src/fst/fst_block_reader.dart:121 — FstBlockReader._readBlockImpl has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · NetlistValidation._driversByBit (cyclomatic 16) · ×1
  • NetlistValidation._driversByBit (cyclomatic 16) lib/src/synthesizers/netlist/netlist_validation.dart:117 — NetlistValidation._driversByBit has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SystemCSynthesisResult._buildInlineGates (cyclomatic 16) · ×1
  • SystemCSynthesisResult._buildInlineGates (cyclomatic 16) lib/src/synthesizers/systemc/systemc_synthesis_result.dart:582 — SystemCSynthesisResult._buildInlineGates has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · _SynthLogicSourcePicker._chooseSource (cyclomatic 16) · ×1
  • _SynthLogicSourcePicker._chooseSource (cyclomatic 16) lib/src/utilities/source_tracer.dart:1842 — _SynthLogicSourcePicker._chooseSource has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · NetlistSynthesizer.synthesize (cognitive 425) · ×1
  • NetlistSynthesizer.synthesize (cognitive 425) lib/src/synthesizers/netlist/netlist_synthesizer.dart:94 — NetlistSynthesizer.synthesize has cognitive complexity 425 (threshold 15). Drivers by points: if/else 76 (227 pts), loops 49 (132 pts), ternaries 14 (40 pts), boolean chains 26 (nesting depth added 260). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · NetlistPasses.applyTransparentClustering (cognitive 157) · ×1
  • NetlistPasses.applyTransparentClustering (cognitive 157) lib/src/synthesizers/netlist/netlist_passes.dart:133 — NetlistPasses.applyTransparentClustering has cognitive complexity 157 (threshold 15). Drivers by points: if/else 21 (84 pts), loops 22 (67 pts), boolean chains 6 (nesting depth added 108). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SystemVerilogSynthModuleDefinition._collapseFullPackedArrayConcats (cognitive 135) · ×1
  • SystemVerilogSynthModuleDefinition._collapseFullPackedArrayConcats (cognitive 135) lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart:1402 — SystemVerilogSynthModuleDefinition._collapseFullPackedArrayConcats has cognitive complexity 135 (threshold 15). Drivers by points: if/else 30 (78 pts), boolean chains 40, loops 9 (17 pts) (nesting depth added 56). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · SystemVerilogSynthModuleDefinition._collapseAggregateConnections (cognitive 128) · ×1
  • SystemVerilogSynthModuleDefinition._collapseAggregateConnections (cognitive 128) lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart:456 — SystemVerilogSynthModuleDefinition._collapseAggregateConnections has cognitive complexity 128 (threshold 15). Drivers by points: if/else 20 (71 pts), loops 14 (36 pts), boolean chains 13, ternaries 2 (8 pts) (nesting depth added 79). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SystemCSynthesisResult._buildProcesses (cognitive 127) · ×1
  • SystemCSynthesisResult._buildProcesses (cognitive 127) lib/src/synthesizers/systemc/systemc_synthesis_result.dart:941 — SystemCSynthesisResult._buildProcesses has cognitive complexity 127 (threshold 15). Drivers by points: if/else 28 (65 pts), loops 10 (27 pts), boolean chains 18, ternaries 5 (17 pts) (nesting depth added 66). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SourceTracer.traceJsonForHierarchy (cognitive 124) · ×1
  • SourceTracer.traceJsonForHierarchy (cognitive 124) lib/src/utilities/source_tracer.dart:1232 — SourceTracer.traceJsonForHierarchy has cognitive complexity 124 (threshold 15). Drivers by points: if/else 37 (70 pts), loops 11 (21 pts), boolean chains 18, ternaries 9 (15 pts) (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · NetlistModuleTranslation.processNetnames (cognitive 118) · ×1
  • NetlistModuleTranslation.processNetnames (cognitive 118) lib/src/synthesizers/netlist/netlist_module_translation.dart:630 — NetlistModuleTranslation.processNetnames has cognitive complexity 118 (threshold 15). Drivers by points: if/else 32 (69 pts), loops 16 (34 pts), boolean chains 10, ternaries 2 (5 pts) (nesting depth added 58). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · SynthModuleDefinition._pruneUnused (cognitive 118) · ×1
  • SynthModuleDefinition._pruneUnused (cognitive 118) lib/src/synthesizers/utilities/synth_module_definition.dart:1499 — SynthModuleDefinition._pruneUnused has cognitive complexity 118 (threshold 15). Drivers by points: if/else 26 (82 pts), boolean chains 24, loops 5 (9 pts), ternaries 1 (3 pts) (nesting depth added 62). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SystemVerilogSynthesisResult._buildSvLineMap (cognitive 107) · ×1
  • SystemVerilogSynthesisResult._buildSvLineMap (cognitive 107) lib/src/synthesizers/systemverilog/systemverilog_synthesis_result.dart:509 — SystemVerilogSynthesisResult._buildSvLineMap has cognitive complexity 107 (threshold 15). Drivers by points: if/else 18 (60 pts), loops 12 (30 pts), ternaries 3 (10 pts), boolean chains 7 (nesting depth added 67). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · LogicValue.of (cognitive 100) · ×1
  • LogicValue.of (cognitive 100) lib/src/values/logic_value.dart:167 — LogicValue.of has cognitive complexity 100 (threshold 15). Drivers by points: if/else 39 (68 pts), ternaries 6 (17 pts), boolean chains 15 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · NetlistEvaluator.collectLeaves (cognitive 97) · ×1
  • NetlistEvaluator.collectLeaves (cognitive 97) rohd_devtools_extension/lib/rohd_devtools/services/netlist_evaluator.dart:309 — NetlistEvaluator.collectLeaves has cognitive complexity 97 (threshold 15). Drivers by points: if/else 25 (69 pts), loops 7 (20 pts), boolean chains 8 (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · FlcData.fromJson (cognitive 89) · ×1
  • FlcData.fromJson (cognitive 89) packages/rohd_source_navigator/lib/flc_data.dart:101 — FlcData.fromJson has cognitive complexity 89 (threshold 15). Drivers by points: if/else 20 (53 pts), loops 6 (16 pts), ternaries 3 (11 pts), boolean chains 9 (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _StandaloneDevToolsPageState._loadModuleTree (cognitive 89) · ×1
  • _StandaloneDevToolsPageState._loadModuleTree (cognitive 89) rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart:1202 — _StandaloneDevToolsPageState._loadModuleTree has cognitive complexity 89 (threshold 15). Drivers by points: if/else 30 (77 pts), boolean chains 8, ternaries 1 (3 pts), error handling 1 (nesting depth added 49). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · SystemVerilogSynthModuleDefinition._collapseWholeNetBuses (cognitive 88) · ×1
  • SystemVerilogSynthModuleDefinition._collapseWholeNetBuses (cognitive 88) lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart:916 — SystemVerilogSynthModuleDefinition._collapseWholeNetBuses has cognitive complexity 88 (threshold 15). Drivers by points: if/else 18 (56 pts), loops 10 (25 pts), boolean chains 7 (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · LogicValue.ofRadixString (cognitive 83) · ×1
  • LogicValue.ofRadixString (cognitive 83) lib/src/values/logic_value.dart:801 — LogicValue.ofRadixString has cognitive complexity 83 (threshold 15). Drivers by points: if/else 18 (46 pts), loops 6 (22 pts), match/switch 2 (8 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 52). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · Module._traceInputForModuleContents (cognitive 80) · ×1
  • Module._traceInputForModuleContents (cognitive 80) lib/src/module.dart:435 — Module._traceInputForModuleContents has cognitive complexity 80 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 8 (29 pts), boolean chains 15, ternaries 1 (2 pts), error handling 1 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · NetlistPasses.removeTrivialConcatAliases (cognitive 80) · ×1
  • NetlistPasses.removeTrivialConcatAliases (cognitive 80) lib/src/synthesizers/netlist/netlist_passes.dart:400 — NetlistPasses.removeTrivialConcatAliases has cognitive complexity 80 (threshold 15). Drivers by points: if/else 12 (41 pts), loops 11 (32 pts), boolean chains 7 (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SynthModuleDefinition.SynthModuleDefinition (cognitive 80) · ×1
  • SynthModuleDefinition.SynthModuleDefinition (cognitive 80) lib/src/synthesizers/utilities/synth_module_definition.dart:504 — SynthModuleDefinition.SynthModuleDefinition has cognitive complexity 80 (threshold 15). Drivers by points: if/else 26 (48 pts), boolean chains 24, loops 6 (8 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Module._traceOutputForModuleContents (cognitive 79) · ×1
  • Module._traceOutputForModuleContents (cognitive 79) lib/src/module.dart:562 — Module._traceOutputForModuleContents has cognitive complexity 79 (threshold 15). Drivers by points: loops 9 (34 pts), if/else 13 (30 pts), boolean chains 12, ternaries 1 (2 pts), error handling 1 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SystemVerilogSynthModuleDefinition._inlinePackedRangesIntoSubmoduleInputs (cognitive 77) · ×1
  • SystemVerilogSynthModuleDefinition._inlinePackedRangesIntoSubmoduleInputs (cognitive 77) lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart:214 — SystemVerilogSynthModuleDefinition._inlinePackedRangesIntoSubmoduleInputs has cognitive complexity 77 (threshold 15). Drivers by points: if/else 12 (32 pts), boolean chains 28, loops 8 (13 pts), ternaries 1 (4 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FstBlockReader._decodeSignalChanges (cognitive 76) · ×1
  • FstBlockReader._decodeSignalChanges (cognitive 76) lib/src/fst/fst_block_reader.dart:427 — FstBlockReader._decodeSignalChanges has cognitive complexity 76 (threshold 15). Drivers by points: if/else 18 (48 pts), ternaries 3 (13 pts), boolean chains 10, loops 2 (5 pts) (nesting depth added 43). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · SystemVerilogSynthModuleDefinition._forwardPassthroughElementsIntoInlineables (cognitive 76) · ×1
  • SystemVerilogSynthModuleDefinition._forwardPassthroughElementsIntoInlineables (cognitive 76) lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart:1180 — SystemVerilogSynthModuleDefinition._forwardPassthroughElementsIntoInlineables has cognitive complexity 76 (threshold 15). Drivers by points: if/else 18 (41 pts), loops 9 (18 pts), boolean chains 9, ternaries 3 (8 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · BaseSignalWaveformApi.getWaveformData (cognitive 72) · ×1
  • BaseSignalWaveformApi.getWaveformData (cognitive 72) rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart:164 — BaseSignalWaveformApi.getWaveformData has cognitive complexity 72 (threshold 15). Drivers by points: if/else 24 (48 pts), loops 8 (17 pts), boolean chains 7 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · NetlistCellMapper._registerDefaults (cognitive 70) · ×1
  • NetlistCellMapper._registerDefaults (cognitive 70) lib/src/synthesizers/netlist/netlist_cell_mapper.dart:262 — NetlistCellMapper._registerDefaults has cognitive complexity 70 (threshold 15). Drivers by points: if/else 31 (32 pts), ternaries 11 (20 pts), boolean chains 16, loops 2 (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · SystemCSynthesisResult._gateExpression (cognitive 66) · ×1
  • SystemCSynthesisResult._gateExpression (cognitive 66) lib/src/synthesizers/systemc/systemc_synthesis_result.dart:676 — SystemCSynthesisResult._gateExpression has cognitive complexity 66 (threshold 15). Drivers by points: if/else 28 (44 pts), ternaries 6 (13 pts), boolean chains 7, loops 1 (2 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SynthModuleDefinition._collapseConstantBackedRangeIntermediates (cognitive 64) · ×1
  • SynthModuleDefinition._collapseConstantBackedRangeIntermediates (cognitive 64) lib/src/synthesizers/utilities/synth_module_definition.dart:3295 — SynthModuleDefinition._collapseConstantBackedRangeIntermediates has cognitive complexity 64 (threshold 15). Drivers by points: if/else 12 (36 pts), boolean chains 18, loops 5 (10 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · NetlistService._buildSlimJson (cognitive 61) · ×1
  • NetlistService._buildSlimJson (cognitive 61) lib/src/synthesizers/netlist/netlist_service.dart:437 — NetlistService._buildSlimJson has cognitive complexity 61 (threshold 15). Drivers by points: if/else 10 (36 pts), loops 8 (23 pts), boolean chains 1, ternaries 1 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · LogicValue.toRadixString (cognitive 59) · ×1
  • LogicValue.toRadixString (cognitive 59) lib/src/values/logic_value.dart:657 — LogicValue.toRadixString has cognitive complexity 59 (threshold 15). Drivers by points: if/else 21 (48 pts), loops 2 (6 pts), ternaries 3, boolean chains 1, match/switch 1 (nesting depth added 31). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · conditional_completions.detectContext (cognitive 58) · ×1
  • conditional_completions.detectContext (cognitive 58) rohd_extension/src/conditional_completions.ts:37 — conditional_completions.detectContext has cognitive complexity 58 (threshold 15). Drivers by points: if/else 20 (39 pts), loops 6 (10 pts), boolean chains 9 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SimCompare.checkVerilatorVector (cognitive 55) · ×1
  • SimCompare.checkVerilatorVector (cognitive 55) lib/src/utilities/simcompare.dart:433 — SimCompare.checkVerilatorVector has cognitive complexity 55 (threshold 15). Drivers by points: if/else 19 (35 pts), loops 3 (9 pts), ternaries 2 (7 pts), boolean chains 3, error handling 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _CrossProbeStatusButtonState._showFormatsMenu (cognitive 54) · ×1
  • _CrossProbeStatusButtonState._showFormatsMenu (cognitive 54) rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart:3387 — _CrossProbeStatusButtonState._showFormatsMenu has cognitive complexity 54 (threshold 15). Drivers by points: if/else 16 (32 pts), ternaries 3 (14 pts), boolean chains 3, loops 1 (3 pts), error handling 1 (2 pts) (nesting depth added 30). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · NetlistPasses.collapseConcatOfAdjacentSlices (cognitive 54) · ×1
  • NetlistPasses.collapseConcatOfAdjacentSlices (cognitive 54) lib/src/synthesizers/netlist/netlist_passes.dart:511 — NetlistPasses.collapseConcatOfAdjacentSlices has cognitive complexity 54 (threshold 15). Drivers by points: if/else 10 (33 pts), loops 5 (12 pts), boolean chains 9 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · NetlistConstExtractor.extract (cognitive 52) · ×1
  • NetlistConstExtractor.extract (cognitive 52) rohd_devtools_extension/lib/rohd_devtools/services/netlist_const_extractor.dart:22 — NetlistConstExtractor.extract has cognitive complexity 52 (threshold 15). Drivers by points: if/else 14 (34 pts), loops 8 (11 pts), boolean chains 4, error handling 1 (3 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _StandaloneAppBarState.build (cognitive 52) · ×1
  • _StandaloneAppBarState.build (cognitive 52) rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart:2993 — _StandaloneAppBarState.build has cognitive complexity 52 (threshold 15). Drivers by points: ternaries 14 (27 pts), if/else 14 (20 pts), boolean chains 5 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · conditional_completions.findEnclosingClassInfo (cognitive 52) · ×1
  • conditional_completions.findEnclosingClassInfo (cognitive 52) rohd_extension/src/conditional_completions.ts:162 — conditional_completions.findEnclosingClassInfo has cognitive complexity 52 (threshold 15). Drivers by points: if/else 14 (26 pts), loops 9 (14 pts), boolean chains 12 (nesting depth added 17). Of this number, 51 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VmServiceWaveformDataSource._evaluate (cognitive 50) · ×1
  • VmServiceWaveformDataSource._evaluate (cognitive 50) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_waveform_data_source.dart:462 — VmServiceWaveformDataSource._evaluate has cognitive complexity 50 (threshold 15). Drivers by points: if/else 10 (35 pts), boolean chains 7, error handling 2 (4 pts), loops 1 (4 pts) (nesting depth added 30). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · _SystemCSimCompare.buildSystemCVectorExecutable (cognitive 50) · ×1
  • _SystemCSimCompare.buildSystemCVectorExecutable (cognitive 50) lib/src/utilities/systemc_simcompare.dart:209 — _SystemCSimCompare.buildSystemCVectorExecutable has cognitive complexity 50 (threshold 15). Drivers by points: if/else 18 (27 pts), loops 16, ternaries 3 (4 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RohdShellOutput._formatResult (cognitive 49) · ×1
  • RohdShellOutput._formatResult (cognitive 49) rohd_devtools_extension/lib/rohd_devtools/cli/rohd_shell_output.dart:59 — RohdShellOutput._formatResult has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (27 pts), ternaries 6 (18 pts), boolean chains 4 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · NetlistModuleTranslation.processCells (cognitive 49) · ×1
  • NetlistModuleTranslation.processCells (cognitive 49) lib/src/synthesizers/netlist/netlist_module_translation.dart:373 — NetlistModuleTranslation.processCells has cognitive complexity 49 (threshold 15). Drivers by points: loops 7 (21 pts), if/else 7 (17 pts), boolean chains 5, ternaries 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SynthModuleDefinition._planConcatRangeRewrite (cognitive 49) · ×1
  • SynthModuleDefinition._planConcatRangeRewrite (cognitive 49) lib/src/synthesizers/utilities/synth_module_definition.dart:3800 — SynthModuleDefinition._planConcatRangeRewrite has cognitive complexity 49 (threshold 15). Drivers by points: boolean chains 26, if/else 10 (16 pts), loops 3 (4 pts), ternaries 1 (3 pts) (nesting depth added 9). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · HierarchyService._searchSignalsRegex (cognitive 48) · ×1
  • HierarchyService._searchSignalsRegex (cognitive 48) packages/rohd_hierarchy/lib/src/hierarchy_service.dart:861 — HierarchyService._searchSignalsRegex has cognitive complexity 48 (threshold 15). Drivers by points: if/else 10 (34 pts), loops 5 (14 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _CopyableCell._showCopyMenu (cognitive 47) · ×1
  • _CopyableCell._showCopyMenu (cognitive 47) rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart:1503 — _CopyableCell._showCopyMenu has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (30 pts), loops 2 (6 pts), boolean chains 5, ternaries 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SynthModuleDefinition._findChainableModulesToCollapse (cognitive 47) · ×1
  • SynthModuleDefinition._findChainableModulesToCollapse (cognitive 47) lib/src/synthesizers/utilities/synth_module_definition.dart:1155 — SynthModuleDefinition._findChainableModulesToCollapse has cognitive complexity 47 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 13, loops 12 (13 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _SystemCSimCompare._runSystemCVectors (cognitive 47) · ×1
  • _SystemCSimCompare._runSystemCVectors (cognitive 47) lib/src/utilities/systemc_simcompare.dart:587 — _SystemCSimCompare._runSystemCVectors has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 7 (12 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FlcData._parseSymbolString (cognitive 46) · ×1
  • FlcData._parseSymbolString (cognitive 46) packages/rohd_source_navigator/lib/flc_data.dart:364 — FlcData._parseSymbolString has cognitive complexity 46 (threshold 15). Drivers by points: if/else 7 (22 pts), ternaries 5 (17 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _VmConnectionFormState.build (cognitive 45) · ×1
  • _VmConnectionFormState.build (cognitive 45) rohd_devtools_extension/lib/rohd_devtools/ui/vm_connection_form.dart:361 — _VmConnectionFormState.build has cognitive complexity 45 (threshold 15). Drivers by points: ternaries 16 (32 pts), if/else 9 (10 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SynthModuleDefinition._pruneClearedSubsetConstantSources (cognitive 43) · ×1
  • SynthModuleDefinition._pruneClearedSubsetConstantSources (cognitive 43) lib/src/synthesizers/utilities/synth_module_definition.dart:3411 — SynthModuleDefinition._pruneClearedSubsetConstantSources has cognitive complexity 43 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 13, loops 8 (12 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _StandaloneDevToolsPageState._tryRefreshDataSource (cognitive 42) · ×1
  • _StandaloneDevToolsPageState._tryRefreshDataSource (cognitive 42) rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart:1434 — _StandaloneDevToolsPageState._tryRefreshDataSource has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (30 pts), error handling 2 (5 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · NetlistUtils.collapseAlwaysBlockPorts (cognitive 42) · ×1
  • NetlistUtils.collapseAlwaysBlockPorts (cognitive 42) lib/src/synthesizers/netlist/netlist_utils.dart:209 — NetlistUtils.collapseAlwaysBlockPorts has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (30 pts), loops 8 (12 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SynthModuleDefinition._collectOutputDrivingConcats (cognitive 42) · ×1
  • SynthModuleDefinition._collectOutputDrivingConcats (cognitive 42) lib/src/synthesizers/utilities/synth_module_definition.dart:3711 — SynthModuleDefinition._collectOutputDrivingConcats has cognitive complexity 42 (threshold 15). Drivers by points: boolean chains 17, if/else 7 (17 pts), loops 4 (8 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · BaseSignalWaveformApi._resolveFieldBits (cognitive 41) · ×1
  • BaseSignalWaveformApi._resolveFieldBits (cognitive 41) rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart:879 — BaseSignalWaveformApi._resolveFieldBits has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (26 pts), ternaries 5 (12 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SimCompare.checkVectors (cognitive 41) · ×1
  • SimCompare.checkVectors (cognitive 41) lib/src/utilities/simcompare.dart:246 — SimCompare.checkVectors has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (32 pts), loops 3, match/switch 1 (3 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · NetlistPasses.removeUnconsumedTransparentCells (cognitive 40) · ×1
  • NetlistPasses.removeUnconsumedTransparentCells (cognitive 40) lib/src/synthesizers/netlist/netlist_passes.dart:338 — NetlistPasses.removeUnconsumedTransparentCells has cognitive complexity 40 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 6 (16 pts), boolean chains 6 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SourceTracer.traceAttributesForModule (cognitive 40) · ×1
  • SourceTracer.traceAttributesForModule (cognitive 40) lib/src/utilities/source_tracer.dart:1121 — SourceTracer.traceAttributesForModule has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (27 pts), loops 5 (9 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _SystemVerilogSimCompare.iverilogVector (cognitive 40) · ×1
  • _SystemVerilogSimCompare.iverilogVector (cognitive 40) lib/src/utilities/systemverilog_simcompare.dart:170 — _SystemVerilogSimCompare.iverilogVector has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (31 pts), loops 3, boolean chains 2, error handling 1 (2 pts), ternaries 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SynthModuleDefinition._collapseSimpleRangeAssignments (cognitive 39) · ×1
  • SynthModuleDefinition._collapseSimpleRangeAssignments (cognitive 39) lib/src/synthesizers/utilities/synth_module_definition.dart:2417 — SynthModuleDefinition._collapseSimpleRangeAssignments has cognitive complexity 39 (threshold 15). Drivers by points: boolean chains 14, if/else 7 (13 pts), loops 8 (10 pts), ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SignalWaveformRepository._resolveFieldBits (cognitive 39) · ×1
  • SignalWaveformRepository._resolveFieldBits (cognitive 39) packages/rohd_waveform/lib/src/waveform_repository.dart:604 — SignalWaveformRepository._resolveFieldBits has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (24 pts), ternaries 5 (12 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · flc_service.queryModule (cognitive 39) · ×1
  • flc_service.queryModule (cognitive 39) rohd_extension/src/flc_service.ts:137 — flc_service.queryModule has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (20 pts), ternaries 4 (7 pts), boolean chains 6, loops 3 (5 pts), error handling 1 (nesting depth added 14). Of this number, 35 points are the body's own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · NetlistSynthesizer._compressModulesMap (cognitive 38) · ×1
  • NetlistSynthesizer._compressModulesMap (cognitive 38) lib/src/synthesizers/netlist/netlist_synthesizer.dart:1210 — NetlistSynthesizer._compressModulesMap has cognitive complexity 38 (threshold 15). Drivers by points: if/else 7 (23 pts), loops 5 (15 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SynthModuleDefinition._collapseWideArrayElementRangeSources (cognitive 38) · ×1
  • SynthModuleDefinition._collapseWideArrayElementRangeSources (cognitive 38) lib/src/synthesizers/utilities/synth_module_definition.dart:2758 — SynthModuleDefinition._collapseWideArrayElementRangeSources has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 12, loops 5 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · PairInterface.connectIO (cognitive 37) · ×1
  • PairInterface.connectIO (cognitive 37) lib/src/interfaces/pair_interface.dart:227 — PairInterface.connectIO has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (35 pts), loops 1 (2 pts) (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · SystemCSynthesisResult._buildScLineMap (cognitive 37) · ×1
  • SystemCSynthesisResult._buildScLineMap (cognitive 37) lib/src/synthesizers/systemc/systemc_synthesis_result.dart:91 — SystemCSynthesisResult._buildScLineMap has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 9 (13 pts), boolean chains 5 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SystemVerilogSynthesisResult._verilogAssignments (cognitive 37) · ×1
  • SystemVerilogSynthesisResult._verilogAssignments (cognitive 37) lib/src/synthesizers/systemverilog/systemverilog_synthesis_result.dart:291 — SystemVerilogSynthesisResult._verilogAssignments has cognitive complexity 37 (threshold 15). Drivers by points: boolean chains 15, if/else 6 (13 pts), ternaries 3 (8 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SynthModuleDefinition._collapseAssignments (cognitive 37) · ×1
  • SynthModuleDefinition._collapseAssignments (cognitive 37) lib/src/synthesizers/utilities/synth_module_definition.dart:4364 — SynthModuleDefinition._collapseAssignments has cognitive complexity 37 (threshold 15). Drivers by points: boolean chains 13, if/else 6 (13 pts), loops 5 (7 pts), ternaries 1 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VmServiceSignalValueSource.getSnapshot (cognitive 35) · ×1
  • VmServiceSignalValueSource.getSnapshot (cognitive 35) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_signal_value_source.dart:115 — VmServiceSignalValueSource.getSnapshot has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 2 (4 pts), ternaries 1 (3 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VmServiceWaveformDataSource._onPause (cognitive 34) · ×1
  • VmServiceWaveformDataSource._onPause (cognitive 34) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_waveform_data_source.dart:196 — VmServiceWaveformDataSource._onPause has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (6 pts), boolean chains 4, ternaries 1 (4 pts), error handling 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Always.Always (cognitive 34) · ×1
  • Always.Always (cognitive 34) lib/src/modules/conditionals/always.dart:81 — Always.Always has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 5 (10 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SynthModuleDefinition.getSynthLogic (cognitive 34) · ×1
  • SynthModuleDefinition.getSynthLogic (cognitive 34) lib/src/synthesizers/utilities/synth_module_definition.dart:305 — SynthModuleDefinition.getSynthLogic has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 10 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SynthModuleDefinition._fullPackedConcatSourceRanges (cognitive 34) · ×1
  • SynthModuleDefinition._fullPackedConcatSourceRanges (cognitive 34) lib/src/synthesizers/utilities/synth_module_definition.dart:4115 — SynthModuleDefinition._fullPackedConcatSourceRanges has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 7, loops 3 (5 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RohdServiceCubit._handleModuleTreeOperation (cognitive 33) · ×1
  • RohdServiceCubit._handleModuleTreeOperation (cognitive 33) rohd_devtools_extension/lib/rohd_devtools/cubit/rohd_service_cubit.dart:152 — RohdServiceCubit._handleModuleTreeOperation has cognitive complexity 33 (threshold 15). Drivers by points: if/else 5 (18 pts), error handling 3 (9 pts), loops 1 (4 pts), ternaries 1 (2 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · DevToolsConnectionHostState.attemptAutoReconnect (cognitive 33) · ×1
  • DevToolsConnectionHostState.attemptAutoReconnect (cognitive 33) rohd_devtools_extension/lib/rohd_devtools/ui/devtools_connection_host.dart:1390 — DevToolsConnectionHostState.attemptAutoReconnect has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (21 pts), boolean chains 5, ternaries 1 (4 pts), error handling 1 (2 pts), loops 1 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · VcdParser.confirmValue (cognitive 33) · ×1
  • VcdParser.confirmValue (cognitive 33) lib/src/utilities/vcd_parser.dart:17 — VcdParser.confirmValue has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · BaseSignalWaveformApi.ensureFullModules (cognitive 32) · ×1
  • BaseSignalWaveformApi.ensureFullModules (cognitive 32) rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart:1099 — BaseSignalWaveformApi.ensureFullModules has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 4 (9 pts), boolean chains 5, ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FlcService.getModuleFormats (cognitive 32) · ×1
  • FlcService.getModuleFormats (cognitive 32) rohd_devtools_extension/lib/rohd_devtools/services/flc_service.dart:192 — FlcService.getModuleFormats has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 4 (8 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _StandaloneDevToolsPageState._buildSignalValueLookup (cognitive 32) · ×1
  • _StandaloneDevToolsPageState._buildSignalValueLookup (cognitive 32) rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart:2662 — _StandaloneDevToolsPageState._buildSignalValueLookup has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (25 pts), boolean chains 4, loops 1 (2 pts), ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · NetlistModuleTranslation.processPorts (cognitive 32) · ×1
  • NetlistModuleTranslation.processPorts (cognitive 32) lib/src/synthesizers/netlist/netlist_module_translation.dart:118 — NetlistModuleTranslation.processPorts has cognitive complexity 32 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 3 (7 pts), ternaries 1 (5 pts), boolean chains 3 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SystemVerilogSynthesizer.instantiationVerilogFor (cognitive 32) · ×1
  • SystemVerilogSynthesizer.instantiationVerilogFor (cognitive 32) lib/src/synthesizers/systemverilog/systemverilog_synthesizer.dart:37 — SystemVerilogSynthesizer.instantiationVerilogFor has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 7, ternaries 2 (6 pts), loops 3 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SynthModuleDefinition._collapseArrays (cognitive 32) · ×1
  • SynthModuleDefinition._collapseArrays (cognitive 32) lib/src/synthesizers/utilities/synth_module_definition.dart:2242 — SynthModuleDefinition._collapseArrays has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 4 (9 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · BaseSignalWaveformApi._synthesizeClientSide (cognitive 31) · ×1
  • BaseSignalWaveformApi._synthesizeClientSide (cognitive 31) rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart:615 — BaseSignalWaveformApi._synthesizeClientSide has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 6 (10 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SynthModuleDefinition._collectOutputSplit (cognitive 31) · ×1
  • SynthModuleDefinition._collectOutputSplit (cognitive 31) lib/src/synthesizers/utilities/synth_module_definition.dart:885 — SynthModuleDefinition._collectOutputSplit has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 16, if/else 5 (10 pts), ternaries 1 (3 pts), loops 2 (nesting depth added 7). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · SynthModuleDefinition._assignmentConnectedSubmoduleMappingSignals (cognitive 31) · ×1
  • SynthModuleDefinition._assignmentConnectedSubmoduleMappingSignals (cognitive 31) lib/src/synthesizers/utilities/synth_module_definition.dart:1958 — SynthModuleDefinition._assignmentConnectedSubmoduleMappingSignals has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 6 (13 pts), boolean chains 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Namer.signalNameOfBest (cognitive 31) · ×1
  • Namer.signalNameOfBest (cognitive 31) lib/src/utilities/namer.dart:288 — Namer.signalNameOfBest has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18 (24 pts), ternaries 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SimCompare.checkFunctionalVector (cognitive 31) · ×1
  • SimCompare.checkFunctionalVector (cognitive 31) lib/src/utilities/simcompare.dart:610 — SimCompare.checkFunctionalVector has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 4 (12 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · LogicValue._doCompare (cognitive 31) · ×1
  • LogicValue._doCompare (cognitive 31) lib/src/values/logic_value.dart:1544 — LogicValue._doCompare has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 5 (11 pts), boolean chains 8 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · BitFieldUtils.parseBitFieldDefs (cognitive 31) · ×1
  • BitFieldUtils.parseBitFieldDefs (cognitive 31) packages/rohd_devtools_widgets/lib/src/bit_field_utils.dart:68 — BitFieldUtils.parseBitFieldDefs has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 6 (16 pts), if/else 5 (10 pts), boolean chains 4, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · elk_layout_only.elkLayoutOnly (cognitive 31) · ×1
  • elk_layout_only.elkLayoutOnly (cognitive 31) rohd_devtools_extension/assets/layout_bridge/elk_layout_only.js:26 — elk_layout_only.elkLayoutOnly has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 5, loops 2 (4 pts), ternaries 2 (3 pts), error handling 1 (nesting depth added 6). Most of this is not in the body itself: 12 of the 31 points are its own statements and the rest belongs to 2 function items inside it that branch (restoreHidden, saveHidden). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · VmServiceTransport._onPause (cognitive 30) · ×1
  • VmServiceTransport._onPause (cognitive 30) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:507 — VmServiceTransport._onPause has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (6 pts), boolean chains 4, error handling 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · WaveformDataService.getSnapshotCompactJSON (cognitive 30) · ×1
  • WaveformDataService.getSnapshotCompactJSON (cognitive 30) lib/src/diagnostics/waveform_data_service.dart:1297 — WaveformDataService.getSnapshotCompactJSON has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 3 (7 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SynthModuleDefinition._connectNestedArrayFields (cognitive 30) · ×1
  • SynthModuleDefinition._connectNestedArrayFields (cognitive 30) lib/src/synthesizers/utilities/synth_module_definition.dart:1757 — SynthModuleDefinition._connectNestedArrayFields has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 3 (5 pts), ternaries 1 (5 pts), boolean chains 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · SynthModuleDefinition._composeChainedRangeAssignment (cognitive 30) · ×1
  • SynthModuleDefinition._composeChainedRangeAssignment (cognitive 30) lib/src/synthesizers/utilities/synth_module_definition.dart:3189 — SynthModuleDefinition._composeChainedRangeAssignment has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 11 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · BaseSignalWaveformApi._evaluateComputedInSnapshot (cognitive 29) · ×1
  • BaseSignalWaveformApi._evaluateComputedInSnapshot (cognitive 29) rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart:481 — BaseSignalWaveformApi._evaluateComputedInSnapshot has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 5 (7 pts), ternaries 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · IoVmConnectionStrategy.connect (cognitive 29) · ×1
  • IoVmConnectionStrategy.connect (cognitive 29) rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart:42 — IoVmConnectionStrategy.connect has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (19 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · WebVmConnectionStrategy.connect (cognitive 29) · ×1
  • WebVmConnectionStrategy.connect (cognitive 29) rohd_devtools_extension/lib/rohd_devtools/services/web_vm_connection_strategy.dart:35 — WebVmConnectionStrategy.connect has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (19 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · WaveformDataService.getSnapshotJSON (cognitive 29) · ×1
  • WaveformDataService.getSnapshotJSON (cognitive 29) lib/src/diagnostics/waveform_data_service.dart:1182 — WaveformDataService.getSnapshotJSON has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 3 (8 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · PairInterface.connectIOAsStructuredPorts (cognitive 29) · ×1
  • PairInterface.connectIOAsStructuredPorts (cognitive 29) lib/src/interfaces/pair_interface.dart:317 — PairInterface.connectIOAsStructuredPorts has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (26 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · NetlistValidation._driversByBit (cognitive 29) · ×1
  • NetlistValidation._driversByBit (cognitive 29) lib/src/synthesizers/netlist/netlist_validation.dart:117 — NetlistValidation._driversByBit has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 5 (9 pts), boolean chains 4 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SystemCSynthesisResult._buildInlineGates (cognitive 29) · ×1
  • SystemCSynthesisResult._buildInlineGates (cognitive 29) lib/src/synthesizers/systemc/systemc_synthesis_result.dart:582 — SystemCSynthesisResult._buildInlineGates has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SignalWaveformRepository._synthesizeBitSlice (cognitive 29) · ×1
  • SignalWaveformRepository._synthesizeBitSlice (cognitive 29) packages/rohd_waveform/lib/src/waveform_repository.dart:512 — SignalWaveformRepository._synthesizeBitSlice has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 3 (8 pts), boolean chains 5, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FlcData._parseEmbeddedModule (cognitive 28) · ×1
  • FlcData._parseEmbeddedModule (cognitive 28) packages/rohd_source_navigator/lib/flc_data.dart:311 — FlcData._parseEmbeddedModule has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (14 pts), ternaries 2 (6 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Case.execute (cognitive 28) · ×1
  • Case.execute (cognitive 28) lib/src/modules/conditionals/case.dart:272 — Case.execute has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (8 pts), boolean chains 6 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · buildModuleInfo (cognitive 28) · ×1
  • buildModuleInfo (cognitive 28) packages/rohd_devtools_widgets/assets/extension/module_info_helper.js:80 — buildModuleInfo has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 8, other 4, ternaries 1 (2 pts), error handling 1 (nesting depth added 7). Of this number, 25 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _SignalTableState._generateSignalRow (cognitive 27) · ×1
  • _SignalTableState._generateSignalRow (cognitive 27) rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart:438 — _SignalTableState._generateSignalRow has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (16 pts), ternaries 6 (8 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · HierarchyService.autocompletePortPaths (cognitive 27) · ×1
  • HierarchyService.autocompletePortPaths (cognitive 27) packages/rohd_hierarchy/lib/src/hierarchy_service.dart:202 — HierarchyService.autocompletePortPaths has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 7, loops 3, ternaries 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · flc_service.parseOutputPositions (cognitive 27) · ×1
  • flc_service.parseOutputPositions (cognitive 27) rohd_extension/src/flc_service.ts:582 — flc_service.parseOutputPositions has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (12 pts), ternaries 3 (9 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SynthStructureLayout.fieldNameAt (cognitive 26) · ×1
  • SynthStructureLayout.fieldNameAt (cognitive 26) lib/src/synthesizers/utilities/synth_structure_layout.dart:77 — SynthStructureLayout.fieldNameAt has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 8, loops 1 (nesting depth added 9). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · _HelpContent._parseDetails (cognitive 26) · ×1
  • _HelpContent._parseDetails (cognitive 26) packages/rohd_devtools_widgets/lib/src/markdown_help_button.dart:411 — _HelpContent._parseDetails has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · buildModuleInfo (cognitive 26) · ×1
  • buildModuleInfo (cognitive 26) rohd_devtools_extension/shared/module_info_helper.js:57 — buildModuleInfo has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 8, other 4, error handling 1 (nesting depth added 6). Of this number, 23 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VmServiceTransport._findWaveformLibrary (cognitive 25) · ×1
  • VmServiceTransport._findWaveformLibrary (cognitive 25) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:636 — VmServiceTransport._findWaveformLibrary has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (6 pts), boolean chains 5, error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VmServiceWaveformDataSource._findWaveformLibrary (cognitive 25) · ×1
  • VmServiceWaveformDataSource._findWaveformLibrary (cognitive 25) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_waveform_data_source.dart:410 — VmServiceWaveformDataSource._findWaveformLibrary has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (6 pts), boolean chains 5, error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · TreeStructurePageState.build (cognitive 25) · ×1
  • TreeStructurePageState.build (cognitive 25) rohd_devtools_extension/lib/rohd_devtools/view/tree_structure_page.dart:343 — TreeStructurePageState.build has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 8, boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · WaveformDataService._registerNetlistInstance (cognitive 25) · ×1
  • WaveformDataService._registerNetlistInstance (cognitive 25) lib/src/diagnostics/waveform_data_service.dart:576 — WaveformDataService._registerNetlistInstance has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · LogicEnum._computeWidth (cognitive 25) · ×1
  • LogicEnum._computeWidth (cognitive 25) lib/src/signals/logic_enum.dart:76 — LogicEnum._computeWidth has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 3 (6 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SynthModuleDefinition._isValidOutputSplit (cognitive 25) · ×1
  • SynthModuleDefinition._isValidOutputSplit (cognitive 25) lib/src/synthesizers/utilities/synth_module_definition.dart:965 — SynthModuleDefinition._isValidOutputSplit has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 18, if/else 3 (6 pts), loops 1 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · _FilledLogicValue._equals (cognitive 25) · ×1
  • _FilledLogicValue._equals (cognitive 25) lib/src/values/filled_logic_value.dart:21 — _FilledLogicValue._equals has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 9 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · LogicValue._doMath (cognitive 25) · ×1
  • LogicValue._doMath (cognitive 25) lib/src/values/logic_value.dart:1418 — LogicValue._doMath has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 11, if/else 7, ternaries 4 (7 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · HierarchyService.autocompletePaths (cognitive 25) · ×1
  • HierarchyService.autocompletePaths (cognitive 25) packages/rohd_hierarchy/lib/src/hierarchy_service.dart:382 — HierarchyService.autocompletePaths has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 4 (7 pts), boolean chains 6, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FlcData.lookupByRohdLine (cognitive 24) · ×1
  • FlcData.lookupByRohdLine (cognitive 24) packages/rohd_source_navigator/lib/flc_data.dart:517 — FlcData.lookupByRohdLine has cognitive complexity 24 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 2 (8 pts), boolean chains 4 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · VmServiceTransport.getModuleTree (cognitive 24) · ×1
  • VmServiceTransport.getModuleTree (cognitive 24) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:224 — VmServiceTransport.getModuleTree has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 8, loops 1 (2 pts), error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · WaveformService._ (cognitive 24) · ×1
  • WaveformService._ (cognitive 24) lib/src/diagnostics/waveform_service.dart:207 — WaveformService._ has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 5, loops 2 (5 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · Sequential._setup (cognitive 24) · ×1
  • Sequential._setup (cognitive 24) lib/src/modules/conditionals/sequential.dart:355 — Sequential._setup has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 3, boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · NetlistUtils.buildLogicType (cognitive 24) · ×1
  • NetlistUtils.buildLogicType (cognitive 24) lib/src/synthesizers/netlist/netlist_utils.dart:406 — NetlistUtils.buildLogicType has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SystemCSynthesisResult._buildSubModuleBindings (cognitive 24) · ×1
  • SystemCSynthesisResult._buildSubModuleBindings (cognitive 24) lib/src/synthesizers/systemc/systemc_synthesis_result.dart:1371 — SystemCSynthesisResult._buildSubModuleBindings has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (5 pts), ternaries 1 (5 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SynthSubModuleInstantiation.adjustTypePairs (cognitive 24) · ×1
  • SynthSubModuleInstantiation.adjustTypePairs (cognitive 24) lib/src/synthesizers/utilities/synth_sub_module_instantiation.dart:116 — SynthSubModuleInstantiation.adjustTypePairs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 2 (6 pts), boolean chains 4, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VmServiceTransport.getModuleNetlist (cognitive 23) · ×1
  • VmServiceTransport.getModuleNetlist (cognitive 23) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:287 — VmServiceTransport.getModuleNetlist has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 6, loops 1 (2 pts), error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VmServiceTransport._evaluateOnFallbackLibrary (cognitive 23) · ×1
  • VmServiceTransport._evaluateOnFallbackLibrary (cognitive 23) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:707 — VmServiceTransport._evaluateOnFallbackLibrary has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 5, loops 1 (2 pts), error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · DevToolsConnectionHostState.handleDtdVmEvent (cognitive 23) · ×1
  • DevToolsConnectionHostState.handleDtdVmEvent (cognitive 23) rohd_devtools_extension/lib/rohd_devtools/ui/devtools_connection_host.dart:1190 — DevToolsConnectionHostState.handleDtdVmEvent has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 6 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RohdDesignCommandShell.complete (cognitive 23) · ×1
  • RohdDesignCommandShell.complete (cognitive 23) lib/src/diagnostics/design_command_shell.dart:72 — RohdDesignCommandShell.complete has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 11, ternaries 7 (9 pts), if/else 2 (3 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SynthModuleDefinition._pickNames (cognitive 23) · ×1
  • SynthModuleDefinition._pickNames (cognitive 23) lib/src/synthesizers/utilities/synth_module_definition.dart:2153 — SynthModuleDefinition._pickNames has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 10, boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · LogicValue.compareTo (cognitive 23) · ×1
  • LogicValue.compareTo (cognitive 23) lib/src/values/logic_value.dart:992 — LogicValue.compareTo has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 9 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · SourceNavigationService._extractPrefix (cognitive 22) · ×1
  • SourceNavigationService._extractPrefix (cognitive 22) rohd_devtools_extension/lib/rohd_devtools/services/source_navigation_service.dart:823 — SourceNavigationService._extractPrefix has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VmServiceTreeDataSource.evalModuleTree (cognitive 22) · ×1
  • VmServiceTreeDataSource.evalModuleTree (cognitive 22) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart:52 — VmServiceTreeDataSource.evalModuleTree has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 9, if/else 3 (7 pts), loops 2 (5 pts), error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VmServiceTreeDataSource.fetchModuleSchematic (cognitive 22) · ×1
  • VmServiceTreeDataSource.fetchModuleSchematic (cognitive 22) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart:156 — VmServiceTreeDataSource.fetchModuleSchematic has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 6, loops 1 (2 pts), error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SystemCSynthesisResult._constLit (cognitive 22) · ×1
  • SystemCSynthesisResult._constLit (cognitive 22) lib/src/synthesizers/systemc/systemc_synthesis_result.dart:1794 — SystemCSynthesisResult._constLit has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 2 (7 pts), boolean chains 1 (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · _SynthLogicSourcePicker._chooseSource (cognitive 22) · ×1
  • _SynthLogicSourcePicker._chooseSource (cognitive 22) lib/src/utilities/source_tracer.dart:1842 — _SynthLogicSourcePicker._chooseSource has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16 (21 pts), loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · HierarchyService._searchSignalsRecursive (cognitive 22) · ×1
  • HierarchyService._searchSignalsRecursive (cognitive 22) packages/rohd_hierarchy/lib/src/hierarchy_service.dart:615 — HierarchyService._searchSignalsRecursive has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 4 (6 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FstBlockReader._readBlockImpl (cognitive 21) · ×1
  • FstBlockReader._readBlockImpl (cognitive 21) lib/src/fst/fst_block_reader.dart:121 — FstBlockReader._readBlockImpl has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 9, loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · NetlistModuleTranslation._emitDynamicSynchronousResetFlipFlop (cognitive 21) · ×1
  • NetlistModuleTranslation._emitDynamicSynchronousResetFlipFlop (cognitive 21) lib/src/synthesizers/netlist/netlist_module_translation.dart:504 — NetlistModuleTranslation._emitDynamicSynchronousResetFlipFlop has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 11, if/else 6 (8 pts), loops 1, ternaries 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · SystemCSynthesisResult._groupArrayElementsByParent (cognitive 21) · ×1
  • SystemCSynthesisResult._groupArrayElementsByParent (cognitive 21) lib/src/synthesizers/systemc/systemc_synthesis_result.dart:390 — SystemCSynthesisResult._groupArrayElementsByParent has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, loops 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VmServiceTransport.resumeFetches (cognitive 20) · ×1
  • VmServiceTransport.resumeFetches (cognitive 20) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:377 — VmServiceTransport.resumeFetches has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (6 pts), boolean chains 2, error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VmServiceWaveformDataSource.resumeFetches (cognitive 20) · ×1
  • VmServiceWaveformDataSource.resumeFetches (cognitive 20) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_waveform_data_source.dart:330 — VmServiceWaveformDataSource.resumeFetches has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (6 pts), boolean chains 2, error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · DevToolsConnectionHostState._checkVmLiveness (cognitive 20) · ×1
  • DevToolsConnectionHostState._checkVmLiveness (cognitive 20) rohd_devtools_extension/lib/rohd_devtools/ui/devtools_connection_host.dart:1345 — DevToolsConnectionHostState._checkVmLiveness has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 9 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _StandaloneDevToolsPageState._evaluateForDetailsPane (cognitive 20) · ×1
  • _StandaloneDevToolsPageState._evaluateForDetailsPane (cognitive 20) rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart:2516 — _StandaloneDevToolsPageState._evaluateForDetailsPane has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4, ternaries 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · WaveformDataService._mapLogicObjects (cognitive 20) · ×1
  • WaveformDataService._mapLogicObjects (cognitive 20) lib/src/diagnostics/waveform_data_service.dart:725 — WaveformDataService._mapLogicObjects has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, loops 4, ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · NetlistPasses._sliceOutputConsumedOutside (cognitive 20) · ×1
  • NetlistPasses._sliceOutputConsumedOutside (cognitive 20) lib/src/synthesizers/netlist/netlist_passes.dart:659 — NetlistPasses._sliceOutputConsumedOutside has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SynthLogic.tryMerge (cognitive 20) · ×1
  • SynthLogic.tryMerge (cognitive 20) lib/src/synthesizers/utilities/synth_logic.dart:416 — SynthLogic.tryMerge has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 7 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · Vector._toTbVerilog (cognitive 20) · ×1
  • Vector._toTbVerilog (cognitive 20) lib/src/utilities/simcompare.dart:99 — Vector._toTbVerilog has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 4 (8 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SimCompare._vectorTestbenchContents (cognitive 20) · ×1
  • SimCompare._vectorTestbenchContents (cognitive 20) lib/src/utilities/simcompare.dart:729 — SimCompare._vectorTestbenchContents has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 4 (7 pts), boolean chains 3, ternaries 2 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · SimCompare.iverilogVector (cognitive 20) · ×1
  • SimCompare.iverilogVector (cognitive 20) lib/src/utilities/simcompare.dart:840 — SimCompare.iverilogVector has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (17 pts), error handling 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VmServiceSignalValueSource.getCurrentTime (cognitive 19) · ×1
  • VmServiceSignalValueSource.getCurrentTime (cognitive 19) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_signal_value_source.dart:72 — VmServiceSignalValueSource.getCurrentTime has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · WellenBackedWaveformDataSource.getSnapshotCompact (cognitive 19) · ×1
  • WellenBackedWaveformDataSource.getSnapshotCompact (cognitive 19) rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart:380 — WellenBackedWaveformDataSource.getSnapshotCompact has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _WaveformViewerWrapperState.build (cognitive 19) · ×1
  • _WaveformViewerWrapperState.build (cognitive 19) rohd_devtools_extension/lib/rohd_devtools/ui/waveform_viewer_wrapper.dart:169 — _WaveformViewerWrapperState.build has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 11 (17 pts), boolean chains 1, if/else 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Concat.inlineVerilog (cognitive 19) · ×1
  • Concat.inlineVerilog (cognitive 19) lib/src/modules/bus.dart:381 — Concat.inlineVerilog has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 4 (7 pts), boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _TypedLogicArrayBuild.build (cognitive 19) · ×1
  • _TypedLogicArrayBuild.build (cognitive 19) lib/src/signals/typed_logic_array.dart:357 — _TypedLogicArrayBuild.build has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9, ternaries 7, boolean chains 3. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · _TypedLogicArrayBuild._sameElementLayout (cognitive 19) · ×1
  • _TypedLogicArrayBuild._sameElementLayout (cognitive 19) lib/src/signals/typed_logic_array.dart:469 — _TypedLogicArrayBuild._sameElementLayout has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 12, if/else 5 (7 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · NetlistService._connectionsForBit (cognitive 19) · ×1
  • NetlistService._connectionsForBit (cognitive 19) lib/src/synthesizers/netlist/netlist_service.dart:360 — NetlistService._connectionsForBit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SynthModuleDefinition._sharedSubmoduleMappingSignals (cognitive 19) · ×1
  • SynthModuleDefinition._sharedSubmoduleMappingSignals (cognitive 19) lib/src/synthesizers/utilities/synth_module_definition.dart:2032 — SynthModuleDefinition._sharedSubmoduleMappingSignals has cognitive complexity 19 (threshold 15). Drivers by points: loops 6 (9 pts), boolean chains 6, if/else 2 (4 pts) (nesting depth added 5). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · SignalValueFormatRegistry._waveformValue (cognitive 19) · ×1
  • SignalValueFormatRegistry._waveformValue (cognitive 19) packages/rohd_devtools_widgets/lib/src/signal_value_format_registry.dart:227 — SignalValueFormatRegistry._waveformValue has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 10 (12 pts), boolean chains 2, error handling 2, match/switch 1 (2 pts), if/else 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · FlcExtensionClient.queryModule (cognitive 18) · ×1
  • FlcExtensionClient.queryModule (cognitive 18) rohd_devtools_extension/lib/rohd_devtools/services/flc_extension_client.dart:53 — FlcExtensionClient.queryModule has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), boolean chains 2, loops 1 (2 pts), error handling 1, ternaries 1 (nesting depth added 9). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · SourceNavigationService._lookupSignalViaDtd (cognitive 18) · ×1
  • SourceNavigationService._lookupSignalViaDtd (cognitive 18) rohd_devtools_extension/lib/rohd_devtools/services/source_navigation_service.dart:449 — SourceNavigationService._lookupSignalViaDtd has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 1 (3 pts), error handling 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · WellenBackedWaveformDataSource.getSnapshot (cognitive 18) · ×1
  • WellenBackedWaveformDataSource.getSnapshot (cognitive 18) rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart:290 — WellenBackedWaveformDataSource.getSnapshot has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _SignalTableState._collectSubFieldRows (cognitive 18) · ×1
  • _SignalTableState._collectSubFieldRows (cognitive 18) rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart:674 — _SignalTableState._collectSubFieldRows has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 5 (6 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _StandaloneDevToolsPageState._childInstancePaths (cognitive 18) · ×1
  • _StandaloneDevToolsPageState._childInstancePaths (cognitive 18) rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart:2456 — _StandaloneDevToolsPageState._childInstancePaths has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3, boolean chains 2, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · IterableRemovableQueue._runPatrol (cognitive 18) · ×1
  • IterableRemovableQueue._runPatrol (cognitive 18) lib/src/collections/iterable_removable_queue.dart:48 — IterableRemovableQueue._runPatrol has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FstBlockReader._parseOffsetChain (cognitive 18) · ×1
  • FstBlockReader._parseOffsetChain (cognitive 18) lib/src/fst/fst_block_reader.dart:303 — FstBlockReader._parseOffsetChain has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4 (6 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Module.addTypedInput (cognitive 18) · ×1
  • Module.addTypedInput (cognitive 18) lib/src/module.dart:726 — Module.addTypedInput has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 10, if/else 8. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · Simulator.run (cognitive 18) · ×1
  • Simulator.run (cognitive 18) lib/src/simulator.dart:445 — Simulator.run has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 7, error handling 2 (4 pts), loops 4, if/else 3 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SystemCSynthesisResult._findArrayElementsWritten (cognitive 18) · ×1
  • SystemCSynthesisResult._findArrayElementsWritten (cognitive 18) lib/src/synthesizers/systemc/systemc_synthesis_result.dart:323 — SystemCSynthesisResult._findArrayElementsWritten has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SystemCSynthesisResult._buildWireAssignments (cognitive 18) · ×1
  • SystemCSynthesisResult._buildWireAssignments (cognitive 18) lib/src/synthesizers/systemc/systemc_synthesis_result.dart:1448 — SystemCSynthesisResult._buildWireAssignments has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SystemCSynthesisResult._caseItemCondition (cognitive 18) · ×1
  • SystemCSynthesisResult._caseItemCondition (cognitive 18) lib/src/synthesizers/systemc/systemc_synthesis_result.dart:1706 — SystemCSynthesisResult._caseItemCondition has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 4, ternaries 1 (4 pts), loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SourceTracer.recordModule (cognitive 18) · ×1
  • SourceTracer.recordModule (cognitive 18) lib/src/utilities/source_tracer.dart:256 — SourceTracer.recordModule has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (5 pts), boolean chains 1, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SourceTracer._parseFrames (cognitive 18) · ×1
  • SourceTracer._parseFrames (cognitive 18) lib/src/utilities/source_tracer.dart:657 — SourceTracer._parseFrames has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2, boolean chains 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SystemCFfiCosim._compileAndLoad (cognitive 18) · ×1
  • SystemCFfiCosim._compileAndLoad (cognitive 18) lib/src/utilities/systemc_cosim_ffi.dart:309 — SystemCFfiCosim._compileAndLoad has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _SystemCSimCompare.cleanupSystemCCache (cognitive 18) · ×1
  • _SystemCSimCompare.cleanupSystemCCache (cognitive 18) lib/src/utilities/systemc_simcompare.dart:170 — _SystemCSimCompare.cleanupSystemCCache has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), boolean chains 3, loops 1 (3 pts), error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SourceNavigationService._sendGoToSource (cognitive 17) · ×1
  • SourceNavigationService._sendGoToSource (cognitive 17) rohd_devtools_extension/lib/rohd_devtools/services/source_navigation_service.dart:584 — SourceNavigationService._sendGoToSource has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), error handling 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VmServiceTreeDataSource._parseResult (cognitive 17) · ×1
  • VmServiceTreeDataSource._parseResult (cognitive 17) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart:513 — VmServiceTreeDataSource._parseResult has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), error handling 2 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _SignalTableState._onRowTap (cognitive 17) · ×1
  • _SignalTableState._onRowTap (cognitive 17) rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart:200 — _SignalTableState._onRowTap has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (6 pts), boolean chains 5, ternaries 2 (4 pts), loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · IterableRemovableQueue.iterate (cognitive 17) · ×1
  • IterableRemovableQueue.iterate (cognitive 17) lib/src/collections/iterable_removable_queue.dart:176 — IterableRemovableQueue.iterate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Sequential._execute (cognitive 17) · ×1
  • Sequential._execute (cognitive 17) lib/src/modules/conditionals/sequential.dart:456 — Sequential._execute has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (7 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SystemVerilogSynthModuleDefinition._expandNestedUnpackedArrayAssignments (cognitive 17) · ×1
  • SystemVerilogSynthModuleDefinition._expandNestedUnpackedArrayAssignments (cognitive 17) lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart:156 — SystemVerilogSynthModuleDefinition._expandNestedUnpackedArrayAssignments has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (5 pts), loops 2 (3 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · SynthModuleDefinition._preservesWholePackedArray (cognitive 17) · ×1
  • SynthModuleDefinition._preservesWholePackedArray (cognitive 17) lib/src/synthesizers/utilities/synth_module_definition.dart:3950 — SynthModuleDefinition._preservesWholePackedArray has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SystemCFfiCosim._pushInputs (cognitive 17) · ×1
  • SystemCFfiCosim._pushInputs (cognitive 17) lib/src/utilities/systemc_cosim_ffi.dart:636 — SystemCFfiCosim._pushInputs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 2 (6 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _FilledLogicValue._and2 (cognitive 17) · ×1
  • _FilledLogicValue._and2 (cognitive 17) lib/src/values/filled_logic_value.dart:169 — _FilledLogicValue._and2 has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SignalWaveformRepository.streamWaveformData (cognitive 17) · ×1
  • SignalWaveformRepository.streamWaveformData (cognitive 17) packages/rohd_waveform/lib/src/waveform_repository.dart:299 — SignalWaveformRepository.streamWaveformData has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · NetlistEvaluator.isComputed (cognitive 16) · ×1
  • NetlistEvaluator.isComputed (cognitive 16) rohd_devtools_extension/lib/rohd_devtools/services/netlist_evaluator.dart:457 — NetlistEvaluator.isComputed has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · NetlistEvaluator._collectEvaluablePaths (cognitive 16) · ×1
  • NetlistEvaluator._collectEvaluablePaths (cognitive 16) rohd_devtools_extension/lib/rohd_devtools/services/netlist_evaluator.dart:580 — NetlistEvaluator._collectEvaluablePaths has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _RohdDesignShellState._complete (cognitive 16) · ×1
  • _RohdDesignShellState._complete (cognitive 16) rohd_devtools_extension/lib/rohd_devtools/ui/rohd_design_shell.dart:217 — _RohdDesignShellState._complete has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, error handling 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · InProcessRohdDesignSession._matchingPorts (cognitive 16) · ×1
  • InProcessRohdDesignSession._matchingPorts (cognitive 16) lib/src/diagnostics/in_process_design_session.dart:352 — InProcessRohdDesignSession._matchingPorts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FstBlockReader._decodeFrame (cognitive 16) · ×1
  • FstBlockReader._decodeFrame (cognitive 16) lib/src/fst/fst_block_reader.dart:372 — FstBlockReader._decodeFrame has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Module.addTypedInOut (cognitive 16) · ×1
  • Module.addTypedInOut (cognitive 16) lib/src/module.dart:865 — Module.addTypedInOut has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FlipFlop.scalar (cognitive 16) · ×1
  • FlipFlop.scalar (cognitive 16) lib/src/modules/conditionals/flop.dart:132 — FlipFlop.scalar has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, boolean chains 5, ternaries 5. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · If.processSsa (cognitive 16) · ×1
  • If.processSsa (cognitive 16) lib/src/modules/conditionals/if.dart:199 — If.processSsa has cognitive complexity 16 (threshold 15). Drivers by points: loops 6 (9 pts), if/else 3 (7 pts) (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · SystemVerilogSynthModuleDefinition._dropEmptiedArrays (cognitive 16) · ×1
  • SystemVerilogSynthModuleDefinition._dropEmptiedArrays (cognitive 16) lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart:1791 — SystemVerilogSynthModuleDefinition._dropEmptiedArrays has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SynthModuleDefinition._addSimpleRangeRun (cognitive 16) · ×1
  • SynthModuleDefinition._addSimpleRangeRun (cognitive 16) lib/src/synthesizers/utilities/synth_module_definition.dart:2595 — SynthModuleDefinition._addSimpleRangeRun has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 3 (4 pts), loops 3 (4 pts), ternaries 1 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SynthModuleDefinition._isRangeChainIntermediate (cognitive 16) · ×1
  • SynthModuleDefinition._isRangeChainIntermediate (cognitive 16) lib/src/synthesizers/utilities/synth_module_definition.dart:4216 — SynthModuleDefinition._isRangeChainIntermediate has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 4 (6 pts), loops 1, ternaries 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · _FilledLogicValue._triState2 (cognitive 16) · ×1
  • _FilledLogicValue._triState2 (cognitive 16) lib/src/values/filled_logic_value.dart:269 — _FilledLogicValue._triState2 has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (16 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · LogicValue._shift (cognitive 16) · ×1
  • LogicValue._shift (cognitive 16) lib/src/values/logic_value.dart:1627 — LogicValue._shift has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 pts), match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · _MarkdownHelpButtonState._loadContent (cognitive 16) · ×1
  • _MarkdownHelpButtonState._loadContent (cognitive 16) packages/rohd_devtools_widgets/lib/src/markdown_help_button.dart:133 — _MarkdownHelpButtonState._loadContent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 2 (4 pts), loops 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · flc_service.lookupSignalInModule · ×1
  • flc_service.lookupSignalInModule::walkNode (cognitive 16) rohd_extension/src/flc_service.ts:466 — flc_service.lookupSignalInModule::walkNode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D4 · Code Duplication · Near-duplicate member pair (68 shared lines) · ×1
  • Near-duplicate member pair (68 shared lines) rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart:42 — rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart:42-147 | rohd_devtools_extension/lib/rohd_devtools/services/web_vm_connection_strategy.dart:35-165 — These two members are variants of one another: 68 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 (4 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (4 members, 50+ identical tokens) doc/tutorials/chapter_4/basic_generation_sv.dart:24 — doc/tutorials/chapter_4/basic_generation_sv.dart:24-47 | doc/tutorials/chapter_5/answers/full_adder.dart:25-48 | doc/tutorials/chapter_5/n_bit_adder.dart:22-48 | doc/tutorials/chapter_6/combinational_logic.dart:27-48 — 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 (64 corresponding lines) · ×1
  • Edited copy of a member (64 corresponding lines) lib/src/utilities/simcompare.dart:99 — lib/src/utilities/simcompare.dart:99-172 | lib/src/utilities/systemverilog_simcompare.dart:61-124 — These two members are one piece of code written twice and then edited apart: 64 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 (66 corresponding lines) · ×1
  • Edited copy of a member (66 corresponding lines) lib/src/modules/conditionals/case.dart:450 — lib/src/modules/conditionals/case.dart:450-524 | lib/src/modules/conditionals/if.dart:199-264 — These two members are one piece of code written twice and then edited apart: 66 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 (62 corresponding lines) · ×1
  • Edited copy of a member (62 corresponding lines) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:224 — rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:224-285 | rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart:52-126 — These two members are one piece of code written twice and then edited apart: 62 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 (51 corresponding lines) · ×1
  • Edited copy of a member (51 corresponding lines) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:287 — rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:287-338 | rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart:156-206 — These two members are one piece of code written twice and then edited apart: 51 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 (48 corresponding lines) · ×1
  • Edited copy of a member (48 corresponding lines) rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart:290 — rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart:290-337 | rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart:380-428 — These two members are one piece of code written twice and then edited apart: 48 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) rohd_devtools_extension/lib/rohd_devtools/services/in_process_waveform_data_source.dart:165 — rohd_devtools_extension/lib/rohd_devtools/services/in_process_waveform_data_source.dart:165-207 | rohd_devtools_extension/lib/rohd_devtools/services/in_process_waveform_data_source.dart:209-248 — 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 (33 corresponding lines) · ×1
  • Edited copy of a member (33 corresponding lines) lib/src/values/filled_logic_value.dart:169 — lib/src/values/filled_logic_value.dart:169-201 | lib/src/values/filled_logic_value.dart:233-267 — These two members are one piece of code written twice and then edited apart: 33 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 (23 corresponding lines) · ×1
  • Edited copy of a member (23 corresponding lines) rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart:254 — rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart:254-276 | rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart:452-480 — These two members are one piece of code written twice and then edited apart: 23 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) rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart:99 — rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart:99-137 | rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart:1659-1690 — 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, 19+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 19+ corresponding lines) doc/tutorials/chapter_4/answers/exercise_2_sv.dart:33 — doc/tutorials/chapter_4/answers/exercise_2_sv.dart:33-53 | doc/tutorials/chapter_5/answers/n_bit_subtractor.dart:17-35 | doc/tutorials/chapter_6/answers/exercise_2_n_bit_subtractor.dart:76-94 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 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) · ×1
  • Edited copy of a member (17 corresponding lines) lib/src/values/big_logic_value.dart:179 — lib/src/values/big_logic_value.dart:179-195 | lib/src/values/small_logic_value.dart:156-172 — 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 (21 corresponding lines) · ×1
  • Edited copy of a member (21 corresponding lines) rohd_devtools_extension/lib/rohd_devtools/services/in_process_transport.dart:100 — rohd_devtools_extension/lib/rohd_devtools/services/in_process_transport.dart:100-122 | rohd_devtools_extension/lib/rohd_devtools/services/in_process_transport.dart:124-144 — 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 (19 corresponding lines) · ×1
  • Edited copy of a member (19 corresponding lines) lib/src/diagnostics/in_process_design_session.dart:310 — lib/src/diagnostics/in_process_design_session.dart:310-330 | lib/src/diagnostics/in_process_design_session.dart:332-350 — 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 · Edited copy of a member (16 corresponding lines) · ×1
  • Edited copy of a member (16 corresponding lines) lib/src/signals/logic_array.dart:104 — lib/src/signals/logic_array.dart:104-119 | lib/src/signals/logic_array.dart:121-136 — 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 copies of one member (4 members, 13+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 13+ corresponding lines) doc/tutorials/chapter_3/answers/exercise_sv.dart:15 — doc/tutorials/chapter_3/answers/exercise_sv.dart:15-30 | doc/tutorials/chapter_4/answers/exercise_1_sv.dart:74-90 | doc/tutorials/chapter_4/answers/exercise_2_sv.dart:65-77 | doc/tutorials/chapter_5/answers/full_subtractor.dart:22-36 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 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, 16+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 16+ corresponding lines) rohd_devtools_extension/lib/rohd_devtools/ui/details_panel_content.dart:118 — rohd_devtools_extension/lib/rohd_devtools/ui/details_panel_content.dart:118-143 | rohd_devtools_extension/lib/rohd_devtools/ui/platform_icon.dart:48-63 | rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart:3227-3244 — 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 copy of a member (11 corresponding lines) · ×1
  • Edited copy of a member (11 corresponding lines) lib/src/signals/const.dart:207 — lib/src/signals/const.dart:207-217 | lib/src/signals/const.dart:219-229 — 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 copies of one member (3 members, 10+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 10+ corresponding lines) lib/src/signals/const.dart:165 — lib/src/signals/const.dart:165-174 | lib/src/signals/const.dart:176-185 | lib/src/signals/const.dart:187-196 — These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (14 corresponding lines) · ×1
  • Edited copy of a member (14 corresponding lines) lib/src/synthesizers/utilities/synth_logic.dart:832 — lib/src/synthesizers/utilities/synth_logic.dart:832-845 | lib/src/synthesizers/utilities/synth_logic.dart:926-939 — 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 copies of one member (3 members, 17+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 17+ corresponding lines) lib/src/diagnostics/in_process_design_session.dart:173 — lib/src/diagnostics/in_process_design_session.dart:173-189 | lib/src/diagnostics/in_process_design_session.dart:205-221 | lib/src/diagnostics/in_process_design_session.dart:237-253 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 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 (13 corresponding lines) · ×1
  • Edited copy of a member (13 corresponding lines) lib/src/values/big_logic_value.dart:211 — lib/src/values/big_logic_value.dart:211-223 | lib/src/values/small_logic_value.dart:188-200 — 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, 5+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 5+ corresponding lines) doc/tutorials/chapter_2/helper.dart:28 — doc/tutorials/chapter_2/helper.dart:28-32 | doc/tutorials/chapter_2/helper.dart:37-44 | doc/tutorials/chapter_2/helper.dart:49-57 — 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 copy of a member (6 corresponding lines) · ×1
  • Edited copy of a member (6 corresponding lines) rohd_devtools_extension/scripts/fix_directives.py:11 — rohd_devtools_extension/scripts/fix_directives.py:11-16 | rohd_devtools_extension/scripts/fix_types.py:9-14 — 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 · Edited copy of a member (7 corresponding lines) · ×1
  • Edited copy of a member (7 corresponding lines) lib/src/diagnostics/design_command_shell.dart:348 — lib/src/diagnostics/design_command_shell.dart:348-354 | rohd_devtools_extension/lib/rohd_devtools/ui/rohd_design_shell.dart:454-460 — 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.
D4 · Code Duplication · Edited copy of a member (8 corresponding lines) · ×1
  • Edited copy of a member (8 corresponding lines) lib/src/synthesizers/systemc/systemc_synthesis_result.dart:60 — lib/src/synthesizers/systemc/systemc_synthesis_result.dart:60-67 | lib/src/synthesizers/systemverilog/systemverilog_synthesis_result.dart:153-160 — 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.
D4 · Code Duplication · Edited copies of one member (3 members, 7+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 7+ corresponding lines) doc/tutorials/chapter_4/answers/exercise_2_sv.dart:57 — doc/tutorials/chapter_4/answers/exercise_2_sv.dart:57-63 | doc/tutorials/chapter_5/answers/full_subtractor.dart:38-44 | doc/tutorials/chapter_6/answers/exercise_2_n_bit_subtractor.dart:65-72 — 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 · Edited copy of a member (3 corresponding lines) · ×1
  • Edited copy of a member (3 corresponding lines) lib/src/values/big_logic_value.dart:225 — lib/src/values/big_logic_value.dart:225-227 | lib/src/values/small_logic_value.dart:202-204 — 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 (4 members, 5+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 5+ corresponding lines) rohd_devtools_extension/lib/rohd_devtools/ui/details_help_button.dart:35 — rohd_devtools_extension/lib/rohd_devtools/ui/details_help_button.dart:35-39 | rohd_devtools_extension/lib/rohd_devtools/ui/devtools_split_layout.dart:177-183 | rohd_devtools_extension/lib/rohd_devtools/ui/module_tree_card.dart:28-35 | rohd_devtools_extension/lib/rohd_devtools/view/tree_structure_page.dart:53-57 — 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 · Duplicated block (41 lines × 2) · ×1
  • Duplicated block (41 lines × 2) rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart:89 — rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart:89-129 | rohd_devtools_extension/lib/rohd_devtools/services/web_vm_connection_strategy.dart:107-147 — before extracting anything, compare `rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart` and `rohd_devtools_extension/lib/rohd_devtools/services/web_vm_connection_strategy.dart` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 68 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. Read the line range as the matched WINDOW rather than a finished unit: at `rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart:89` it begins part-way through the construct above it, 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.
D4 · Code Duplication · Duplicated block (21–30 lines × 2) · ×1
  • Duplicated block (21–30 lines × 2) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:242 — rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:242-262 | rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart:71-100 — before extracting anything, compare `rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart` and `rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 85 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. Read the line range as the matched WINDOW rather than a finished unit: at `rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:242` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart:70` calls `debugPrint` and `rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:241` 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.
D4 · Code Duplication · Duplicated block (27 lines × 2) · ×1
  • Duplicated block (27 lines × 2) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:294 — rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:294-320 | rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart:162-188 — before extracting anything, compare `rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart` and `rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 85 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. Read the line range as the matched WINDOW rather than a finished unit: at `rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:294` 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.
D4 · Code Duplication · Duplicated block (19–21 lines × 2) · ×1
  • Duplicated block (19–21 lines × 2) rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart:305 — rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart:305-325 | rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart:404-422 — 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 × 3) · ×1
  • Duplicated block (20 lines × 3) doc/tutorials/chapter_4/basic_generation_sv.dart:59 — doc/tutorials/chapter_4/basic_generation_sv.dart:59-78 | doc/tutorials/chapter_5/n_bit_adder.dart:60-79 | doc/tutorials/chapter_6/combinational_logic.dart:66-85 — before extracting anything, compare `doc/tutorials/chapter_4/basic_generation_sv.dart` and `doc/tutorials/chapter_5/n_bit_adder.dart` 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. 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 (20 lines × 2) · ×1
  • Duplicated block (20 lines × 2) lib/src/modules/conditionals/case.dart:475 — lib/src/modules/conditionals/case.dart:475-494 | lib/src/modules/conditionals/if.dart:216-235 — 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 `lib/src/modules/conditionals/case.dart:475` it begins part-way through the construct above it, 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.
D4 · Code Duplication · Duplicated block (19–20 lines × 2) · ×1
  • Duplicated block (19–20 lines × 2) rohd_devtools_extension/lib/rohd_devtools/view/tree_structure_page.dart:528 — rohd_devtools_extension/lib/rohd_devtools/view/tree_structure_page.dart:528-546 | rohd_devtools_extension/lib/rohd_devtools/view/tree_structure_page.dart:569-588 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `rohd_devtools_extension/lib/rohd_devtools/view/tree_structure_page.dart:528` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (17 lines × 3) · ×1
  • Duplicated block (17 lines × 3) doc/tutorials/chapter_4/basic_generation_sv.dart:24 — doc/tutorials/chapter_4/basic_generation_sv.dart:24-40 | doc/tutorials/chapter_5/answers/full_adder.dart:25-41 | doc/tutorials/chapter_5/n_bit_adder.dart:22-38 — before extracting anything, compare `doc/tutorials/chapter_4/basic_generation_sv.dart` and `doc/tutorials/chapter_5/n_bit_adder.dart` 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. 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. Read the line range as the matched WINDOW rather than a finished unit: at `doc/tutorials/chapter_4/basic_generation_sv.dart:24` 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.
D4 · Code Duplication · Duplicated block (16–17 lines × 2) · ×1
  • Duplicated block (16–17 lines × 2) lib/src/synthesizers/netlist/netlist_synthesizer.dart:433 — lib/src/synthesizers/netlist/netlist_synthesizer.dart:433-448 | lib/src/synthesizers/netlist/netlist_synthesizer.dart:457-473 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `lib/src/synthesizers/netlist/netlist_synthesizer.dart:433` 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.
D4 · Code Duplication · Duplicated block (16 lines × 2) · ×1
  • Duplicated block (16 lines × 2) lib/src/diagnostics/in_process_design_session.dart:426 — lib/src/diagnostics/in_process_design_session.dart:426-441 | lib/src/diagnostics/in_process_design_session.dart:446-461 — 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 (12–13 lines × 2) · ×1
  • Duplicated block (12–13 lines × 2) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:226 — rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:226-238 | rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:289-300 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:226` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:302` calls `contains` and `rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:240` 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 (10–12 lines × 2) · ×1
  • Duplicated block (10–12 lines × 2) rohd_devtools_extension/lib/rohd_devtools/ui/details_panel_content.dart:211 — rohd_devtools_extension/lib/rohd_devtools/ui/details_panel_content.dart:211-220 | rohd_devtools_extension/lib/rohd_devtools/ui/module_tree_card.dart:46-57 — 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 `rohd_devtools_extension/lib/rohd_devtools/ui/details_panel_content.dart:211` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (10–11 lines × 3) · ×1
  • Duplicated block (10–11 lines × 3) rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:229 — rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:229-239 | rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:292-301 | rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart:160-169 — before extracting anything, compare `rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart` and `rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 85 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. Read the line range as the matched WINDOW rather than a finished unit: at `rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:229` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:302` calls `contains` and `rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:240` 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.
D4 · Code Duplication · Duplicated block (10 lines × 4) · ×1
  • Duplicated block (10 lines × 4) doc/tutorials/chapter_4/basic_generation_sv.dart:28 — doc/tutorials/chapter_4/basic_generation_sv.dart:28-37 | doc/tutorials/chapter_5/answers/full_adder.dart:29-38 | doc/tutorials/chapter_5/n_bit_adder.dart:26-35 | doc/tutorials/chapter_6/combinational_logic.dart:32-41 — before extracting anything, compare `doc/tutorials/chapter_4/basic_generation_sv.dart` and `doc/tutorials/chapter_5/n_bit_adder.dart` 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. 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. Read the line range as the matched WINDOW rather than a finished unit: at `doc/tutorials/chapter_4/basic_generation_sv.dart:28` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
D4 · Code Duplication · Duplicated block (9–10 lines × 2) · ×1
  • Duplicated block (9–10 lines × 2) rohd_devtools_extension/lib/rohd_devtools/ui/waveform_viewer_wrapper.dart:216 — rohd_devtools_extension/lib/rohd_devtools/ui/waveform_viewer_wrapper.dart:216-225 | rohd_devtools_extension/lib/rohd_devtools/ui/waveform_viewer_wrapper.dart:254-262 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `rohd_devtools_extension/lib/rohd_devtools/ui/waveform_viewer_wrapper.dart:216` 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (9 lines × 3) · ×1
  • Duplicated block (9 lines × 3) lib/src/utilities/source_tracer.dart:678 — lib/src/utilities/source_tracer.dart:678-686 | lib/src/utilities/source_tracer.dart:691-699 | lib/src/utilities/source_tracer.dart:704-712 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `lib/src/utilities/source_tracer.dart:678` 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.
D4 · Code Duplication · Duplicated block (8–9 lines × 2) · ×1
  • Duplicated block (8–9 lines × 2) lib/src/utilities/simcompare.dart:822 — lib/src/utilities/simcompare.dart:822-830 | lib/src/utilities/systemverilog_simcompare.dart:267-274 — 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 `lib/src/utilities/simcompare.dart:822` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. 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–8 lines × 2) · ×1
  • Duplicated block (7–8 lines × 2) lib/src/synthesizers/netlist/netlist_synthesizer.dart:192 — lib/src/synthesizers/netlist/netlist_synthesizer.dart:192-199 | lib/src/synthesizers/netlist/netlist_synthesizer.dart:208-214 — 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 lines × 2) · ×1
  • Duplicated block (35 lines × 2) rohd_devtools_extension/lib/rohd_devtools/cubit/rohd_service_state.dart:17 — rohd_devtools_extension/lib/rohd_devtools/cubit/rohd_service_state.dart:17-51 | rohd_devtools_extension/lib/rohd_devtools/cubit/standalone_rohd_service_state.dart:16-51 — 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 `rohd_devtools_extension/lib/rohd_devtools/cubit/rohd_service_state.dart:17` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×1
  • Duplicated block (6 lines × 2) packages/rohd_devtools_widgets/lib/src/rohd_extension_client.dart:121 — packages/rohd_devtools_widgets/lib/src/rohd_extension_client.dart:121-126 | rohd_devtools_extension/lib/rohd_devtools/services/flc_extension_client.dart:139-144 — 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 (24 lines × 2) · ×1
  • Duplicated block (24 lines × 2) example/filter_bank/filter_sample.dart:24 — example/filter_bank/filter_sample.dart:24-50 | lib/src/examples/filter_bank/filter_sample.dart:24-47 — before extracting anything, compare `example/filter_bank/filter_sample.dart` and `lib/src/examples/filter_bank/filter_sample.dart` as WHOLE FILES: 83% 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. 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.
D5 · Coupling · Off the main sequence · ×1
  • Off the main sequence: rohd_devtools_widgets — rohd_devtools_widgets: abstractness 0.19, instability 0.00, distance 0.81 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
P3 · Security & performance tooling · Analyzer excludes the shipped package `doc/tutorials/chapter_9/rohd_vf_example` · ×1
  • Analyzer excludes the shipped package `doc/tutorials/chapter_9/rohd_vf_example` analysis_options.yaml:1 — `analysis_options.yaml` excludes `doc/tutorials/chapter_9/rohd_vf_example` from analysis, and `doc/tutorials/chapter_9/rohd_vf_example` is a Dart package this repository ships — it has its own `pubspec.yaml` and 2 Dart file(s). Nothing in that tree is linted, type-checked or reported on by `dart analyze` / `flutter analyze`, locally or in CI. For a published package the excluded tree is usually the example app, which is the code consumers read first and copy from. Remove the exclusion and fix what it surfaces, or narrow it to the generated files it was meant for.
P3 · Security & performance tooling · Analyzer excludes the shipped package `packages/rohd_devtools_widgets` · ×1
  • Analyzer excludes the shipped package `packages/rohd_devtools_widgets` analysis_options.yaml:1 — `analysis_options.yaml` excludes `packages/rohd_devtools_widgets` from analysis, and `packages/rohd_devtools_widgets` is a Dart package this repository ships — it has its own `pubspec.yaml` and 35 Dart file(s). Nothing in that tree is linted, type-checked or reported on by `dart analyze` / `flutter analyze`, locally or in CI. For a published package the excluded tree is usually the example app, which is the code consumers read first and copy from. Remove the exclusion and fix what it surfaces, or narrow it to the generated files it was meant for.
P3 · Security & performance tooling · Analyzer excludes the shipped package `packages/rohd_hierarchy` · ×1
  • Analyzer excludes the shipped package `packages/rohd_hierarchy` analysis_options.yaml:1 — `analysis_options.yaml` excludes `packages/rohd_hierarchy` from analysis, and `packages/rohd_hierarchy` is a Dart package this repository ships — it has its own `pubspec.yaml` and 33 Dart file(s). Nothing in that tree is linted, type-checked or reported on by `dart analyze` / `flutter analyze`, locally or in CI. For a published package the excluded tree is usually the example app, which is the code consumers read first and copy from. Remove the exclusion and fix what it surfaces, or narrow it to the generated files it was meant for.
P3 · Security & performance tooling · Analyzer excludes the shipped package `packages/rohd_source_navigator` · ×1
  • Analyzer excludes the shipped package `packages/rohd_source_navigator` analysis_options.yaml:1 — `analysis_options.yaml` excludes `packages/rohd_source_navigator` from analysis, and `packages/rohd_source_navigator` is a Dart package this repository ships — it has its own `pubspec.yaml` and 6 Dart file(s). Nothing in that tree is linted, type-checked or reported on by `dart analyze` / `flutter analyze`, locally or in CI. For a published package the excluded tree is usually the example app, which is the code consumers read first and copy from. Remove the exclusion and fix what it surfaces, or narrow it to the generated files it was meant for.
P3 · Security & performance tooling · Analyzer excludes the shipped package `packages/rohd_waveform` · ×1
  • Analyzer excludes the shipped package `packages/rohd_waveform` analysis_options.yaml:1 — `analysis_options.yaml` excludes `packages/rohd_waveform` from analysis, and `packages/rohd_waveform` is a Dart package this repository ships — it has its own `pubspec.yaml` and 23 Dart file(s). Nothing in that tree is linted, type-checked or reported on by `dart analyze` / `flutter analyze`, locally or in CI. For a published package the excluded tree is usually the example app, which is the code consumers read first and copy from. Remove the exclusion and fix what it surfaces, or narrow it to the generated files it was meant for.
P3 · Security & performance tooling · Analyzer excludes the shipped package `rohd_devtools_extension` · ×1
  • Analyzer excludes the shipped package `rohd_devtools_extension` analysis_options.yaml:1 — `analysis_options.yaml` excludes `rohd_devtools_extension` from analysis, and `rohd_devtools_extension` is a Dart package this repository ships — it has its own `pubspec.yaml` and 176 Dart file(s). Nothing in that tree is linted, type-checked or reported on by `dart analyze` / `flutter analyze`, locally or in CI. For a published package the excluded tree is usually the example app, which is the code consumers read first and copy from. Remove the exclusion and fix what it surfaces, or narrow it to the generated files it was meant for.
R1 · Type Safety · Type Safety · ×1
  • Type Safety — 8 typed · 4 plain JS — the untyped files are packages/rohd_devtools_widgets/assets/extension/module_info_helper.js, rohd_devtools_extension/assets/layout_bridge/elk_layout_only.js, rohd_devtools_extension/shared/module_info_helper.js, rohd_extension/tool/test_flc_instance_paths.cjs.
R10 · Code Duplication · Duplicated block with local edits (74 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (74 matched lines × 2 locations) rohd_extension/src/debug_tracker.ts:97 — rohd_extension/src/debug_tracker.ts:97 · rohd_extension/src/uri_forwarder.ts:87 — the two spans are one implementation copied and then locally edited — 450 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Wholesale file copy (64 identical lines × 2 files) · ×1
  • Wholesale file copy (64 identical lines × 2 files) packages/rohd_devtools_widgets/assets/extension/module_info_helper.js:13 — packages/rohd_devtools_widgets/assets/extension/module_info_helper.js:13 · rohd_devtools_extension/shared/module_info_helper.js:13 — these 2 files are line-for-line copies of one another — 64 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done.
R10 · Code Duplication · Duplicated block (42 lines × 2 locations) · ×1
  • Duplicated block (42 lines × 2 locations) rohd_extension/src/debug_tracker.ts:34 — rohd_extension/src/debug_tracker.ts:34 · rohd_extension/src/uri_forwarder.ts:23 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
R10 · Code Duplication · Duplicated block (26 lines × 2 locations) · ×1
  • Duplicated block (26 lines × 2 locations) rohd_extension/src/conditional_completions.ts:80 — rohd_extension/src/conditional_completions.ts:80 · rohd_extension/src/conditional_completions.ts:202 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (15 lines × 2 locations) · ×1
  • Duplicated block (15 lines × 2 locations) rohd_extension/src/conditional_completions.ts:963 — rohd_extension/src/conditional_completions.ts:963 · rohd_extension/src/conditional_completions.ts:979 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
R10 · Code Duplication · Duplicated block (14 lines × 2 locations) · ×1
  • Duplicated block (14 lines × 2 locations) rohd_extension/src/conditional_completions.ts:50 — rohd_extension/src/conditional_completions.ts:50 · rohd_extension/src/conditional_completions.ts:177 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (10 lines × 2 locations) · ×1
  • Duplicated block (10 lines × 2 locations) rohd_extension/src/flc_service.ts:314 — rohd_extension/src/flc_service.ts:314 · rohd_extension/src/flc_service.ts:420 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (9 lines × 2 locations) · ×1
  • Duplicated block (9 lines × 2 locations) rohd_extension/src/conditional_completions.ts:835 — rohd_extension/src/conditional_completions.ts:835 · rohd_extension/src/conditional_completions.ts:876 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (9 lines × 4 locations) · ×1
  • Duplicated block (9 lines × 4 locations) rohd_extension/src/dtd_bridge.ts:249 — rohd_extension/src/dtd_bridge.ts:249 · rohd_extension/src/dtd_bridge.ts:259 · rohd_extension/src/dtd_bridge.ts:269 · rohd_extension/src/dtd_bridge.ts:279 — 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.
R10 · Code Duplication · Duplicated block (8 lines × 2 locations) · ×1
  • Duplicated block (8 lines × 2 locations) rohd_extension/src/flc_service.ts:169 — rohd_extension/src/flc_service.ts:169 · rohd_extension/src/flc_service.ts:382 — 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.
R10 · Code Duplication · Duplicated block (7 lines × 2 locations) · ×1
  • Duplicated block (7 lines × 2 locations) rohd_devtools_extension/assets/layout_bridge/elk_layout_only.js:47 — rohd_devtools_extension/assets/layout_bridge/elk_layout_only.js:47 · rohd_devtools_extension/assets/layout_bridge/elk_layout_only.js:73 — 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.
R10 · Code Duplication · Duplicated block (6 lines × 2 locations) · ×1
  • Duplicated block (6 lines × 2 locations) rohd_extension/src/flc_service.ts:366 — rohd_extension/src/flc_service.ts:366 · rohd_extension/src/flc_service.ts:514 — all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct — the members of a type, or the entries of an object or array literal — with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal's entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or — where the copies are a literal's entries rather than a type's members — one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared — a decorator and its options, an annotation, a registration table's keys — the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases.
R2 · Cyclomatic Complexity · Complex function detectContext (cyclomatic 38, cognitive 57) · ×1
  • Complex function detectContext (cyclomatic 38, cognitive 57) rohd_extension/src/conditional_completions.ts:37 — detectContext has cyclomatic complexity 38 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function findEnclosingClassInfo (cyclomatic 36, cognitive 50) · ×1
  • Complex function findEnclosingClassInfo (cyclomatic 36, cognitive 50) rohd_extension/src/conditional_completions.ts:162 — findEnclosingClassInfo has cyclomatic complexity 36 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function queryModule (cyclomatic 26, cognitive 41) · ×1
  • Complex function queryModule (cyclomatic 26, cognitive 41) rohd_extension/src/flc_service.ts:137 — queryModule has cyclomatic complexity 26 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function buildModuleInfo (cyclomatic 20, cognitive 25) · ×1
  • Complex function buildModuleInfo (cyclomatic 20, cognitive 25) packages/rohd_devtools_widgets/assets/extension/module_info_helper.js:80 — buildModuleInfo has cyclomatic complexity 20 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function buildModuleInfo (cyclomatic 19, cognitive 23) · ×1
  • Complex function buildModuleInfo (cyclomatic 19, cognitive 23) rohd_devtools_extension/shared/module_info_helper.js:57 — buildModuleInfo has cyclomatic complexity 19 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function parseOutputPositions (cyclomatic 14, cognitive 28) · ×1
  • Complex function parseOutputPositions (cyclomatic 14, cognitive 28) rohd_extension/src/flc_service.ts:582 — parseOutputPositions has cyclomatic complexity 14 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function handleMessage (cyclomatic 14, cognitive 22) · ×1
  • Complex function handleMessage (cyclomatic 14, cognitive 22) rohd_extension/src/dtd_bridge.ts:50 — handleMessage has cyclomatic complexity 14 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function provideCompletionItems (cyclomatic 13, cognitive 13) · ×1
  • Complex function provideCompletionItems (cyclomatic 13, cognitive 13) rohd_extension/src/conditional_completions.ts:1022 — provideCompletionItems has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function elkLayoutOnly (cyclomatic 12, cognitive 12) · ×1
  • Complex function elkLayoutOnly (cyclomatic 12, cognitive 12) rohd_devtools_extension/assets/layout_bridge/elk_layout_only.js:26 — elkLayoutOnly has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function lookupSignal (cyclomatic 12, cognitive 10) · ×1
  • Complex function lookupSignal (cyclomatic 12, cognitive 10) rohd_extension/src/flc_service.ts:273 — lookupSignal has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function entryToFrames (cyclomatic 11, cognitive 13) · ×1
  • Complex function entryToFrames (cyclomatic 11, cognitive 13) rohd_extension/src/flc_service.ts:498 — entryToFrames has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function openSourceLocations (cyclomatic 11, cognitive 10) · ×1
  • Complex function openSourceLocations (cyclomatic 11, cognitive 10) rohd_extension/src/source_navigator.ts:77 — openSourceLocations has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R3 · Large Files · rohd_extension/src/conditional_completions.ts · ×1
  • rohd_extension/src/conditional_completions.ts: 1014 lines of code rohd_extension/src/conditional_completions.ts:1 — rohd_extension/src/conditional_completions.ts has 1014 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · rohd_extension/src/flc_service.ts · ×1
  • rohd_extension/src/flc_service.ts: 576 lines of code rohd_extension/src/flc_service.ts:1 — rohd_extension/src/flc_service.ts has 576 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · rohd_extension/src/source_navigator.ts · ×1
  • rohd_extension/src/source_navigator.ts: 423 lines of code rohd_extension/src/source_navigator.ts:1 — rohd_extension/src/source_navigator.ts has 423 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R6 · Tooling · No lint script · ×1
  • No lint script — test ✓ · lint ✗ · typecheck ✓ — read from this repository's package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: `test` for the suite, `lint` or `prettier` for linting, `typecheck`/`type-check`/`tsc` for type checking. ✗ therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline — a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A ✓ means the wiring is DECLARED — a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite.
R7 · Dead Code · Dead file (~295 LoC) · ×1
  • Dead file (~295 LoC) rohd_extension/src/uri_forwarder.ts — no import path from any entry point (3 application, 0 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~159 LoC) · ×1
  • Dead file (~159 LoC) rohd_devtools_extension/shared/module_info_helper.js — no import path from any entry point (3 application, 0 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
X17 · Uncapped recursion over a caller-supplied document · Recursive walk over a caller-supplied document has no depth cap · ×1
  • Recursive walk over a caller-supplied document has no depth cap packages/rohd_hierarchy/lib/src/hierarchy_occurrence.dart:120 — `HierarchyOccurrence.fromJson` is public and takes `Map<String, dynamic> json` from its caller, and it calls itself at line 120 (`HierarchyOccurrence.fromJson`) with a piece of `json` — and nowhere in `HierarchyOccurrence.fromJson` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. `jsonDecode` sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws `StackOverflowError` from about 20,000 levels — 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser's stack). That is an `Error`, not an `Exception`: an `on Exception catch` around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through `HierarchyOccurrence.fromJson` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Minor — 52 finding(s)
X10 · Duplicated predicate · Duplicated predicate · ×25
  • Duplicated predicate lib/src/signals/logic.dart:295 — `_parentModule == null || _parentModule == newParentModule` appears character-identically in 2 files — lib/src/signals/logic.dart, lib/src/signals/logic_structure.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate lib/src/values/big_logic_value.dart:86 — `_value == other._value && _invalid == other._invalid` appears character-identically in 2 files — lib/src/values/big_logic_value.dart, lib/src/values/small_logic_value.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/rohd_hierarchy/lib/src/signal_occurrence.dart:228 — `arrayDims != null && arrayDims.isNotEmpty` appears character-identically in 2 files — packages/rohd_hierarchy/lib/src/signal_occurrence.dart, rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart:436 — `assignment.src.isNet && assignment.dst.isNet` appears character-identically in 2 files — lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart, lib/src/synthesizers/systemverilog/systemverilog_synthesis_result.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate rohd_devtools_extension/lib/rohd_devtools/services/in_process_transport.dart:180 — `decoded.containsKey('modules') && !decoded.containsKey(definitionName)` appears character-identically in 3 files — rohd_devtools_extension/lib/rohd_devtools/services/in_process_transport.dart, rohd_devtools_extension/lib/rohd_devtools/services/tree_service.dart, rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate rohd_devtools_extension/lib/rohd_devtools/services/tree_service.dart:98 — `decoded['status'] == 'fail' || decoded['status'] == 'unavailable'` appears character-identically in 2 files — rohd_devtools_extension/lib/rohd_devtools/services/tree_service.dart, rohd_devtools_extension/lib/rohd_devtools/services/vm_service_signal_value_source.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate lib/src/synthesizers/netlist/netlist_module_translation.dart:214 — `element is LogicStructure && element is! BaseLogicArray` appears character-identically in 2 files — lib/src/synthesizers/netlist/netlist_module_translation.dart, lib/src/synthesizers/utilities/synth_structure_layout.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart:105 — `lib.uri != null && lib.uri!.contains('rohd') && lib.uri!.contains('inspector_service')` appears character-identically in 3 files — rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart, rohd_devtools_extension/lib/rohd_devtools/services/web_vm_connection_strategy.dart, rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart:276 — `logic is LogicStructure || logic.parentStructure != null` appears character-identically in 2 files — lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart, lib/src/synthesizers/utilities/synth_module_definition.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate lib/src/synthesizers/netlist/netlist_synthesizer_configuration.dart:133 — `module is Mux || module is FlipFlop || module is Passthrough` appears character-identically in 2 files — lib/src/synthesizers/netlist/netlist_synthesizer_configuration.dart, lib/src/synthesizers/utilities/synth_module_stop_policy.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate lib/src/synthesizers/systemverilog/systemverilog_synthesis_result.dart:50 — `module is SystemVerilog && module.generatedDefinitionType == DefinitionGenerationType.custom` appears character-identically in 2 files — lib/src/synthesizers/systemverilog/systemverilog_synthesis_result.dart, lib/src/synthesizers/systemverilog/systemverilog_synthesizer.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate lib/src/synthesizers/netlist/netlist_module_translation.dart:74 — `module is SystemVerilog && module.generatedDefinitionType == DefinitionGenerationType.none` appears character-identically in 5 files — lib/src/synthesizers/netlist/netlist_module_translation.dart, lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart, lib/src/synthesizers/systemverilog/systemverilog_synthesizer.dart, lib/src/synthesizers/utilities/synth_module_definition.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate rohd_devtools_extension/lib/rohd_devtools/ui/devtools_connection_host.dart:918 — `mounted && dialogContext.mounted && _isConnected` appears character-identically in 2 files — rohd_devtools_extension/lib/rohd_devtools/ui/devtools_connection_host.dart, rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart:1151 — `nextType == null || !modules.containsKey(nextType)` appears character-identically in 3 files — rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart, rohd_devtools_extension/lib/rohd_devtools/services/netlist_evaluator.dart, rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate lib/src/synthesizers/netlist/netlist_passes.dart:40 — `packageRoot != null && SourceTracer.hasTraces` appears character-identically in 2 files — lib/src/synthesizers/netlist/netlist_passes.dart, lib/src/synthesizers/netlist/netlist_synthesizer.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/rohd_waveform/lib/src/waveform_repository.dart:583 — `parentData.isEmpty || parentData.first.data.isEmpty` appears character-identically in 2 files — packages/rohd_waveform/lib/src/waveform_repository.dart, rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate rohd_devtools_extension/lib/rohd_devtools/services/tree_service.dart:375 — `raw == null || raw == 'null' || raw.startsWith('{')` appears character-identically in 2 files — rohd_devtools_extension/lib/rohd_devtools/services/tree_service.dart, rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate lib/src/utilities/systemc_cosim_ffi.dart:318 — `resolvedHome == null || resolvedLib == null` appears character-identically in 2 files — lib/src/utilities/systemc_cosim_ffi.dart, lib/src/utilities/systemc_simcompare.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate lib/src/synthesizers/netlist/netlist_synthesizer.dart:168 — `srcLogic is! BaseLogicArray || dstLogic is! BaseLogicArray` appears character-identically in 2 files — lib/src/synthesizers/netlist/netlist_synthesizer.dart, lib/src/synthesizers/utilities/synth_module_definition.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate lib/src/diagnostics/design_command_shell.dart:350 — `start > 0 && !RegExp(r'\s').hasMatch(input[start - 1])` appears character-identically in 2 files — lib/src/diagnostics/design_command_shell.dart, rohd_devtools_extension/lib/rohd_devtools/ui/rohd_design_shell.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart:128 — `structure == null || structure.modules.isEmpty` appears character-identically in 2 files — rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart, rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart:497 — `synthLogic != null && synthLogic.isArray` appears character-identically in 2 files — lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart, lib/src/synthesizers/utilities/synth_module_definition.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/rohd_devtools_widgets/assets/extension/module_info_helper.js:111 — `!hasFormats && instancePath && instancePath.length > 0` appears character-identically in 2 files — packages/rohd_devtools_widgets/assets/extension/module_info_helper.js, rohd_devtools_extension/shared/module_info_helper.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/rohd_devtools_widgets/assets/extension/module_info_helper.js:115 — `instanceName && instanceName !== moduleName` appears character-identically in 2 files — packages/rohd_devtools_widgets/assets/extension/module_info_helper.js, rohd_devtools_extension/shared/module_info_helper.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/rohd_devtools_widgets/assets/extension/module_info_helper.js:114 — `typeof segment === 'string' && segment.length > 0` appears character-identically in 2 files — packages/rohd_devtools_widgets/assets/extension/module_info_helper.js, rohd_devtools_extension/shared/module_info_helper.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
X7 · Silent fallback defaults · Silent fallback default in catch · ×5
  • Silent fallback default in catch rohd_devtools_extension/lib/rohd_devtools/services/source_navigation_service.dart:579 — `_extractFramesFromMissingTypeError` turns every thrown error into `[]` — a data error becomes a silent behavior change with no trail. Log the error or rethrow it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment at the `catch` or in the `///` doc, and the row stops firing.
  • Silent fallback default in catch rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:627 — `_getWaveformDataWithTimepointsBatch` turns every thrown error into `[]` — a data error becomes a silent behavior change with no trail. Log the error or rethrow it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment at the `catch` or in the `///` doc, and the row stops firing.
  • Silent fallback default in catch rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:816 — `_parseCompactWaveformData` turns every thrown error into `[]` — a data error becomes a silent behavior change with no trail. Log the error or rethrow it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment at the `catch` or in the `///` doc, and the row stops firing.
  • Silent fallback default in catch rohd_devtools_extension/lib/rohd_devtools/services/vm_service_waveform_data_source.dart:724 — `_getWaveformDataWithTimepointsBatch` turns every thrown error into `[]` — a data error becomes a silent behavior change with no trail. Log the error or rethrow it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment at the `catch` or in the `///` doc, and the row stops firing.
  • Silent fallback default in catch rohd_extension/src/source_navigator.ts:417 — `resolveEnclosingSymbol` swallows every exception into `return {}` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
D24 · Comment Value · redundant comment · ×2
  • redundant comment rohd_extension/src/debug_tracker.ts:319 — "Register the tracker factory for Dart debug sessions" repeats the code it sits on: 5 of its 6 words (register, tracker, factory, dart, debug) are already in `context.subscriptions.push(`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment rohd_extension/src/flc_service.ts:107 — ".rohd.json → .flc.json" repeats the code it sits on: 3 of its 3 words (rohd, json, flc) are already in `const fromRohdJson = base.replace(/\.rohd\.json$/i, '.flc.json');`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
D26 · Project Cohesion · Projects may be oversized for their cohesion · ×2
  • Projects may be oversized for their cohesion pubspec.yaml:1 — `(repository root)` (54026 LoC, 363 module-visible types across 43 directories) overshoots its size bounds. 2 of 8 build unit(s) (npm, pub) overshoot their size bounds, lowering Project Cohesion to 5.0/10. Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
  • Projects may be oversized for their cohesion rohd_devtools_extension/pubspec.yaml:1 — `rohd_devtools_extension` (26600 LoC, 158 module-visible types across 12 directories) overshoots its size bounds. 2 of 8 build unit(s) (npm, pub) overshoot their size bounds, lowering Project Cohesion to 5.0/10. Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
D16 · Bus Factor · Off-boarding risk · ×1
  • Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 25 significant file(s) lose their only recent owner: rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart, lib/src/synthesizers/systemc/systemc_synthesis_result.dart, lib/src/utilities/source_tracer.dart, rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart, lib/src/diagnostics/waveform_data_service.dart, lib/src/synthesizers/netlist/netlist_synthesizer.dart, lib/src/utilities/systemc_simcompare.dart, rohd_extension/src/flc_service.ts (+17 more). Pair on, review, or document these before any departure.
D16 · Bus Factor · Further sole-owners (lower concentration) · ×1
  • Further sole-owners (lower concentration) — 2 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold — folded into the bus-factor score and metrics (27 single-owned of 206 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 206 of the 374 production source files in this repository met that bar). They are anonymized user #2 (1 file(s)), anonymized user #3 (1 file(s)) — spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: lib/src/synthesizers/utilities/synth_assignment.dart, lib/src/modules/clkgen.dart.
D20 · ADR Quality · No ADRs found · ×1
  • No ADRs found rohd_devtools_extension/lib/main.dart:28 — 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 `rohd_devtools_extension/lib/main.dart` makes this repository a deployable product (line 28).
D21 · Naming Consistency · `sanitizeSV` spells `SV` where 18 names in the project spell it `Sv` · ×1
  • `sanitizeSV` spells `SV` where 18 names in the project spell it `Sv` lib/src/utilities/sanitizer.dart:20 — 18 of 20 names in project repository.src spell the token `Sv` (18 of 20; unit: names in project repository.src containing `Sv`). Peers: TraceService.singleFileSvLineMaps (lib/src/diagnostics/trace_service.dart:235); TraceService.singleFileSvLineMapsByModule (lib/src/diagnostics/trace_service.dart:245); TraceService.singleFileSvFileMap (lib/src/diagnostics/trace_service.dart:251); TraceService.singleFileSvFileMapByModule (lib/src/diagnostics/trace_service.dart:264); TraceService._singleFileSvPath (lib/src/diagnostics/trace_service.dart:269). Rename to `sanitizeSv`. [rule N6]
D21 · Naming Consistency · `_reservedSVKeywords` spells `SV` where 18 names in the project spell it `Sv` · ×1
  • `_reservedSVKeywords` spells `SV` where 18 names in the project spell it `Sv` lib/src/utilities/sanitizer.dart:160 — 18 of 20 names in project repository.src spell the token `Sv` (18 of 20; unit: names in project repository.src containing `Sv`). Peers: TraceService.singleFileSvLineMaps (lib/src/diagnostics/trace_service.dart:235); TraceService.singleFileSvLineMapsByModule (lib/src/diagnostics/trace_service.dart:245); TraceService.singleFileSvFileMap (lib/src/diagnostics/trace_service.dart:251); TraceService.singleFileSvFileMapByModule (lib/src/diagnostics/trace_service.dart:264); TraceService._singleFileSvPath (lib/src/diagnostics/trace_service.dart:269). Rename to `_reservedSvKeywords`. [rule N6]
D34 · Knowledge Freshness · Orphaned files with no living knowledge · ×1
  • Orphaned files with no living knowledge — 1 of 206 analysed file(s) have no living knowledge left — their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 206 of the 374 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each — most significant first: lib/src/values/random_logic_value.dart. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway.
D34 · Knowledge Freshness · Orphaned file · ×1
  • Orphaned file lib/src/values/random_logic_value.dart:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
IC1 · Incompleteness & stubs · Member throws UnsupportedError · ×1
  • Member throws UnsupportedError lib/src/signals/wire_net.dart:252 — `_addParent`'s body only throws an UnsupportedError or an UnimplementedError that gives its reason — sometimes a deliberate refusal, often an unfinished stub. Confirm it's intentional.
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.
P2 · Observability · Logging is not universal · ×1
  • Logging is not universal — Only 3/7 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `packages/rohd_devtools_widgets`, `packages/rohd_hierarchy`, `packages/rohd_source_navigator`, `packages/rohd_waveform`.
P3 · Security & performance tooling · No SAST · ×1
  • No SAST REDACTED:6 — No static application security testing detected. For this repository's stack, add the Dart analyzer's security lints plus `semgrep --config=auto` as a CI step. What was searched, so you can tell an absence from a miss: the 5 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.
P3 · Security & performance tooling · No dependency-update automation · ×1
  • No dependency-update automation rohd_extension/package.json:104 — `rohd_extension/package.json` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`.
R7 · Dead Code · Unused export 'getDtdUri' · ×1
  • Unused export 'getDtdUri' rohd_extension/src/debug_tracker.ts:302 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'getVmServiceUri' · ×1
  • Unused export 'getVmServiceUri' rohd_extension/src/debug_tracker.ts:308 — Nothing imports this binding — it is safe to review for removal.
Minor — 1 finding(s)
D12 · Dependency Hygiene · Outdated (npm) · ×1
  • Outdated (npm): ws — ws is pinned at 8.21.3; registry.npmjs.org publishes 8.23.0 as the latest release. Upgrading is a judgement call — read that package's changelog for what changed between the two — but a direct production dependency several releases behind is where security and compatibility debt accumulates silently.

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 --log-opts "--full-history --all --skip=0 --max-count=200" --report-format json --report-path /tmp/watchdog-gitleaks-f8d6730b76b04bc583e76330e40c7242/history.json --exit-code 0 --source .0artifacts/raw/gitleaks-history.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=200 --max-count=211" --report-format json --report-path /tmp/watchdog-gitleaks-f8d6730b76b04bc583e76330e40c7242/history-1.json --exit-code 0 --source .0artifacts/raw/gitleaks-history-1.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-f8d6730b76b04bc583e76330e40c7242/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 .37artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** .1artifacts/raw/trivy-fs.json
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—
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 Dependenciestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** .0artifacts/raw/trivy-fs.json

Run 01a1eb2e-1a02-72a1-8603-62bbfd6f9387 · 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