Public report of RealityRipple/Lime-Seed-Media-Player, published 21 October 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.10.5). Watchdog 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, 21 October 2026, 17:07 UTC Β· Survey ID cd_9eaba0f55d8045f19d2545609c284d69

RealityRipple/Lime-Seed-Media-Player

Measured 21 October 2026, 17:06 UTC, at code version 0e0e083

Test distribution is not measured: No automated tests.

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

CAI score 29out of 100 Provisional Down 3 since the last survey

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

A medium codebase: 41,214 lines of product code in 6 projects, tests not counted Β· Estimated rebuild effort: about 0.3 person-years Β· Weakest lens: Production Readiness, 10

Findings by how serious they are

65 critical 547 serious 58 minor

6 dimensions are left out of the score. For each one, Watchdog either couldn't measure it in this code, or found no evidence of the safeguard it looks 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

Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
21 October 2026, 17:06 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 Watchdog. It is open to any tool that implements it, and today Watchdog is the only one that does.

The code didn't build, so the score is provisional
Watchdog couldn't build the code: the build stopped with 1 error. The dimensions that need a working build, such as complexity, duplication and dead code, were measured on an incomplete picture of the code, so their grades and the score are provisional. Fix the build errors and run the survey again for a final score. The first errors: BC30002: Type 'Seed.clsRIFF.WAVFormatTag' is not defined.

The score is deterministic, which means the same code always gets the same score. Watchdog works 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 β–Έ

54of 59 dimensions measured by tools. The other 5 are advisory notes from an AI model, which explain the code but don't count towards the score.
652of 670 findings point to an exact file and line, so you can open each one in the code. The other 18 concern the repository as a whole, such as missing documentation.
59dimensions across 5 lenses, read from 41,214 lines of product code in 6 projects.
Chapters

Executive summary

RealityRipple/Lime-Seed-Media-Player scores 29 out of 100, but the score is provisional because the code didn't build, so the ratings below may change once it does. The project hasn't declared a stable release yet, so its lenses are rated against a lower bar than a released product's, while the score itself is worked out as for any repository.

The weakest lens counts most in the score, and here that is Production Readiness, which scores 10 and is rated Critical. Its Code Coverage dimension scores 0 out of 10, and until that reaches 4, Production Readiness can't be rated higher than Adequate. The first actions are to resolve the 3 Leaked secret finding(s) in Secret Scanning and to resolve the 1 No automated tests finding(s) in Code Coverage, and if Production Readiness rose to 70, the score would rise from 29 to about 45.

65 findings are critical: 58 in Explicit Debt, three in Secret Scanning, three in Secrets (history) and one in Code Coverage.

Watchdog couldn't measure 4 dimensions in this code, among them Dependency Hygiene, License Compliance and IL Efficiency, so they are left out of the score. The product code is 41,214 lines, which would take an estimated 0.3 person-years, around €37,000, to rebuild.

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

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

If Production Readiness rose from 10 to 70, the lowest score rated Strong, the score would rise from 29 to about 45.

Code composition: what the lines of code are
Business logic 5%Supporting code 22%Generated by tools 73%
New since the last survey: 5 findings

These 5 critical or serious findings weren't in the previous survey, on 6 October 2026.

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

Fixed since the last survey: 2 findings

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

  • Code Duplication Β· Duplicated block (8 lines × 6) Seed/Headers/clsMPEG.vb
  • Coupling Β· Off the main sequence: Seed
Rebuild cost: about €37,000 Β· Estimate
Cost to rebuild€12,000 to €61,000, for 203 to 643 hours of work, about 0.3 person-years for one engineer
Difficulty of the problemStandard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor×0.7 at a score of 29. 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: 41,214 lines of product code
Comment linesThe estimate prices 40,557 lines. Comment lines count towards the size of 41,214 lines but aren't priced as work.

How the estimate is made: Watchdog prices 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.

Top priorities

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

1
Resolve the 3 Leaked secret finding(s) in Secret Scanning β€” start with REDACTED, REDACTED, REDACTED.
Raises the score by about 19 points Β· Low effort Β· Secret Scanning
2
Resolve the 1 No automated tests finding(s) in Code Coverage.
Raises the score by about 15 points Β· Low effort Β· Code Coverage
3
Resolve the 1 No tests found finding(s) in Test Distribution.
Raises the score by about 15 points Β· Low effort Β· Test Distribution

Diagnosis: what the measurements show together

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

If you do one thing first Β· First action
Fix the build. The code didn't build, so the dimensions that need a working build were measured on an incomplete picture of the code, and every grade in this report is provisional. Once the build works, the next survey gives a final score. The compiler's first errors: BC30002: Type 'Seed.clsRIFF.WAVFormatTag' is not defined.
Based on: Solution Shape
Where the investment is most exposed Β· Value at risk
This code would cost about €37,000 to build again, about 0.3 person-years of work. Its weakest lens is Production Readiness, at 10 (Critical). Production Readiness is about whether the product is ready to run in production and to change without breaking. Because the weakest lens counts most in the score, work on Production Readiness also moves the score most.
Based on: the rebuild estimate · the Production Readiness grade · how much each lens counts
What to do: Start with the Production Readiness actions in Top priorities.
What hard-to-read code costs each year Β· Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 5.8 out of 10. Code at that level is slower to change than clean code, and Watchdog estimates the extra work at 6% to 12% on every change.
How this is estimated: It rests on an assumption of Watchdog's 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. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4)
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 β€” a layering smell or cycle. A clean layered graph has none.

arch FFDShowAPI_2010 FFDShowAPI_2010 GreenThumb GreenThumb LSFA LSFA LimeSeed LimeSeed LimeSeed->FFDShowAPI_2010 Seed Seed LimeSeed->Seed LimeThumbViewer LimeThumbViewer

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 5 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 FFDShowAPI.Interfaces2 GreenThumb3 GreenThumb.My4 LSFA5 LSFA.My6 LimeSeed.TaskbarLib7 Microsoft.VisualBasic8 Seed9 Seed.My10 WindowsApplication111 WindowsApplication1.My12 FFDShowAPI13 LimeSeed14 LimeSeed.My
1 FFDShowAPI.Interfaces
2 GreenThumb
3 GreenThumb.My
4 LSFA
5 LSFA.My
6 LimeSeed.TaskbarLib
7 Microsoft.VisualBasic
8 Seed
9 Seed.My
10 WindowsApplication1
11 WindowsApplication1.My
12 FFDShowAPI5
13 LimeSeed291
14 LimeSeed.My5
Uses a module listed above itPart of a loopThe module itself
1 FFDShowAPI.Interfaces2 GreenThumb3 GreenThumb.My4 LSFA5 LSFA.My6 LimeSeed.TaskbarLib7 Microsoft.VisualBasic8 Seed9 Seed.My10 WindowsApplication111 WindowsApplication1.My12 FFDShowAPI13 LimeSeed14 LimeSeed.MyFFDShowAPI.Interfaces1GreenThumb2GreenThumb.My3LSFA4LSFA.My5LimeSeed.TaskbarLib6Microsoft.VisualBasic7Seed8Seed.My9WindowsApplication110WindowsApplication1.My11FFDShowAPI12LimeSeed13LimeSeed.My1452915

At a glance β€” Code Health Β· 59% Β· Adequate Β· gated by D1, D2, D18, X3 Β·

At a glance β€” Architecture Β· 91% Β· Exemplary Β·

At a glance β€” Maturity Β· 20% Β· Weak Β· gated by M1, M2, M4 Β·

At a glance β€” Readiness Β· 10% Β· Critical Β· gated by D8, D9, D13, P1, P3 Β·

At a glance β€” Security Β· 85% Β· 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
A07:2025 β€” Authentication Failures6High / Critical

Roadmap

Immediately resolve the three leaked secrets in REDACTED, REDACTED, and REDACTED to secure the codebase. Establish a CI workflow to build and run tests on every push, which will simultaneously address the lack of automated tests, test distribution, and architectural decision records.

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

Do thisHelpsEffortDimension
Resolve the 3 Leaked secret finding(s) in Secret Scanning β€” start with REDACTED, REDACTED, REDACTED.+19.5 ptsLowSecret Scanning
Resolve the 1 No automated tests finding(s) in Code Coverage.+15.0 ptsLowCode Coverage
Resolve the 1 No tests found finding(s) in Test Distribution.+15.0 ptsLowTest Distribution
Resolve the 1 No ADRs found finding(s) in ADR Quality.+6.5 ptsLowADR Quality
Add a CI workflow that builds and runs the test suite on every push/PR.+4.8 ptsMediumCI/CD gates
Improve Documentation Quality β€” currently 3.0/10.+4.6 ptsMediumDocumentation Quality
Add a root README: what the system is, how to build/run it, and a map of the projects.+4.4 ptsMediumDocumentation (README)
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.+4.4 ptsMediumArchitecture documentation

File quality

Per-file score 0–10 β€” a quality signature. Of 42 files carrying findings, judged against the Preview bar: 17% slop Β· 35% mixed Β· 48% near-clean.

FileScoreBandWorst signal
LimeSeed/Forms/frmMain.vb1.0SlopExplicit Debt: EmptyCatchBlock
Seed/Headers/clsID3v2.vb1.0SlopExplicit Debt: EmptyCatchBlock
FFAPI/FFDShowAPI.cs1.0SlopExplicit Debt: EmptyCatchBlock
LimeSeed/Forms/frmSettings.vb1.9SlopExplicit Debt: EmptyCatchBlock
Seed/ctlSeed.vb2.2SlopExplicit Debt: EmptyCatchBlock
LimeSeed/Modules/modFuncts.vb2.5SlopExplicit Debt: EmptyCatchBlock
LimeSeed/Classes/clsTaskBarLib.vb2.9SlopExplicit Debt: EmptyCatchBlock
GreenThumb/GreenThumbnailProperties.vb3.4MixedExplicit Debt: EmptyCatchBlock
REDACTED4.4MixedSecret Scanning: Leaked secret: REDACTED
REDACTED4.4MixedSecret Scanning: Leaked secret: REDACTED
REDACTED4.4MixedSecret Scanning: Leaked secret: REDACTED
LimeSeed/Forms/frmProps.vb4.6MixedExplicit Debt: EmptyCatchBlock
LimeSeed/Controls/ctlRipper.vb4.6MixedExplicit Debt: EmptyCatchBlock
LimeSeed/Classes/clsToolStripSystemRenderer.vb4.6MixedExplicit Debt: EmptyCatchBlock
Seed/Headers/clsID3v1.vb4.7MixedExplicit Debt: EmptyCatchBlock
LimeSeed/Forms/frmFullScreen.vb4.7MixedExplicit Debt: EmptyCatchBlock
Seed/modFuncts.vb4.7MixedExplicit Debt: EmptyCatchBlock
LimeSeed/Classes/clsRadioMenu.vb5.5MixedCognitive Complexity: ToolStripRadioButtonMenuItem.OnPaint (cognitive 20)
FFAPI/FFDShowReceiver.cs5.8MixedExplicit Debt: EmptyCatchBlock
LSFA/modAssoc.vb6.0MixedExplicit Debt: TodoComment

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 β€” 65

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 β€” 547

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 β€” 58

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

Could not be resolved β€” 6

Something this survey could not settle from the outside, and which could be critical or serious. Either a control was required and no positive evidence of it exists in the repository β€” a backup job that nothing shows was ever restored from proves nothing about restores β€” or our own analysis could not run over that part of the tree. This is not a clean result. These are excluded from the score rather than awarded a pass, so the number on the cover neither rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each one is named under Limitations.

Methodology & how to trust this report

Watchdog is a deep, periodic assessment β€” run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. 54 of 59 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 5 documentation/naming judgement(s) are LLM-assisted and labelled advisory. Overall confidence is 0.8 β€” the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.

Every figure here is one of three kinds, and we label which: βœ“ Measured β€” a deterministic fact (LoC, complexity, coverage); ~ Modeled β€” an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact; ◐ Advisory β€” an LLM prose judgement. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): βœ“ Tool-verified means the property itself was measured across the surface; β—‹ Nothing flagged means the probes came back clean β€” a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence β€” absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10; ◐ Sampled Β· advisory marks an LLM verdict over a bounded sample β€” advisory, never a deterministic measurement.

What we checked β€” 59 dimensions across the health lenses
D1D2D3D4D5D6D8D9D13D15D17D18D19D20D21D24D26D27D28D29D35AX10AX3AX4AX5AX6GD1IC1M1M2M3M4P1P2P3P6X1X12X13X14X15X16X17X18X19X20X21X22X23X24X25X26X27X28X29X3X30X32X4

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, 652 of 670 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, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled Β· advisory β€” 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
Watchdog 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
LLM (sampled · advisory)Documentation quality, ADR conformance, naming β€” sampled over a bounded sample; advisory, never a deterministic measurementLocal LLM◐ LLM Β· sampled Β· advisory

Every finding is locatable in findings.md. Run 01a15f6d-4bd3-7c87-be45-16370a0d8e56.

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

Run transparency β€” what happened this run

What ran differently this time β€” a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.

  • D12 Dependency Hygiene β€” not measured this run β€” Watchdog could not measure this here. That is a gap on our side β€” a collector, parser or image we have not built yet β€” and it is neither a defect in this repository nor evidence that the check would have passed. `dotnet list package` did not return usable output (restore or query failed); no outdated/vulnerable/deprecated data to assess. The tool said: `dotnet list package` exited 1 with no output.
  • D14 License Compliance β€” not measured this run β€” Watchdog could not measure this here. That is a gap on our side β€” a collector, parser or image we have not built yet β€” and it is neither a defect in this repository nor evidence that the check would have passed. License scan produced no result β€” the tool ran but wrote no JSON report (no package reference resolved); the offline NuGet fallback resolved nothing.
  • D15 Churn × Complexity Hotspots β€” measured, with a gap in what it reached β€” This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. Git history depth insufficient β€” this repository has 21 commit(s), too few for a reliable trend signal. The clone is complete, so there is no deeper history to fetch: the signal returns as the project accumulates history.
  • D16 Bus Factor β€” not measured this run β€” This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. Single-contributor repository β€” bus factor is not applicable (1 contributor(s) across 21 commit(s) sampled, automation and bot accounts excluded). Concentration needs a team to concentrate: with one contributor there is nobody to spread the knowledge to, so there is nothing here for the owner to act on.
  • D17 Explicit Debt β€” measured, with a gap in what it reached β€” Watchdog measured this, but not all of it. What it 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. The C# workspace loaded this repository's projects but reported a load failure, and the dead-code reference search is unreliable over a graph that did not load cleanly, so it was skipped. The other debt markers on this row were read; dead symbols were not, and their absence from the score is not a finding that the code has none. First load diagnostic: Failure: Msbuild failed when processing the file 'FFAPI/FFDShowAPI_2010.csproj' with message: Could not find rule set file "AllRules.ruleset".
  • D22 Internal API Consistency β€” not measured this run β€” This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. The loaded project set declares no packable project and no `.Contracts` project, so there is no intentionally-exposed surface for API consistency to be judged over.
  • D23 Boundary Type-Coupling β€” not measured this run β€” Watchdog could not measure this here. That is a gap on our side β€” a collector, parser or image we have not built yet β€” and it is neither a defect in this repository nor evidence that the check would have passed. Large codebase (41,214 production LoC in the .NET projects) with no declared bounded contexts β€” cross-boundary type coupling is unassessed Bounded contexts cannot be inferred from a codebase that is not physically organised by them (D-321), so with none declared there are no boundaries for the coupling pass to measure across. You can widen what we reach: name this codebase's bounded contexts (β‰₯2 module groups, e.g. per subsystem) so cross-boundary type coupling can be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it β€” e.g. `architecture:` β†’ `contexts:` β†’ `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
  • D34 Knowledge Freshness β€” not measured this run β€” This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. Too few commits to judge knowledge freshness (21 commit(s) sampled).
  • D35 Change Coupling β€” measured, with a gap in what it reached β€” This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. Git history depth insufficient β€” this repository has 21 commit(s), too few for a reliable change-coupling signal. The clone is complete, so there is no deeper history to fetch: the signal returns as the project accumulates history.
  • D39 IL Efficiency β€” not measured this run β€” Watchdog could not measure this here. That is a gap on our side β€” a collector, parser or image we have not built yet β€” and it is neither a defect in this repository nor evidence that the check would have passed. IL NOT MEASURED: the analyzer's own build of this repository failed for an ENVIRONMENT reason (exit 1) β€” MSBuild's engine or the CLR gave up, or our image does not carry the SDK band/targeting pack this repository needs. This is OUR limitation, not a defect in the repo, and it is not a statement that this repository fails to build. D18 owns the question of whether this repository builds; it was not answered here.
  • D44 Platform End-of-Life β€” not measured this run β€” Watchdog could not measure this here. That is a gap on our side β€” a collector, parser or image we have not built yet β€” and it is neither a defect in this repository nor evidence that the check would have passed. This dimension reads a project's own statement about the platform it runs on: a TargetFramework in a .NET project file, a .nvmrc or .python-version, a capped requires-python, a Rust toolchain file or Cargo.toml rust-version, a .go-version, .java-version, .ruby-version, .tool-versions or .sdkmanrc, a go.mod go directive, a Maven or Gradle Java level or toolchain, a Gemfile's ruby directive, a mix.exs elixir requirement, a rebar.config minimum_otp_vsn, a pubspec.yaml SDK constraint, a build.sbt scalaVersion, or a framework major pinned by a dependency constraint. This repository carries none of them, so nothing about its platform was established. That is a gap in this analyzer's coverage, NOT a finding that the platform is supported β€” a language whose runtime is declared elsewhere (Package.swift, a Dockerfile) is simply not read here yet.
  • IC1 Incompleteness & stubs β€” measured, with a gap in what it reached β€” Watchdog measured this, but not all of it. What it 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. 25 further occurrence(s) are not listed individually; the score already reflects all 65.
  • 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

Watchdog assesses the repository exactly as committed, and only the repository. By design it does not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap β€” a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.

Per-dimension blind spots

For each dimension that was measured, what a static, repo-only scan structurally cannot see β€” the honest edge of the measurement, not a failure of it.

  • D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically β€” it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
  • D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
  • D3 God Classes: "God class" is sized by members and responsibilities visible in the type β€” a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module β€” one class/IIFE β€” earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
  • D4 Code Duplication: Duplication is token-similarity β€” an in-process token-stream comparison over sliding windows, with type-aware normalization β€” so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED β€” its repetition is the tool's, not the team's β€” so the score reflects hand-written duplication only.
  • D5 Coupling: Coupling is measured between projects/assemblies β€” runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
  • D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic β€” it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
  • D8 Code Coverage: Coverage is measured by building and running the test suite inside Watchdog's isolated image β€” the target repo is never modified, and nothing on your systems runs. So coverage exists only when the suite builds and runs within the inline time budget; one that needs external services, can't build, or exceeds the budget yields no coverage (D8 then degrades to not-measured, not a low score). Line coverage also says nothing about assertion quality.
  • D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals β€” a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
  • D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree β€” a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
  • D15 Churn × Complexity Hotspots: Churn hotspots come from git history β€” a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
  • D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual β€” undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded β€” it is never the team's dead code to delete.
  • D18 Solution Shape: Build integrity reflects whether the solution compiled in this environment β€” a build that needs a private feed, a specific SDK, or a generated file absent from the repo can read as broken when it is merely unreproducible here.
  • D19 Documentation Quality: Documentation quality is judged by an LLM over a bounded sample of docs β€” it reads what is written, not whether the docs match the running system, and it is advisory, not a measurement. Its critique rows are drawn from a closed category vocabulary and each row means the same thing in every run, so two scans can be compared row by row; the SET that fires is still a sample, and does not repeat exactly. Measured on one frozen input, six scans at one engine SHA: 2-5 critique rows per scan, 8 distinct rows across the six, 3 of those 8 seen in only one scan. So a D19 row is evidence about the documentation, but a COUNT of D19 rows is not a quantity β€” never read a change in it as an improvement or a regression.
  • D20 ADR Quality: ADR quality is an LLM read of the decision records present β€” it cannot know about decisions made and never recorded, and its verdict is sampled and advisory.
  • D21 Naming Consistency: Naming quality is an LLM judgement over a bounded sample β€” it assesses clarity/consistency of the names it sees, not domain-correctness, and is advisory.
  • D24 Comment Value: Comment value (WHY vs WHAT) is an LLM judgement over a bounded sample β€” it is advisory and cannot weigh a comment against the precise code change it was written to explain.
  • D26 Project Cohesion: Project focus is sized from members/namespaces per project β€” a project that is broad by deliberate design reads the same as one that has sprawled.
  • D27 Navigability: Indirection/navigability is structural β€” it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
  • D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns β€” a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
  • D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) β€” it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
  • D35 Change Coupling: Change coupling is co-change in COMMITS β€” files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
  • AX10 Code composition: Role is inferred from namespace/folder convention, not semantics β€” a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
  • M4 Documentation accuracy: Onboarding quality is an LLM read of the docs/setup present β€” it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
  • P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) β€” controls configured in external tooling, with no in-repo trace, cannot be credited.

The LLM boundary

LLM-set scores this run (5): D19, D21, D24, D26, M4 (model: Local LLM). For these, a model reads a bounded sample and sets the numeric score; each names its own sample and method on its card. They are sampled and advisory by design: they vary at the margins between runs and are never a deterministic measurement. Every other score in this report is tool-computed at confidence 1.0.

Dimensions

D1 Β· Cyclomatic Complexity3.1 / 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 3.1 / 10 Β· rule-coverage 100% Β· ceiling Prevented

104 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was PropertyHandler.LoadRIFF at 188. A further 25 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 modFuncts.AVIVideoCodecs at 293 β€” they are counted neither in the figure above nor in this dimension's score.

modFuncts.GetMKVDisplaySize (cyclomatic 20) Β· Γ—2LimeSeed/Modules/modFuncts.vb:241
PropertyHandler.LoadRIFF (cyclomatic 188)GreenThumb/GreenThumbnailProperties.vb:346
frmMain.tmrUpdate_Tick (cyclomatic 153)LimeSeed/Forms/frmMain.vb:4971
frmMain.CleanupID3 (cyclomatic 143)LimeSeed/Forms/frmMain.vb:6348
frmProps.LoadRIFF (cyclomatic 134)LimeSeed/Forms/frmProps.vb:815

+ 98 more group(s) β€” more in Appendix A; the complete list is findings.md.

What to do

  1. Bring the 5 bodies over 120 down to 120 or less in Cyclomatic Complexity β€” start with PropertyHandler.LoadRIFF (cyclomatic 188), frmMain.tmrUpdate_Tick (cyclomatic 153), frmMain.CleanupID3 (cyclomatic 143). β€” 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 5 together lifts Cyclomatic Complexity from 3.1 to about 4.0/10, projected with the scoring formula itself and assuming each lands exactly at 120; a cleaner split scores higher.
  2. Stand up a CI pipeline, then gate Cyclomatic Complexity in it to reach Verified (currently Documented). β€” This repository has no CI pipeline, so there is nothing to add a gate to yet β€” the pipeline comes first. Hardens enforcement from Documented toward Prevented β€” provenance only; does not change the score.

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

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

194 method(s) exceeded the cognitive complexity threshold of 15; the worst was PropertyHandler.LoadRIFF at 578.

modFuncts.GetMKVDisplaySize (cognitive 57) Β· Γ—2LimeSeed/Modules/modFuncts.vb:241
Connection.AsyncEventCompleted (cognitive 36) Β· Γ—2LimeSeed/Classes/clsSocket.vb:297
modFuncts.CheckMPEG (cognitive 20) Β· Γ—2LimeSeed/Modules/modFuncts.vb:198
clsVorbis.FindLONG (cognitive 19) Β· Γ—2Seed/Headers/clsVorbis.vb:830
PropertyHandler.LoadRIFF (cognitive 578)GreenThumb/GreenThumbnailProperties.vb:346

+ 185 more group(s) β€” more in Appendix A; the complete list is findings.md.

What to do

  1. Bring the 194 bodies over 15 down to 15 or less in Cognitive Complexity β€” start with PropertyHandler.LoadRIFF (cognitive 578), frmMain.tmrUpdate_Tick (cognitive 545), frmMain.CleanupID3 (cognitive 397). β€” 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 194 together lifts Cognitive Complexity from 2.0 to about 10.0/10, projected with the scoring formula itself and assuming each lands exactly at 15.
  2. Stand up a CI pipeline, then gate Cognitive Complexity in it to reach Verified (currently Documented). β€” This repository has no CI pipeline, so there is nothing to add a gate to yet β€” the pipeline comes first. Hardens enforcement from Documented toward Prevented β€” provenance only; does not change the score.

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

D3 Β· God Classes7.1 / 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.1 / 10 Β· rule-coverage 100% Β· ceiling Prevented

98 god class(es) detected.

MethodTooLong: clsRIFF.New(…) Β· Γ—61Seed/Headers/clsRIFF.vb:823
FileTooLong: Forms/frmMain.vb Β· Γ—19LimeSeed/Forms/frmMain.vb
ClassTooLong: clsRIFF Β· Γ—10Seed/Headers/clsRIFF.vb
TooManyMethods: frmMain Β· Γ—8LimeSeed/Forms/frmMain.vb

What to do

  1. Resolve the 61 MethodTooLong finding(s) in God Classes β€” start with frmMain.vb (14), frmProps.vb (8), modAssoc.vb (5). β€” One of this dimension's main actionable groups (61 warning-level).
  2. Resolve the 19 FileTooLong finding(s) in God Classes β€” start with modFuncts.vb (2), frmMain.vb, clsID3v2.vb. β€” One of this dimension's main actionable groups (19 warning-level).
  3. Resolve the 10 ClassTooLong finding(s) in God Classes β€” start with clsRIFF.vb, clsMKV.vb, modAssoc.vb. β€” One of this dimension's main actionable groups (10 warning-level).
  4. Stand up a CI pipeline, then gate God Classes in it to reach Verified (currently Documented). β€” This repository has no CI pipeline, so there is nothing to add a gate to yet β€” the pipeline comes first. Hardens enforcement from Documented toward Prevented β€” provenance only; does not change the score.

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

D4 Β· Code Duplication8.7 / 10Strongβœ“ Tool-verified

What it measures: Copy-pasted code that should be shared instead.

Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.

Maturity: Documented β†’ Verified β†’ Prevented Β· effective 8.7 / 10 Β· rule-coverage 100% Β· ceiling Verified

112 duplicated block group(s) detected. A further 4 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted.

Duplicated block (5 lines × 2) Β· Γ—14Seed/Headers/clsMPEG.vb:99
Duplicated block (7 lines × 2) Β· Γ—12LimeSeed/Forms/frmAbout.vb:122
Duplicated block (6 lines × 2) Β· Γ—10LimeSeed/Forms/frmMain.vb:221
Duplicated block (8 lines × 2) Β· Γ—6LimeSeed/Classes/clsRadioMenu.vb:155
Duplicated block (9 lines × 2) Β· Γ—6LimeSeed/Controls/ctlRipper.vb:200

+ 47 more group(s) β€” more in Appendix A; the complete list is findings.md.

What to do

  1. Resolve the 14 Duplicated block (5 lines × 2) finding(s) in Code Duplication β€” start with clsRadioMenu.vb (2), clsToolStripSystemRenderer.vb (2), ctlRipper.vb (2). β€” One of this dimension's main actionable groups (14 warning-level).
  2. Resolve the 12 Duplicated block (7 lines × 2) finding(s) in Code Duplication β€” start with clsSocket.vb (3), frmMain.vb (2), frmAbout.vb. β€” One of this dimension's main actionable groups (12 warning-level).
  3. Resolve the 10 Duplicated block (6 lines × 2) finding(s) in Code Duplication β€” start with frmProps.vb (6), clsToolStripSystemRenderer.vb (2), frmMain.vb. β€” One of this dimension's main actionable groups (10 warning-level).
  4. Stand up a CI pipeline, then gate Code Duplication in it to reach Verified (currently Documented). β€” This repository has no CI pipeline, so there is nothing to add a gate to yet β€” the pipeline comes first. Hardens enforcement from Documented toward Verified β€” provenance only; does not change the score.

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

D5 Β· Coupling10.0 / 10Exemplaryβœ“ Tool-verified

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

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

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

Maturity: Documented β†’ Verified β†’ Prevented Β· effective 10.0 / 10 Β· rule-coverage 100% Β· ceiling Prevented

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

βœ“ On the Gold path β€” maintain.

Detailed fixes: d5_recommendation.md.

D6 Β· Cohesion (LCOM4)9.3 / 10Stronggated by 3 serious findingsβœ“ Tool-verified

What it measures: Whether a class's methods are focused on a single responsibility.

Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.

Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class β€” the population is all types, not a name convention.

Maturity: Documented β†’ Verified β†’ Prevented Β· effective 9.3 / 10 Β· rule-coverage 100% Β· ceiling Verified

3 of 53 classes have LCOM4 above 3.

Low cohesion: ToolStripRadioButtonMenuItem (LCOM4 6) Β· Γ—3LimeSeed/Classes/clsRadioMenu.vb:5

What to do

  1. Resolve the 3 Low cohesion finding(s) in Cohesion (LCOM4) β€” start with clsRadioMenu.vb, frmMain.vb, clsID3v2.vb. β€” One of this dimension's main actionable groups (3 warning-level).
  2. Stand up a CI pipeline, then gate Cohesion (LCOM4) in it to reach Verified (currently Documented). β€” This repository has no CI pipeline, so there is nothing to add a gate to yet β€” the pipeline comes first. Hardens enforcement from Documented toward Verified β€” provenance only; does not change the score.

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

D8 Β· Code Coverage0.0 / 10Criticalβœ“ Tool-verified

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

Method: Coverage from coverlet runs or committed reports (Cobertura/OpenCover/lcov), computed per-file with structured exclusions for generated, trivial, and glue code. When the suite can't be built/run in-image AND no report is committed, coverage is reported NOT-MEASURED (excluded from the score) with the precondition to make it measurable β€” never a LoC-ratio proxy folded in as if measured. Deterministic.

Maturity: Documented β†’ Verified β†’ Prevented Β· effective 0.0 / 10 Β· rule-coverage 100% Β· ceiling Verified

No automated tests β€” no test code was found in this repository.

No automated tests

What to do

  1. Resolve the 1 No automated tests finding(s) in Code Coverage. β€” One of this dimension's main actionable groups (1 issue-level).
  2. Stand up a CI pipeline, then gate Code Coverage in it to reach Verified (currently Documented). β€” This repository has no CI pipeline, so there is nothing to add a gate to yet β€” the pipeline comes first. Hardens enforcement from Documented toward Verified β€” provenance only; does not change the score.

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

D9 Β· Test Distribution0.0 / 10Criticalβœ“ Tool-verified

What it measures: Whether the test suite has a healthy mix of unit / integration / end-to-end tests.

Method: Test projects classified (Unit/Integration/BDD/E2E) from compiled metadata; test methods counted exhaustively across projects with placement-agnostic disk fallback. Deterministic.

Maturity: Documented β†’ Verified β†’ Prevented Β· effective 0.0 / 10 Β· rule-coverage 100% Β· ceiling Documented

No test suite found.

No tests found

What to do

  1. Resolve the 1 No tests found finding(s) in Test Distribution. β€” One of this dimension's main actionable groups (1 recommendation-level).

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

D13 Β· Secret Scanning0.0 / 10Criticalβœ“ Tool-verified

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

3 secret(s) detected.

REDACTED

What to do

  1. Resolve the 3 Leaked secret finding(s) in Secret Scanning β€” start with REDACTED, REDACTED, REDACTED. β€” One of this dimension's main actionable groups (3 issue-level).
  2. Stand up a CI pipeline, then gate Secret Scanning in it to reach Verified (currently Documented). β€” This repository has no CI pipeline, so there is nothing to add a gate to yet β€” the pipeline comes first. Hardens enforcement from Documented toward Prevented β€” provenance only; does not change the score.

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

D15 Β· Churn × Complexity Hotspots10.0 / 10Exemplaryβœ“ Tool-verified

What it measures: Files that change often and are also complex β€” the riskiest hotspots.

Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.

Maturity: Documented β†’ Verified β†’ Prevented Β· effective 10.0 / 10 Β· rule-coverage 100% Β· ceiling Documented

No churn × complexity hotspots in the window.

βœ“ On the Gold path β€” maintain.

Detailed fixes: d15_recommendation.md.

D17 Β· Explicit Debt7.1 / 10Adequategated by 58 critical findingsβœ“ Tool-verified

What it measures: Acknowledged debt left in the code β€” TODOs, dead code, suppressed warnings.

Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.

Maturity: Documented β†’ Verified β†’ Prevented Β· effective 7.1 / 10 Β· rule-coverage 100% Β· ceiling Prevented

81 deducted debt markers + unmeasured dead symbols across 41214 LoC in the .NET projects (1.4/KLoC) β†’ score 7.1. Dead code not measured: the solution did not load cleanly, so the reference search was skipped.

EmptyCatchBlock Β· Γ—58FFAPI/FFDShowAPI.cs:1740
TodoComment Β· Γ—16FFAPI/FFDShowAPI.cs:1964
CommentedOutCode Β· Γ—5FFAPI/FFDShowAPI.cs:1243
BarePragmaDisable Β· Γ—2FFAPI/FFDShowAPI.cs:72

What to do

  1. Resolve the 58 EmptyCatchBlock finding(s) in Explicit Debt β€” start with frmMain.vb (27), ctlSeed.vb (7), modFuncts.vb (5). β€” One of this dimension's main actionable groups (58 issue-level).
  2. Resolve the 16 TodoComment finding(s) in Explicit Debt β€” start with frmMain.vb (7), clsSocket.vb (4), modAssoc.vb (2). β€” One of this dimension's main actionable groups (16 warning-level).
  3. Resolve the 5 CommentedOutCode finding(s) in Explicit Debt β€” start with FFDShowAPI.cs (3), FFDShowReceiver.cs, IffdshowDecVideo.cs. β€” One of this dimension's main actionable groups (5 warning-level).
  4. Stand up a CI pipeline, then gate Explicit Debt in it to reach Verified (currently Documented). β€” This repository has no CI pipeline, so there is nothing to add a gate to yet β€” the pipeline comes first. Hardens enforcement from Documented toward Prevented β€” provenance only; does not change the score.

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

D18 Β· Solution Shape3.0 / 10Weakβœ“ Tool-verified

What it measures: Whether the solution is laid out in a sensible, conventional structure.

Method: Solution structure: project count, decomposition, shell-project detection, build success (confirmed failures cap the score); traced to actual .sln files and binaries. Deterministic.

Maturity: Documented β†’ Verified β†’ Prevented Β· effective 3.0 / 10 Β· rule-coverage 100% Β· ceiling Documented

6 projects, 57 source files, 41214 hand-written lines of code (41214 production / 0 test β€” the split is derived per file: test is what its project, its own path, or a compile-guarded region marks as test, and a file carrying no test signal counts as production), plus 9454 generated (machine-written code β€” designer, scaffolded and tool-emitted files β€” excluded from quality), 2 inter-project edges (build failed). Measured across 2 solutions loaded as one workspace: `LimeSeed.sln`, `Research/LimeThumbViewer/LimeThumbViewer.sln`.

Build failed

What to do

  1. Resolve the 1 Build failed finding(s) in Solution Shape. β€” One of this dimension's main actionable groups (1 warning-level).

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

D19 Β· Documentation QualityWeak◐ Sampled Β· advisory

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

Method: Judged by language model at low temperature (0.0-0.1) on a deterministic doc sample (READMEs plus first 25 architecture docs), with two-pass stability filtering. Advisory, sampled.

Maturity: Documented β†’ Verified β†’ Prevented Β· effective Weak / 10 Β· rule-coverage 100% Β· ceiling Documented

The repository's READMEs are thin and unstructured; each is a directory README for its own package or tool rather than the project overview, installation, usage, contribution, or licence. The architecture/design docs are not present (marked 0), XML documentation coverage is low at 69% of the referenced API types.

XML-doc coverage: FFDShowAPI_2010FFAPI/FFDShowAPI_2010.csproj

What to do

  1. Improve Documentation Quality β€” currently 3.0/10. β€” The repository's READMEs are thin and unstructured; each is a directory README for its own package or tool rather than the project overview, installation, usage, contribution, or licence. The architecture/design docs are not present (marked 0), XML documentation coverage is low at 69% of the referenced API types.

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

D20 Β· ADR Quality0.0 / 10Criticalβœ“ Tool-verified

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

Method: Per-ADR judgment by language model at low temperature with two-pass stability; confidence is share of ADRs evaluated; enforcement-field presence detected deterministically. Advisory.

Maturity: Documented β†’ Verified β†’ Prevented Β· effective 0.0 / 10 Β· rule-coverage 100% Β· ceiling Documented

No architecture decision records were found.

No ADRs found

What to do

  1. Resolve the 1 No ADRs found finding(s) in ADR Quality. β€” 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 ConsistencyStrong◐ Sampled Β· advisory

What it measures: Whether names β€” types, methods, variables β€” are clear and consistent.

Method: Judged by language model at low temperature (0.0-0.1) on a deterministic random symbol sample (fixed size, not exhaustive), with disclosed confidence band. Advisory, sampled.

Maturity: Documented β†’ Verified β†’ Prevented Β· effective Strong / 10 Β· rule-coverage 100% Β· ceiling Verified

4 naming inconsistencies across 200 sampled symbols.

Two methods with nearly identical signatures (accepting an object parameter) and similar names ('getPresets' vs 'getPresetsPtr') likely return related but distinct data structures (e.g., a managed object vs a pointer to unmanaged memory). While the suffix 'Ptr' clarifies the return type, the base name 'getPresets' is ambiguous when paired with 'getPresetsPtr'.
Two methods with identical names except for a numeric suffix (2 vs 3) suggest an iterative refactoring or versioning of the same underlying logic (likely finding auto subtitle filenames). This indicates a lack of semantic distinction in naming.
Two methods that appear to retrieve the current playback time use different naming conventions: one uses snake_case with a specific context ('get_time_on_ffdshow'), while the other uses PascalCase with a generic context ('getCurrentTime'). This inconsistency makes it unclear if they return the same value or different time sources.
Two methods performing the same action ('lock') have different names: one uses a trailing underscore ('lock_') and the other uses a 'compat_' prefix. The underscore is often a workaround for reserved keywords or conflicts, while 'compat_' suggests a compatibility wrapper. This inconsistency obscures the relationship between the base interface and the compatibility layer.

What to do

  1. Resolve the 1 Two methods with nearly identical signatures (accepting an object… finding(s) in Naming Consistency. β€” One of this dimension's main actionable groups (1 recommendation-level).
  2. Resolve the 1 Two methods with identical names except for a numeric suffix (2 vs 3)… finding(s) in Naming Consistency. β€” One of this dimension's main actionable groups (1 recommendation-level).
  3. Resolve the 1 Two methods that appear to retrieve the current playback time use… finding(s) in Naming Consistency. β€” 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 ValueStrong◐ Sampled Β· advisory

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

Method: Judged by language model at low temperature (0.0-0.1) on deterministically sampled inline comments with surrounding code; findings verified back to sampled comments by substring match. Advisory, sampled.

Maturity: Documented β†’ Verified β†’ Prevented Β· effective Strong / 10 Β· rule-coverage 100% Β· ceiling Documented

149 valuable / 0 redundant across 200 sampled comments.

What to do

  1. Improve Comment Value β€” currently 8.9/10. β€” 149 valuable / 0 redundant across 200 sampled comments.

Detailed fixes: d24_recommendation.md.

D26 Β· Project Cohesion6.7 / 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, LLM-independent.

Maturity: Documented β†’ Verified β†’ Prevented Β· effective 6.7 / 10 Β· rule-coverage 100% Β· ceiling Documented

1 of 6 projects flagged as possibly oversized/incoherent.

Projects may be oversized for their cohesion

What to do

  1. Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion. β€” One of this dimension's main actionable groups (1 recommendation-level).

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

D27 Β· Navigability9.8 / 10Exemplaryβœ“ Tool-verified

What it measures: How far you must trace to follow a call β€” low indirection and co-located slices read easier.

Method: Call indirection (interface hops, cross-namespace calls, slice-locality scaled) over a sampled set of method invocations, size-aware baseline. Sampled; confidence discounted by symbol-resolution gaps. C# also names each pass-through layer (a class whose every public method only forwards its own parameters to one collaborator) as a located finding; the score is not affected.

Coverage: Slice locality from the first namespace segments, SAMPLED (≀400 methods) β€” not exhaustive.

Maturity: Documented β†’ Verified β†’ Prevented Β· effective 9.8 / 10 Β· rule-coverage 100% Β· ceiling Documented

83 % of calls cross a namespace and 1 % go through an interface, but 99 % of collaborators are co-located β€” so a call's collaborators sit together and tracing stays easy. Baseline: medium β€” clean/modular boundaries expected.

βœ“ On the Gold path β€” maintain.

Detailed fixes: d27_recommendation.md.

D28 Β· Secrets (history)7.0 / 10Adequategated by 3 critical findingsβœ“ Tool-verified

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

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

REDACTED

What to do

  1. Resolve the 3 High secret finding(s) in Secrets (history) β€” start with REDACTED, REDACTED, REDACTED. β€” One of this dimension's main actionable groups (3 issue-level).

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

D29 Β· Static Analysis (SAST)10.0 / 10Exemplaryβ—‹ Nothing flagged

What it measures: Real static-analysis (SAST) findings β€” likely security bugs in the code, any language.

Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.

Coverage: semgrep pattern rules over all files β€” exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).

Maturity: Documented β†’ Verified β†’ Prevented Β· effective 10.0 / 10 Β· rule-coverage 100% Β· ceiling Documented

semgrep found no security issues.

βœ“ On the Gold path β€” maintain.

Detailed fixes: d29_recommendation.md.

D35 Β· Change Coupling10.0 / 10Exemplaryβœ“ Tool-verified

What it measures: Whether files that change together actually belong together β€” pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.

Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only β€” tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file β‰₯10 revisions, β‰₯5 shared commits, β‰₯50% strength); sweeping commits excluded. Deterministic over fixed history.

Coverage: Population: PRODUCTION source files only β€” test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair β€” a command and the reference page that restates it β€” is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.

Maturity: Documented β†’ Verified β†’ Prevented Β· effective 10.0 / 10 Β· rule-coverage 100% Β· ceiling Documented

No strong hidden change-coupling between production files.

βœ“ On the Gold path β€” maintain.

Detailed fixes: d35_recommendation.md.

Frontend & cross-cutting dimensions

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

AX10 Β· Code composition10.0 / 10Exemplaryβœ“ Tool-verified

Other Β· Architecture β€” How the codebase splits by code ROLE β€” domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER β€” domain, then infrastructure, then application β€” so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does.

Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.

Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention β€” a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.

What to do

  • The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all β€” so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.
AX3 Β· Project dependency cycles10.0 / 10Exemplaryβœ“ Tool-verified

Other Β· Architecture β€” Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).

Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.

AX4 Β· Dependency direction10.0 / 10Exemplaryβœ“ Tool-verified

Other Β· Architecture β€” Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) β€” the clean-architecture dependency rule, checked across the project graph.

Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.

AX5 Β· Architecture & structure10.0 / 10Exemplaryβœ“ Tool-verified

Other Β· Architecture β€” Whether the codebase has a recognisable, scale-appropriate structure (a named architectural style, or modular enough for its size) rather than being an ad-hoc ball of mud.

Method: Roslyn plus csproj analysis: architecture style detection (DDD, clean, vertical-slice, CQRS) and structure fitness for repo size. Deterministic.

AX6 Β· Interface segregation8.0 / 10Strongβœ“ 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.

  • `IffDecoder` declares 111 members: `compat_getParam`, `compat_getParam2`, `compat_putParam`, `compat_getNumPresets`, `compat_getPresetName`, `compat_getActivePresetName`, `compat_setActivePreset`, `compat_getAVIdimensions`, `compat_getAVIfps`, `compat_saveActivePreset`, `compat_saveActivePresetToFile`, `compat_loadActivePresetFromFile`, `compat_removePreset`, `compat_notifyParamsChanged`, `compat_getAVcodecVersion`, `compat_getPPmode`, `compat_getRealCrop`, `compat_getMinOrder2`, `compat_getMaxOrder2`, `compat_saveGlobalSettings`, `compat_loadGlobalSettings`, `compat_saveDialogSettings`, `compat_loadDialogSettings`, `compat_getPresets`, `compat_setPresets`, `compat_savePresets`, `compat_getPresetPtr`, `compat_setPresetPtr`, `compat_renameActivePreset`, `compat_setOnChangeMsg`, `compat_setOnFrameMsg`, `compat_isDefaultPreset`, `compat_showCfgDlg`, `compat_getXvidVersion`, `compat_getMovieSource`, `compat_getOutputDimensions`, `compat_getCpuUsage2`, `compat_getOutputFourcc`, `compat_getInputBitrate2`, `compat_getHistogram`, and 71 more. Counted as the author wrote them β€” a property is ONE member and its get/set accessors are not counted separately, and an event counts once. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. β€” FFAPI/Interfaces/IffDecoder.cs:8
  • `IffdshowBase` declares 86 members: `getVersion2`, `getParam`, `getParam2`, `putParam`, `invParam`, `getParamStr`, `getParamStr2`, `putParamStr`, `getParamName`, `notifyParamsChanged`, `setOnChangeMsg`, `setOnFrameMsg`, `getGlobalSettings`, `saveGlobalSettings`, `loadGlobalSettings`, `saveDialogSettings`, `loadDialogSettings`, `getConfig`, `getInstance`, `getInstance2`, `getTranslator`, `initDialog`, `showCfgDlg`, `getCpuUsage2`, `getCpuUsageForPP`, `cpuSupportsMMX`, `cpuSupportsMMXEXT`, `cpuSupportsSSE`, `cpuSupportsSSE2`, `cpuSupportsSSE3`, `cpuSupportsSSSE3`, `cpuSupports3DNOW`, `cpuSupports3DNOWEXT`, `dbgInit`, `dbgError`, `dbgWrite`, `dbgDone`, `showTrayIcon`, `hideTrayIcon`, `getExeflnm`, and 46 more. Counted as the author wrote them β€” a property is ONE member and its get/set accessors are not counted separately, and an event counts once. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. β€” FFAPI/Interfaces/IffdshowBase.cs:9
  • `IffdshowDec` declares 80 members: `getVersion2`, `saveKeysSettings`, `loadKeysSettings`, `getGraph`, `seek`, `tell`, `stop`, `run`, `getState2`, `getDuration`, `getCurTime2`, `initKeys`, `getKeyParamCount2`, `getKeyParamDescr`, `getKeyParamKey2`, `setKeyParamKey`, `getNumPresets`, `initPresets`, `getPresetName`, `getActivePresetName`, `setActivePreset`, `saveActivePreset`, `saveActivePresetToFile`, `loadActivePresetFromFile`, `removePreset`, `getPresets`, `setPresets`, `savePresets`, `getPresetPtr`, `setPresetPtr`, `renameActivePreset`, `isDefaultPreset`, `createTempPreset`, `getMinOrder2`, `getMaxOrder2`, `resetFilter`, `resetFilterEx`, `getFilterTip`, `getFilterTipEx`, `filterHasReset`, and 40 more. Counted as the author wrote them β€” a property is ONE member and its get/set accessors are not counted separately, and an event counts once. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. β€” FFAPI/Interfaces/IffdshowDec.cs:9
  • `IffdshowDecVideo` declares 63 members: `getVersion2`, `getAVIdimensions`, `getAVIfps`, `getAVcodecVersion`, `getPPmode`, `getRealCrop`, `getXvidVersion`, `getOutputDimensions`, `getOutputFourcc`, `getInputBitrate2`, `setFilterOrder`, `getAVIfps1000_2`, `getCurrentFrameTime`, `calcNewSize`, `grabNow`, `getOverlayControlCapability`, `findAutoSubflnm2`, `getFrameTime`, `shortOSDmessage`, `cleanShortOSDmessages`, `shortOSDmessageAbsolute`, `registerSelectedMediaTypes`, `getFrameTimes`, `getSubtitleTimes`, `resetSubtitleTimes`, `setFrameTimes`, `getInIsSync`, `getVideoWindowPos`, `getSubtitleLanguagesCount2`, `getSubtitleLanguageDesc`, `getFrameTimeMS`, `getCurrentFrameTimeMS`, `frameStep`, `textPinConnected_`, `cycleSubLanguages`, `findAutoSubflnm3`, `setAverageTimePerFrame`, `getLate`, `getAverageTimePerFrame`, `getCurrentSubFlnm`, and 23 more. Counted as the author wrote them β€” a property is ONE member and its get/set accessors are not counted separately, and an event counts once. Those 63 declarations carry 62 distinct name(s), so part of the width is overloading rather than separate responsibilities β€” but 62 operations clears the >15 bar on its own, so the row is about responsibilities, not signatures. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. β€” FFAPI/Interfaces/IffdshowDecVideo.cs:8

What to do

  • Split fat interfaces into focused role-interfaces so clients depend only on what they use.
GD1 Β· Unfinished & placeholder code10.0 / 10Exemplaryβ—‹ Nothing flagged

Other Β· Code Health β€” Unreviewed-generation residue: shipped members still throwing NotImplementedException, and placeholder string literals left in non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.

Method: Roslyn syntax scan: NotImplementedException throws and placeholder string literals in non-test, non-generated shipped code. Deterministic, code-shape signature.

IC1 Β· Incompleteness & stubs10.0 / 10Exemplaryβ—‹ Nothing flagged

Other Β· Code Health β€” Unfinished work detected by code SHAPE, not keywords: members that only throw a "not implemented" exception, methods that take inputs and return a constant, async methods that never await, dead `if (false)` / `#if false` branches, and skeleton types most of whose members are holes. A real, objective slice of technical debt.

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.

  • A line of code has been commented out rather than removed β€” dead weight that rots and confuses. Delete it (version control remembers). (×36) β€” FFAPI/FFDShowAPI.cs:222, FFAPI/FFDShowAPI.cs:226, FFAPI/FFDShowAPI.cs:572, …
  • 4 consecutive lines of code sit inside a `/* … */` block β€” a block of code switched off rather than removed, which rots and confuses. Delete it (version control remembers). (×2) β€” FFAPI/FFDShowAPI.cs:1243, FFAPI/FFDShowAPI.cs:1251
  • 3 consecutive lines of code sit inside a `/* … */` block β€” a block of code switched off rather than removed, which rots and confuses. Delete it (version control remembers). β€” FFAPI/FFDShowAPI.cs:2252
  • 5 consecutive lines of code sit inside a `/* … */` block β€” a block of code switched off rather than removed, which rots and confuses. Delete it (version control remembers). β€” FFAPI/FFDShowReceiver.cs:113

What to do

  • Clear the softer debt: remove commented-out code and dead branches, re-enable or delete skipped tests, and replace blanket warning suppressions with targeted ones.
M1 Β· Documentation (README)0.0 / 10Criticalβœ“ Tool-verified

Maturity Β· Maturity β€” Whether the repo and its projects have a README, and whether it's substantive and current.

Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.

  • No README at the repository root β€” newcomers have no entry point.

What to do

  • Add a root README: what the system is, how to build/run it, and a map of the projects.
  • Add a README to the 6 of 6 project(s) that lack one β€” worth up to 2 pts.
M2 Β· Architecture documentation0.0 / 10Criticalβœ“ Tool-verified

Maturity Β· Maturity β€” Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.

Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.

  • No Architecture Decision Records found β€” no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
  • No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape β€” no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document β€” not evidence that nobody wrote the shape down.

What to do

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

Maturity Β· Maturity β€” Whether the repo is organised deliberately β€” src/test separation and consistent project naming.

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

  • Production code isn't grouped under a src/ folder β€” it's spread across several top-level directories, so there's no one place that says 'this is the product'.
  • Only 1/6 projects share a common root namespace β€” the code's module identity is inconsistent.

What to do

  • Group production code under src/ (or split deliberately, e.g. backend/ + frontend/) so production and tooling code aren't mixed at the root.
  • Start a test surface where your build system looks for one (tests/, test/, spec/, or your ecosystem's test source set) β€” the separation follows from putting the first tests in the right place.
  • Adopt a consistent root-namespace convention (a shared prefix, e.g. Acme.*); short project-file/directory names are fine as long as the RootNamespace is uniform.
M4 Β· Documentation accuracy2.0 / 10Weak◐ Sampled Β· advisory

Maturity Β· Maturity β€” Whether the README actually describes the code that exists (LLM-judged, advisory).

Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.

  • There is no README, so nothing documents what the system is or how it works.

What to do

  • Add a README describing the system, how to build/run it, and keep it current.
P1 Β· CI/CD gates0.0 / 10Criticalβœ“ Tool-verified

Readiness Β· Readiness β€” Whether an automated pipeline builds and tests every change.

Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.

  • No CI workflow found (.github/workflows, azure-pipelines.yml, .gitlab-ci.yml, …) β€” changes aren't gated by an automated build/test.

What to do

  • Add a CI workflow that builds and runs the test suite on every push/PR.
P2 Β· Observability7.0 / 10Strongβœ“ Tool-verified

Readiness Β· Readiness β€” Whether the code is diagnosable in production β€” structured logging, tracing/metrics, health checks.

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

What to do

  • For more than a log file, an `ActivitySource`/`EventSource` the user can switch on gives you a structured trace to attach to a bug report. A health-check endpoint does not apply here: nothing orchestrates or load-balances a binary the user launches.
P3 Β· Security & performance tooling0.0 / 10Criticalβœ“ Tool-verified

Readiness Β· Readiness β€” Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).

Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step β€” in this repository's own ecosystem. Exhaustive, deterministic.

  • No static application security testing detected. For this repository's stack, add a Roslyn security analyzer package referenced from the project (the analyzer packages do analyse VB.NET), plus gitleaks for committed secrets β€” CodeQL has no VB.NET extractor, so its csharp pack would extract nothing from this tree and then report it clean β€” this repository has no CI pipeline yet, so run it locally to clear the existing findings, then make it a step of the first workflow you add so a regression fails the build. What was searched, so you can tell an absence from a miss: the 0 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen β€” if that is your case the row is wrong, and saying so is more useful than adding a second scanner.

What to do

  • Run what this repository's stack ships: a Roslyn security analyzer package referenced from the project (the analyzer packages do analyse VB.NET), plus gitleaks for committed secrets β€” CodeQL has no VB.NET extractor, so its csharp pack would extract nothing from this tree and then report it clean β€” locally for now, since there is no CI pipeline here yet, and as a step of the first workflow you add so a security regression fails the build instead of landing.
  • Enable Dependabot/Renovate or a dependency-review gate.
  • Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
P6 Β· Release Hygiene5.0 / 10Adequateβœ“ Tool-verified

Readiness Β· Readiness β€” Whether releases are traceable β€” a maintained changelog and explicit version stamping.

Method: Filesystem scan: changelog file presence and version tags in csproj or git tags. Exhaustive, deterministic.

  • No CHANGELOG/HISTORY/RELEASES file β€” what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)

What to do

  • Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.
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.

X14 Β· Bypassable address classification10.0 / 10Exemplaryβ—‹ Nothing flagged

Other Β· Security β€” Whether a hand-rolled public/private IP check can be walked past β€” a method that unwraps IPv4-mapped IPv6 but returns the opposite verdict for the same host written as IPv4-compatible, 6to4 or NAT64.

Method: Roslyn syntax + semantics: methods that unwrap IPv4-mapped IPv6 and hand-roll IPv4 range carve-outs, checked for whether the IPv6 branch also accounts for the IPv4-compatible, 6to4 and NAT64 embeddings. Deterministic, provable per finding. Advisory.

X15 Β· Unvalidated length from an untrusted reader10.0 / 10Exemplaryβ—‹ Nothing flagged

Other Β· Security β€” Whether a length read out of the stream being parsed is bounded before it is allocated or read β€” an unchecked count taken from the input lets the input choose the allocation.

Method: Roslyn syntax + semantics: integer lengths read from a BinaryReader and spent on a bulk read or an array allocation, checked for any comparison or bounding call on the value anywhere in the method. 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 document10.0 / 10Exemplaryβ—‹ Nothing flagged

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.

X18 Β· Disposal-pattern correctness3.5 / 10Weakβœ“ Tool-verified

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.

  • `FFDShowAPI` implements `IDisposable` β€” so it has told every caller it holds something worth releasing β€” and it constructs `receiver` itself (line 188), which makes that instance its own. But `receiver` is named in none of the methods the disposal search covered: `Dispose` (line 1647) β€” that is `Dispose` plus every method `Dispose` calls BY NAME, so a release reached through an interface, a delegate or a base class is not followed and is worth checking before acting. On what was read, the type's disposal releases everything except the one thing it owns. A disposable the owner never disposes is held until finalization if its type has a finalizer, and forever if it does not β€” which for a synchronisation primitive, a timer, a stream or a handle means the resource accumulates once per instance for the life of the process. Release it in `Dispose` (`receiver?.Dispose();`), or, if it truly does not need releasing, drop `IDisposable` from the type so the claim and the behaviour agree. β€” FFAPI/FFDShowAPI.cs:188

What to do

  • Each finding names the value and the span that decides who owns it β€” the `new` that created it, or the constructor parameter that handed it over. Confirm ownership from that span, then make the disposal match it: release what this type created, leave what it was injected with to whoever created THAT, and drop a finalizer whose type holds nothing unmanaged to release.
X19 Β· Unrestored process-global state10.0 / 10Exemplaryβ—‹ Nothing flagged

Other Β· Code Health β€” Whether a method that temporarily changes state belonging to the whole process β€” the working directory, an environment variable β€” puts it back on EVERY path: a restore reached only when nothing throws leaks the change to the rest of the process.

Method: Roslyn syntax + semantics: method bodies that write the process working directory or an environment variable and write it back in the same body, checked for whether that restore sits in a `finally`/`catch` or only on the straight-line path. On a repository with no .NET source the same rule reads production JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not): `process.chdir`, `process.env.NAME =`/`["NAME"] =` and `delete process.env.NAME`, and Deno’s `Deno.chdir`/`Deno.env.set`/`Deno.env.delete`, paired per function body (a nested function or arrow is its own body, and module top-level code is none), where the last write puts back a local the body captured from the same global or deletes a variable the first write set, with at least one statement between them; a write in a `catch`/`finally` of that body silences it. Deterministic, provable per finding. Advisory.

X20 Β· Mistyped argument guard10.0 / 10Exemplaryβ—‹ Nothing flagged

Other Β· Code Health β€” Whether an argument guard throws the exception its own condition describes β€” a guard that rejects a value for being EMPTY and reports it as `ArgumentNullException` tells the caller a parameter was null when it provably was not.

Method: Roslyn syntax: `throw new ArgumentNullException(nameof(p))` statements controlled by an `if`, whose condition is read for a test that is true of a NON-null `p` β€” an emptiness test that dereferences it (`p.Count == 0`, `!p.Any()`) or a BCL predicate documented true of the empty value (`string.IsNullOrEmpty(p)`). 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.

X22 Β· Contradicted release guard10.0 / 10Exemplaryβ—‹ Nothing flagged

Other Β· Code Health β€” Whether a method that TAKES a lock or semaphore and gives it back from a flag-guarded `finally` returns the value that flag implies β€” reporting success while the guard hands the primitive back admits a second caller the exclusion was there to keep out, and reporting failure while the guard keeps it leaves nothing to ever give it back.

Method: Roslyn syntax: `try` statements whose `finally` releases a synchronisation primitive under a bare local-bool guard, where the method also TOOK that same primitive before the `try`, checked for a `return` of a bool literal whose value disagrees with the flag state the method's own straight-line assignments put it in. Deterministic, provable per finding. Advisory.

X23 Β· Unguarded diagnostic materialisation10.0 / 10Exemplaryβ—‹ Nothing flagged

Other Β· Code Health β€” Whether the work a diagnostic log line costs is paid only when that line is wanted β€” C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.

Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence β€” a LINQ operator, a materialisation, `string.Join`, a serializer β€” with no enclosing level check or conditional-compilation region. 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 `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` β€” outside any arrow or function passed as an argument, which the logger calls only when the level is on β€” with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.

X24 Β· Document value interpolated into markup unescaped10.0 / 10Exemplaryβ—‹ Nothing flagged

Other Β· Security β€” Whether text read out of the document being converted is escaped before it is written into generated markup β€” a value the document's author chose, interpolated into an attribute the surrounding literal delimits, can close that attribute and open another.

Method: Roslyn semantic model over the whole compilation: a string-typed `Value`/`InnerText`/`InnerXml`/`Text` member declared inside `DocumentFormat.OpenXml` or `System.Xml` is a taint SOURCE, propagated through assignments, returns, arguments, tuple elements and string composition to its transitive closure, then read at interpolated-string holes that sit in a markup position the surrounding literal itself delimits. Escaper/encoder calls and enclosing validator conditions cut the flow. Flow- and container-insensitive by construction. A second arm needs no provenance at all and reports a type that CONTRADICTS ITSELF β€” the same expression escaped at one delimited markup hole and interpolated raw at another hole in the same markup position of the same type, which the type's own escaping proves is a defect without knowing where the value came from. On a repository with no .NET source it reads JavaScript/TypeScript off the token stream with the same rule: a DOM read of raw document text (`getAttribute`, `textContent`, `innerText`, `nodeValue`) is the source, propagated through local bindings and string composition, and judged at template-literal and concatenation holes in the same two delimited markup positions; escapers and validating conditions cut it, and documentation-site, test, vendored and minified scripts are not read. 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.

X26 Β· Unsynchronised callback handoff10.0 / 10Exemplaryβ—‹ Nothing flagged

Other Β· Code Health β€” Whether a value handed from a callback to the body that waits on it crosses on something built to be crossed β€” a `Queue<T>`/`List<T>`/`Dictionary<K,V>` written inside an event handler and read back outside it is mutated by two flows at once, and the semaphore or completion source beside it orders how MANY items exist while leaving the collection's own head, tail and backing array unprotected.

Method: Roslyn syntax: method, accessor, local-function and lambda bodies that declare BOTH a non-thread-safe generic collection (`Queue`/`Stack`/`List`/`Dictionary`/`HashSet`/`Sorted*`/`LinkedList`) and a synchronisation primitive (`SemaphoreSlim`/`TaskCompletionSource`/`ManualResetEvent(Slim)`/`AutoResetEvent`/`CountdownEvent`) as locals, then read for a `+=`-registered lambda that raises that primitive while the body outside every lambda waits on it β€” and, in that scope, a mutating call on the collection inside the lambda paired with a mention of it outside. Any `lock` in the scope abstains it. On a repository with no .NET source the same handoff is read in Java off the engine’s own token stream (test source sets, vendored and demonstration paths not): an `ArrayList`/`LinkedList`/`ArrayDeque`/`PriorityQueue`/`Hash*`/`LinkedHash*`/`Tree*` local and a `CountDownLatch`/`Semaphore`/`CompletableFuture` local, a lambda or anonymous class that raises the primitive and mutates the collection, and a wait outside it; any `synchronized` or `lock()` abstains the body. Because each of those primitives orders what the callback wrote before raising it, only a touch that provably overlaps the callback is convicted: one after the registration and before the next wait, or one in a loop registered-before, waiting on every pass and not declaring the collection. Deterministic, provable per finding. Advisory.

X27 Β· Collection changed while being enumerated10.0 / 10Exemplaryβ—‹ Nothing flagged

Other Β· Code Health β€” Whether a `foreach` leaves the collection it is walking alone β€” a body that adds to or removes from the very collection the loop is enumerating invalidates the enumerator it is holding, so the next `MoveNext` throws `InvalidOperationException` and the remaining items 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 handling2.0 / 10Criticalβœ“ 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.

  • 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. (×4) β€” FFAPI/FFDShowReceiver.cs:123, FFAPI/FFDShowAPI.cs:1740, FFAPI/FFDShowAPI.cs:2163, …

What to do

  • Swallowed exception (empty catch)
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.

X32 Β· Type resolved by simple name across every loaded assembly10.0 / 10Exemplaryβ—‹ Nothing flagged

Other Β· Code Health β€” Whether a plugin lookup names the type it means β€” searching every assembly loaded into the process for a candidate whose SIMPLE name equals a string supplied at runtime, and taking the first one found, is decided by assembly LOAD ORDER rather than by this source, so the same name can resolve to a different type on the next run.

Method: Roslyn syntax only, no semantic model: every invocation of `First`/`FirstOrDefault`/`Single`/`SingleOrDefault` whose OWN expression subtree contains both a `GetAssemblies()` call and a `GetTypes()`/`GetExportedTypes()` call β€” a single-element pick out of every type loaded into the process. A nested selector in the same chain sees no `GetAssemblies()` in its own subtree and is outside the population, so one lookup counts once however many links its chain has. A finding additionally needs both remaining halves: the selector must be `First`/`FirstOrDefault` (`Single`/`SingleOrDefault` reports the ambiguity rather than resolving it, and is counted and never reported), and the chain must carry an `==` comparison of `<lambda parameter>.Name` against something that is not a literal. The receiver must be a plain identifier bound by one of the chain’s own lambdas, which places `assembly.GetName().Name == "X"` outside the rule by construction. One exemption: a `.Name` test joined by `&&` to a `FullName`/`AssemblyQualifiedName` test on the same identifier is spared; joined by `||` it is not. Deterministic, provable per finding. Advisory.

X4 Β· Structured logging10.0 / 10Exemplaryβ—‹ Nothing flagged

Other Β· Code Health β€” Whether log calls use message templates (queryable) rather than interpolated strings.

Method: Roslyn syntax scan: every log call-site counted; interpolated-string first-argument violations flagged. Population is all log calls, not estimated. 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 `trace`/`debug`/`info`/`warn`/`error`/`fatal`/`verbose`/`silly`/`http`/`log` call on a receiver named for a logger, in a package whose own or an enclosing `package.json` declares a logger that carries values as fields (pino, pino-http, nestjs-pino, Fastify, winston, bunyan, tslog, LogTape, roarr), whose first deciding argument is a template literal with substitutions; an object-literal fields argument is stepped over, a plain string message clears the call. Python is read the same way: a `debug`/`info`/`warning`/`error`/`exception`/`critical`/`log` call on a logger in a file that imports the standard library’s `logging` or structlog (loguru, which formats at the call, is not judged), whose message is a whole f-string with a non-constant field; a `%`-formatted, `.format()`-ed or concatenated message is not convicted, as in C#. PHP is read the same way: a PSR-3 level call (`emergency`…`debug`, `log`) on a logger (`$logger`, `$this->logger`, Laravel’s `Log::`, `logger()`, `\Drupal::logger()`) in a package whose `composer.json` requires a PSR-3 logger or a framework that hands one out (psr/log, Monolog, Laravel, Symfony, Drupal, CakePHP), or a file that imports one, whose message is a double-quoted string interpolating a variable; a single-quoted message clears the call, and `sprintf` or `.` concatenation is not convicted, as in C#. Dart is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on Sentry’s structured logger (`Sentry.logger`) whose message is a whole string literal interpolating a value (`$name`, `${…}`); the `Sentry.logger.fmt` template API clears the call. Dart that logs only through loggers with one message and no fields (package:logging, package:logger, talker, dart:developer) is not applicable rather than a reach gap. Ruby is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on the console gem’s `Console` (declared by a Gemfile, gemspec or Gemfile.lock, or required) or, where SemanticLogger, Ougai or dry-logger is declared or required, on a receiver named for a logger (`logger`, `@logger`, `Rails.logger`, `log`), whose first deciding argument is, as the whole argument, a double-quoted string interpolating a non-constant value (`#{…}`, `#@ivar`); a plain literal clears the call, keyword arguments are the fields, and a block, `%`-format or `+` concatenation is not convicted. Ruby that logs only through the standard Logger (Rails.logger) is not applicable rather than a reach gap. Deterministic.

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 Health59%Adequate β€” gated by D1, D2, D18, X3Capped at Fair by a Critical contributor β€” resolve it before relying on this lens.
Architecture91%ExemplaryStrongest area.
Maturity20%Weak β€” gated by M1, M2, M4Capped at Fair by a Critical contributor β€” resolve it before relying on this lens.
Readiness10%Critical β€” gated by D8, D9, D13, P1, P3Capped at Fair by a Critical contributor β€” resolve it before relying on this lens.
Security85%StrongSolid.
Not evidenced β€” 2 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.

  • P4 Deployment & Rollback β€” not evidenced β€” no deploy/rollback/approval signal in the repo; absence of evidence is not evidence of a manual release
  • P5 DR & Backup β€” not evidenced β€” repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included β€” 57 check(s) not relevant to this codebase

These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.

  • AC1 Text alternatives β€” No web markup found β€” accessibility is not applicable to this repository.
  • AC2 Forms & labels β€” No web markup found β€” accessibility is not applicable to this repository.
  • AC3 Page structure β€” No web markup found β€” accessibility is not applicable to this repository.
  • AC4 Keyboard semantics β€” No web markup found β€” accessibility is not applicable to this repository.
  • AC5 ARIA correctness β€” No web markup found β€” accessibility is not applicable to this repository.
  • AC6 Visual & motion safety β€” No web markup found β€” accessibility is not applicable to this repository.
  • AC7 A11y enforcement β€” No web markup found β€” accessibility is not applicable to this repository.
  • AX1 Captive dependencies β€” no DI registrations detected
  • AX2 Stateful singletons β€” no singleton implementations detected
  • AX7 Slice cohesion β€” not applicable β€” not a vertical-slice architecture
  • AX8 Test isolation β€” no test/production split to check
  • AX9 CQS / query purity β€” no CQRS query handlers detected β€” query purity is not applicable to this codebase
  • AXB1 Runtime evidence locked β€” no reproducible boot β€” This repository has nothing the runtime tiers could boot or serve β€” no markup, no UI framework or web-server dependency, no UI component source, no native UI project and no API definition β€” nothing here is a surface to boot β€” so runtime a11y/egress/header evidence has no subject here. Not applicable: this is neither a gap in the scan nor a finding about your code.
  • C1 Data Protection β€” No personal data detected in the analyzed source β€” no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
  • C2 Access Controls β€” No access-control surface detected in the analyzed source β€” no web/app surface to authorize (no HTTP API or web-UI project) and no authorization code at all (no [Authorize]/policies, no imperative guard methods). Access control is therefore N/A here β€” this is a library/CLI, which is authorized by its CALLER, not by itself. 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 the analyzed source β€” no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
  • C4 Data Retention β€” No personal data detected in the analyzed source β€” no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
  • C5 Data-Subject Rights β€” No personal data detected in the analyzed source β€” no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
  • D10 Test Quality β€” No tests were found in the analyzed repository to assess for quality.
  • D11 Test Reliability β€” No test suite was found to re-run, so reliability couldn't be assessed. Two searches produced that zero and both came back empty: the classifier that reads the loaded workspace recognised no suite it could run, and a walk of the source on disk β€” which covers the JS/TS `*.test.*` and `*.spec.*` conventions and probes for a Pester suite β€” found no test source in any other ecosystem either. Neither search reaches a suite that is missing from the loaded workspace and carries no name either walk recognises, so this is 'no suite found by those two searches', not a verdict that the repository has none.
  • D12 Dependency Hygiene β€” Dependency hygiene not measured
  • D14 License Compliance β€” Licence collector did not produce a result
  • D16 Bus Factor β€” single-contributor repository β€” bus factor is not applicable
  • D22 Internal API Consistency β€” No intentionally-exposed public API to evaluate for consistency.
  • D23 Boundary Type-Coupling β€” Cross-context type coupling could not be assessed β€” this codebase's bounded contexts are neither declared nor inferable.
  • D25 ADR Conformance β€” no ADRs to check
  • D30 Dependency Vulnerabilities β€” nuget: `dotnet list package --vulnerable` could not read this solution's dependency graph β€” it reported an error for at least one project and returned no package data at all (typically a packages.config / non-PackageReference project, which the command cannot read). An unreadable dependency graph is not a clean one; migrate the project(s) to PackageReference to enable this scan
  • D31 IaC & Container Security β€” No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
  • D32 Data Compliance (PII/GDPR) β€” No personal data was found crossing a boundary the PII/GDPR ruleset checks β€” nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
  • D34 Knowledge Freshness β€” too few commits to judge knowledge freshness
  • D36 Supply-chain Provenance & Signing β€” No CI/build pipeline found (.github/.forgejo/.gitea workflows, .circleci, .buildkite, .woodpecker, .teamcity, .gitlab-ci.yml, .travis.yml, bitbucket-pipelines.yml, .drone.yml, .cirrus.yml, .woodpecker.yml, appveyor.yml, azure-pipelines*.yml, .pipelines/, .vsts-ci/, .azuredevops/, Jenkinsfile); there is no build to attest provenance for.
  • D37 Vulnerability-disclosure Policy β€” No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
  • D39 IL Efficiency β€” IL not measured β€” the analyzer's build of the target did not succeed
  • D40 Network Egress Confinement β€” No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
  • D41 Kernel & Syscall Confinement β€” No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
  • D42 Runtime Threat Enforcement β€” No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
  • D43 Malicious Dependencies β€” Not scored β€” no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Python pyproject.toml/requirements.txt (pip/uv/Poetry), a Swift Package.swift/Package.resolved, a Cargo manifest, a Go module (go.mod/go.sum), a Gradle version catalogue, a Maven POM, an sbt build (build.sbt), composer.json, package.json, a Dart pubspec.yaml, an Elixir mix.exs/mix.lock (Hex), a rebar.config / erlang.mk DEPS (Hex), a Ruby Gemfile/Gemfile.lock or .gemspec (Bundler/RubyGems) β€” not scanned yet).
  • D44 Platform End-of-Life β€” Platform end-of-life not assessed β€” this repository declares no platform this pass reads
  • D7 Architectural Integrity β€” no checkable ADRs and no dependency cycles β€” architectural integrity not assessed
  • DM1 Domain Modelling β€” not scored β€” this repository shows none of the 3 signals this lens looks for
  • ED1 Event-Driven β€” not scored β€” this repository shows none of the 3 signals this lens looks for
  • ED5 Idempotency β€” no mutating command handlers or message consumers detected β€” idempotency check not applicable
  • ES1 Event Sourcing β€” not scored β€” this repository shows none of the 3 signals this lens looks for
  • P12 CI test-gate honesty β€” no CI workflow found
  • P7 Outbound HTTP resilience β€” not applicable β€” this isn't a service/API/worker
  • P8 Schema migrations β€” no EF Core usage detected
  • P9 Domain vs controller coverage β€” no coverage report found on disk β€” produce a coverage report in a standard format (Cobertura β€” `dotnet test --collect:"XPlat Code Coverage"` with a `coverlet.collector` PackageReference) and commit it β€” a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
  • PF1 Benchmark discipline β€” Performance is assessed only for perf-relevant repos β€” a packaged library, one that ships benchmarks, or one already using allocation-aware APIs. This repo isn't one, so the Performance lens is not applicable and is excluded from the score.
  • PF2 Allocation hygiene β€” Performance is assessed only for perf-relevant repos β€” a packaged library, one that ships benchmarks, or one already using allocation-aware APIs. This repo isn't one, so the Performance lens is not applicable and is excluded from the score.
  • PF3 Async & latency hygiene β€” Performance is assessed only for perf-relevant repos β€” a packaged library, one that ships benchmarks, or one already using allocation-aware APIs. This repo isn't one, so the Performance lens is not applicable and is excluded from the score.
  • S1 Web-Security Posture β€” No web surface detected in the analyzed source β€” no HTTP API or web-UI project (no controllers/minimal-API endpoints, no Razor/Blazor views) and no web middleware (HTTPS redirection, HSTS, security headers, cookies). Transport security, security headers, secure cookies, CSRF/input-validation and middleware-order controls are therefore N/A here β€” this is a library/CLI/worker, not a web app. Crypto hygiene was still checked and found nothing to flag. If this codebase becomes web-facing, the dimension reactivates automatically.
  • X10 Duplicated predicate β€” Advisory β€” this card reports evidence and never carries a score, so there is nothing missing here.
  • X2 Cancellation propagation β€” no async method does work a token could cancel
  • X5 Nullable reference types β€” no NRT-eligible projects
  • X6 Hand-rolled structured-format parsing β€” Advisory β€” this card reports evidence and never carries a score, so there is nothing missing here.
  • X7 Silent fallback defaults β€” 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 β€” 65 finding(s)
D17 Β· Explicit Debt Β· EmptyCatchBlock Β· Γ—58
  • EmptyCatchBlock FFAPI/FFDShowAPI.cs:1740 β€” empty catch block β€” the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct β€” as it often is on a teardown/dispose path where throwing would mask the original failure β€” catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
  • EmptyCatchBlock FFAPI/FFDShowAPI.cs:2163 β€” empty catch block β€” the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct β€” as it often is on a teardown/dispose path where throwing would mask the original failure β€” catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
  • EmptyCatchBlock FFAPI/FFDShowAPI.cs:2231 β€” empty catch block β€” the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct β€” as it often is on a teardown/dispose path where throwing would mask the original failure β€” catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
  • EmptyCatchBlock FFAPI/FFDShowReceiver.cs:123 β€” empty catch block β€” the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct β€” as it often is on a teardown/dispose path where throwing would mask the original failure β€” catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
  • EmptyCatchBlock GreenThumb/GreenThumbnailProperties.vb:320 β€” empty catch block β€” the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct β€” as it often is on a teardown/dispose path where throwing would mask the original failure β€” catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
  • EmptyCatchBlock GreenThumb/GreenThumbnailProperties.vb:342 β€” empty catch block β€” the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct β€” as it often is on a teardown/dispose path where throwing would mask the original failure β€” catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
  • EmptyCatchBlock LimeSeed/Classes/clsTaskBarLib.vb:397 β€” empty catch block β€” the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct β€” as it often is on a teardown/dispose path where throwing would mask the original failure β€” catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
  • EmptyCatchBlock LimeSeed/Classes/clsTaskBarLib.vb:408 β€” empty catch block β€” the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct β€” as it often is on a teardown/dispose path where throwing would mask the original failure β€” catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
  • EmptyCatchBlock LimeSeed/Classes/clsTaskBarLib.vb:694 β€” empty catch block β€” the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct β€” as it often is on a teardown/dispose path where throwing would mask the original failure β€” catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
  • EmptyCatchBlock LimeSeed/Classes/clsToolStripSystemRenderer.vb:451 β€” empty catch block β€” the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct β€” as it often is on a teardown/dispose path where throwing would mask the original failure β€” catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
  • EmptyCatchBlock LimeSeed/Controls/ctlRipper.vb:688 β€” empty catch block β€” the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct β€” as it often is on a teardown/dispose path where throwing would mask the original failure β€” catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
  • EmptyCatchBlock LimeSeed/Forms/frmFullScreen.vb:62 β€” empty catch block β€” the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct β€” as it often is on a teardown/dispose path where throwing would mask the original failure β€” catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
  • EmptyCatchBlock LimeSeed/Forms/frmMain.vb:1958 β€” empty catch block β€” the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct β€” as it often is on a teardown/dispose path where throwing would mask the original failure β€” catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
  • EmptyCatchBlock LimeSeed/Forms/frmMain.vb:1970 β€” empty catch block β€” the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct β€” as it often is on a teardown/dispose path where throwing would mask the original failure β€” catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
  • EmptyCatchBlock LimeSeed/Forms/frmMain.vb:2145 β€” empty catch block β€” the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct β€” as it often is on a teardown/dispose path where throwing would mask the original failure β€” catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
  • EmptyCatchBlock LimeSeed/Forms/frmMain.vb:2679 β€” empty catch block β€” the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct β€” as it often is on a teardown/dispose path where throwing would mask the original failure β€” catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
  • EmptyCatchBlock LimeSeed/Forms/frmMain.vb:2683 β€” empty catch block β€” the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct β€” as it often is on a teardown/dispose path where throwing would mask the original failure β€” catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
  • EmptyCatchBlock LimeSeed/Forms/frmMain.vb:2704 β€” empty catch block β€” the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct β€” as it often is on a teardown/dispose path where throwing would mask the original failure β€” catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
  • EmptyCatchBlock LimeSeed/Forms/frmMain.vb:2708 β€” empty catch block β€” the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct β€” as it often is on a teardown/dispose path where throwing would mask the original failure β€” catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
  • EmptyCatchBlock LimeSeed/Forms/frmMain.vb:2785 β€” empty catch block β€” the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct β€” as it often is on a teardown/dispose path where throwing would mask the original failure β€” catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
  • EmptyCatchBlock LimeSeed/Forms/frmMain.vb:3064 β€” empty catch block β€” the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct β€” as it often is on a teardown/dispose path where throwing would mask the original failure β€” catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
  • EmptyCatchBlock LimeSeed/Forms/frmMain.vb:3076 β€” empty catch block β€” the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct β€” as it often is on a teardown/dispose path where throwing would mask the original failure β€” catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
  • EmptyCatchBlock LimeSeed/Forms/frmMain.vb:3199 β€” empty catch block β€” the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct β€” as it often is on a teardown/dispose path where throwing would mask the original failure β€” catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
  • EmptyCatchBlock LimeSeed/Forms/frmMain.vb:3215 β€” empty catch block β€” the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct β€” as it often is on a teardown/dispose path where throwing would mask the original failure β€” catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
  • EmptyCatchBlock LimeSeed/Forms/frmMain.vb:3635 β€” empty catch block β€” the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct β€” as it often is on a teardown/dispose path where throwing would mask the original failure β€” catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
  • + 33 more in this group β€” see findings.md.
D13 Β· Secret Scanning Β· Leaked secret Β· Γ—3
  • REDACTED
  • REDACTED
  • REDACTED
D28 Β· Secrets (history) Β· High secret Β· Γ—3
  • REDACTED
  • REDACTED
  • REDACTED
D8 Β· Code Coverage Β· No automated tests Β· Γ—1
  • No automated tests β€” No automated tests β€” no test code was found in this repository. Untested code is the largest single risk to changing it safely. Start with the code you change most often: add a suite in a framework a runner can collect (xUnit, NUnit or MSTest), and run it in CI so the gap cannot reopen.
Serious β€” 547 finding(s)
D3 Β· God Classes Β· MethodTooLong Β· Γ—61
  • MethodTooLong: clsRIFF.New(…) Seed/Headers/clsRIFF.vb:823 β€” MethodTooLong β€” New(…) runs 415 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 315 over it, 4.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.
  • MethodTooLong: frmMain.CleanupID3 LimeSeed/Forms/frmMain.vb:6348 β€” MethodTooLong β€” CleanupID3 runs 396 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 296 over it, 3.96× 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: frmMain.tmrUpdate_Tick LimeSeed/Forms/frmMain.vb:4971 β€” MethodTooLong β€” tmrUpdate_Tick runs 336 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 236 over it, 3.36× 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: modAssoc.Main LSFA/modAssoc.vb:62 β€” MethodTooLong β€” Main runs 301 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 201 over it, 3.01× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body β€” the runs of statements that work on the same values and would earn the same name β€” into its own named unit, and have this one call them in order.
  • MethodTooLong: modFuncts.AVIVideoCodecs LimeSeed/Modules/modFuncts.vb:1026 β€” MethodTooLong β€” AVIVideoCodecs runs 300 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 200 over it, 3.00× 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: frmProps.LoadRIFF LimeSeed/Forms/frmProps.vb:815 β€” MethodTooLong β€” LoadRIFF runs 282 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 182 over it, 2.82× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body β€” the runs of statements that work on the same values and would earn the same name β€” into its own named unit, and have this one call them in order.
  • MethodTooLong: clsMKVHeaders.ReadTrackInfo Seed/Headers/clsMKV.vb:792 β€” MethodTooLong β€” ReadTrackInfo runs 275 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 175 over it, 2.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: clsVorbis.LoadVorbis Seed/Headers/clsVorbis.vb:447 β€” MethodTooLong β€” LoadVorbis runs 268 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 168 over it, 2.68× 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: ctlSeed.sckDownload_SocketReceived Seed/ctlSeed.vb:1988 β€” MethodTooLong β€” sckDownload_SocketReceived runs 264 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 164 over it, 2.64× 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: frmMain.LoadData_Video LimeSeed/Forms/frmMain.vb:3714 β€” MethodTooLong β€” LoadData_Video 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: frmMain.LoadData_Audio_WAV LimeSeed/Forms/frmMain.vb:4497 β€” MethodTooLong β€” LoadData_Audio_WAV runs 229 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 129 over it, 2.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: frmProps.LoadMKV LimeSeed/Forms/frmProps.vb:508 β€” MethodTooLong β€” LoadMKV runs 221 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 121 over it, 2.21× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body β€” the runs of statements that work on the same values and would earn the same name β€” into its own named unit, and have this one call them in order.
  • MethodTooLong: clsMIDI.ReadTrack Seed/Headers/clsMIDI.vb:127 β€” MethodTooLong β€” ReadTrack runs 216 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 116 over it, 2.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: ctlSeed.GetThumbnailFromControl Seed/ctlSeed.vb:396 β€” MethodTooLong β€” GetThumbnailFromControl runs 200 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 100 over it, 2.00× 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: frmMain.LoadTempPL LimeSeed/Forms/frmMain.vb:2378 β€” MethodTooLong β€” LoadTempPL runs 187 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 87 over it, 1.87× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body β€” the runs of statements that work on the same values and would earn the same name β€” into its own named unit, and have this one call them in order.
  • MethodTooLong: frmProps.DataGrid_CellContentClick LimeSeed/Forms/frmProps.vb:1485 β€” MethodTooLong β€” DataGrid_CellContentClick runs 186 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 86 over it, 1.86× 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: ToolStripSystemRenderer.OnRenderMenuItemBackground LimeSeed/Classes/clsToolStripSystemRenderer.vb:268 β€” MethodTooLong β€” OnRenderMenuItemBackground runs 185 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 85 over it, 1.85× 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: clsMKVHeaders.DebugData Seed/Headers/clsMKV.vb:438 β€” MethodTooLong β€” DebugData runs 185 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 85 over it, 1.85× 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: CDDBNet.HandleData LimeSeed/Controls/ctlRipper.vb:1039 β€” MethodTooLong β€” HandleData runs 184 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 84 over it, 1.84× 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: frmSettings.StrToKeys LimeSeed/Forms/frmSettings.vb:623 β€” MethodTooLong β€” StrToKeys runs 182 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 82 over it, 1.82× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body β€” the runs of statements that work on the same values and would earn the same name β€” into its own named unit, and have this one call them in order.
  • MethodTooLong: ctlSeed.GetFileThumbnail Seed/ctlSeed.vb:617 β€” MethodTooLong β€” GetFileThumbnail runs 182 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 82 over it, 1.82× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body β€” the runs of statements that work on the same values and would earn the same name β€” into its own named unit, and have this one call them in order.
  • MethodTooLong: clsMPEG.GetBitrate Seed/Headers/clsMPEG.vb:124 β€” MethodTooLong β€” GetBitrate runs 181 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 81 over it, 1.81× 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: clsMPEG.GetBitQual Seed/Headers/clsMPEG.vb:305 β€” MethodTooLong β€” GetBitQual runs 181 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 81 over it, 1.81× 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: frmMain.DragDropFiles LimeSeed/Forms/frmMain.vb:5885 β€” MethodTooLong β€” DragDropFiles runs 178 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 78 over it, 1.78× 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: frmProps.dgvID3v2_CellValueChanged LimeSeed/Forms/frmProps.vb:1749 β€” MethodTooLong β€” dgvID3v2_CellValueChanged runs 177 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 77 over it, 1.77× 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.
  • + 36 more in this group β€” see findings.md.
D3 Β· God Classes Β· FileTooLong Β· Γ—19
  • FileTooLong: Forms/frmMain.vb LimeSeed/Forms/frmMain.vb β€” FileTooLong β€” 7374 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 6874 over it, 14.75× 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: Headers/clsID3v2.vb Seed/Headers/clsID3v2.vb β€” FileTooLong β€” 2858 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2358 over it, 5.72× 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: Seed/ctlSeed.vb Seed/ctlSeed.vb β€” FileTooLong β€” 2675 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2175 over it, 5.35× 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: Modules/modFuncts.vb LimeSeed/Modules/modFuncts.vb β€” FileTooLong β€” 2218 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1718 over it, 4.44× 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: Forms/frmProps.vb LimeSeed/Forms/frmProps.vb β€” FileTooLong β€” 2062 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1562 over it, 4.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: Headers/clsRIFF.vb Seed/Headers/clsRIFF.vb β€” FileTooLong β€” 1273 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 773 over it, 2.55× 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: Headers/clsMKV.vb Seed/Headers/clsMKV.vb β€” FileTooLong β€” 1189 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 689 over it, 2.38× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: Controls/ctlRipper.vb LimeSeed/Controls/ctlRipper.vb β€” FileTooLong β€” 1164 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 664 over it, 2.33× 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: Forms/frmSettings.vb LimeSeed/Forms/frmSettings.vb β€” FileTooLong β€” 1079 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 579 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: FFAPI/FFDShowAPI.cs FFAPI/FFDShowAPI.cs β€” FileTooLong β€” 1008 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 508 over it, 2.02× 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: LSFA/modAssoc.vb LSFA/modAssoc.vb β€” FileTooLong β€” 966 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 466 over it, 1.93× 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: Seed/clsSocket.vb Seed/clsSocket.vb β€” FileTooLong β€” 960 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 460 over it, 1.92× 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: Headers/clsVorbis.vb Seed/Headers/clsVorbis.vb β€” FileTooLong β€” 890 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 390 over it, 1.78× 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: Classes/clsTaskBarLib.vb LimeSeed/Classes/clsTaskBarLib.vb β€” FileTooLong β€” 710 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 210 over it, 1.42× 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: Classes/clsCDText.vb LimeSeed/Classes/clsCDText.vb β€” FileTooLong β€” 680 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 180 over it, 1.36× 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: GreenThumb/GreenThumbnailProperties.vb GreenThumb/GreenThumbnailProperties.vb β€” FileTooLong β€” 656 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 156 over it, 1.31× 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: Headers/clsMPEG.vb Seed/Headers/clsMPEG.vb β€” FileTooLong β€” 648 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 148 over it, 1.30× 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: Seed/modFuncts.vb Seed/modFuncts.vb β€” FileTooLong β€” 640 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 140 over it, 1.28× 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: Classes/clsLAME.vb LimeSeed/Classes/clsLAME.vb β€” 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.
D17 Β· Explicit Debt Β· TodoComment Β· Γ—16
  • TodoComment FFAPI/FFDShowAPI.cs:1964 β€” //TODO in directshow mode β€” source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment LSFA/modAssoc.vb:66 β€” 'TODO: Enable if you ever get a thumbnail and property generator working better than K-Lite β€” source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment LSFA/modAssoc.vb:623 β€” 'TODO: Enable if you ever get a thumbnail and property generator working better than K-Lite β€” source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment LimeSeed/Forms/frmSettings.vb:241 β€” 'TODO: Enable if you ever get a thumbnail and property generator working better than K-Lite β€” source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment LimeSeed/Forms/frmSettings.vb:495 β€” 'TODO: Enable if you ever get a thumbnail and property generator working better than K-Lite β€” source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment LimeSeed/Classes/clsSocket.vb:150 β€” ' TODO: Test with multiple pending threads .. do we need to make this a ManualResetEvent .. ? β€” source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment LimeSeed/Classes/clsSocket.vb:160 β€” ' TODO: Test with multiple pending threads .. do we need to make this a ManualResetEvent .. ? β€” source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment Seed/clsSocket.vb:390 β€” ' TODO: Test with multiple pending threads .. do we need to make this a ManualResetEvent .. ? β€” source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment Seed/clsSocket.vb:400 β€” ' TODO: Test with multiple pending threads .. do we need to make this a ManualResetEvent .. ? β€” source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment LimeSeed/Forms/frmMain.vb:14 β€” 'TODO: stop cd i guess? β€” source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment LimeSeed/Forms/frmMain.vb:4765 β€” 'TODO: THIS IS A THING β€” source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment LimeSeed/Forms/frmMain.vb:7314 β€” 'TODO: THIS IS A THING β€” source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment LimeSeed/Forms/frmMain.vb:7667 β€” 'TODO: THIS IS A THING β€” source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment LimeSeed/Forms/frmMain.vb:5928 β€” ' TODO: Make sure "AndMaybePlay" is the right call β€” source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment LimeSeed/Forms/frmMain.vb:5957 β€” ' TODO: Make sure "AndMaybePlay" is the right call β€” source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment LimeSeed/Forms/frmMain.vb:5972 β€” ' TODO: Make sure "AndMaybePlay" is the right call β€” source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
D4 Β· Code Duplication Β· Duplicated block (5 lines × 2) Β· Γ—14
  • Duplicated block (5 lines × 2) Seed/Headers/clsMPEG.vb:99 β€” Seed/Headers/clsMPEG.vb:99-103 | Seed/Headers/clsMPEG.vb:115-119 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
  • Duplicated block (5 lines × 2) LimeSeed/Classes/clsCDRip.vb:613 β€” LimeSeed/Classes/clsCDRip.vb:613-617 | LimeSeed/Classes/clsCDRip.vb:629-633 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
  • Duplicated block (5 lines × 2) LimeSeed/Classes/clsRadioMenu.vb:71 β€” LimeSeed/Classes/clsRadioMenu.vb:71-75 | LimeSeed/Classes/clsToolStripSystemRenderer.vb:67-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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names β€” the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (5 lines × 2) LimeSeed/Classes/clsRadioMenu.vb:152 β€” LimeSeed/Classes/clsRadioMenu.vb:152-156 | LimeSeed/Classes/clsRadioMenu.vb:239-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.
  • Duplicated block (5 lines × 2) LimeSeed/Classes/clsToolStripSystemRenderer.vb:279 β€” LimeSeed/Classes/clsToolStripSystemRenderer.vb:279-283 | LimeSeed/Classes/clsToolStripSystemRenderer.vb:285-289 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
  • Duplicated block (5 lines × 2) LimeSeed/Classes/clsToolStripSystemRenderer.vb:293 β€” LimeSeed/Classes/clsToolStripSystemRenderer.vb:293-297 | LimeSeed/Classes/clsToolStripSystemRenderer.vb:404-408 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
  • Duplicated block (5 lines × 2) LimeSeed/Controls/ctlArtList.vb:230 β€” LimeSeed/Controls/ctlArtList.vb:230-234 | LimeSeed/Controls/ctlRipper.vb:503-507 β€” 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) LimeSeed/Controls/ctlRipper.vb:306 β€” LimeSeed/Controls/ctlRipper.vb:306-310 | LimeSeed/Modules/modFuncts.vb:2332-2336 β€” the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach β€” a location they all depend on today, or a new shared one if there is none β€” and call it from each site; until then, every change has to be made twice.
  • Duplicated block (5 lines × 2) LimeSeed/Controls/ctlRipper.vb:653 β€” LimeSeed/Controls/ctlRipper.vb:653-657 | LimeSeed/Modules/modFuncts.vb:2189-2193 β€” the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach β€” a location they all depend on today, or a new shared one if there is none β€” and call it from each site; until then, every change has to be made twice.
  • Duplicated block (5 lines × 2) LimeSeed/Forms/frmFullScreen.vb:138 β€” LimeSeed/Forms/frmFullScreen.vb:138-142 | LimeSeed/Forms/frmMain.vb:896-900 β€” 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) LimeSeed/Forms/frmMain.vb:252 β€” LimeSeed/Forms/frmMain.vb:252-256 | LimeSeed/Forms/frmMain.vb:6273-6277 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited. β˜… These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `LimeSeed/Forms/frmMain.vb:257` calls `IsNullOrEmpty` and `LimeSeed/Forms/frmMain.vb:6278` does not β€” after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (5 lines × 2) LimeSeed/Forms/frmMain.vb:4941 β€” LimeSeed/Forms/frmMain.vb:4941-4945 | LimeSeed/Forms/frmMain.vb:4947-4951 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
  • Duplicated block (5 lines × 2) Seed/ctlSeed.vb:730 β€” Seed/ctlSeed.vb:730-734 | Seed/ctlSeed.vb:750-754 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names β€” the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. β˜… These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `Seed/ctlSeed.vb:754` calls `DrawImage`, `Rectangle` and `Seed/ctlSeed.vb:734` does not β€” after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (5 lines × 2) LimeSeed/Classes/clsTaskBarLib.vb:198 β€” LimeSeed/Classes/clsTaskBarLib.vb:198-202 | LimeSeed/Classes/clsTaskBarLib.vb:474-478 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names β€” the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 Β· Code Duplication Β· Duplicated block (7 lines × 2) Β· Γ—12
  • Duplicated block (7 lines × 2) LimeSeed/Forms/frmAbout.vb:122 β€” LimeSeed/Forms/frmAbout.vb:122-128 | LimeSeed/Forms/frmAbout.vb:146-152 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
  • Duplicated block (7 lines × 2) LimeSeed/Classes/clsSocket.vb:268 β€” LimeSeed/Classes/clsSocket.vb:268-274 | Seed/clsSocket.vb:487-493 β€” before extracting anything, compare `LimeSeed/Classes/clsSocket.vb` and `Seed/clsSocket.vb` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (7 lines × 2) Seed/Headers/clsVorbis.vb:512 β€” Seed/Headers/clsVorbis.vb:512-518 | Seed/Headers/clsVorbis.vb:526-532 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
  • Duplicated block (7 lines × 2) LimeSeed/Classes/clsSocket.vb:238 β€” LimeSeed/Classes/clsSocket.vb:238-244 | Seed/clsSocket.vb:457-463 β€” before extracting anything, compare `LimeSeed/Classes/clsSocket.vb` and `Seed/clsSocket.vb` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (7 lines × 2) LimeSeed/Classes/clsToolStripSystemRenderer.vb:319 β€” LimeSeed/Classes/clsToolStripSystemRenderer.vb:319-325 | LimeSeed/Classes/clsToolStripSystemRenderer.vb:359-365 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names β€” the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (7 lines × 2) LimeSeed/Controls/ctlRipper.vb:268 β€” LimeSeed/Controls/ctlRipper.vb:268-274 | LimeSeed/Modules/modFuncts.vb:2297-2303 β€” 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) LimeSeed/Forms/frmFullScreen.vb:174 β€” LimeSeed/Forms/frmFullScreen.vb:174-180 | LimeSeed/Forms/frmMain.vb:1230-1236 β€” 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) LimeSeed/Forms/frmMain.vb:888 β€” LimeSeed/Forms/frmMain.vb:888-894 | LimeSeed/Forms/frmMain.vb:905-911 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited. β˜… These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `LimeSeed/Forms/frmMain.vb:913` calls `mpPlay`, `Invalidate` and `LimeSeed/Forms/frmMain.vb:895` does not β€” after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (7 lines × 2) LimeSeed/Forms/frmMain.vb:1496 β€” LimeSeed/Forms/frmMain.vb:1496-1502 | LimeSeed/Forms/frmMain.vb:8020-8029 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
  • Duplicated block (7 lines × 2) Seed/Headers/clsID3v1.vb:183 β€” Seed/Headers/clsID3v1.vb:183-189 | Seed/Headers/clsID3v2.vb:2896-2902 β€” 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) LimeSeed/Classes/clsSocket.vb:159 β€” LimeSeed/Classes/clsSocket.vb:159-165 | Seed/clsSocket.vb:399-405 β€” before extracting anything, compare `LimeSeed/Classes/clsSocket.vb` and `Seed/clsSocket.vb` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (7 lines × 2) LimeSeed/Forms/frmTray.vb:156 β€” LimeSeed/Forms/frmTray.vb:156-162 | LimeSeed/Forms/frmTray.vb:164-170 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
D3 Β· God Classes Β· ClassTooLong Β· Γ—10
  • ClassTooLong: clsRIFF Seed/Headers/clsRIFF.vb β€” ClassTooLong β€” 1273 significant lines (blank, comment-only and punctuation-only lines excluded), 5 methods. The bar is 400 significant lines; this is 873 over it, 3.18× 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: clsMKVHeaders Seed/Headers/clsMKV.vb β€” ClassTooLong β€” 1189 significant lines (blank, comment-only and punctuation-only lines excluded), 11 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: modAssoc LSFA/modAssoc.vb β€” ClassTooLong β€” 966 significant lines (blank, comment-only and punctuation-only lines excluded), 9 methods. The bar is 400 significant lines; this is 566 over it, 2.42× 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: clsVorbis Seed/Headers/clsVorbis.vb β€” ClassTooLong β€” 890 significant lines (blank, comment-only and punctuation-only lines excluded), 17 methods. The bar is 400 significant lines; this is 490 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.
  • ClassTooLong: PropertyHandler GreenThumb/GreenThumbnailProperties.vb β€” ClassTooLong β€” 655 significant lines (blank, comment-only and punctuation-only lines excluded), 20 methods. The bar is 400 significant lines; this is 255 over it, 1.64× 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: clsMPEG Seed/Headers/clsMPEG.vb β€” ClassTooLong β€” 648 significant lines (blank, comment-only and punctuation-only lines excluded), 20 methods. The bar is 400 significant lines; this is 248 over it, 1.62× 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: clsID3v1 Seed/Headers/clsID3v1.vb β€” ClassTooLong β€” 461 significant lines (blank, comment-only and punctuation-only lines excluded), 10 methods. The bar is 400 significant lines; this is 61 over it, 1.15× 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: Sound LimeSeed/Modules/modFuncts.vb β€” ClassTooLong β€” 451 significant lines (blank, comment-only and punctuation-only lines excluded), 4 methods. The bar is 400 significant lines; this is 51 over it, 1.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.
  • ClassTooLong: ToolStripSystemRenderer LimeSeed/Classes/clsToolStripSystemRenderer.vb β€” ClassTooLong β€” 429 significant lines (blank, comment-only and punctuation-only lines excluded), 9 methods. The bar is 400 significant lines; this is 29 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: MyApplication LimeSeed/ApplicationEvents.vb β€” ClassTooLong β€” 408 significant lines (blank, comment-only and punctuation-only lines excluded), 10 methods. The bar is 400 significant lines; this is 8 over it, 1.02× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
D4 Β· Code Duplication Β· Duplicated block (6 lines × 2) Β· Γ—10
  • Duplicated block (6 lines × 2) LimeSeed/Forms/frmMain.vb:221 β€” LimeSeed/Forms/frmMain.vb:221-226 | LimeSeed/Forms/frmMain.vb:6240-6245 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) LimeSeed/Classes/clsToolStripSystemRenderer.vb:49 β€” LimeSeed/Classes/clsToolStripSystemRenderer.vb:49-54 | LimeSeed/Classes/clsToolStripSystemRenderer.vb:396-401 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) LimeSeed/Classes/clsToolStripSystemRenderer.vb:139 β€” LimeSeed/Classes/clsToolStripSystemRenderer.vb:139-144 | LimeSeed/Classes/clsToolStripSystemRenderer.vb:218-223 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) LimeSeed/Forms/frmProps.vb:1985 β€” LimeSeed/Forms/frmProps.vb:1985-1990 | LimeSeed/Forms/frmProps.vb:1991-1996 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) LimeSeed/Forms/frmProps.vb:1997 β€” LimeSeed/Forms/frmProps.vb:1997-2002 | LimeSeed/Forms/frmProps.vb:2045-2050 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) LimeSeed/Forms/frmProps.vb:2003 β€” LimeSeed/Forms/frmProps.vb:2003-2008 | LimeSeed/Forms/frmProps.vb:2057-2062 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) LimeSeed/Forms/frmProps.vb:2009 β€” LimeSeed/Forms/frmProps.vb:2009-2014 | LimeSeed/Forms/frmProps.vb:2015-2020 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) LimeSeed/Forms/frmProps.vb:2021 β€” LimeSeed/Forms/frmProps.vb:2021-2026 | LimeSeed/Forms/frmProps.vb:2051-2056 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) LimeSeed/Forms/frmProps.vb:2063 β€” LimeSeed/Forms/frmProps.vb:2063-2068 | LimeSeed/Forms/frmProps.vb:2111-2116 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) LimeSeed/Modules/modFuncts.vb:41 β€” LimeSeed/Modules/modFuncts.vb:41-46 | Seed/Headers/modHeaderFunctions.vb:41-46 β€” 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.
D3 Β· God Classes Β· TooManyMethods Β· Γ—8
  • TooManyMethods: frmMain LimeSeed/Forms/frmMain.vb β€” TooManyMethods β€” 7373 significant lines (blank, comment-only and punctuation-only lines excluded), 238 methods. The bar is 30 methods; this is 208 over it, 7.93× 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: ctlSeed Seed/ctlSeed.vb β€” TooManyMethods β€” 2659 significant lines (blank, comment-only and punctuation-only lines excluded), 78 methods. The bar is 30 methods; this is 48 over it, 2.60× 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: clsID3v2 Seed/Headers/clsID3v2.vb β€” TooManyMethods β€” 2858 significant lines (blank, comment-only and punctuation-only lines excluded), 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: frmSettings LimeSeed/Forms/frmSettings.vb β€” TooManyMethods β€” 1079 significant lines (blank, comment-only and punctuation-only lines excluded), 49 methods. The bar is 30 methods; this is 19 over it, 1.63× 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: FFDShowAPI FFAPI/FFDShowAPI.cs β€” TooManyMethods β€” 902 significant lines (blank, comment-only and punctuation-only lines excluded), 47 methods. The bar is 30 methods; this is 17 over it, 1.57× 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: frmProps LimeSeed/Forms/frmProps.vb β€” TooManyMethods β€” 2062 significant lines (blank, comment-only and punctuation-only lines excluded), 39 methods. The bar is 30 methods; this is 9 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.
  • TooManyMethods: ctlRipper LimeSeed/Controls/ctlRipper.vb β€” TooManyMethods β€” 711 significant lines (blank, comment-only and punctuation-only lines excluded), 37 methods. The bar is 30 methods; this is 7 over it, 1.23× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: modFuncts LimeSeed/Modules/modFuncts.vb β€” TooManyMethods β€” 1386 significant lines (blank, comment-only and punctuation-only lines excluded), 35 methods. The bar is 30 methods; this is 5 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.
D4 Β· Code Duplication Β· Duplicated block (8 lines × 2) Β· Γ—6
  • Duplicated block (8 lines × 2) LimeSeed/Classes/clsRadioMenu.vb:155 β€” LimeSeed/Classes/clsRadioMenu.vb:155-162 | LimeSeed/Classes/clsToolStripSystemRenderer.vb:143-150 β€” 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) LimeSeed/ApplicationEvents.vb:296 β€” LimeSeed/ApplicationEvents.vb:296-303 | LimeSeed/ApplicationEvents.vb:370-377 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
  • Duplicated block (8 lines × 2) LimeSeed/Controls/ctlRipper.vb:660 β€” LimeSeed/Controls/ctlRipper.vb:660-667 | LimeSeed/Modules/modFuncts.vb:2195-2202 β€” the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach β€” a location they all depend on today, or a new shared one if there is none β€” and call it from each site; until then, every change has to be made twice. β˜… These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `LimeSeed/Modules/modFuncts.vb:2203` calls `Trks` and `LimeSeed/Controls/ctlRipper.vb:668` does not β€” after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (8 lines × 2) LimeSeed/Controls/ctlRipper.vb:1090 β€” LimeSeed/Controls/ctlRipper.vb:1090-1097 | LimeSeed/Controls/ctlRipper.vb:1108-1115 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
  • Duplicated block (8 lines × 2) LimeSeed/Forms/frmMain.vb:2677 β€” LimeSeed/Forms/frmMain.vb:2677-2684 | LimeSeed/Forms/frmMain.vb:2702-2709 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
  • Duplicated block (8 lines × 2) LimeSeed/Forms/frmSettings.vb:613 β€” LimeSeed/Forms/frmSettings.vb:613-620 | LimeSeed/Forms/frmSettings.vb:1000-1007 β€” both copies are in the same file, so extract the 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 (9 lines × 2) Β· Γ—6
  • Duplicated block (9 lines × 2) LimeSeed/Controls/ctlRipper.vb:200 β€” LimeSeed/Controls/ctlRipper.vb:200-208 | LimeSeed/Modules/modFuncts.vb:2251-2259 β€” 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 (9 lines × 2) LimeSeed/Classes/clsCDRip.vb:148 β€” LimeSeed/Classes/clsCDRip.vb:148-156 | LimeSeed/Classes/clsCDRip.vb:163-171 β€” both copies are in the same file, so extract the 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) LimeSeed/Classes/clsSocket.vb:257 β€” LimeSeed/Classes/clsSocket.vb:257-265 | Seed/clsSocket.vb:476-484 β€” before extracting anything, compare `LimeSeed/Classes/clsSocket.vb` and `Seed/clsSocket.vb` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (9 lines × 2) LimeSeed/Classes/clsToolStripSystemRenderer.vb:304 β€” LimeSeed/Classes/clsToolStripSystemRenderer.vb:304-312 | LimeSeed/Classes/clsToolStripSystemRenderer.vb:415-423 β€” both copies are in the same file, so extract the 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 `LimeSeed/Classes/clsToolStripSystemRenderer.vb:304` 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 (9 lines × 2) LimeSeed/Forms/frmMain.vb:5177 β€” LimeSeed/Forms/frmMain.vb:5177-5185 | LimeSeed/Forms/frmMain.vb:5278-5286 β€” both copies are in the same file, so extract the 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) LimeSeed/Forms/frmTray.vb:100 β€” LimeSeed/Forms/frmTray.vb:100-108 | LimeSeed/Forms/frmTray.vb:113-121 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
D4 Β· Code Duplication Β· Duplicated block (10 lines × 2) Β· Γ—6
  • Duplicated block (10 lines × 2) LimeSeed/Forms/frmProps.vb:1775 β€” LimeSeed/Forms/frmProps.vb:1775-1784 | LimeSeed/Forms/frmProps.vb:1808-1817 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
  • Duplicated block (10 lines × 2) LimeSeed/Forms/frmMain.vb:5945 β€” LimeSeed/Forms/frmMain.vb:5945-5954 | LimeSeed/Forms/frmMain.vb:5962-5971 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited. β˜… These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `LimeSeed/Forms/frmMain.vb:5955` calls `GetFileName` and `LimeSeed/Forms/frmMain.vb:5972` does not β€” after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (10 lines × 2) LimeSeed/Forms/frmMain.vb:6078 β€” LimeSeed/Forms/frmMain.vb:6078-6087 | LimeSeed/Forms/frmMain.vb:6111-6120 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
  • Duplicated block (10 lines × 2) Seed/Headers/clsID3v2.vb:2422 β€” Seed/Headers/clsID3v2.vb:2422-2431 | Seed/Headers/clsID3v2.vb:2489-2498 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
  • Duplicated block (10 lines × 2) Seed/Headers/clsID3v2.vb:2811 β€” Seed/Headers/clsID3v2.vb:2811-2820 | Seed/Headers/clsID3v2.vb:2824-2833 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
  • Duplicated block (10 lines × 2) Seed/Headers/clsMPEG.vb:294 β€” Seed/Headers/clsMPEG.vb:294-303 | Seed/Headers/clsMPEG.vb:475-484 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
D17 Β· Explicit Debt Β· CommentedOutCode Β· Γ—5
  • CommentedOutCode FFAPI/FFDShowAPI.cs:1243 β€” 4 consecutive commented-code lines
  • CommentedOutCode FFAPI/FFDShowAPI.cs:1251 β€” 4 consecutive commented-code lines
  • CommentedOutCode FFAPI/FFDShowAPI.cs:2252 β€” 4 consecutive commented-code lines
  • CommentedOutCode FFAPI/FFDShowReceiver.cs:113 β€” 5 consecutive commented-code lines
  • CommentedOutCode FFAPI/Interfaces/IffdshowDecVideo.cs:69 β€” 3 consecutive commented-code lines
D4 Β· Code Duplication Β· Duplicated block (13 lines × 2) Β· Γ—4
  • Duplicated block (13 lines × 2) Seed/ctlSeed.vb:973 β€” Seed/ctlSeed.vb:973-985 | Seed/ctlSeed.vb:1058-1070 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
  • Duplicated block (13 lines × 2) LimeSeed/Classes/clsToolStripSystemRenderer.vb:366 β€” LimeSeed/Classes/clsToolStripSystemRenderer.vb:366-378 | LimeSeed/Classes/clsToolStripSystemRenderer.vb:436-448 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited. β˜… These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `LimeSeed/Classes/clsToolStripSystemRenderer.vb:365` calls `GetType` and `LimeSeed/Classes/clsToolStripSystemRenderer.vb:435` 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 (13 lines × 2) Seed/Headers/clsMPEG.vb:260 β€” Seed/Headers/clsMPEG.vb:260-272 | Seed/Headers/clsMPEG.vb:441-453 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
  • Duplicated block (13 lines × 2) LimeSeed/Classes/clsSocket.vb:439 β€” LimeSeed/Classes/clsSocket.vb:439-451 | Seed/clsSocket.vb:645-657 β€” before extracting anything, compare `LimeSeed/Classes/clsSocket.vb` and `Seed/clsSocket.vb` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 91 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.
X3 Β· Exception handling Β· Swallowed exception (empty catch) Β· Γ—4
  • Swallowed exception (empty catch) FFAPI/FFDShowReceiver.cs:123 β€” 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) FFAPI/FFDShowAPI.cs:1740 β€” 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) FFAPI/FFDShowAPI.cs:2163 β€” 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) FFAPI/FFDShowAPI.cs:2231 β€” 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 Β· Duplicated block (16 lines × 2) Β· Γ—3
  • Duplicated block (16 lines × 2) LimeSeed/Modules/modFuncts.vb:1377 β€” LimeSeed/Modules/modFuncts.vb:1377-1392 | LimeSeed/Modules/modFuncts.vb:1398-1413 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
  • Duplicated block (16 lines × 2) LimeSeed/Forms/frmMain.vb:7359 β€” LimeSeed/Forms/frmMain.vb:7359-7374 | LimeSeed/Forms/frmMain.vb:7382-7397 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
  • Duplicated block (16 lines × 2) Seed/Headers/clsID3v2.vb:197 β€” Seed/Headers/clsID3v2.vb:197-212 | Seed/Headers/clsID3v2.vb:219-234 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
D4 Β· Code Duplication Β· Duplicated block (14 lines × 2) Β· Γ—3
  • Duplicated block (14 lines × 2) LimeSeed/Forms/frmMain.vb:3496 β€” LimeSeed/Forms/frmMain.vb:3496-3509 | LimeSeed/Forms/frmMain.vb:3519-3532 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
  • Duplicated block (14 lines × 2) Seed/Headers/clsID3v2.vb:2607 β€” Seed/Headers/clsID3v2.vb:2607-2620 | Seed/Headers/clsID3v2.vb:2630-2643 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
  • Duplicated block (14 lines × 2) Seed/Headers/clsMPEG.vb:223 β€” Seed/Headers/clsMPEG.vb:223-236 | Seed/Headers/clsMPEG.vb:404-417 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
D6 Β· Cohesion (LCOM4) Β· Low cohesion Β· Γ—3
  • Low cohesion: ToolStripRadioButtonMenuItem (LCOM4 6) LimeSeed/Classes/clsRadioMenu.vb:5 β€” ToolStripRadioButtonMenuItem'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: frmMain (LCOM4 5) LimeSeed/Forms/frmMain.vb:3 β€” frmMain'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: clsID3v2 (LCOM4 5) Seed/Headers/clsID3v2.vb:1 β€” clsID3v2'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.
D1 Β· Cyclomatic Complexity Β· modFuncts.GetMKVDisplaySize (cyclomatic 20) Β· Γ—2
  • modFuncts.GetMKVDisplaySize (cyclomatic 20) LimeSeed/Modules/modFuncts.vb:241 β€” modFuncts.GetMKVDisplaySize has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: modFuncts.AVIVideoCodecs (cyclomatic 293) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
  • modFuncts.GetMKVDisplaySize (cyclomatic 20) Seed/modFuncts.vb:46 β€” modFuncts.GetMKVDisplaySize has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: modFuncts.HRMessage (cyclomatic 135) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D17 Β· Explicit Debt Β· BarePragmaDisable Β· Γ—2
  • BarePragmaDisable FFAPI/FFDShowAPI.cs:72 β€” #pragma warning disable 1591 β€” the disable is closed again below, so its scope is not the problem; what it records is no reason: there is nothing on the directive line, and no ordinary comment attached to it either side. A suppression is a decision somebody made, and without the reason the next reader cannot tell a considered exception from an unexamined one, so it is never revisited and it outlives the code it was written for. Put the reason on the directive line β€” what makes this site legitimately different β€” or fix what the rule is pointing at and delete the pair. A rationale in the member's documentation comment does not clear this row and is not meant to: it explains the member to its callers, and the next person to touch the suppression is not reading it for that.
  • BarePragmaDisable FFAPI/FFDShowAPI.cs:235 β€” #pragma warning disable 1591 β€” the disable is closed again below, so its scope is not the problem; what it records is no reason: there is nothing on the directive line, and no ordinary comment attached to it either side. A suppression is a decision somebody made, and without the reason the next reader cannot tell a considered exception from an unexamined one, so it is never revisited and it outlives the code it was written for. Put the reason on the directive line β€” what makes this site legitimately different β€” or fix what the rule is pointing at and delete the pair. A rationale in the member's documentation comment does not clear this row and is not meant to: it explains the member to its callers, and the next person to touch the suppression is not reading it for that.
D2 Β· Cognitive Complexity Β· modFuncts.GetMKVDisplaySize (cognitive 57) Β· Γ—2
  • modFuncts.GetMKVDisplaySize (cognitive 57) LimeSeed/Modules/modFuncts.vb:241 β€” modFuncts.GetMKVDisplaySize has cognitive complexity 57 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
  • modFuncts.GetMKVDisplaySize (cognitive 57) Seed/modFuncts.vb:46 β€” modFuncts.GetMKVDisplaySize has cognitive complexity 57 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· Connection.AsyncEventCompleted (cognitive 36) Β· Γ—2
  • Connection.AsyncEventCompleted (cognitive 36) LimeSeed/Classes/clsSocket.vb:297 β€” Connection.AsyncEventCompleted has cognitive complexity 36 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
  • Connection.AsyncEventCompleted (cognitive 36) Seed/clsSocket.vb:513 β€” Connection.AsyncEventCompleted has cognitive complexity 36 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· modFuncts.CheckMPEG (cognitive 20) Β· Γ—2
  • modFuncts.CheckMPEG (cognitive 20) LimeSeed/Modules/modFuncts.vb:198 β€” modFuncts.CheckMPEG has cognitive complexity 20 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
  • modFuncts.CheckMPEG (cognitive 20) Seed/modFuncts.vb:19 β€” modFuncts.CheckMPEG has cognitive complexity 20 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· clsVorbis.FindLONG (cognitive 19) Β· Γ—2
  • clsVorbis.FindLONG (cognitive 19) Seed/Headers/clsVorbis.vb:830 β€” clsVorbis.FindLONG has cognitive complexity 19 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (clsVorbis.FindLONG) has the same decision points, in the same order, at the same nesting depths β€” so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
  • clsVorbis.FindLONG (cognitive 19) Seed/Headers/clsVorbis.vb:861 β€” clsVorbis.FindLONG has cognitive complexity 19 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (clsVorbis.FindLONG) has the same decision points, in the same order, at the same nesting depths β€” so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D4 Β· Code Duplication Β· Members sharing a duplicated core (4 members, 50+ identical tokens) Β· Γ—2
  • Members sharing a duplicated core (4 members, 50+ identical tokens) LimeSeed/Forms/frmFullScreen.vb:168 β€” LimeSeed/Forms/frmFullScreen.vb:168-180 | LimeSeed/Forms/frmFullScreen.vb:184-191 | LimeSeed/Forms/frmMain.vb:1227-1236 | LimeSeed/Forms/frmMain.vb:1240-1246 β€” These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below β€” it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain β€” factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
  • Members sharing a duplicated core (4 members, 50+ identical tokens) LimeSeed/Modules/modFuncts.vb:50 β€” LimeSeed/Modules/modFuncts.vb:50-71 | Seed/Headers/clsID3v2.vb:1191-1212 | Seed/Headers/clsMIDI.vb:383-401 | Seed/Headers/modHeaderFunctions.vb:3-24 β€” 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 Β· Duplicated block (18 lines × 2) Β· Γ—2
  • Duplicated block (18 lines × 2) LimeSeed/Controls/ctlArtList.vb:22 β€” LimeSeed/Controls/ctlArtList.vb:22-39 | LimeSeed/Controls/ctlArtList.vb:276-293 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
  • Duplicated block (18 lines × 2) LimeSeed/Forms/frmMain.vb:7048 β€” LimeSeed/Forms/frmMain.vb:7048-7065 | LimeSeed/Forms/frmSettings.vb:955-972 β€” 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 (15 lines × 2) Β· Γ—2
  • Duplicated block (15 lines × 2) LimeSeed/Controls/BetterProgress.vb:290 β€” LimeSeed/Controls/BetterProgress.vb:290-304 | LimeSeed/Controls/BetterProgress.vb:308-322 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
  • Duplicated block (15 lines × 2) Seed/Headers/clsID3v1.vb:116 β€” Seed/Headers/clsID3v1.vb:116-130 | Seed/Headers/clsID3v1.vb:133-147 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
D4 Β· Code Duplication Β· Duplicated block (11 lines × 2) Β· Γ—2
  • Duplicated block (11 lines × 2) LimeSeed/Forms/frmMain.vb:3451 β€” LimeSeed/Forms/frmMain.vb:3451-3461 | LimeSeed/Forms/frmMain.vb:3465-3475 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
  • Duplicated block (11 lines × 2) Seed/ctlSeed.vb:702 β€” Seed/ctlSeed.vb:702-712 | Seed/ctlSeed.vb:763-773 β€” both copies are in the same file, so extract the 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 lines × 2) Β· Γ—2
  • Duplicated block (12 lines × 2) GreenThumb/GreenThumbnailProperties.vb:566 β€” GreenThumb/GreenThumbnailProperties.vb:566-577 | LimeSeed/Modules/modFuncts.vb:184-195 β€” the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach β€” a location they all depend on today, or a new shared one if there is none β€” and call it from each site; until then, every change has to be made twice.
  • Duplicated block (12 lines × 2) Seed/ctlSeed.vb:1262 β€” Seed/ctlSeed.vb:1262-1273 | Seed/ctlSeed.vb:1286-1297 β€” both copies are in the same file, so extract the 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 (6 lines × 4) Β· Γ—2
  • Duplicated block (6 lines × 4) LimeSeed/Forms/frmProps.vb:1781 β€” LimeSeed/Forms/frmProps.vb:1781-1786 | LimeSeed/Forms/frmProps.vb:1795-1800 | LimeSeed/Forms/frmProps.vb:1814-1819 | LimeSeed/Forms/frmProps.vb:1828-1833 β€” all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites β€” resolving only two of them leaves the rest to drift apart the first time one is edited.
  • Duplicated block (6 lines × 4) LimeSeed/Classes/clsRadioMenu.vb:90 β€” LimeSeed/Classes/clsRadioMenu.vb:90-95 | LimeSeed/Classes/clsRadioMenu.vb:178-183 | LimeSeed/Classes/clsToolStripSystemRenderer.vb:87-92 | LimeSeed/Classes/clsToolStripSystemRenderer.vb:166-171 β€” there are 4 copies across 2 file(s) β€” more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart.
D4 Β· Code Duplication Β· Duplicated block (8 lines × 3) Β· Γ—2
  • Duplicated block (8 lines × 3) Seed/ctlSeed.vb:628 β€” Seed/ctlSeed.vb:628-635 | Seed/ctlSeed.vb:705-712 | Seed/ctlSeed.vb:766-773 β€” all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites β€” resolving only two of them leaves the rest to drift apart the first time one is edited.
  • Duplicated block (8 lines × 3) Seed/Headers/clsID3v2.vb:198 β€” Seed/Headers/clsID3v2.vb:198-205 | Seed/Headers/clsID3v2.vb:220-227 | Seed/Headers/clsID3v2.vb:549-556 β€” all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites β€” resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 Β· Code Duplication Β· Duplicated block (7 lines × 4) Β· Γ—2
  • Duplicated block (7 lines × 4) Seed/Headers/clsMPEG.vb:127 β€” Seed/Headers/clsMPEG.vb:127-133 | Seed/Headers/clsMPEG.vb:232-238 | Seed/Headers/clsMPEG.vb:308-314 | Seed/Headers/clsMPEG.vb:413-419 β€” all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites β€” resolving only two of them leaves the rest to drift apart the first time one is edited.
  • Duplicated block (7 lines × 4) Seed/Headers/clsMPEG.vb:6 β€” Seed/Headers/clsMPEG.vb:6-12 | Seed/Headers/clsMPEG.vb:13-19 | Seed/Headers/clsMPEG.vb:20-26 | Seed/Headers/clsMPEG.vb:27-33 β€” all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites β€” resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 Β· Code Duplication Β· Duplicated block (6 lines × 3) Β· Γ—2
  • Duplicated block (6 lines × 3) LimeSeed/Classes/clsToolStripSystemRenderer.vb:319 β€” LimeSeed/Classes/clsToolStripSystemRenderer.vb:319-324 | LimeSeed/Classes/clsToolStripSystemRenderer.vb:359-364 | LimeSeed/Classes/clsToolStripSystemRenderer.vb:430-435 β€” all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites β€” resolving only two of them leaves the rest to drift apart the first time one is edited. β˜… These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `LimeSeed/Classes/clsToolStripSystemRenderer.vb:365` calls `GetType` and `LimeSeed/Classes/clsToolStripSystemRenderer.vb:436` does not β€” after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (6 lines × 3) LimeSeed/Forms/frmProps.vb:2075 β€” LimeSeed/Forms/frmProps.vb:2075-2080 | LimeSeed/Forms/frmProps.vb:2081-2086 | LimeSeed/Forms/frmProps.vb:2087-2092 β€” 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.
D1 Β· Cyclomatic Complexity Β· PropertyHandler.LoadRIFF (cyclomatic 188) Β· Γ—1
  • PropertyHandler.LoadRIFF (cyclomatic 188) GreenThumb/GreenThumbnailProperties.vb:346 β€” PropertyHandler.LoadRIFF has cyclomatic complexity 188 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· frmMain.tmrUpdate_Tick (cyclomatic 153) Β· Γ—1
  • frmMain.tmrUpdate_Tick (cyclomatic 153) LimeSeed/Forms/frmMain.vb:4971 β€” frmMain.tmrUpdate_Tick has cyclomatic complexity 153 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· frmMain.CleanupID3 (cyclomatic 143) Β· Γ—1
  • frmMain.CleanupID3 (cyclomatic 143) LimeSeed/Forms/frmMain.vb:6348 β€” frmMain.CleanupID3 has cyclomatic complexity 143 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· frmProps.LoadRIFF (cyclomatic 134) Β· Γ—1
  • frmProps.LoadRIFF (cyclomatic 134) LimeSeed/Forms/frmProps.vb:815 β€” frmProps.LoadRIFF has cyclomatic complexity 134 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· frmProps.ShowData (cyclomatic 121) Β· Γ—1
  • frmProps.ShowData (cyclomatic 121) LimeSeed/Forms/frmProps.vb:1132 β€” frmProps.ShowData has cyclomatic complexity 121 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· clsMKVHeaders.ReadTrackInfo (cyclomatic 114) Β· Γ—1
  • clsMKVHeaders.ReadTrackInfo (cyclomatic 114) Seed/Headers/clsMKV.vb:792 β€” clsMKVHeaders.ReadTrackInfo has cyclomatic complexity 114 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· frmProps.LoadMKV (cyclomatic 98) Β· Γ—1
  • frmProps.LoadMKV (cyclomatic 98) LimeSeed/Forms/frmProps.vb:508 β€” frmProps.LoadMKV has cyclomatic complexity 98 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· clsMPEG.GetBitrate (cyclomatic 90) Β· Γ—1
  • clsMPEG.GetBitrate (cyclomatic 90) Seed/Headers/clsMPEG.vb:124 β€” clsMPEG.GetBitrate has cyclomatic complexity 90 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: one other method here (clsMPEG.GetBitQual) has the same decision points, in the same order, at the same nesting depths β€” so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 Β· Cyclomatic Complexity Β· clsMPEG.GetBitQual (cyclomatic 90) Β· Γ—1
  • clsMPEG.GetBitQual (cyclomatic 90) Seed/Headers/clsMPEG.vb:305 β€” clsMPEG.GetBitQual has cyclomatic complexity 90 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: one other method here (clsMPEG.GetBitrate) has the same decision points, in the same order, at the same nesting depths β€” so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 Β· Cyclomatic Complexity Β· frmMain.LoadData_Audio_WAV (cyclomatic 89) Β· Γ—1
  • frmMain.LoadData_Audio_WAV (cyclomatic 89) LimeSeed/Forms/frmMain.vb:4497 β€” frmMain.LoadData_Audio_WAV has cyclomatic complexity 89 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· frmMain.DragDropFiles (cyclomatic 87) Β· Γ—1
  • frmMain.DragDropFiles (cyclomatic 87) LimeSeed/Forms/frmMain.vb:5885 β€” frmMain.DragDropFiles has cyclomatic complexity 87 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· clsMKVHeaders.DebugData (cyclomatic 86) Β· Γ—1
  • clsMKVHeaders.DebugData (cyclomatic 86) Seed/Headers/clsMKV.vb:438 β€” clsMKVHeaders.DebugData has cyclomatic complexity 86 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· frmMain.LoadData_Video (cyclomatic 82) Β· Γ—1
  • frmMain.LoadData_Video (cyclomatic 82) LimeSeed/Forms/frmMain.vb:3714 β€” frmMain.LoadData_Video has cyclomatic complexity 82 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· clsRIFF.New.ctor (cyclomatic 80) Β· Γ—1
  • clsRIFF.New.ctor (cyclomatic 80) Seed/Headers/clsRIFF.vb:823 β€” clsRIFF.New.ctor has cyclomatic complexity 80 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· ctlSeed.sckDownload_SocketReceived (cyclomatic 75) Β· Γ—1
  • ctlSeed.sckDownload_SocketReceived (cyclomatic 75) Seed/ctlSeed.vb:1988 β€” ctlSeed.sckDownload_SocketReceived has cyclomatic complexity 75 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· frmMain.GetArt (cyclomatic 68) Β· Γ—1
  • frmMain.GetArt (cyclomatic 68) LimeSeed/Forms/frmMain.vb:7465 β€” frmMain.GetArt has cyclomatic complexity 68 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· frmMain.ProcessKeyPreview (cyclomatic 66) Β· Γ—1
  • frmMain.ProcessKeyPreview (cyclomatic 66) LimeSeed/Forms/frmMain.vb:6830 β€” frmMain.ProcessKeyPreview has cyclomatic complexity 66 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· modAssoc.Main (cyclomatic 65) Β· Γ—1
  • modAssoc.Main (cyclomatic 65) LSFA/modAssoc.vb:62 β€” modAssoc.Main has cyclomatic complexity 65 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· modFuncts.FindAdditionalMKVChapters (cyclomatic 64) Β· Γ—1
  • modFuncts.FindAdditionalMKVChapters (cyclomatic 64) LimeSeed/Modules/modFuncts.vb:325 β€” modFuncts.FindAdditionalMKVChapters has cyclomatic complexity 64 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: modFuncts.AVIVideoCodecs (cyclomatic 293) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· frmMain.PLItems_PlayListUpdate (cyclomatic 63) Β· Γ—1
  • frmMain.PLItems_PlayListUpdate (cyclomatic 63) LimeSeed/Forms/frmMain.vb:7900 β€” frmMain.PLItems_PlayListUpdate has cyclomatic complexity 63 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· modAssoc.Add_Associate (cyclomatic 63) Β· Γ—1
  • modAssoc.Add_Associate (cyclomatic 63) LSFA/modAssoc.vb:364 β€” modAssoc.Add_Associate has cyclomatic complexity 63 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· clsID3v2.Save (cyclomatic 54) Β· Γ—1
  • clsID3v2.Save (cyclomatic 54) Seed/Headers/clsID3v2.vb:2765 β€” clsID3v2.Save has cyclomatic complexity 54 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: clsID3v2.GetFrameName (cyclomatic 164) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· frmMain.PlayList_ParseItem (cyclomatic 53) Β· Γ—1
  • frmMain.PlayList_ParseItem (cyclomatic 53) LimeSeed/Forms/frmMain.vb:205 β€” frmMain.PlayList_ParseItem has cyclomatic complexity 53 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· SocketWrapper.ReceivedData (cyclomatic 53) Β· Γ—1
  • SocketWrapper.ReceivedData (cyclomatic 53) Seed/clsSocket.vb:139 β€” SocketWrapper.ReceivedData has cyclomatic complexity 53 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· modAssoc.Rem_Associate (cyclomatic 50) Β· Γ—1
  • modAssoc.Rem_Associate (cyclomatic 50) LSFA/modAssoc.vb:784 β€” modAssoc.Rem_Associate has cyclomatic complexity 50 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: modAssoc.RemType (cyclomatic 56) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· frmMain.LoadData_Video_AVI (cyclomatic 44) Β· Γ—1
  • frmMain.LoadData_Video_AVI (cyclomatic 44) LimeSeed/Forms/frmMain.vb:4235 β€” frmMain.LoadData_Video_AVI has cyclomatic complexity 44 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· clsMIDI.ReadTrack (cyclomatic 44) Β· Γ—1
  • clsMIDI.ReadTrack (cyclomatic 44) Seed/Headers/clsMIDI.vb:127 β€” clsMIDI.ReadTrack has cyclomatic complexity 44 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· ctlRipper.cmdRip_Click (cyclomatic 43) Β· Γ—1
  • ctlRipper.cmdRip_Click (cyclomatic 43) LimeSeed/Controls/ctlRipper.vb:313 β€” ctlRipper.cmdRip_Click has cyclomatic complexity 43 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· ctlSeed.GetThumbnailFromControl (cyclomatic 43) Β· Γ—1
  • ctlSeed.GetThumbnailFromControl (cyclomatic 43) Seed/ctlSeed.vb:396 β€” ctlSeed.GetThumbnailFromControl has cyclomatic complexity 43 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· frmMain.StartupRun (cyclomatic 42) Β· Γ—1
  • frmMain.StartupRun (cyclomatic 42) LimeSeed/Forms/frmMain.vb:5715 β€” frmMain.StartupRun has cyclomatic complexity 42 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· frmMain.LoadTempPL (cyclomatic 41) Β· Γ—1
  • frmMain.LoadTempPL (cyclomatic 41) LimeSeed/Forms/frmMain.vb:2378 β€” frmMain.LoadTempPL has cyclomatic complexity 41 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· clsVorbis.LoadVorbis (cyclomatic 41) Β· Γ—1
  • clsVorbis.LoadVorbis (cyclomatic 41) Seed/Headers/clsVorbis.vb:447 β€” clsVorbis.LoadVorbis has cyclomatic complexity 41 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· CDDBNet.HandleData (cyclomatic 40) Β· Γ—1
  • CDDBNet.HandleData (cyclomatic 40) LimeSeed/Controls/ctlRipper.vb:1039 β€” CDDBNet.HandleData has cyclomatic complexity 40 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· frmProps.dgvID3v2_CellValueChanged (cyclomatic 40) Β· Γ—1
  • frmProps.dgvID3v2_CellValueChanged (cyclomatic 40) LimeSeed/Forms/frmProps.vb:1749 β€” frmProps.dgvID3v2_CellValueChanged has cyclomatic complexity 40 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· clsID3v2.ParseString (cyclomatic 40) Β· Γ—1
  • clsID3v2.ParseString (cyclomatic 40) Seed/Headers/clsID3v2.vb:2589 β€” clsID3v2.ParseString has cyclomatic complexity 40 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: clsID3v2.GetFrameName (cyclomatic 164) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· frmMain.LoadData_Video_MKV (cyclomatic 39) Β· Γ—1
  • frmMain.LoadData_Video_MKV (cyclomatic 39) LimeSeed/Forms/frmMain.vb:4038 β€” frmMain.LoadData_Video_MKV has cyclomatic complexity 39 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· clsMKVHeaders.ReadChapterAtom (cyclomatic 39) Β· Γ—1
  • clsMKVHeaders.ReadChapterAtom (cyclomatic 39) Seed/Headers/clsMKV.vb:1127 β€” clsMKVHeaders.ReadChapterAtom has cyclomatic complexity 39 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· frmMain.JoyRun (cyclomatic 38) Β· Γ—1
  • frmMain.JoyRun (cyclomatic 38) LimeSeed/Forms/frmMain.vb:7068 β€” frmMain.JoyRun has cyclomatic complexity 38 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· ctlSeed.GetFileThumbnail (cyclomatic 38) Β· Γ—1
  • ctlSeed.GetFileThumbnail (cyclomatic 38) Seed/ctlSeed.vb:617 β€” ctlSeed.GetFileThumbnail has cyclomatic complexity 38 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· frmMain.SetProps (cyclomatic 36) Β· Γ—1
  • frmMain.SetProps (cyclomatic 36) LimeSeed/Forms/frmMain.vb:3287 β€” frmMain.SetProps has cyclomatic complexity 36 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· clsVorbis.FillInData (cyclomatic 35) Β· Γ—1
  • clsVorbis.FillInData (cyclomatic 35) Seed/Headers/clsVorbis.vb:291 β€” clsVorbis.FillInData has cyclomatic complexity 35 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· frmProps.GenerateFrameRow (cyclomatic 34) Β· Γ—1
  • frmProps.GenerateFrameRow (cyclomatic 34) LimeSeed/Forms/frmProps.vb:118 β€” frmProps.GenerateFrameRow has cyclomatic complexity 34 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· frmMain.LoadData_Video_OGM (cyclomatic 33) Β· Γ—1
  • frmMain.LoadData_Video_OGM (cyclomatic 33) LimeSeed/Forms/frmMain.vb:4160 β€” frmMain.LoadData_Video_OGM has cyclomatic complexity 33 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· frmMain.SaveArtToMP3 (cyclomatic 33) Β· Γ—1
  • frmMain.SaveArtToMP3 (cyclomatic 33) LimeSeed/Forms/frmMain.vb:7400 β€” frmMain.SaveArtToMP3 has cyclomatic complexity 33 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· frmProps.LoadVorbis (cyclomatic 33) Β· Γ—1
  • frmProps.LoadVorbis (cyclomatic 33) LimeSeed/Forms/frmProps.vb:441 β€” frmProps.LoadVorbis has cyclomatic complexity 33 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· frmProps.LoadMIDI (cyclomatic 33) Β· Γ—1
  • frmProps.LoadMIDI (cyclomatic 33) LimeSeed/Forms/frmProps.vb:740 β€” frmProps.LoadMIDI has cyclomatic complexity 33 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· frmMain.GetTitle (cyclomatic 32) Β· Γ—1
  • frmMain.GetTitle (cyclomatic 32) LimeSeed/Forms/frmMain.vb:6234 β€” frmMain.GetTitle has cyclomatic complexity 32 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· LHV1.New.ctor (cyclomatic 31) Β· Γ—1
  • LHV1.New.ctor (cyclomatic 31) LimeSeed/Classes/clsLAME.vb:147 β€” LHV1.New.ctor has cyclomatic complexity 31 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· frmMain.LoadData_Video_DVD (cyclomatic 31) Β· Γ—1
  • frmMain.LoadData_Video_DVD (cyclomatic 31) LimeSeed/Forms/frmMain.vb:3963 β€” frmMain.LoadData_Video_DVD has cyclomatic complexity 31 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· frmMain.mpPlayer_EndOfFile (cyclomatic 30) Β· Γ—1
  • frmMain.mpPlayer_EndOfFile (cyclomatic 30) LimeSeed/Forms/frmMain.vb:3071 β€” frmMain.mpPlayer_EndOfFile has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· clsJoyDetection.tmrCheck_Tick (cyclomatic 29) Β· Γ—1
  • clsJoyDetection.tmrCheck_Tick (cyclomatic 29) LimeSeed/Classes/clsJoy.vb:258 β€” clsJoyDetection.tmrCheck_Tick has cyclomatic complexity 29 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· frmMain.macArt_Choices (cyclomatic 29) Β· Γ—1
  • frmMain.macArt_Choices (cyclomatic 29) LimeSeed/Forms/frmMain.vb:7202 β€” frmMain.macArt_Choices has cyclomatic complexity 29 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· frmProps.LoadID3v2 (cyclomatic 29) Β· Γ—1
  • frmProps.LoadID3v2 (cyclomatic 29) LimeSeed/Forms/frmProps.vb:241 β€” frmProps.LoadID3v2 has cyclomatic complexity 29 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· ctlSeed.PullMetaDataFromStream (cyclomatic 29) Β· Γ—1
  • ctlSeed.PullMetaDataFromStream (cyclomatic 29) Seed/ctlSeed.vb:2261 β€” ctlSeed.PullMetaDataFromStream has cyclomatic complexity 29 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· frmMain.cmbAudTrack_SelectedIndexChanged (cyclomatic 27) Β· Γ—1
  • frmMain.cmbAudTrack_SelectedIndexChanged (cyclomatic 27) LimeSeed/Forms/frmMain.vb:1110 β€” frmMain.cmbAudTrack_SelectedIndexChanged has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· frmProps.DataGrid_CellContentClick (cyclomatic 27) Β· Γ—1
  • frmProps.DataGrid_CellContentClick (cyclomatic 27) LimeSeed/Forms/frmProps.vb:1485 β€” frmProps.DataGrid_CellContentClick has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmProps.id3v2Combo_SelectedIndexChanged (cyclomatic 28) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· clsID3v2.ParseGenreFrame (cyclomatic 27) Β· Γ—1
  • clsID3v2.ParseGenreFrame (cyclomatic 27) Seed/Headers/clsID3v2.vb:2353 β€” clsID3v2.ParseGenreFrame has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: clsID3v2.GetFrameName (cyclomatic 164) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· PropertyHandler.GetValue (cyclomatic 26) Β· Γ—1
  • PropertyHandler.GetValue (cyclomatic 26) GreenThumb/GreenThumbnailProperties.vb:106 β€” PropertyHandler.GetValue has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: PropertyHandler.WAVAudioCodecs (cyclomatic 120) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· PROPERTYKEY.ToString (cyclomatic 26) Β· Γ—1
  • PROPERTYKEY.ToString (cyclomatic 26) GreenThumb/COMWrap.vb:47 β€” PROPERTYKEY.ToString has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· clsID3v2.AddBareFrame (cyclomatic 26) Β· Γ—1
  • clsID3v2.AddBareFrame (cyclomatic 26) Seed/Headers/clsID3v2.vb:178 β€” clsID3v2.AddBareFrame has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: clsID3v2.GetFrameName (cyclomatic 164) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· clsMKVHeaders.ReadSegmentInfo (cyclomatic 25) Β· Γ—1
  • clsMKVHeaders.ReadSegmentInfo (cyclomatic 25) Seed/Headers/clsMKV.vb:729 β€” clsMKVHeaders.ReadSegmentInfo has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· ToolStripSystemRenderer.OnRenderMenuItemBackground (cyclomatic 24) Β· Γ—1
  • ToolStripSystemRenderer.OnRenderMenuItemBackground (cyclomatic 24) LimeSeed/Classes/clsToolStripSystemRenderer.vb:268 β€” ToolStripSystemRenderer.OnRenderMenuItemBackground has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· BetterProgress.OnPaint (cyclomatic 24) Β· Γ—1
  • BetterProgress.OnPaint (cyclomatic 24) LimeSeed/Controls/BetterProgress.vb:164 β€” BetterProgress.OnPaint has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· frmAbout.CompareVersions (cyclomatic 24) Β· Γ—1
  • frmAbout.CompareVersions (cyclomatic 24) LimeSeed/Forms/frmAbout.vb:103 β€” frmAbout.CompareVersions has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· frmMain.PlayList_ItemParsed (cyclomatic 24) Β· Γ—1
  • frmMain.PlayList_ItemParsed (cyclomatic 24) LimeSeed/Forms/frmMain.vb:313 β€” frmMain.PlayList_ItemParsed has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· frmMain.SaveTempPL (cyclomatic 24) Β· Γ—1
  • frmMain.SaveTempPL (cyclomatic 24) LimeSeed/Forms/frmMain.vb:2665 β€” frmMain.SaveTempPL has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· clsID3v1.Save (cyclomatic 24) Β· Γ—1
  • clsID3v1.Save (cyclomatic 24) Seed/Headers/clsID3v1.vb:82 β€” clsID3v1.Save has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: clsID3v1.GenreName.Get (cyclomatic 194) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· clsID3v2.ParseGenreFrame (cyclomatic 24) Β· Γ—1
  • clsID3v2.ParseGenreFrame (cyclomatic 24) Seed/Headers/clsID3v2.vb:2433 β€” clsID3v2.ParseGenreFrame has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: clsID3v2.GetFrameName (cyclomatic 164) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· MyApplication.tcpListener_SocketReceived (cyclomatic 23) Β· Γ—1
  • MyApplication.tcpListener_SocketReceived (cyclomatic 23) LimeSeed/ApplicationEvents.vb:381 β€” MyApplication.tcpListener_SocketReceived has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· frmMain.LoadData_Audio_Vorbis (cyclomatic 23) Β· Γ—1
  • frmMain.LoadData_Audio_Vorbis (cyclomatic 23) LimeSeed/Forms/frmMain.vb:4447 β€” frmMain.LoadData_Audio_Vorbis has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· ctlSeed.Duration.Get (cyclomatic 23) Β· Γ—1
  • ctlSeed.Duration.Get (cyclomatic 23) Seed/ctlSeed.vb:220 β€” ctlSeed.Duration.Get has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· ctlSeed.CloseMedia (cyclomatic 23) Β· Γ—1
  • ctlSeed.CloseMedia (cyclomatic 23) Seed/ctlSeed.vb:1541 β€” ctlSeed.CloseMedia has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· frmMain.OpenM3U (cyclomatic 22) Β· Γ—1
  • frmMain.OpenM3U (cyclomatic 22) LimeSeed/Forms/frmMain.vb:2269 β€” frmMain.OpenM3U has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· frameSort.Compare (cyclomatic 22) Β· Γ—1
  • frameSort.Compare (cyclomatic 22) Seed/Headers/clsID3v2.vb:2718 β€” frameSort.Compare has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: clsID3v2.GetFrameName (cyclomatic 164) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· PlayListItems.Shuffle (cyclomatic 21) Β· Γ—1
  • PlayListItems.Shuffle (cyclomatic 21) LimeSeed/Forms/frmMain.vb:639 β€” PlayListItems.Shuffle has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· frmMain.LoadData_Video_FFDShow (cyclomatic 21) Β· Γ—1
  • frmMain.LoadData_Video_FFDShow (cyclomatic 21) LimeSeed/Forms/frmMain.vb:4338 β€” frmMain.LoadData_Video_FFDShow has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· frmMain.tmrVis_Tick (cyclomatic 21) Β· Γ—1
  • frmMain.tmrVis_Tick (cyclomatic 21) LimeSeed/Forms/frmMain.vb:5501 β€” frmMain.tmrVis_Tick has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· PropertyHandler.LoadVorbis (cyclomatic 21) Β· Γ—1
  • PropertyHandler.LoadVorbis (cyclomatic 21) GreenThumb/GreenThumbnailProperties.vb:272 β€” PropertyHandler.LoadVorbis has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: PropertyHandler.WAVAudioCodecs (cyclomatic 120) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· frmMain.frmMain_Load (cyclomatic 20) Β· Γ—1
  • frmMain.frmMain_Load (cyclomatic 20) LimeSeed/Forms/frmMain.vb:5591 β€” frmMain.frmMain_Load has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· PropertyHandler.LoadMKV (cyclomatic 20) Β· Γ—1
  • PropertyHandler.LoadMKV (cyclomatic 20) GreenThumb/GreenThumbnailProperties.vb:297 β€” PropertyHandler.LoadMKV has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: PropertyHandler.WAVAudioCodecs (cyclomatic 120) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· ctlSeed.GetFileDuration (cyclomatic 20) Β· Γ—1
  • ctlSeed.GetFileDuration (cyclomatic 20) Seed/ctlSeed.vb:852 β€” ctlSeed.GetFileDuration has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· PlayListItems.Remove (cyclomatic 19) Β· Γ—1
  • PlayListItems.Remove (cyclomatic 19) LimeSeed/Forms/frmMain.vb:511 β€” PlayListItems.Remove has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· frmMain.SetCombos (cyclomatic 19) Β· Γ—1
  • frmMain.SetCombos (cyclomatic 19) LimeSeed/Forms/frmMain.vb:3374 β€” frmMain.SetCombos has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· frmTray.tmrUpdate_Tick (cyclomatic 19) Β· Γ—1
  • frmTray.tmrUpdate_Tick (cyclomatic 19) LimeSeed/Forms/frmTray.vb:238 β€” frmTray.tmrUpdate_Tick has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· modAssoc.Add_Props (cyclomatic 19) Β· Γ—1
  • modAssoc.Add_Props (cyclomatic 19) LSFA/modAssoc.vb:486 β€” modAssoc.Add_Props has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: modAssoc.RemType (cyclomatic 56) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· PropertyHandler.LoadID3v2 (cyclomatic 19) Β· Γ—1
  • PropertyHandler.LoadID3v2 (cyclomatic 19) GreenThumb/GreenThumbnailProperties.vb:226 β€” PropertyHandler.LoadID3v2 has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: PropertyHandler.WAVAudioCodecs (cyclomatic 120) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· clsID3v2.MakeFrameStringData (cyclomatic 19) Β· Γ—1
  • clsID3v2.MakeFrameStringData (cyclomatic 19) Seed/Headers/clsID3v2.vb:248 β€” clsID3v2.MakeFrameStringData has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: clsID3v2.GetFrameName (cyclomatic 164) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· FFDShowAPI.SubtitleStreams.get (cyclomatic 19) Β· Γ—1
  • FFDShowAPI.SubtitleStreams.get (cyclomatic 19) FFAPI/FFDShowAPI.cs:864 β€” FFDShowAPI.SubtitleStreams.get 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 Β· FFDShowAPI.init (cyclomatic 19) Β· Γ—1
  • FFDShowAPI.init (cyclomatic 19) FFAPI/FFDShowAPI.cs:1666 β€” FFDShowAPI.init 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 Β· ctlRipper.RefreshDriveList (cyclomatic 18) Β· Γ—1
  • ctlRipper.RefreshDriveList (cyclomatic 18) LimeSeed/Controls/ctlRipper.vb:33 β€” ctlRipper.RefreshDriveList has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· frmMain.DrawGlassText (cyclomatic 18) Β· Γ—1
  • frmMain.DrawGlassText (cyclomatic 18) LimeSeed/Forms/frmMain.vb:4875 β€” frmMain.DrawGlassText has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· frmMain.tmrTray_Tick (cyclomatic 18) Β· Γ—1
  • frmMain.tmrTray_Tick (cyclomatic 18) LimeSeed/Forms/frmMain.vb:7868 β€” frmMain.tmrTray_Tick has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· modFuncts.CompareLanguages (cyclomatic 18) Β· Γ—1
  • modFuncts.CompareLanguages (cyclomatic 18) LimeSeed/Modules/modFuncts.vb:1359 β€” modFuncts.CompareLanguages has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: modFuncts.AVIVideoCodecs (cyclomatic 293) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· ctlSeed.SpreadManagement (cyclomatic 18) Β· Γ—1
  • ctlSeed.SpreadManagement (cyclomatic 18) Seed/ctlSeed.vb:2483 β€” ctlSeed.SpreadManagement has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· clsID3v2.Genre.Get (cyclomatic 18) Β· Γ—1
  • clsID3v2.Genre.Get (cyclomatic 18) Seed/Headers/clsID3v2.vb:475 β€” clsID3v2.Genre.Get has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: clsID3v2.GetFrameName (cyclomatic 164) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· frmMain.LoadData_Audio_MP3 (cyclomatic 17) Β· Γ—1
  • frmMain.LoadData_Audio_MP3 (cyclomatic 17) LimeSeed/Forms/frmMain.vb:4414 β€” frmMain.LoadData_Audio_MP3 has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· frmSettings.frmSettings_Load (cyclomatic 17) Β· Γ—1
  • frmSettings.frmSettings_Load (cyclomatic 17) LimeSeed/Forms/frmSettings.vb:75 β€” frmSettings.frmSettings_Load has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmSettings.StrToKeys (cyclomatic 176) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· ctlSeed.WndProc (cyclomatic 17) Β· Γ—1
  • ctlSeed.WndProc (cyclomatic 17) Seed/ctlSeed.vb:1643 β€” ctlSeed.WndProc has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· CDDrive.ReadTrack (cyclomatic 16) Β· Γ—1
  • CDDrive.ReadTrack (cyclomatic 16) LimeSeed/Classes/clsCDRip.vb:316 β€” CDDrive.ReadTrack has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 Β· Cyclomatic Complexity Β· Connection.AsyncEventCompleted (cyclomatic 16) Β· Γ—1
  • Connection.AsyncEventCompleted (cyclomatic 16) LimeSeed/Classes/clsSocket.vb:297 β€” Connection.AsyncEventCompleted has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: Connection.ErrorDetails (cyclomatic 46) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· PlayListItem.ToolTipText.Get (cyclomatic 16) Β· Γ—1
  • PlayListItem.ToolTipText.Get (cyclomatic 16) LimeSeed/Forms/frmMain.vb:409 β€” PlayListItem.ToolTipText.Get has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· frmMain.cmdFullScreen_Click (cyclomatic 16) Β· Γ—1
  • frmMain.cmdFullScreen_Click (cyclomatic 16) LimeSeed/Forms/frmMain.vb:962 β€” frmMain.cmdFullScreen_Click has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: frmMain.KeyToStr (cyclomatic 167) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D18 Β· Solution Shape Β· Build failed Β· Γ—1
  • Build failed β€” The target solution did not build cleanly (errors: 1), which caps Solution Shape at 3/10 β€” the most basic shape signal is that it compiles. First errors: BC30002: Type 'Seed.clsRIFF.WAVFormatTag' is not defined..
D2 Β· Cognitive Complexity Β· PropertyHandler.LoadRIFF (cognitive 578) Β· Γ—1
  • PropertyHandler.LoadRIFF (cognitive 578) GreenThumb/GreenThumbnailProperties.vb:346 β€” PropertyHandler.LoadRIFF has cognitive complexity 578 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.tmrUpdate_Tick (cognitive 545) Β· Γ—1
  • frmMain.tmrUpdate_Tick (cognitive 545) LimeSeed/Forms/frmMain.vb:4971 β€” frmMain.tmrUpdate_Tick has cognitive complexity 545 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.CleanupID3 (cognitive 397) Β· Γ—1
  • frmMain.CleanupID3 (cognitive 397) LimeSeed/Forms/frmMain.vb:6348 β€” frmMain.CleanupID3 has cognitive complexity 397 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· clsRIFF.New.ctor (cognitive 347) Β· Γ—1
  • clsRIFF.New.ctor (cognitive 347) Seed/Headers/clsRIFF.vb:823 β€” clsRIFF.New.ctor has cognitive complexity 347 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· ctlSeed.sckDownload_SocketReceived (cognitive 341) Β· Γ—1
  • ctlSeed.sckDownload_SocketReceived (cognitive 341) Seed/ctlSeed.vb:1988 β€” ctlSeed.sckDownload_SocketReceived has cognitive complexity 341 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· modFuncts.FindAdditionalMKVChapters (cognitive 329) Β· Γ—1
  • modFuncts.FindAdditionalMKVChapters (cognitive 329) LimeSeed/Modules/modFuncts.vb:325 β€” modFuncts.FindAdditionalMKVChapters has cognitive complexity 329 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmProps.LoadMKV (cognitive 323) Β· Γ—1
  • frmProps.LoadMKV (cognitive 323) LimeSeed/Forms/frmProps.vb:508 β€” frmProps.LoadMKV has cognitive complexity 323 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.LoadData_Video (cognitive 322) Β· Γ—1
  • frmMain.LoadData_Video (cognitive 322) LimeSeed/Forms/frmMain.vb:3714 β€” frmMain.LoadData_Video has cognitive complexity 322 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.GetArt (cognitive 221) Β· Γ—1
  • frmMain.GetArt (cognitive 221) LimeSeed/Forms/frmMain.vb:7465 β€” frmMain.GetArt has cognitive complexity 221 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· modAssoc.Main (cognitive 212) Β· Γ—1
  • modAssoc.Main (cognitive 212) LSFA/modAssoc.vb:62 β€” modAssoc.Main has cognitive complexity 212 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· clsMKVHeaders.ReadTrackInfo (cognitive 207) Β· Γ—1
  • clsMKVHeaders.ReadTrackInfo (cognitive 207) Seed/Headers/clsMKV.vb:792 β€” clsMKVHeaders.ReadTrackInfo has cognitive complexity 207 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmProps.LoadRIFF (cognitive 203) Β· Γ—1
  • frmProps.LoadRIFF (cognitive 203) LimeSeed/Forms/frmProps.vb:815 β€” frmProps.LoadRIFF has cognitive complexity 203 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.LoadTempPL (cognitive 201) Β· Γ—1
  • frmMain.LoadTempPL (cognitive 201) LimeSeed/Forms/frmMain.vb:2378 β€” frmMain.LoadTempPL has cognitive complexity 201 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.PLItems_PlayListUpdate (cognitive 190) Β· Γ—1
  • frmMain.PLItems_PlayListUpdate (cognitive 190) LimeSeed/Forms/frmMain.vb:7900 β€” frmMain.PLItems_PlayListUpdate has cognitive complexity 190 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· modAssoc.Add_Associate (cognitive 185) Β· Γ—1
  • modAssoc.Add_Associate (cognitive 185) LSFA/modAssoc.vb:364 β€” modAssoc.Add_Associate has cognitive complexity 185 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· clsMKVHeaders.DebugData (cognitive 182) Β· Γ—1
  • clsMKVHeaders.DebugData (cognitive 182) Seed/Headers/clsMKV.vb:438 β€” clsMKVHeaders.DebugData has cognitive complexity 182 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.DragDropFiles (cognitive 180) Β· Γ—1
  • frmMain.DragDropFiles (cognitive 180) LimeSeed/Forms/frmMain.vb:5885 β€” frmMain.DragDropFiles has cognitive complexity 180 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.LoadData_Audio_WAV (cognitive 147) Β· Γ—1
  • frmMain.LoadData_Audio_WAV (cognitive 147) LimeSeed/Forms/frmMain.vb:4497 β€” frmMain.LoadData_Audio_WAV has cognitive complexity 147 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· ctlRipper.cmdRip_Click (cognitive 141) Β· Γ—1
  • ctlRipper.cmdRip_Click (cognitive 141) LimeSeed/Controls/ctlRipper.vb:313 β€” ctlRipper.cmdRip_Click has cognitive complexity 141 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· ctlSeed.GetFileThumbnail (cognitive 130) Β· Γ—1
  • ctlSeed.GetFileThumbnail (cognitive 130) Seed/ctlSeed.vb:617 β€” ctlSeed.GetFileThumbnail has cognitive complexity 130 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· clsVorbis.LoadVorbis (cognitive 128) Β· Γ—1
  • clsVorbis.LoadVorbis (cognitive 128) Seed/Headers/clsVorbis.vb:447 β€” clsVorbis.LoadVorbis has cognitive complexity 128 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· clsMIDI.ReadTrack (cognitive 118) Β· Γ—1
  • clsMIDI.ReadTrack (cognitive 118) Seed/Headers/clsMIDI.vb:127 β€” clsMIDI.ReadTrack has cognitive complexity 118 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· modAssoc.Rem_Associate (cognitive 112) Β· Γ—1
  • modAssoc.Rem_Associate (cognitive 112) LSFA/modAssoc.vb:784 β€” modAssoc.Rem_Associate has cognitive complexity 112 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.PlayList_ParseItem (cognitive 106) Β· Γ—1
  • frmMain.PlayList_ParseItem (cognitive 106) LimeSeed/Forms/frmMain.vb:205 β€” frmMain.PlayList_ParseItem has cognitive complexity 106 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.SaveArtToMP3 (cognitive 105) Β· Γ—1
  • frmMain.SaveArtToMP3 (cognitive 105) LimeSeed/Forms/frmMain.vb:7400 β€” frmMain.SaveArtToMP3 has cognitive complexity 105 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmProps.dgvID3v2_CellValueChanged (cognitive 105) Β· Γ—1
  • frmProps.dgvID3v2_CellValueChanged (cognitive 105) LimeSeed/Forms/frmProps.vb:1749 β€” frmProps.dgvID3v2_CellValueChanged has cognitive complexity 105 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· ctlSeed.PullMetaDataFromStream (cognitive 101) Β· Γ—1
  • ctlSeed.PullMetaDataFromStream (cognitive 101) Seed/ctlSeed.vb:2261 β€” ctlSeed.PullMetaDataFromStream has cognitive complexity 101 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· clsID3v2.Save (cognitive 101) Β· Γ—1
  • clsID3v2.Save (cognitive 101) Seed/Headers/clsID3v2.vb:2765 β€” clsID3v2.Save has cognitive complexity 101 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· MyApplication.tcpListener_SocketReceived (cognitive 99) Β· Γ—1
  • MyApplication.tcpListener_SocketReceived (cognitive 99) LimeSeed/ApplicationEvents.vb:381 β€” MyApplication.tcpListener_SocketReceived has cognitive complexity 99 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· clsMPEG.GetBitrate (cognitive 95) Β· Γ—1
  • clsMPEG.GetBitrate (cognitive 95) Seed/Headers/clsMPEG.vb:124 β€” clsMPEG.GetBitrate has cognitive complexity 95 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (clsMPEG.GetBitQual) has the same decision points, in the same order, at the same nesting depths β€” so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 Β· Cognitive Complexity Β· clsMPEG.GetBitQual (cognitive 95) Β· Γ—1
  • clsMPEG.GetBitQual (cognitive 95) Seed/Headers/clsMPEG.vb:305 β€” clsMPEG.GetBitQual has cognitive complexity 95 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (clsMPEG.GetBitrate) has the same decision points, in the same order, at the same nesting depths β€” so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 Β· Cognitive Complexity Β· frmMain.ProcessKeyPreview (cognitive 90) Β· Γ—1
  • frmMain.ProcessKeyPreview (cognitive 90) LimeSeed/Forms/frmMain.vb:6830 β€” frmMain.ProcessKeyPreview has cognitive complexity 90 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· ctlSeed.GetThumbnailFromControl (cognitive 90) Β· Γ—1
  • ctlSeed.GetThumbnailFromControl (cognitive 90) Seed/ctlSeed.vb:396 β€” ctlSeed.GetThumbnailFromControl has cognitive complexity 90 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· clsID3v2.AddBareFrame (cognitive 90) Β· Γ—1
  • clsID3v2.AddBareFrame (cognitive 90) Seed/Headers/clsID3v2.vb:178 β€” clsID3v2.AddBareFrame has cognitive complexity 90 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.StartupRun (cognitive 87) Β· Γ—1
  • frmMain.StartupRun (cognitive 87) LimeSeed/Forms/frmMain.vb:5715 β€” frmMain.StartupRun has cognitive complexity 87 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmProps.DataGrid_CellContentClick (cognitive 87) Β· Γ—1
  • frmProps.DataGrid_CellContentClick (cognitive 87) LimeSeed/Forms/frmProps.vb:1485 β€” frmProps.DataGrid_CellContentClick has cognitive complexity 87 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.GetTitle (cognitive 84) Β· Γ—1
  • frmMain.GetTitle (cognitive 84) LimeSeed/Forms/frmMain.vb:6234 β€” frmMain.GetTitle has cognitive complexity 84 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.LoadData_Video_AVI (cognitive 83) Β· Γ—1
  • frmMain.LoadData_Video_AVI (cognitive 83) LimeSeed/Forms/frmMain.vb:4235 β€” frmMain.LoadData_Video_AVI has cognitive complexity 83 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· clsID3v2.ParseString (cognitive 81) Β· Γ—1
  • clsID3v2.ParseString (cognitive 81) Seed/Headers/clsID3v2.vb:2589 β€” clsID3v2.ParseString has cognitive complexity 81 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmProps.ShowData (cognitive 77) Β· Γ—1
  • frmProps.ShowData (cognitive 77) LimeSeed/Forms/frmProps.vb:1132 β€” frmProps.ShowData has cognitive complexity 77 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.LoadData_Video_MKV (cognitive 75) Β· Γ—1
  • frmMain.LoadData_Video_MKV (cognitive 75) LimeSeed/Forms/frmMain.vb:4038 β€” frmMain.LoadData_Video_MKV has cognitive complexity 75 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.macArt_Choices (cognitive 72) Β· Γ—1
  • frmMain.macArt_Choices (cognitive 72) LimeSeed/Forms/frmMain.vb:7202 β€” frmMain.macArt_Choices has cognitive complexity 72 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· ToolStripSystemRenderer.OnRenderMenuItemBackground (cognitive 71) Β· Γ—1
  • ToolStripSystemRenderer.OnRenderMenuItemBackground (cognitive 71) LimeSeed/Classes/clsToolStripSystemRenderer.vb:268 β€” ToolStripSystemRenderer.OnRenderMenuItemBackground has cognitive complexity 71 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· clsMKVHeaders.ReadChapterAtom (cognitive 68) Β· Γ—1
  • clsMKVHeaders.ReadChapterAtom (cognitive 68) Seed/Headers/clsMKV.vb:1127 β€” clsMKVHeaders.ReadChapterAtom has cognitive complexity 68 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· BetterProgress.OnPaint (cognitive 66) Β· Γ—1
  • BetterProgress.OnPaint (cognitive 66) LimeSeed/Controls/BetterProgress.vb:164 β€” BetterProgress.OnPaint has cognitive complexity 66 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.cmbAudTrack_SelectedIndexChanged (cognitive 66) Β· Γ—1
  • frmMain.cmbAudTrack_SelectedIndexChanged (cognitive 66) LimeSeed/Forms/frmMain.vb:1110 β€” frmMain.cmbAudTrack_SelectedIndexChanged has cognitive complexity 66 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.SaveTempPL (cognitive 64) Β· Γ—1
  • frmMain.SaveTempPL (cognitive 64) LimeSeed/Forms/frmMain.vb:2665 β€” frmMain.SaveTempPL has cognitive complexity 64 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmAbout.CompareVersions (cognitive 61) Β· Γ—1
  • frmAbout.CompareVersions (cognitive 61) LimeSeed/Forms/frmAbout.vb:103 β€” frmAbout.CompareVersions has cognitive complexity 61 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· clsVorbis.FillInData (cognitive 59) Β· Γ—1
  • clsVorbis.FillInData (cognitive 59) Seed/Headers/clsVorbis.vb:291 β€” clsVorbis.FillInData has cognitive complexity 59 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· PropertyHandler.LoadMKV (cognitive 58) Β· Γ—1
  • PropertyHandler.LoadMKV (cognitive 58) GreenThumb/GreenThumbnailProperties.vb:297 β€” PropertyHandler.LoadMKV has cognitive complexity 58 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· ctlRipper.cmbDrive_SelectedIndexChanged (cognitive 57) Β· Γ—1
  • ctlRipper.cmbDrive_SelectedIndexChanged (cognitive 57) LimeSeed/Controls/ctlRipper.vb:98 β€” ctlRipper.cmbDrive_SelectedIndexChanged has cognitive complexity 57 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.OpenM3U (cognitive 57) Β· Γ—1
  • frmMain.OpenM3U (cognitive 57) LimeSeed/Forms/frmMain.vb:2269 β€” frmMain.OpenM3U has cognitive complexity 57 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.DrawGlassText (cognitive 57) Β· Γ—1
  • frmMain.DrawGlassText (cognitive 57) LimeSeed/Forms/frmMain.vb:4875 β€” frmMain.DrawGlassText has cognitive complexity 57 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· clsID3v2.ParseGenreFrame (cognitive 57) Β· Γ—1
  • clsID3v2.ParseGenreFrame (cognitive 57) Seed/Headers/clsID3v2.vb:2353 β€” clsID3v2.ParseGenreFrame has cognitive complexity 57 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· clsMPEG.CheckValidity (cognitive 55) Β· Γ—1
  • clsMPEG.CheckValidity (cognitive 55) Seed/Headers/clsMPEG.vb:39 β€” clsMPEG.CheckValidity has cognitive complexity 55 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· FFDShowAPI.SubtitleStreams.get (cognitive 55) Β· Γ—1
  • FFDShowAPI.SubtitleStreams.get (cognitive 55) FFAPI/FFDShowAPI.cs:864 β€” FFDShowAPI.SubtitleStreams.get has cognitive complexity 55 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· FFDShowAPI.init (cognitive 54) Β· Γ—1
  • FFDShowAPI.init (cognitive 54) FFAPI/FFDShowAPI.cs:1666 β€” FFDShowAPI.init has cognitive complexity 54 (threshold 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 Β· frmProps.LoadMIDI (cognitive 53) Β· Γ—1
  • frmProps.LoadMIDI (cognitive 53) LimeSeed/Forms/frmProps.vb:740 β€” frmProps.LoadMIDI has cognitive complexity 53 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmProps.LoadVorbis (cognitive 52) Β· Γ—1
  • frmProps.LoadVorbis (cognitive 52) LimeSeed/Forms/frmProps.vb:441 β€” frmProps.LoadVorbis has cognitive complexity 52 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.DragOverEvent (cognitive 51) Β· Γ—1
  • frmMain.DragOverEvent (cognitive 51) LimeSeed/Forms/frmMain.vb:6071 β€” frmMain.DragOverEvent has cognitive complexity 51 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· ctlSeed.Duration.Get (cognitive 51) Β· Γ—1
  • ctlSeed.Duration.Get (cognitive 51) Seed/ctlSeed.vb:220 β€” ctlSeed.Duration.Get has cognitive complexity 51 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· clsID3v2.ParseGenreFrame (cognitive 50) Β· Γ—1
  • clsID3v2.ParseGenreFrame (cognitive 50) Seed/Headers/clsID3v2.vb:2433 β€” clsID3v2.ParseGenreFrame has cognitive complexity 50 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmProps.LoadID3v2 (cognitive 49) Β· Γ—1
  • frmProps.LoadID3v2 (cognitive 49) LimeSeed/Forms/frmProps.vb:241 β€” frmProps.LoadID3v2 has cognitive complexity 49 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.JoyRun (cognitive 47) Β· Γ—1
  • frmMain.JoyRun (cognitive 47) LimeSeed/Forms/frmMain.vb:7068 β€” frmMain.JoyRun has cognitive complexity 47 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmProps.GenerateFrameRow (cognitive 47) Β· Γ—1
  • frmProps.GenerateFrameRow (cognitive 47) LimeSeed/Forms/frmProps.vb:118 β€” frmProps.GenerateFrameRow has cognitive complexity 47 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· PropertyHandler.LoadVorbis (cognitive 47) Β· Γ—1
  • PropertyHandler.LoadVorbis (cognitive 47) GreenThumb/GreenThumbnailProperties.vb:272 β€” PropertyHandler.LoadVorbis has cognitive complexity 47 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· ctlRipper.RefreshDriveList (cognitive 46) Β· Γ—1
  • ctlRipper.RefreshDriveList (cognitive 46) LimeSeed/Controls/ctlRipper.vb:33 β€” ctlRipper.RefreshDriveList has cognitive complexity 46 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· PlayListItems.Shuffle (cognitive 46) Β· Γ—1
  • PlayListItems.Shuffle (cognitive 46) LimeSeed/Forms/frmMain.vb:639 β€” PlayListItems.Shuffle has cognitive complexity 46 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.tmrVis_Tick (cognitive 46) Β· Γ—1
  • frmMain.tmrVis_Tick (cognitive 46) LimeSeed/Forms/frmMain.vb:5501 β€” frmMain.tmrVis_Tick has cognitive complexity 46 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.FileArt.Set (cognitive 46) Β· Γ—1
  • frmMain.FileArt.Set (cognitive 46) LimeSeed/Forms/frmMain.vb:7628 β€” frmMain.FileArt.Set has cognitive complexity 46 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· SocketWrapper.ReceivedData (cognitive 46) Β· Γ—1
  • SocketWrapper.ReceivedData (cognitive 46) Seed/clsSocket.vb:139 β€” SocketWrapper.ReceivedData has cognitive complexity 46 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· MyApplication.MyApplication_StartupNextInstance (cognitive 45) Β· Γ—1
  • MyApplication.MyApplication_StartupNextInstance (cognitive 45) LimeSeed/ApplicationEvents.vb:33 β€” MyApplication.MyApplication_StartupNextInstance has cognitive complexity 45 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.cmdFullScreen_Click (cognitive 45) Β· Γ—1
  • frmMain.cmdFullScreen_Click (cognitive 45) LimeSeed/Forms/frmMain.vb:962 β€” frmMain.cmdFullScreen_Click has cognitive complexity 45 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· CDDBNet.HandleData (cognitive 43) Β· Γ—1
  • CDDBNet.HandleData (cognitive 43) LimeSeed/Controls/ctlRipper.vb:1039 β€” CDDBNet.HandleData has cognitive complexity 43 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· clsJoyDetection.tmrCheck_Tick (cognitive 42) Β· Γ—1
  • clsJoyDetection.tmrCheck_Tick (cognitive 42) LimeSeed/Classes/clsJoy.vb:258 β€” clsJoyDetection.tmrCheck_Tick has cognitive complexity 42 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.frmMain_Load (cognitive 41) Β· Γ—1
  • frmMain.frmMain_Load (cognitive 41) LimeSeed/Forms/frmMain.vb:5591 β€” frmMain.frmMain_Load has cognitive complexity 41 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· PropertyHandler.LoadID3v2 (cognitive 41) Β· Γ—1
  • PropertyHandler.LoadID3v2 (cognitive 41) GreenThumb/GreenThumbnailProperties.vb:226 β€” PropertyHandler.LoadID3v2 has cognitive complexity 41 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.PlayList_ItemParsed (cognitive 40) Β· Γ—1
  • frmMain.PlayList_ItemParsed (cognitive 40) LimeSeed/Forms/frmMain.vb:313 β€” frmMain.PlayList_ItemParsed has cognitive complexity 40 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.mpPlayer_EndOfFile (cognitive 40) Β· Γ—1
  • frmMain.mpPlayer_EndOfFile (cognitive 40) LimeSeed/Forms/frmMain.vb:3071 β€” frmMain.mpPlayer_EndOfFile has cognitive complexity 40 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmTray.tmrUpdate_Tick (cognitive 40) Β· Γ—1
  • frmTray.tmrUpdate_Tick (cognitive 40) LimeSeed/Forms/frmTray.vb:238 β€” frmTray.tmrUpdate_Tick has cognitive complexity 40 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· TaskbarController_Image.Dispose (cognitive 39) Β· Γ—1
  • TaskbarController_Image.Dispose (cognitive 39) LimeSeed/Classes/clsTaskBarLib.vb:388 β€” TaskbarController_Image.Dispose has cognitive complexity 39 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.DrawTitleArtist (cognitive 39) Β· Γ—1
  • frmMain.DrawTitleArtist (cognitive 39) LimeSeed/Forms/frmMain.vb:4790 β€” frmMain.DrawTitleArtist has cognitive complexity 39 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· clsID3v1.Save (cognitive 39) Β· Γ—1
  • clsID3v1.Save (cognitive 39) Seed/Headers/clsID3v1.vb:82 β€” clsID3v1.Save has cognitive complexity 39 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· clsID3v2.Genre.Get (cognitive 39) Β· Γ—1
  • clsID3v2.Genre.Get (cognitive 39) Seed/Headers/clsID3v2.vb:475 β€” clsID3v2.Genre.Get has cognitive complexity 39 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· clsID3v2.MakeFrameStringData (cognitive 38) Β· Γ—1
  • clsID3v2.MakeFrameStringData (cognitive 38) Seed/Headers/clsID3v2.vb:248 β€” clsID3v2.MakeFrameStringData has cognitive complexity 38 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.LastDitchv1Genre (cognitive 37) Β· Γ—1
  • frmMain.LastDitchv1Genre (cognitive 37) LimeSeed/Forms/frmMain.vb:6315 β€” frmMain.LastDitchv1Genre has cognitive complexity 37 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· ctlSeed.WndProc (cognitive 37) Β· Γ—1
  • ctlSeed.WndProc (cognitive 37) Seed/ctlSeed.vb:1643 β€” ctlSeed.WndProc has cognitive complexity 37 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· clsID3v2.SplitByteArrays (cognitive 37) Β· Γ—1
  • clsID3v2.SplitByteArrays (cognitive 37) Seed/Headers/clsID3v2.vb:2544 β€” clsID3v2.SplitByteArrays has cognitive complexity 37 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· modFuncts.FFDShowRemote (cognitive 36) Β· Γ—1
  • modFuncts.FFDShowRemote (cognitive 36) LimeSeed/Modules/modFuncts.vb:620 β€” modFuncts.FFDShowRemote has cognitive complexity 36 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· ctlSeed.ShowProperties (cognitive 36) Β· Γ—1
  • ctlSeed.ShowProperties (cognitive 36) Seed/ctlSeed.vb:1213 β€” ctlSeed.ShowProperties has cognitive complexity 36 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· FFDShowAPI.AudioStreams.get (cognitive 35) Β· Γ—1
  • FFDShowAPI.AudioStreams.get (cognitive 35) FFAPI/FFDShowAPI.cs:940 β€” FFDShowAPI.AudioStreams.get has cognitive complexity 35 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· PlayListItems.Remove (cognitive 34) Β· Γ—1
  • PlayListItems.Remove (cognitive 34) LimeSeed/Forms/frmMain.vb:511 β€” PlayListItems.Remove has cognitive complexity 34 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.dgvPlayList_DragOver (cognitive 34) Β· Γ—1
  • frmMain.dgvPlayList_DragOver (cognitive 34) LimeSeed/Forms/frmMain.vb:1911 β€” frmMain.dgvPlayList_DragOver has cognitive complexity 34 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.SetCombos (cognitive 34) Β· Γ—1
  • frmMain.SetCombos (cognitive 34) LimeSeed/Forms/frmMain.vb:3374 β€” frmMain.SetCombos has cognitive complexity 34 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· ctlSeed.SpreadManagement (cognitive 34) Β· Γ—1
  • ctlSeed.SpreadManagement (cognitive 34) Seed/ctlSeed.vb:2483 β€” ctlSeed.SpreadManagement has cognitive complexity 34 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· ctlSeed.GetFileDuration (cognitive 33) Β· Γ—1
  • ctlSeed.GetFileDuration (cognitive 33) Seed/ctlSeed.vb:852 β€” ctlSeed.GetFileDuration has cognitive complexity 33 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.LoadData_Video_OGM (cognitive 32) Β· Γ—1
  • frmMain.LoadData_Video_OGM (cognitive 32) LimeSeed/Forms/frmMain.vb:4160 β€” frmMain.LoadData_Video_OGM has cognitive complexity 32 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· Mp3Writer.Write (cognitive 31) Β· Γ—1
  • Mp3Writer.Write (cognitive 31) LimeSeed/Classes/clsLAME.vb:756 β€” Mp3Writer.Write has cognitive complexity 31 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· ctlArtList.AddRow (cognitive 31) Β· Γ—1
  • ctlArtList.AddRow (cognitive 31) LimeSeed/Controls/ctlArtList.vb:44 β€” ctlArtList.AddRow has cognitive complexity 31 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· ctlSeed.mpStop (cognitive 31) Β· Γ—1
  • ctlSeed.mpStop (cognitive 31) Seed/ctlSeed.vb:1034 β€” ctlSeed.mpStop has cognitive complexity 31 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· ctlSeed.CloseMedia (cognitive 30) Β· Γ—1
  • ctlSeed.CloseMedia (cognitive 30) Seed/ctlSeed.vb:1541 β€” ctlSeed.CloseMedia has cognitive complexity 30 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmSettings.frmSettings_Load (cognitive 29) Β· Γ—1
  • frmSettings.frmSettings_Load (cognitive 29) LimeSeed/Forms/frmSettings.vb:75 β€” frmSettings.frmSettings_Load has cognitive complexity 29 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· Parsed_APIC.FromByteArray (cognitive 29) Β· Γ—1
  • Parsed_APIC.FromByteArray (cognitive 29) Seed/Headers/clsID3v2.vb:1936 β€” Parsed_APIC.FromByteArray has cognitive complexity 29 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· FFDShowAPI.parseStreamsString (cognitive 29) Β· Γ—1
  • FFDShowAPI.parseStreamsString (cognitive 29) FFAPI/FFDShowAPI.cs:1019 β€” FFDShowAPI.parseStreamsString has cognitive complexity 29 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· CDDrive.ReadTrack (cognitive 28) Β· Γ—1
  • CDDrive.ReadTrack (cognitive 28) LimeSeed/Classes/clsCDRip.vb:316 β€” CDDrive.ReadTrack has cognitive complexity 28 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· modAssoc.Add_Props (cognitive 28) Β· Γ—1
  • modAssoc.Add_Props (cognitive 28) LSFA/modAssoc.vb:486 β€” modAssoc.Add_Props has cognitive complexity 28 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· ctlSeed.Rate.Set (cognitive 28) Β· Γ—1
  • ctlSeed.Rate.Set (cognitive 28) Seed/ctlSeed.vb:1185 β€” ctlSeed.Rate.Set has cognitive complexity 28 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· MyApplication.udpListener_SocketReceived (cognitive 27) Β· Γ—1
  • MyApplication.udpListener_SocketReceived (cognitive 27) LimeSeed/ApplicationEvents.vb:307 β€” MyApplication.udpListener_SocketReceived has cognitive complexity 27 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· TaskbarController_Clip.Dispose (cognitive 27) Β· Γ—1
  • TaskbarController_Clip.Dispose (cognitive 27) LimeSeed/Classes/clsTaskBarLib.vb:685 β€” TaskbarController_Clip.Dispose has cognitive complexity 27 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· PlayListItem.ToolTipText.Get (cognitive 27) Β· Γ—1
  • PlayListItem.ToolTipText.Get (cognitive 27) LimeSeed/Forms/frmMain.vb:409 β€” PlayListItem.ToolTipText.Get has cognitive complexity 27 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmText.DrawText (cognitive 27) Β· Γ—1
  • frmText.DrawText (cognitive 27) LimeSeed/Forms/frmText.vb:42 β€” frmText.DrawText has cognitive complexity 27 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· ToolStripSystemRenderer.OnRenderItemCheck (cognitive 26) Β· Γ—1
  • ToolStripSystemRenderer.OnRenderItemCheck (cognitive 26) LimeSeed/Classes/clsToolStripSystemRenderer.vb:62 β€” ToolStripSystemRenderer.OnRenderItemCheck has cognitive complexity 26 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmTransfer.udpBroadcast_SocketReceived (cognitive 26) Β· Γ—1
  • frmTransfer.udpBroadcast_SocketReceived (cognitive 26) LimeSeed/Forms/frmTransfer.vb:219 β€” frmTransfer.udpBroadcast_SocketReceived has cognitive complexity 26 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· clsHeaderLoader.GetRealFrameCount (cognitive 26) Β· Γ—1
  • clsHeaderLoader.GetRealFrameCount (cognitive 26) Seed/clsHeaders.vb:86 β€” clsHeaderLoader.GetRealFrameCount has cognitive complexity 26 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· clsID3v2.TryToDecode (cognitive 26) Β· Γ—1
  • clsID3v2.TryToDecode (cognitive 26) Seed/Headers/clsID3v2.vb:1055 β€” clsID3v2.TryToDecode has cognitive complexity 26 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· ctlRipper.cmdSendInfo_Click (cognitive 25) Β· Γ—1
  • ctlRipper.cmdSendInfo_Click (cognitive 25) LimeSeed/Controls/ctlRipper.vb:548 β€” ctlRipper.cmdSendInfo_Click has cognitive complexity 25 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmFullScreen.SetVisuals (cognitive 25) Β· Γ—1
  • frmFullScreen.SetVisuals (cognitive 25) LimeSeed/Forms/frmFullScreen.vb:69 β€” frmFullScreen.SetVisuals has cognitive complexity 25 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.PLShowMissing_Really (cognitive 25) Β· Γ—1
  • frmMain.PLShowMissing_Really (cognitive 25) LimeSeed/Forms/frmMain.vb:1965 β€” frmMain.PLShowMissing_Really has cognitive complexity 25 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· modFuncts.CompareLanguages (cognitive 25) Β· Γ—1
  • modFuncts.CompareLanguages (cognitive 25) LimeSeed/Modules/modFuncts.vb:1359 β€” modFuncts.CompareLanguages has cognitive complexity 25 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· clsHeaderLoader.GetVBRDuration (cognitive 25) Β· Γ—1
  • clsHeaderLoader.GetVBRDuration (cognitive 25) Seed/clsHeaders.vb:139 β€” clsHeaderLoader.GetVBRDuration has cognitive complexity 25 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmFullScreen.tmrHide_Tick (cognitive 24) Β· Γ—1
  • frmFullScreen.tmrHide_Tick (cognitive 24) LimeSeed/Forms/frmFullScreen.vb:5 β€” frmFullScreen.tmrHide_Tick has cognitive complexity 24 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· PlayListItems.ChangeDisplayIndex (cognitive 24) Β· Γ—1
  • PlayListItems.ChangeDisplayIndex (cognitive 24) LimeSeed/Forms/frmMain.vb:575 β€” PlayListItems.ChangeDisplayIndex has cognitive complexity 24 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.frmMain_ResizeEnd (cognitive 24) Β· Γ—1
  • frmMain.frmMain_ResizeEnd (cognitive 24) LimeSeed/Forms/frmMain.vb:2878 β€” frmMain.frmMain_ResizeEnd has cognitive complexity 24 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmProps.cmdID3v2Save_Click (cognitive 24) Β· Γ—1
  • frmProps.cmdID3v2Save_Click (cognitive 24) LimeSeed/Forms/frmProps.vb:1379 β€” frmProps.cmdID3v2Save_Click has cognitive complexity 24 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmSettings.Chk_Associate (cognitive 24) Β· Γ—1
  • frmSettings.Chk_Associate (cognitive 24) LimeSeed/Forms/frmSettings.vb:421 β€” frmSettings.Chk_Associate has cognitive complexity 24 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· clsMKVHeaders.ReadSegmentInfo (cognitive 24) Β· Γ—1
  • clsMKVHeaders.ReadSegmentInfo (cognitive 24) Seed/Headers/clsMKV.vb:729 β€” clsMKVHeaders.ReadSegmentInfo has cognitive complexity 24 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· DataPacketParser.Pass2 (cognitive 23) Β· Γ—1
  • DataPacketParser.Pass2 (cognitive 23) LimeSeed/Classes/clsCDText.vb:439 β€” DataPacketParser.Pass2 has cognitive complexity 23 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.mnuPLQueue_Click (cognitive 23) Β· Γ—1
  • frmMain.mnuPLQueue_Click (cognitive 23) LimeSeed/Forms/frmMain.vb:1481 β€” frmMain.mnuPLQueue_Click has cognitive complexity 23 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· modFuncts.FormatBytes (cognitive 23) Β· Γ—1
  • modFuncts.FormatBytes (cognitive 23) LimeSeed/Modules/modFuncts.vb:705 β€” modFuncts.FormatBytes has cognitive complexity 23 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· MyApplication.MyApplication_UnhandledException (cognitive 22) Β· Γ—1
  • MyApplication.MyApplication_UnhandledException (cognitive 22) LimeSeed/ApplicationEvents.vb:89 β€” MyApplication.MyApplication_UnhandledException has cognitive complexity 22 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· ctlRipper.cCDText_RunWorkerCompleted (cognitive 22) Β· Γ—1
  • ctlRipper.cCDText_RunWorkerCompleted (cognitive 22) LimeSeed/Controls/ctlRipper.vb:652 β€” ctlRipper.cCDText_RunWorkerCompleted has cognitive complexity 22 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.LoadData_Video_FFDShow (cognitive 22) Β· Γ—1
  • frmMain.LoadData_Video_FFDShow (cognitive 22) LimeSeed/Forms/frmMain.vb:4338 β€” frmMain.LoadData_Video_FFDShow has cognitive complexity 22 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.SetVisualizations (cognitive 22) Β· Γ—1
  • frmMain.SetVisualizations (cognitive 22) LimeSeed/Forms/frmMain.vb:5560 β€” frmMain.SetVisualizations has cognitive complexity 22 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.tmrTray_Tick (cognitive 22) Β· Γ—1
  • frmMain.tmrTray_Tick (cognitive 22) LimeSeed/Forms/frmMain.vb:7868 β€” frmMain.tmrTray_Tick has cognitive complexity 22 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· AlbumInfo.cCDText_RunWorkerCompleted (cognitive 22) Β· Γ—1
  • AlbumInfo.cCDText_RunWorkerCompleted (cognitive 22) LimeSeed/Modules/modFuncts.vb:2188 β€” AlbumInfo.cCDText_RunWorkerCompleted has cognitive complexity 22 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· PropertyHandler.LoadMIDI (cognitive 22) Β· Γ—1
  • PropertyHandler.LoadMIDI (cognitive 22) GreenThumb/GreenThumbnailProperties.vb:324 β€” PropertyHandler.LoadMIDI has cognitive complexity 22 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· ctlSeed.FileName.Set (cognitive 22) Β· Γ—1
  • ctlSeed.FileName.Set (cognitive 22) Seed/ctlSeed.vb:305 β€” ctlSeed.FileName.Set has cognitive complexity 22 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· clsID3v2.LoadFile (cognitive 22) Β· Γ—1
  • clsID3v2.LoadFile (cognitive 22) Seed/Headers/clsID3v2.vb:966 β€” clsID3v2.LoadFile has cognitive complexity 22 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· Parsed_TZZZ.FromByteArray (cognitive 22) Β· Γ—1
  • Parsed_TZZZ.FromByteArray (cognitive 22) Seed/Headers/clsID3v2.vb:1433 β€” Parsed_TZZZ.FromByteArray has cognitive complexity 22 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (Parsed_WZZZ.FromByteArray) has the same decision points, in the same order, at the same nesting depths β€” so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 Β· Cognitive Complexity Β· Parsed_WZZZ.FromByteArray (cognitive 22) Β· Γ—1
  • Parsed_WZZZ.FromByteArray (cognitive 22) Seed/Headers/clsID3v2.vb:1501 β€” Parsed_WZZZ.FromByteArray has cognitive complexity 22 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (Parsed_TZZZ.FromByteArray) has the same decision points, in the same order, at the same nesting depths β€” so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 Β· Cognitive Complexity Β· Parsed_TCON.ToByteArray (cognitive 22) Β· Γ—1
  • Parsed_TCON.ToByteArray (cognitive 22) Seed/Headers/clsID3v2.vb:1569 β€” Parsed_TCON.ToByteArray has cognitive complexity 22 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.SetTabs (cognitive 21) Β· Γ—1
  • frmMain.SetTabs (cognitive 21) LimeSeed/Forms/frmMain.vb:3354 β€” frmMain.SetTabs has cognitive complexity 21 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· PropertyHandler.LoadMPEG (cognitive 21) Β· Γ—1
  • PropertyHandler.LoadMPEG (cognitive 21) GreenThumb/GreenThumbnailProperties.vb:252 β€” PropertyHandler.LoadMPEG has cognitive complexity 21 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· ctlSeed.mpPlay (cognitive 21) Β· Γ—1
  • ctlSeed.mpPlay (cognitive 21) Seed/ctlSeed.vb:999 β€” ctlSeed.mpPlay has cognitive complexity 21 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frameSort.Compare (cognitive 21) Β· Γ—1
  • frameSort.Compare (cognitive 21) Seed/Headers/clsID3v2.vb:2718 β€” frameSort.Compare has cognitive complexity 21 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· ToolStripRadioButtonMenuItem.OnPaint (cognitive 20) Β· Γ—1
  • ToolStripRadioButtonMenuItem.OnPaint (cognitive 20) LimeSeed/Classes/clsRadioMenu.vb:58 β€” ToolStripRadioButtonMenuItem.OnPaint has cognitive complexity 20 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.QueueNextTrack (cognitive 20) Β· Γ—1
  • frmMain.QueueNextTrack (cognitive 20) LimeSeed/Forms/frmMain.vb:2780 β€” frmMain.QueueNextTrack has cognitive complexity 20 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.SetProps (cognitive 20) Β· Γ—1
  • frmMain.SetProps (cognitive 20) LimeSeed/Forms/frmMain.vb:3287 β€” frmMain.SetProps has cognitive complexity 20 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.LoadData_CD (cognitive 20) Β· Γ—1
  • frmMain.LoadData_CD (cognitive 20) LimeSeed/Forms/frmMain.vb:3679 β€” frmMain.LoadData_CD has cognitive complexity 20 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· modFuncts.ByteSize (cognitive 20) Β· Γ—1
  • modFuncts.ByteSize (cognitive 20) LimeSeed/Modules/modFuncts.vb:159 β€” modFuncts.ByteSize has cognitive complexity 20 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· ctlSeed.mpPause (cognitive 20) Β· Γ—1
  • ctlSeed.mpPause (cognitive 20) Seed/ctlSeed.vb:965 β€” ctlSeed.mpPause has cognitive complexity 20 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· ctlSeed.SeekPosition (cognitive 20) Β· Γ—1
  • ctlSeed.SeekPosition (cognitive 20) Seed/ctlSeed.vb:1723 β€” ctlSeed.SeekPosition has cognitive complexity 20 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· ctlSeed.FileQueue (cognitive 20) Β· Γ—1
  • ctlSeed.FileQueue (cognitive 20) Seed/ctlSeed.vb:2387 β€” ctlSeed.FileQueue has cognitive complexity 20 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· clsMKVHeaders.ReadChapterInfo (cognitive 20) Β· Γ—1
  • clsMKVHeaders.ReadChapterInfo (cognitive 20) Seed/Headers/clsMKV.vb:1081 β€” clsMKVHeaders.ReadChapterInfo has cognitive complexity 20 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· ctlRipper.cInfo_Found (cognitive 19) Β· Γ—1
  • ctlRipper.cInfo_Found (cognitive 19) LimeSeed/Controls/ctlRipper.vb:260 β€” ctlRipper.cInfo_Found has cognitive complexity 19 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.Open_Single (cognitive 19) Β· Γ—1
  • frmMain.Open_Single (cognitive 19) LimeSeed/Forms/frmMain.vb:115 β€” frmMain.Open_Single has cognitive complexity 19 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· PlayListItems.ChangeIndex (cognitive 19) Β· Γ—1
  • PlayListItems.ChangeIndex (cognitive 19) LimeSeed/Forms/frmMain.vb:610 β€” PlayListItems.ChangeIndex has cognitive complexity 19 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.CheckDiscs (cognitive 19) Β· Γ—1
  • frmMain.CheckDiscs (cognitive 19) LimeSeed/Forms/frmMain.vb:3597 β€” frmMain.CheckDiscs has cognitive complexity 19 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.LoadData_Video_DVD (cognitive 19) Β· Γ—1
  • frmMain.LoadData_Video_DVD (cognitive 19) LimeSeed/Forms/frmMain.vb:3963 β€” frmMain.LoadData_Video_DVD has cognitive complexity 19 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmProps.dgvID3v2_EditingControlShowing (cognitive 19) Β· Γ—1
  • frmProps.dgvID3v2_EditingControlShowing (cognitive 19) LimeSeed/Forms/frmProps.vb:1932 β€” frmProps.dgvID3v2_EditingControlShowing has cognitive complexity 19 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· clsHeaderLoader.New.ctor (cognitive 19) Β· Γ—1
  • clsHeaderLoader.New.ctor (cognitive 19) Seed/clsHeaders.vb:20 β€” clsHeaderLoader.New.ctor has cognitive complexity 19 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· FFDShowAPI.ChaptersList.get (cognitive 19) Β· Γ—1
  • FFDShowAPI.ChaptersList.get (cognitive 19) FFAPI/FFDShowAPI.cs:1267 β€” FFDShowAPI.ChaptersList.get has cognitive complexity 19 (threshold 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 Β· frmMain.cmbChapters_SelectedIndexChanged (cognitive 18) Β· Γ—1
  • frmMain.cmbChapters_SelectedIndexChanged (cognitive 18) LimeSeed/Forms/frmMain.vb:1085 β€” frmMain.cmbChapters_SelectedIndexChanged has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.SetPlayPause (cognitive 18) Β· Γ—1
  • frmMain.SetPlayPause (cognitive 18) LimeSeed/Forms/frmMain.vb:3264 β€” frmMain.SetPlayPause has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmProps.LoadMPEG (cognitive 18) Β· Γ—1
  • frmProps.LoadMPEG (cognitive 18) LimeSeed/Forms/frmProps.vb:361 β€” frmProps.LoadMPEG has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmTray.pctRestore_Click (cognitive 18) Β· Γ—1
  • frmTray.pctRestore_Click (cognitive 18) LimeSeed/Forms/frmTray.vb:152 β€” frmTray.pctRestore_Click has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· ctlSeed.Position.Get (cognitive 18) Β· Γ—1
  • ctlSeed.Position.Get (cognitive 18) Seed/ctlSeed.vb:1117 β€” ctlSeed.Position.Get has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· ctlSeed.tmrJustBefore_Tick (cognitive 18) Β· Γ—1
  • ctlSeed.tmrJustBefore_Tick (cognitive 18) Seed/ctlSeed.vb:2615 β€” ctlSeed.tmrJustBefore_Tick has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· clsID3v2.GetHeader (cognitive 18) Β· Γ—1
  • clsID3v2.GetHeader (cognitive 18) Seed/Headers/clsID3v2.vb:610 β€” clsID3v2.GetHeader has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· FFDShowAPI.SubtitleFiles.get (cognitive 18) Β· Γ—1
  • FFDShowAPI.SubtitleFiles.get (cognitive 18) FFAPI/FFDShowAPI.cs:1171 β€” FFDShowAPI.SubtitleFiles.get has cognitive complexity 18 (threshold 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 Β· DeviceChangeNotificationWindow.WndProc (cognitive 17) Β· Γ—1
  • DeviceChangeNotificationWindow.WndProc (cognitive 17) LimeSeed/Classes/clsCDRip.vb:603 β€” DeviceChangeNotificationWindow.WndProc has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· IoctlResult.BuildRepository (cognitive 17) Β· Γ—1
  • IoctlResult.BuildRepository (cognitive 17) LimeSeed/Classes/clsCDText.vb:648 β€” IoctlResult.BuildRepository has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· ctlRipper.cArtwork_Choices (cognitive 17) Β· Γ—1
  • ctlRipper.cArtwork_Choices (cognitive 17) LimeSeed/Controls/ctlRipper.vb:479 β€” ctlRipper.cArtwork_Choices has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.tbsView_SelectedIndexChanged (cognitive 17) Β· Γ—1
  • frmMain.tbsView_SelectedIndexChanged (cognitive 17) LimeSeed/Forms/frmMain.vb:2977 β€” frmMain.tbsView_SelectedIndexChanged has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.SetWindowSize (cognitive 17) Β· Γ—1
  • frmMain.SetWindowSize (cognitive 17) LimeSeed/Forms/frmMain.vb:3541 β€” frmMain.SetWindowSize has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.SetTitleArtist (cognitive 17) Β· Γ—1
  • frmMain.SetTitleArtist (cognitive 17) LimeSeed/Forms/frmMain.vb:4735 β€” frmMain.SetTitleArtist has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.LoadFFDShow (cognitive 17) Β· Γ—1
  • frmMain.LoadFFDShow (cognitive 17) LimeSeed/Forms/frmMain.vb:6130 β€” frmMain.LoadFFDShow has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmText.SetText (cognitive 17) Β· Γ—1
  • frmText.SetText (cognitive 17) LimeSeed/Forms/frmText.vb:97 β€” frmText.SetText has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmTransfer.tcpRequest_SocketReceived (cognitive 17) Β· Γ—1
  • frmTransfer.tcpRequest_SocketReceived (cognitive 17) LimeSeed/Forms/frmTransfer.vb:176 β€” frmTransfer.tcpRequest_SocketReceived has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmTray.DrawGlassText (cognitive 17) Β· Γ—1
  • frmTray.DrawGlassText (cognitive 17) LimeSeed/Forms/frmTray.vb:183 β€” frmTray.DrawGlassText has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· DataPacketParser.Pass1 (cognitive 16) Β· Γ—1
  • DataPacketParser.Pass1 (cognitive 16) LimeSeed/Classes/clsCDText.vb:389 β€” DataPacketParser.Pass1 has cognitive complexity 16 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.mnuSettings_Click (cognitive 16) Β· Γ—1
  • frmMain.mnuSettings_Click (cognitive 16) LimeSeed/Forms/frmMain.vb:1361 β€” frmMain.mnuSettings_Click has cognitive complexity 16 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmMain.macArt_Complete (cognitive 16) Β· Γ—1
  • frmMain.macArt_Complete (cognitive 16) LimeSeed/Forms/frmMain.vb:7302 β€” frmMain.macArt_Complete has cognitive complexity 16 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· frmSettings.txtKey_KeyUp (cognitive 16) Β· Γ—1
  • frmSettings.txtKey_KeyUp (cognitive 16) LimeSeed/Forms/frmSettings.vb:586 β€” frmSettings.txtKey_KeyUp has cognitive complexity 16 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· clsMPEG.GetSampleRate (cognitive 16) Β· Γ—1
  • clsMPEG.GetSampleRate (cognitive 16) Seed/Headers/clsMPEG.vb:486 β€” clsMPEG.GetSampleRate has cognitive complexity 16 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D2 Β· Cognitive Complexity Β· clsXING.New.ctor (cognitive 16) Β· Γ—1
  • clsXING.New.ctor (cognitive 16) Seed/Headers/clsXING.vb:34 β€” clsXING.New.ctor has cognitive complexity 16 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
D4 Β· Code Duplication Β· Near-duplicate member pair (72 shared lines) Β· Γ—1
  • Near-duplicate member pair (72 shared lines) Seed/Headers/clsMPEG.vb:125 β€” Seed/Headers/clsMPEG.vb:125-303 | Seed/Headers/clsMPEG.vb:306-484 β€” These two members are variants of one another: 72 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain β€” factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 Β· Code Duplication Β· Edited copy of a member (7 corresponding lines) Β· Γ—1
  • Edited copy of a member (7 corresponding lines) LimeSeed/Classes/clsToolStripSystemRenderer.vb:48 β€” LimeSeed/Classes/clsToolStripSystemRenderer.vb:48-60 | LimeSeed/Classes/clsToolStripSystemRenderer.vb:269-452 β€” 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 Β· Duplicated block (122 lines × 2) Β· Γ—1
  • Duplicated block (122 lines × 2) GreenThumb/GreenThumbnailProperties.vb:592 β€” GreenThumb/GreenThumbnailProperties.vb:592-713 | LimeSeed/Modules/modFuncts.vb:901-1022 β€” 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 (80 lines × 2) Β· Γ—1
  • Duplicated block (80 lines × 2) LimeSeed/Forms/frmMain.vb:6917 β€” LimeSeed/Forms/frmMain.vb:6917-6996 | LimeSeed/Forms/frmSettings.vb:826-905 β€” 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 (4–79 lines × 3) Β· Γ—1
  • Duplicated block (4–79 lines × 3) LimeSeed/Modules/modFuncts.vb:228 β€” LimeSeed/Modules/modFuncts.vb:228-231 | LimeSeed/Modules/modFuncts.vb:244-322 | Seed/modFuncts.vb:49-127 β€” there are 3 copies across 2 file(s) β€” more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names β€” the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. β˜… These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `LimeSeed/Modules/modFuncts.vb:231` calls `TrackEntries`, `Size` and `LimeSeed/Modules/modFuncts.vb:322` does not β€” after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 Β· Code Duplication Β· Duplicated block (49 lines × 2) Β· Γ—1
  • Duplicated block (49 lines × 2) LimeSeed/Forms/frmMain.vb:6998 β€” LimeSeed/Forms/frmMain.vb:6998-7046 | LimeSeed/Forms/frmSettings.vb:906-954 β€” 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 (48 lines × 2) Β· Γ—1
  • Duplicated block (48 lines × 2) LimeSeed/Classes/clsSocket.vb:374 β€” LimeSeed/Classes/clsSocket.vb:374-421 | Seed/clsSocket.vb:580-627 β€” before extracting anything, compare `LimeSeed/Classes/clsSocket.vb` and `Seed/clsSocket.vb` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 91 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 (31 lines × 3) Β· Γ—1
  • Duplicated block (31 lines × 3) Seed/ctlSeed.vb:2109 β€” Seed/ctlSeed.vb:2109-2139 | Seed/ctlSeed.vb:2154-2184 | Seed/ctlSeed.vb:2197-2227 β€” all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites β€” resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 Β· Code Duplication Β· Duplicated block (33 lines × 2) Β· Γ—1
  • Duplicated block (33 lines × 2) LimeSeed/Classes/clsTaskBarLib.vb:404 β€” LimeSeed/Classes/clsTaskBarLib.vb:404-436 | LimeSeed/Classes/clsTaskBarLib.vb:690-722 β€” both copies are in the same file, so extract the 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 (30 lines × 2) Β· Γ—1
  • Duplicated block (30 lines × 2) Seed/Headers/clsID3v1.vb:150 β€” Seed/Headers/clsID3v1.vb:150-179 | Seed/Headers/clsID3v2.vb:2862-2891 β€” 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 (28–29 lines × 2) Β· Γ—1
  • Duplicated block (28–29 lines × 2) LimeSeed/Classes/clsToolStripSystemRenderer.vb:68 β€” LimeSeed/Classes/clsToolStripSystemRenderer.vb:68-96 | LimeSeed/Classes/clsToolStripSystemRenderer.vb:148-175 β€” both copies are in the same file, so extract the 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 (21 lines × 2) Β· Γ—1
  • Duplicated block (21 lines × 2) LimeSeed/Classes/clsRadioMenu.vb:75 β€” LimeSeed/Classes/clsRadioMenu.vb:75-95 | LimeSeed/Classes/clsRadioMenu.vb:163-183 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
D4 Β· Code Duplication Β· Duplicated block (26 lines × 2) Β· Γ—1
  • Duplicated block (26 lines × 2) GreenThumb/GreenThumbnailProperties.vb:718 β€” GreenThumb/GreenThumbnailProperties.vb:718-743 | LimeSeed/Modules/modFuncts.vb:1331-1356 β€” 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 (19–22 lines × 4) Β· Γ—1
  • Duplicated block (19–22 lines × 4) LimeSeed/Modules/modFuncts.vb:50 β€” LimeSeed/Modules/modFuncts.vb:50-71 | Seed/Headers/clsID3v2.vb:1191-1212 | Seed/Headers/clsMIDI.vb:383-401 | Seed/Headers/modHeaderFunctions.vb:3-24 β€” the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times.
D4 Β· Code Duplication Β· Duplicated block (22 lines × 2) Β· Γ—1
  • Duplicated block (22 lines × 2) FFAPI/FFDShowAPI.cs:886 β€” FFAPI/FFDShowAPI.cs:886-907 | FFAPI/FFDShowAPI.cs:956-977 β€” both copies are in the same file, so extract the 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 (19 lines × 2) Β· Γ—1
  • Duplicated block (19 lines × 2) LimeSeed/Forms/frmMain.vb:6897 β€” LimeSeed/Forms/frmMain.vb:6897-6915 | LimeSeed/Forms/frmSettings.vb:807-825 β€” 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 (13–20 lines × 2) Β· Γ—1
  • Duplicated block (13–20 lines × 2) Seed/Headers/clsMKV.vb:400 β€” Seed/Headers/clsMKV.vb:400-412 | Seed/Headers/clsMKV.vb:414-433 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
D4 Β· Code Duplication Β· Duplicated block (10 lines × 3) Β· Γ—1
  • Duplicated block (10 lines × 3) LimeSeed/Forms/frmMain.vb:6448 β€” LimeSeed/Forms/frmMain.vb:6448-6457 | LimeSeed/Forms/frmMain.vb:6466-6475 | LimeSeed/Forms/frmMain.vb:6484-6493 β€” all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites β€” resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 Β· Code Duplication Β· Duplicated block (17 lines × 2) Β· Γ—1
  • Duplicated block (17 lines × 2) Seed/Headers/clsVorbis.vb:837 β€” Seed/Headers/clsVorbis.vb:837-853 | Seed/Headers/clsVorbis.vb:868-884 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
D4 Β· Code Duplication Β· Duplicated block (14–17 lines × 2) Β· Γ—1
  • Duplicated block (14–17 lines × 2) FFAPI/FFDShowAPI.cs:865 β€” FFAPI/FFDShowAPI.cs:865-881 | FFAPI/FFDShowAPI.cs:941-954 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `FFAPI/FFDShowAPI.cs:865` 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. 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 (14–15 lines × 2) Β· Γ—1
  • Duplicated block (14–15 lines × 2) LimeSeed/Forms/frmMain.vb:5772 β€” LimeSeed/Forms/frmMain.vb:5772-5786 | LimeSeed/Forms/frmMain.vb:5792-5805 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
D4 Β· Code Duplication Β· Duplicated block (14 lines × 3) Β· Γ—1
  • Duplicated block (14 lines × 3) LimeSeed/Controls/BetterProgress.vb:225 β€” LimeSeed/Controls/BetterProgress.vb:225-238 | LimeSeed/Controls/BetterProgress.vb:241-254 | LimeSeed/Controls/BetterProgress.vb:272-285 β€” all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites β€” resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 Β· Code Duplication Β· Duplicated block (13–14 lines × 3) Β· Γ—1
  • Duplicated block (13–14 lines × 3) LimeSeed/Forms/frmMain.vb:1013 β€” LimeSeed/Forms/frmMain.vb:1013-1026 | LimeSeed/Forms/frmMain.vb:3497-3509 | LimeSeed/Forms/frmMain.vb:3520-3532 β€” all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites β€” resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 Β· Code Duplication Β· Duplicated block (12 lines × 3) Β· Γ—1
  • Duplicated block (12 lines × 3) LimeSeed/Forms/frmProps.vb:1859 β€” LimeSeed/Forms/frmProps.vb:1859-1870 | LimeSeed/Forms/frmProps.vb:1898-1909 | LimeSeed/Forms/frmProps.vb:1912-1923 β€” all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites β€” resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 Β· Code Duplication Β· Duplicated block (6–14 lines × 2) Β· Γ—1
  • Duplicated block (6–14 lines × 2) Seed/Headers/clsID3v2.vb:2908 β€” Seed/Headers/clsID3v2.vb:2908-2913 | Seed/ctlSeed.vb:364-377 β€” 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 (13 lines × 5) Β· Γ—1
  • Duplicated block (13 lines × 5) LimeSeed/Forms/frmMain.vb:5986 β€” LimeSeed/Forms/frmMain.vb:5986-5998 | LimeSeed/Forms/frmMain.vb:6000-6012 | LimeSeed/Forms/frmMain.vb:6019-6031 | LimeSeed/Forms/frmMain.vb:6033-6045 | LimeSeed/Forms/frmMain.vb:6049-6061 β€” all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites β€” resolving only two of them leaves the rest to drift apart the first time one is edited. β˜… These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `LimeSeed/Forms/frmMain.vb:6046` calls `StartPlayList` and `LimeSeed/Forms/frmMain.vb:6032` does not β€” after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 Β· Code Duplication Β· Duplicated block (13 lines × 4) Β· Γ—1
  • Duplicated block (13 lines × 4) Seed/Headers/clsMPEG.vb:155 β€” Seed/Headers/clsMPEG.vb:155-167 | Seed/Headers/clsMPEG.vb:189-201 | Seed/Headers/clsMPEG.vb:336-348 | Seed/Headers/clsMPEG.vb:370-382 β€” all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites β€” resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 Β· Code Duplication Β· Duplicated block (10 lines × 6) Β· Γ—1
  • Duplicated block (10 lines × 6) LimeSeed/Forms/frmMain.vb:5936 β€” LimeSeed/Forms/frmMain.vb:5936-5945 | LimeSeed/Forms/frmMain.vb:5987-5996 | LimeSeed/Forms/frmMain.vb:6001-6010 | LimeSeed/Forms/frmMain.vb:6020-6029 | LimeSeed/Forms/frmMain.vb:6034-6043 | LimeSeed/Forms/frmMain.vb:6050-6059 β€” all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites β€” resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 Β· Code Duplication Β· Duplicated block (7 lines × 6) Β· Γ—1
  • Duplicated block (7 lines × 6) Seed/Headers/clsMPEG.vb:155 β€” Seed/Headers/clsMPEG.vb:155-161 | Seed/Headers/clsMPEG.vb:189-195 | Seed/Headers/clsMPEG.vb:260-266 | Seed/Headers/clsMPEG.vb:336-342 | Seed/Headers/clsMPEG.vb:370-376 | Seed/Headers/clsMPEG.vb:441-447 β€” all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites β€” resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 Β· Code Duplication Β· Duplicated block (8 lines × 4) Β· Γ—1
  • Duplicated block (8 lines × 4) Seed/Headers/clsMPEG.vb:223 β€” Seed/Headers/clsMPEG.vb:223-230 | Seed/Headers/clsMPEG.vb:294-301 | Seed/Headers/clsMPEG.vb:404-411 | Seed/Headers/clsMPEG.vb:475-482 β€” all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites β€” resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 Β· Code Duplication Β· Duplicated block (4–7 lines × 6) Β· Γ—1
  • Duplicated block (4–7 lines × 6) LimeSeed/Classes/clsToolStripSystemRenderer.vb:298 β€” LimeSeed/Classes/clsToolStripSystemRenderer.vb:298-301 | LimeSeed/Classes/clsToolStripSystemRenderer.vb:313-316 | LimeSeed/Classes/clsToolStripSystemRenderer.vb:330-336 | LimeSeed/Classes/clsToolStripSystemRenderer.vb:350-356 | LimeSeed/Classes/clsToolStripSystemRenderer.vb:409-412 | LimeSeed/Classes/clsToolStripSystemRenderer.vb:424-427 β€” all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites β€” resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 Β· Code Duplication Β· Duplicated block (3–7 lines × 4) Β· Γ—1
  • Duplicated block (3–7 lines × 4) LimeSeed/Forms/frmFullScreen.vb:168 β€” LimeSeed/Forms/frmFullScreen.vb:168-174 | LimeSeed/Forms/frmFullScreen.vb:184-190 | LimeSeed/Forms/frmMain.vb:1227-1229 | LimeSeed/Forms/frmMain.vb:1240-1243 β€” there are 4 copies across 2 file(s) β€” more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names β€” the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 Β· Code Duplication Β· Duplicated block (5 lines × 8) Β· Γ—1
  • Duplicated block (5 lines × 8) Seed/Headers/clsMPEG.vb:129 β€” Seed/Headers/clsMPEG.vb:129-133 | Seed/Headers/clsMPEG.vb:163-167 | Seed/Headers/clsMPEG.vb:197-201 | Seed/Headers/clsMPEG.vb:234-238 | Seed/Headers/clsMPEG.vb:310-314 | Seed/Headers/clsMPEG.vb:344-348 | Seed/Headers/clsMPEG.vb:378-382 | Seed/Headers/clsMPEG.vb:415-419 β€” all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites β€” resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 Β· Code Duplication Β· Duplicated block (5–6 lines × 3) Β· Γ—1
  • Duplicated block (5–6 lines × 3) Seed/Headers/clsID3v2.vb:2785 β€” Seed/Headers/clsID3v2.vb:2785-2790 | Seed/Headers/clsID3v2.vb:2791-2796 | Seed/Headers/clsID3v2.vb:2797-2801 β€” all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites β€” resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names β€” the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
M1 Β· Documentation (README) Β· No solution README Β· Γ—1
  • No solution README β€” No README at the repository root β€” newcomers have no entry point.
M4 Β· Documentation accuracy Β· No README Β· Γ—1
  • No README β€” There is no README, so nothing documents what the system is or how it works.
P1 Β· CI/CD gates Β· No CI pipeline Β· Γ—1
  • No CI pipeline β€” No CI workflow found (.github/workflows, azure-pipelines.yml, .gitlab-ci.yml, …) β€” changes aren't gated by an automated build/test.
X18 Β· Disposal-pattern correctness Β· Owned disposable field is never released Β· Γ—1
  • Owned disposable field is never released FFAPI/FFDShowAPI.cs:188 β€” `FFDShowAPI` implements `IDisposable` β€” so it has told every caller it holds something worth releasing β€” and it constructs `receiver` itself (line 188), which makes that instance its own. But `receiver` is named in none of the methods the disposal search covered: `Dispose` (line 1647) β€” that is `Dispose` plus every method `Dispose` calls BY NAME, so a release reached through an interface, a delegate or a base class is not followed and is worth checking before acting. On what was read, the type's disposal releases everything except the one thing it owns. A disposable the owner never disposes is held until finalization if its type has a finalizer, and forever if it does not β€” which for a synchronisation primitive, a timer, a stream or a handle means the resource accumulates once per instance for the life of the process. Release it in `Dispose` (`receiver?.Dispose();`), or, if it truly does not need releasing, drop `IDisposable` from the type so the claim and the behaviour agree.
Minor β€” 57 finding(s)
IC1 Β· Incompleteness & stubs Β· Commented-out code Β· Γ—40
  • Commented-out code FFAPI/FFDShowAPI.cs:222 β€” A line of code has been commented out rather than removed β€” dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FFAPI/FFDShowAPI.cs:226 β€” A line of code has been commented out rather than removed β€” dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FFAPI/FFDShowAPI.cs:572 β€” A line of code has been commented out rather than removed β€” dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FFAPI/FFDShowAPI.cs:957 β€” A line of code has been commented out rather than removed β€” dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FFAPI/FFDShowAPI.cs:978 β€” A line of code has been commented out rather than removed β€” dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FFAPI/FFDShowAPI.cs:1001 β€” A line of code has been commented out rather than removed β€” dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FFAPI/FFDShowAPI.cs:1142 β€” A line of code has been commented out rather than removed β€” dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FFAPI/FFDShowAPI.cs:1143 β€” A line of code has been commented out rather than removed β€” dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FFAPI/FFDShowAPI.cs:1243 β€” 4 consecutive lines of code sit inside a `/* … */` block β€” a block of code switched off rather than removed, which rots and confuses. Delete it (version control remembers).
  • Commented-out code FFAPI/FFDShowAPI.cs:1251 β€” 4 consecutive lines of code sit inside a `/* … */` block β€” a block of code switched off rather than removed, which rots and confuses. Delete it (version control remembers).
  • Commented-out code FFAPI/FFDShowAPI.cs:1778 β€” A line of code has been commented out rather than removed β€” dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FFAPI/FFDShowAPI.cs:1779 β€” A line of code has been commented out rather than removed β€” dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FFAPI/FFDShowAPI.cs:2252 β€” 3 consecutive lines of code sit inside a `/* … */` block β€” a block of code switched off rather than removed, which rots and confuses. Delete it (version control remembers).
  • Commented-out code FFAPI/FFDShowAPI.cs:2255 β€” A line of code has been commented out rather than removed β€” dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FFAPI/FFDShowAPI.cs:2276 β€” A line of code has been commented out rather than removed β€” dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FFAPI/FFDShowReceiver.cs:113 β€” 5 consecutive lines of code sit inside a `/* … */` block β€” a block of code switched off rather than removed, which rots and confuses. Delete it (version control remembers).
  • Commented-out code FFAPI/FFDShowReceiver.cs:121 β€” A line of code has been commented out rather than removed β€” dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FFAPI/Interfaces/IffDecoder.cs:35 β€” A line of code has been commented out rather than removed β€” dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FFAPI/Interfaces/IffDecoder.cs:40 β€” A line of code has been commented out rather than removed β€” dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FFAPI/Interfaces/IffDecoder.cs:41 β€” A line of code has been commented out rather than removed β€” dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FFAPI/Interfaces/IffDecoder.cs:80 β€” A line of code has been commented out rather than removed β€” dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FFAPI/Interfaces/IffDecoder.cs:87 β€” A line of code has been commented out rather than removed β€” dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FFAPI/Interfaces/IffDecoder.cs:93 β€” A line of code has been commented out rather than removed β€” dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FFAPI/Interfaces/IffDecoder.cs:94 β€” A line of code has been commented out rather than removed β€” dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FFAPI/Interfaces/IffDecoder.cs:101 β€” A line of code has been commented out rather than removed β€” dead weight that rots and confuses. Delete it (version control remembers).
  • + 15 more in this group β€” see findings.md.
AX6 Β· Interface segregation Β· Fat interface Β· Γ—4
  • Fat interface: IffDecoder (111 members) FFAPI/Interfaces/IffDecoder.cs:8 β€” `IffDecoder` declares 111 members: `compat_getParam`, `compat_getParam2`, `compat_putParam`, `compat_getNumPresets`, `compat_getPresetName`, `compat_getActivePresetName`, `compat_setActivePreset`, `compat_getAVIdimensions`, `compat_getAVIfps`, `compat_saveActivePreset`, `compat_saveActivePresetToFile`, `compat_loadActivePresetFromFile`, `compat_removePreset`, `compat_notifyParamsChanged`, `compat_getAVcodecVersion`, `compat_getPPmode`, `compat_getRealCrop`, `compat_getMinOrder2`, `compat_getMaxOrder2`, `compat_saveGlobalSettings`, `compat_loadGlobalSettings`, `compat_saveDialogSettings`, `compat_loadDialogSettings`, `compat_getPresets`, `compat_setPresets`, `compat_savePresets`, `compat_getPresetPtr`, `compat_setPresetPtr`, `compat_renameActivePreset`, `compat_setOnChangeMsg`, `compat_setOnFrameMsg`, `compat_isDefaultPreset`, `compat_showCfgDlg`, `compat_getXvidVersion`, `compat_getMovieSource`, `compat_getOutputDimensions`, `compat_getCpuUsage2`, `compat_getOutputFourcc`, `compat_getInputBitrate2`, `compat_getHistogram`, and 71 more. Counted as the author wrote them β€” a property is ONE member and its get/set accessors are not counted separately, and an event counts once. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
  • Fat interface: IffdshowBase (86 members) FFAPI/Interfaces/IffdshowBase.cs:9 β€” `IffdshowBase` declares 86 members: `getVersion2`, `getParam`, `getParam2`, `putParam`, `invParam`, `getParamStr`, `getParamStr2`, `putParamStr`, `getParamName`, `notifyParamsChanged`, `setOnChangeMsg`, `setOnFrameMsg`, `getGlobalSettings`, `saveGlobalSettings`, `loadGlobalSettings`, `saveDialogSettings`, `loadDialogSettings`, `getConfig`, `getInstance`, `getInstance2`, `getTranslator`, `initDialog`, `showCfgDlg`, `getCpuUsage2`, `getCpuUsageForPP`, `cpuSupportsMMX`, `cpuSupportsMMXEXT`, `cpuSupportsSSE`, `cpuSupportsSSE2`, `cpuSupportsSSE3`, `cpuSupportsSSSE3`, `cpuSupports3DNOW`, `cpuSupports3DNOWEXT`, `dbgInit`, `dbgError`, `dbgWrite`, `dbgDone`, `showTrayIcon`, `hideTrayIcon`, `getExeflnm`, and 46 more. Counted as the author wrote them β€” a property is ONE member and its get/set accessors are not counted separately, and an event counts once. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
  • Fat interface: IffdshowDec (80 members) FFAPI/Interfaces/IffdshowDec.cs:9 β€” `IffdshowDec` declares 80 members: `getVersion2`, `saveKeysSettings`, `loadKeysSettings`, `getGraph`, `seek`, `tell`, `stop`, `run`, `getState2`, `getDuration`, `getCurTime2`, `initKeys`, `getKeyParamCount2`, `getKeyParamDescr`, `getKeyParamKey2`, `setKeyParamKey`, `getNumPresets`, `initPresets`, `getPresetName`, `getActivePresetName`, `setActivePreset`, `saveActivePreset`, `saveActivePresetToFile`, `loadActivePresetFromFile`, `removePreset`, `getPresets`, `setPresets`, `savePresets`, `getPresetPtr`, `setPresetPtr`, `renameActivePreset`, `isDefaultPreset`, `createTempPreset`, `getMinOrder2`, `getMaxOrder2`, `resetFilter`, `resetFilterEx`, `getFilterTip`, `getFilterTipEx`, `filterHasReset`, and 40 more. Counted as the author wrote them β€” a property is ONE member and its get/set accessors are not counted separately, and an event counts once. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
  • Fat interface: IffdshowDecVideo (63 members) FFAPI/Interfaces/IffdshowDecVideo.cs:8 β€” `IffdshowDecVideo` declares 63 members: `getVersion2`, `getAVIdimensions`, `getAVIfps`, `getAVcodecVersion`, `getPPmode`, `getRealCrop`, `getXvidVersion`, `getOutputDimensions`, `getOutputFourcc`, `getInputBitrate2`, `setFilterOrder`, `getAVIfps1000_2`, `getCurrentFrameTime`, `calcNewSize`, `grabNow`, `getOverlayControlCapability`, `findAutoSubflnm2`, `getFrameTime`, `shortOSDmessage`, `cleanShortOSDmessages`, `shortOSDmessageAbsolute`, `registerSelectedMediaTypes`, `getFrameTimes`, `getSubtitleTimes`, `resetSubtitleTimes`, `setFrameTimes`, `getInIsSync`, `getVideoWindowPos`, `getSubtitleLanguagesCount2`, `getSubtitleLanguageDesc`, `getFrameTimeMS`, `getCurrentFrameTimeMS`, `frameStep`, `textPinConnected_`, `cycleSubLanguages`, `findAutoSubflnm3`, `setAverageTimePerFrame`, `getLate`, `getAverageTimePerFrame`, `getCurrentSubFlnm`, and 23 more. Counted as the author wrote them β€” a property is ONE member and its get/set accessors are not counted separately, and an event counts once. Those 63 declarations carry 62 distinct name(s), so part of the width is overloading rather than separate responsibilities β€” but 62 operations clears the >15 bar on its own, so the row is about responsibilities, not signatures. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
D20 Β· ADR Quality Β· No ADRs found Β· Γ—1
  • No ADRs found β€” No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these β€” unnumbered files outside any recognised directory, without those headings β€” is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`.
D21 Β· Naming Consistency Β· Two methods with nearly identical signatures (accepting an object parameter) and similar names ('getPresets' vs 'getPresetsPtr') likely return related but distinct data structures (e.g., a managed object vs a pointer to unmanaged memory). While the suffix 'Ptr' clarifies the return type, the base name 'getPresets' is ambiguous when paired with 'getPresetsPtr'. Β· Γ—1
  • Two methods with nearly identical signatures (accepting an object parameter) and similar names ('getPresets' vs 'getPresetsPtr') likely return related but distinct data structures (e.g., a managed object vs a pointer to unmanaged memory). While the suffix 'Ptr' clarifies the return type, the base name 'getPresets' is ambiguous when paired with 'getPresetsPtr'. β€” Rename 'getPresetsPtr' to 'GetPresetsPointer' or 'GetPresetsRaw' to clearly distinguish it from the managed 'getPresets' method, or rename 'getPresets' to 'GetPresetsManaged' if both are needed. (symbols: FFDShowAPI.Interfaces.IffdshowDec.getPresets(object), FFDShowAPI.Interfaces.IffdshowDec.getPresetsPtr(object))
D21 Β· Naming Consistency Β· Two methods with identical names except for a numeric suffix (2 vs 3) suggest an iterative refactoring or versioning of the same underlying logic (likely finding auto subtitle filenames). This indicates a lack of semantic distinction in naming. Β· Γ—1
  • Two methods with identical names except for a numeric suffix (2 vs 3) suggest an iterative refactoring or versioning of the same underlying logic (likely finding auto subtitle filenames). This indicates a lack of semantic distinction in naming. β€” Determine if these are truly distinct operations. If so, rename them to reflect their specific behavior (e.g., 'FindAutoSubtitleFileLegacy' and 'FindAutoSubtitleFileV2'). If one is obsolete, remove it. (symbols: FFDShowAPI.Interfaces.IffdshowDecVideo.findAutoSubflnm2(), FFDShowAPI.Interfaces.IffdshowDecVideo.findAutoSubflnm3())
D21 Β· Naming Consistency Β· Two methods that appear to retrieve the current playback time use different naming conventions Β· Γ—1
  • Two methods that appear to retrieve the current playback time use different naming conventions: one uses snake_case with a specific context ('get_time_on_ffdshow'), while the other uses PascalCase with a generic context ('getCurrentTime'). This inconsistency makes it unclear if they return the same value or different time sources. β€” Standardize on PascalCase for public API methods. Rename 'get_time_on_ffdshow' to 'GetTimeOnFFDShow' or, if it serves the same purpose as 'getCurrentTime', consolidate them. (symbols: FFDShowAPI.Interfaces.IffdshowDecVideo.get_time_on_ffdshow(), FFDShowAPI.FFDShowAPI.getCurrentTime())
D21 Β· Naming Consistency Β· Two methods performing the same action ('lock') have different names Β· Γ—1
  • Two methods performing the same action ('lock') have different names: one uses a trailing underscore ('lock_') and the other uses a 'compat_' prefix. The underscore is often a workaround for reserved keywords or conflicts, while 'compat_' suggests a compatibility wrapper. This inconsistency obscures the relationship between the base interface and the compatibility layer. β€” If 'lock_' is a workaround, rename it to 'Lock' or 'LockResource'. If 'compat_lock' is a wrapper, consider if the base interface should expose 'Lock' directly, or rename 'lock_' to 'Lock' and 'compat_lock' to 'LockCompatibility' for clarity. (symbols: FFDShowAPI.Interfaces.IffdshowBase.lock_(int), FFDShowAPI.Interfaces.IffDecoder.compat_lock(int))
D26 Β· Project Cohesion Β· Projects may be oversized for their cohesion Β· Γ—1
  • Projects may be oversized for their cohesion β€” 1 of 6 project(s) overshoot their size bounds, lowering Project Cohesion to 6.7/10. The most over is `LimeSeed` (21762 LoC, 134 public types across 2 namespaces). Review these for cohesion β€” split a project that spans unrelated responsibilities.
D9 Β· Test Distribution Β· No tests found Β· Γ—1
  • No tests found β€” No test suite could be collected β€” no discoverable tests to count. If this repository does test, wiring the suite to a framework a runner can collect (xUnit, NUnit or MSTest) is what makes it countable here; a pipeline step that invokes a runner is not evidence on its own, because a runner over an empty suite passes. Tests written as plain executables or shell/PowerShell harnesses are not collectible this way and are not scored here.
M2 Β· Architecture documentation Β· No ADRs Β· Γ—1
  • No ADRs β€” No Architecture Decision Records found β€” no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
M2 Β· Architecture documentation Β· No architecture diagram/doc Β· Γ—1
  • No architecture diagram/doc β€” No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape β€” no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document β€” not evidence that nobody wrote the shape down.
M3 Β· Folder & project structure Β· No src/ separation Β· Γ—1
  • No src/ separation β€” Production code isn't grouped under a src/ folder β€” it's spread across several top-level directories, so there's no one place that says 'this is the product'.
M3 Β· Folder & project structure Β· Inconsistent root namespaces Β· Γ—1
  • Inconsistent root namespaces β€” Only 1/6 projects share a common root namespace β€” the code's module identity is inconsistent.
P3 Β· Security & performance tooling Β· No SAST Β· Γ—1
  • No SAST β€” No static application security testing detected. For this repository's stack, add a Roslyn security analyzer package referenced from the project (the analyzer packages do analyse VB.NET), plus gitleaks for committed secrets β€” CodeQL has no VB.NET extractor, so its csharp pack would extract nothing from this tree and then report it clean β€” this repository has no CI pipeline yet, so run it locally to clear the existing findings, then make it a step of the first workflow you add so a regression fails the build. What was searched, so you can tell an absence from a miss: the 0 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen β€” if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
P6 Β· Release Hygiene Β· No changelog Β· Γ—1
  • No changelog β€” No CHANGELOG/HISTORY/RELEASES file β€” what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
Minor β€” 1 finding(s)
D19 Β· Documentation Quality Β· XML-doc coverage Β· Γ—1
  • XML-doc coverage: FFDShowAPI_2010 FFAPI/FFDShowAPI_2010.csproj β€” FFDShowAPI_2010: 69 % XML-doc coverage (114/166).

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/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-01e1584b56a94edd83be5b63eb2fd40a/history.json --exit-code 0 --source .0artifacts/raw/gitleaks-history.json
D28 Β· Secrets (history)gitleaksβ€”gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-01e1584b56a94edd83be5b63eb2fd40a/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/watchdog-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off .0artifacts/raw/semgrep.json
D30 Β· Dependency Vulnerabilitiesnugetβ€”nuget: not applicable β€” nuget: `dotnet list package --vulnerable` could not read this solution's dependency graph β€” it reported an error for at least one project and returned no package data at all (typically a packages.config / non-PackageReference project, which the command cannot read). An unreadable dependency graph is not a clean one; migrate the project(s) to PackageReference to enable this scan0β€”
D31 Β· IaC & Container Securitytrivyβ€”trivy: not applicable β€” No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.0β€”
D32 Β· Data Compliance (PII/GDPR)semgrepβ€”semgrep: not applicable β€” No personal data was found crossing a boundary the PII/GDPR ruleset checks β€” nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.0β€”
D36 Β· Supply-chain Provenance & Signingprovenanceβ€”provenance: not applicable β€” No CI/build pipeline found (.github/.forgejo/.gitea workflows, .circleci, .buildkite, .woodpecker, .teamcity, .gitlab-ci.yml, .travis.yml, bitbucket-pipelines.yml, .drone.yml, .cirrus.yml, .woodpecker.yml, appveyor.yml, azure-pipelines*.yml, .pipelines/, .vsts-ci/, .azuredevops/, Jenkinsfile); there is no build to attest provenance for.0β€”
D37 Β· Vulnerability-disclosure Policydisclosureβ€”disclosure: not applicable β€” No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.0β€”
D40 Β· Network Egress Confinementruntime-hardeningβ€”runtime-hardening: not applicable β€” No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.0β€”
D41 Β· Kernel & Syscall Confinementruntime-hardeningβ€”runtime-hardening: not applicable β€” No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.0β€”
D42 Β· Runtime Threat Enforcementruntime-hardeningβ€”runtime-hardening: not applicable β€” No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.0β€”
D43 Β· Malicious Dependenciesnone (no readable dependency manifest)β€”none (no readable dependency manifest): not applicable β€” Not scored β€” no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Python pyproject.toml/requirements.txt (pip/uv/Poetry), a Swift Package.swift/Package.resolved, a Cargo manifest, a Go module (go.mod/go.sum), a Gradle version catalogue, a Maven POM, an sbt build (build.sbt), composer.json, package.json, a Dart pubspec.yaml, an Elixir mix.exs/mix.lock (Hex), a rebar.config / erlang.mk DEPS (Hex), a Ruby Gemfile/Gemfile.lock or .gemspec (Bundler/RubyGems) β€” not scanned yet).0β€”

Run 01a15f6d-4bd3-7c87-be45-16370a0d8e56 Β· 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