Public report — FASTER, published 5 Aug 2026.
Concrete security findings (CVE IDs, secret matches, dependency versions) are hidden in this version;
ask the repo owner for the full report.
Medium · 49,978 LoC · 35 projects · rebuild ~0.8 person-years · weakest lens: Code Health (38%)
Build did not compile — scores are provisional
The analysed solution did not compile (4 build error(s)). Dimensions that depend on the compiler — complexity, duplication, cohesion, dead code, API surface — ran on incomplete models, so the scores below are provisional. Fix the build, then re-run for a reliable grade. First errors: CS0023: Operator '.' cannot be applied to operand of type 'void'
Grounded in facts. Every number here is computed, not narrated — reproducible, tool-backed, and traceable to a line of code. How to trust this ▸
316findings with an exact file:lineof 333 — the remainder are repo-wide signals (a dimension-level measurement, not a single line); open any file:line and verify
57/108dimensions across the health lenses49978 LoC · 35 projects — wide & deep
Executive summary
Read through the Production lens — the standard calibration. *Green* means good enough to run in production. The score is absolute and comparable across repos.
microsoft/FASTER carries serious gaps (45%). Several issues below can materially affect correctness, security, or the cost of changing it — and propagate to everything that depends on it.
It is strongest in Architecture (97%) — the structure is clean and changes stay contained. Security (78%) is solid too.
The area that most needs attention is Code Health (38%) — changes there are slower and more error-prone. Readiness (39%) is the next concern — releases are harder to depend on — versioning, release notes and dependency hygiene are thin, so consumers can't easily tell what changed or trust an upgrade.
Leadership focus, highest impact first: TypeScript for the frontend (Type Safety); Enable <Nullable>enable</Nullable> across all projects… (Nullable reference types); Sync-over-async (deadlock risk) (Async correctness).
For scale: Medium (~49,978 production lines); rebuilding it from scratch would take roughly ~0.8 person-years (~1–2 engineers). Approximate, ±~30%.
It builds on a genuinely strong Architecture foundation (97%); the priorities above are the highest-leverage way to bring the rest up to that level.
How the score is built — each lens's share of the headlineWidth is the lens's weight in the worst-heaviest fold (the weakest area pulls hardest); colour is that lens's own band. A lens fixes the score in proportion to its width.
A full-fidelity diff against the previous run's complete recorded findings — line-move tolerant: a finding that only shifted line counts as unchanged, only genuinely new titles/files surface here.
This codebase represents roughly ~0.8 person-years of build effort (about ~€120,000 to rebuild). Its weakest lens is Code Health at 38% — the part of that asset most exposed by the findings below.
How we model this: boilerplate at a scaffolding rate + logic × domain Standard (×1.0) — library/CLI, high decision density × a 0.7× quality factor, at €60–95/h; indicative, ±~30%. Indicative only — most sensitive to the hourly rate and the domain tier (both tunable in config).
Top priorities
The highest-leverage moves; the full ranked list is in the Roadmap below.
1
Resolve the 3 Largest orphaned file finding(s) in Knowledge Freshness — start with FasterLog.cs, AllocatorBase.cs, ClientSession.cs.
Adopt TypeScript for the frontend: add a typecheck step to the build, then either type-check the existing JavaScript in place (`checkJs`/JSDoc types) or convert the highest-traffic modules first — no file is typed today, so this is an adoption, not a clean-up.
Highest-leverage move: fix the build · Critical · Leverage
The solution doesn't compile, so every Roslyn-derived dimension (complexity, duplication, cohesion, dead code, API surface) ran on incomplete models and is PROVISIONAL. Fixing the build is the single change that makes the rest of the report trustworthy — do it first. The compiler reported: CS0023: Operator '.' cannot be applied to operand of type 'void'.
Evidence: D18 build: The compiler reported: CS0023: Operator '.' cannot be applied to operand of type 'void'.
→ Fix the build, then re-run for a reliable grade.
Value concentrated against a weak lens · High · Value at risk
This is a Medium asset (~0.8 person-years to rebuild), and its weakest lens is Code Health at 38%. The operational and business risk on an asset this size concentrates there — that's where remediation buys the most protection.
→ Direct remediation budget at Code Health first — highest risk-reduction per euro on an asset this size.
Architecture — module dependency graph
Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways — a layering smell or cycle. A clean layered graph has none.
Architecture — module dependency matrix
10 modules, 7 dependencies — every dependency points down the layering, so there are no cycles. Rows and columns are the same modules, ordered so that a module only depends on ones above it. A cell means the row depends on the column, and its number is how many type pairs create that dependency. Read one thing: is anything above the diagonal? A mark there is a dependency cycle. (A cycle is all this shows — an unusual but cycle-free dependency sits below the diagonal like any other.)
At a glance — Code Health · 38% · Weak · gated by D18, R1, X5
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A06:2021 — Vulnerable & Outdated Components
2
High / Critical
Roadmap
Begin by adopting TypeScript for the frontend, starting with the highest-traffic modules to establish type safety. Next, enable nullable reference types across all projects and resolve warnings instead of suppressing them. Then, address 34 instances of sync-over-async patterns to prevent deadlocks. After that, fix 25 cases of swallowed exceptions by ensuring proper error handling. Finally, extract duplicated code blocks into shared functions or components to reduce redundancy.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Resolve the 3 Largest orphaned file finding(s) in Knowledge Freshness — start with FasterLog.cs, AllocatorBase.cs, ClientSession.cs.
Adopt TypeScript for the frontend: add a typecheck step to the build, then either type-check the existing JavaScript in place (`checkJs`/JSDoc types) or convert the highest-traffic modules first — no file is typed today, so this is an adoption, not a clean-up.
Explicit Debt: Dead code: FastForwardToCurrentCycle
cs/src/core/Allocator/AllocatorBase.cs
6.0
Mixed
Explicit Debt: Dead code: PMMFlushStatus
cs/src/core/Index/FASTER/FASTERBase.cs
6.0
Mixed
Explicit Debt: TodoComment
cs/src/core/Allocator/MallocFixedPageSize.cs
6.0
Mixed
Explicit Debt: BarePragmaDisable
cs/src/core/Index/Common/Contexts.cs
6.0
Mixed
Explicit Debt: Dead code: DetachKey
cs/src/core/Index/Common/RecordInfo.cs
6.0
Mixed
Explicit Debt: BarePragmaDisable
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. 53 of 57 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 4 documentation/naming judgement(s) are LLM-assisted and labelled advisory. Overall confidence is 0.6 — 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 — 57 dimensions across the health lenses
Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.
How to trust any code-health report — three questions
Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 316 of 333 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
A clean run — every tool resolved and ran, and every applicable dimension was measured at full confidence. No scanner was unavailable, no analysis timed out or crashed, and nothing fell back to a degraded estimate.
When something does degrade — a missing scanner, a shallow clone, an LLM hiccup — it is named here explicitly and its exact cause recorded in diagnostics.md, never absorbed silently into the score.
Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.
Limitations & what we did not check
Watchdog assesses the repository exactly as committed, and only the repository. By design it does not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity (jscpd) — it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
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.
D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
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.
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").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and the advisory database — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
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, D20, D21, D24, M4 (model: Local LLM). For these, a model reads a bounded sample and sets the numeric score (documentation, ADR quality, naming, comment value, onboarding) — D25 sets the ADR-conformance fraction over sampled code, D22 judges API accuracy over a sample. These are sampled and advisory by design: they vary at the margins between runs and are never a deterministic measurement. Every other score in this report is tool-computed at confidence 1.0.
What it measures: How tangled the control flow is — methods with many branches are hard to test and change.
Method: Cyclomatic complexity per method (1 + decision points), computed exhaustively across production source; test projects separated by convention. Deterministic.
+ 33 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 1 TestLoader.TestLoader.ctor (cyclomatic 39) finding(s) in Cyclomatic Complexity — start with TestLoader.cs. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 FasterKV.InternalRMW (cyclomatic 37) finding(s) in Cyclomatic Complexity — start with InternalRMW.cs. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Program.ProfileStore (cyclomatic 33) finding(s) in Cyclomatic Complexity — start with Program.cs. — One of this dimension's main actionable groups (1 warning-level).
Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How hard the code is for a person to follow, beyond raw branching.
Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.
+ 86 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 2 Program.Main (cognitive 27) finding(s) in Cognitive Complexity — start with Program.cs (2). — One of this dimension's main actionable groups (2 warning-level).
Resolve the 1 FasterKV.ContinuePendingRead (cognitive 83) finding(s) in Cognitive Complexity — start with ContinuePending.cs. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 FasterKV.SplitChunk (cognitive 80) finding(s) in Cognitive Complexity — start with SplitIndex.cs. — One of this dimension's main actionable groups (1 warning-level).
Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes8.6 / 10Strong✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
Resolve the 14 TooManyMethods finding(s) in God Classes — start with ClientSession.cs (2), LockableContext.cs (2), FASTER.cs. — One of this dimension's main actionable groups (14 warning-level).
Resolve the 6 FileTooLong finding(s) in God Classes — start with FasterLog.cs, AllocatorBase.cs, ClientSession.cs. — One of this dimension's main actionable groups (6 warning-level).
Resolve the 1 ClassTooLong finding(s) in God Classes — start with FasterLogIterator.cs. — One of this dimension's main actionable groups (1 warning-level).
Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Copy-pasted code that should be shared instead.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.
+ 14 more group(s) — more in Appendix A; the complete list is findings.md.
✓ On the Gold path — maintain.
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D5 · Coupling9.8 / 10Exemplary✓ Tool-verified
What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.
Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.
Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.
What it measures: Whether a class's methods are focused on a single responsibility.
Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.
Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.
Detailed fixes: d6_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D9 · Test Distribution10.0 / 10Exemplary✓ 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.
622 test methods: 622 unit, 0 integration, 0 BDD, 0 e2e.
✓ On the Gold path — maintain.
Detailed fixes: d9_recommendation.md.
Do you agree with this assessment?
D10 · Test Quality10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the tests truly assert behaviour rather than just running the code.
Method: Per-test assertions, skips, and mock references analyzed via Roslyn; structured skip-reason tags (BUG:/ENV:) separate documented deferrals from debt. Deterministic.
1 skipped (1 with a documented reason), 0 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 322 tests.
What it measures: Whether dependencies are current, secure, and not bloated.
Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (saturating for vulnerabilities, capped-linear for deprecation/outdated) per KLoC. Exhaustive, deterministic.
What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.
Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.
What it measures: Whether the licenses of third-party packages are compatible with your policy.
Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.
What it measures: Files that change often and are also complex — the riskiest hotspots.
Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.
What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.
Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.
+ 2 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 25 EmptyCatchBlock finding(s) in Explicit Debt — start with FasterLog.cs (7), Program.cs (4), FasterLogRecoveryInfo.cs (2). — One of this dimension's main actionable groups (25 issue-level).
Resolve the 6 NoWarnInCsproj finding(s) in Explicit Debt — start with FASTER.test.csproj (3), FASTER.remote.test.csproj (3). — One of this dimension's main actionable groups (6 issue-level).
Resolve the 26 TodoComment finding(s) in Explicit Debt — start with FASTERBase.cs (6), ShardedStorageDevice.cs (4), FasterLog.cs (2). — One of this dimension's main actionable groups (26 warning-level).
Enforce Explicit Debt in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D18 · Solution Shape3.0 / 10Weak✓ Tool-verified
What it measures: Whether the solution is laid out in a sensible, conventional structure.
Method: Solution structure: project count, decomposition, shell-project detection, build success (confirmed failures cap the score); traced to actual .sln files and binaries. Deterministic.
35 projects, 1042 source files, 72288 hand-written lines of code (49379 production / 22909 test), 36 inter-project edges (build failed).
Build failed
Monorepo: only 1 of 2 solutions was scored
Thin analysable surface across projects
What to do
Resolve the 1 Build failed finding(s) in Solution Shape. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Monorepo finding(s) in Solution Shape. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Thin analysable surface across projects finding(s) in Solution Shape. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d18_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic doc sample (READMEs plus first 25 architecture docs), with two-pass stability filtering. Advisory, sampled.
The documentation is comprehensive for a high-performance concurrent key-value store and log project: the READMEs (C# and C++) give quick-start guidance with links to dedicated docs sites; architecture/design docs cover both FASTER KV and Log with detailed usage of each component; XML-doc coverage across 30 artifacts ranges from 1% (ClassRecoveryDurability, StoreLogCompaction) to 75% (FASTER.core net7.0), reflecting strong code coverage for the core library but gaps in the storage/benchmarking/doc suites; there is a dedicated roadmap and release notes document that is well written and up-to-date. The documentation is comprehensive for its target audience: FASTER remote-publish/subscribe (Pub/Sub), basics, tuning, record locking, and the C++ port. It includes two dedicated markdown architecture docs on remote-pubsub and remote-basics covering server creation, client usage, binary vs RESP protocol support, fixed-length and variable-length servers, and a detailed tuning guide with PageSizeBits, MemorySizeBits, and device-creation examples. The XML-doc coverage is low (0/75 to 0/105), so the in-code documentation is sparse but well written for its scope.
Improve Documentation Quality — currently 7.3/10. — The documentation is comprehensive for a high-performance concurrent key-value store and log project: the READMEs (C# and C++) give quick-start guidance with links to dedicated docs sites; architecture/design docs cover both FASTER KV and Log with detailed usage of each component; XML-doc coverage across 30 artifacts ranges from 1% (ClassRecoveryDurability, StoreLogCompaction) to 75% (FASTER.core net7.0), reflecting strong code coverage for the core library but gaps in the storage/benchmarking/doc suites; there is a dedicated roadmap and release notes document that is well written and up-to-date. The documentation is comprehensive for its target audience: FASTER remote-publish/subscribe (Pub/Sub), basics, tuning, record locking, and the C++ port. It includes two dedicated markdown architecture docs on remote-pubsub and remote-basics covering server creation, client usage, binary vs RESP protocol support, fixed-length and variable-length servers, and a detailed tuning guide with PageSizeBits, MemorySizeBits, and device-creation examples. The XML-doc coverage is low (0/75 to 0/105), so the in-code documentation is sparse but well written for its scope.
Detailed fixes: d19_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether architecture decisions are recorded well (context, decision, consequences).
Method: Per-ADR judgment by language model at low temperature with two-pass stability; confidence is share of ADRs evaluated; enforcement-field presence detected deterministically. Advisory.
What it measures: Whether names — types, methods, variables — are clear and consistent.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic random symbol sample (fixed size, not exhaustive), with disclosed confidence band. Advisory, sampled.
0 naming inconsistencies across 200 sampled symbols.
✓ On the Gold path — maintain.
Detailed fixes: d21_recommendation.md.
Do you agree with this assessment?
D24 · Comment Value / 10Exemplary◐ 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.
What it measures: How far you must trace to follow a call — low indirection and co-located slices read easier.
Method: Call indirection (interface hops, cross-namespace calls, slice-locality scaled) over a sampled set of method invocations, size-aware baseline. Sampled; confidence discounted by symbol-resolution gaps.
Coverage: Slice locality from the first namespace segments, SAMPLED (≤400 methods) — not exhaustive.
85 % of calls cross a namespace and 5 % go through an interface, but 100 % of collaborators are co-located — so a call's collaborators sit together and tracing stays easy. Baseline: medium — clean/modular boundaries expected.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: Git-history secret scan via gitleaks detect over full history in an isolated checkout; each match flagged High. Exhaustive; degrades cleanly when tool absent.
What it measures: Real static-analysis (SAST) findings — likely security bugs in the code, any language.
Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.
Coverage: semgrep pattern rules over all files — exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).
What it measures: Whether any dependencies have known published vulnerabilities (CVEs), direct or transitive.
Method: NuGet CVE scan via dotnet list package --vulnerable including transitive; severity tally (Critical/High/Medium/Low) to 0-10 tight normalizer. Exhaustive, deterministic; degrades when absent.
What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.
Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.
182 of 182 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is cs/src/core/FasterLog/FasterLog.cs.
Largest orphaned file · ×3cs/src/core/FasterLog/FasterLog.cs
Concentrated knowledge decay
What to do
Resolve the 3 Largest orphaned file finding(s) in Knowledge Freshness — start with FasterLog.cs, AllocatorBase.cs, ClientSession.cs. — One of this dimension's main actionable groups (3 recommendation-level).
Resolve the 1 Concentrated knowledge decay finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d34_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.
Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.
Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling; coupling through a build step, config, or non-source file isn't seen.
What it measures: Whether the build pipeline provides supply-chain integrity — generated provenance/attestation, signed artifacts (cosign/sigstore), an SBOM, and pinned build actions. Presence of the configuration, not a runtime guarantee.
Method: Supply-chain provenance/signing read deterministically from CI/build config (.github/workflows, .gitlab-ci.yml, azure-pipelines, Jenkinsfile, .circleci) + the release surface: four signals — generated provenance/attestation (SLSA/in-toto/actions-attest), artifact signing (cosign/sigstore/gitsign), an SBOM (syft/sbom-action/*.spdx.json/*.cdx.json), and SHA-pinned build actions — scored 10·present/denom. NotApplicable without a build pipeline. Detects configuration presence, not runtime enforcement.
Resolve the 1 No build provenance finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 recommendation-level).
Resolve the 1 No artifact signing finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 recommendation-level).
Resolve the 1 No SBOM finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d36_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the repository publishes a coordinated-vulnerability-disclosure policy (SECURITY.md or security.txt) with a reporting contact, so finders know how to report a vulnerability. Presence of a policy file with a contact, not whether the policy is adequate or honoured.
Method: Vulnerability-disclosure policy read deterministically from the repo: a SECURITY.md (root/.github/docs) or .well-known/security.txt / security.txt, regex-checked for a reporting contact (email / URL / mailto). Present + contact → 10; present without a contact → 4; NotApplicable when no policy file exists (it may live off-repo). Detects the policy file's presence + contact, not its adequacy.
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.
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 — check that business logic isn't leaking into the application/infrastructure layers (a thin domain is the anemic-domain smell).
Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).
Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.
Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.
Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.
Other · Architecture — Whether the codebase has a recognisable, scale-appropriate structure (a named architectural style, or modular enough for its size) rather than being an ad-hoc ball of mud.
Method: Roslyn plus csproj analysis: architecture style detection (DDD, clean, vertical-slice, CQRS) and structure fitness for repo size. Deterministic.
Other · Architecture — Whether interfaces stay focused rather than fat — the Interface-Segregation principle (SOLID 'I').
Method: Roslyn scan: public interface member counts; fat-interface threshold (over 15 members) flagged per type. Deterministic, type-level.
`IFasterContext<Key, Value, Input, Output, Context>` declares 67 members. 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. — IFasterContext.cs:32
`ILockableContext<TKey>` declares 20 members. 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. — ILockableContext.cs:13
`IDevice` declares 22 members. 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. — IDevice.cs:19
`IFasterKV<Key, Value>` declares 24 members. 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. — IFasterKV.cs:13
`IFunctions<Key, Value, Input, Output, Context>` declares 23 members. 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. — IFunctions.cs:14
`ICheckpointManager` declares 17 members. 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. — ICheckpointManager.cs:31
What to do
Split fat interfaces into focused role-interfaces so clients depend only on what they use.
Do you agree with this assessment?
AX8 · Test isolation10.0 / 10Exemplary✓ Tool-verified
Other · Architecture — Whether production projects stay free of references to test projects — tests may depend on production, never the reverse.
Method: Csproj graph: each production project checked for references to test projects (identified by test-framework presence, not name). Zero violations is clean. Deterministic.
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.
A shipped member still throws NotImplementedException — generated scaffolding that was never completed. Implement it or remove the dead surface. (×10) — ConcurrencyTest.cs:160, LocalStorageDevice.cs:546, LocalStorageDevice.cs:548, …
What to do
Finish or delete NotImplementedException stubs and replace placeholder literals before shipping.
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.
`Compact` is a shipped member whose whole body throws NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface. — Checkpoint.cs:93
A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers). (×9) — Program.cs:77, Program.cs:92, Program.cs:111, …
`GetKeyAddressInfo`'s body only throws NotSupportedException — sometimes a deliberate contract, often an unfinished stub. Confirm it's intentional. — VarLenBlittableAllocator.cs:276
`GetValueAddressInfo`'s body only throws NotSupportedException — sometimes a deliberate contract, often an unfinished stub. Confirm it's intentional. — VarLenBlittableAllocator.cs:281
What to do
Finish or delete the unfinished stubs (NotImplementedException / empty / constant-returning bodies) — they are dead surface that looks live.
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.
Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
What to do
Add a build/run (quick start) section to the root README — the first thing a newcomer needs.
Add a 'Testing' section to the root README — how to run the test suite.
Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
Add a README to the 26 of 28 project(s) that lack one — worth up to 1.9 pts.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no `NNNN-title.md` documents and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
No C4/PlantUML/Mermaid diagram or architecture.md — the high-level shape isn't documented.
What to do
Record significant decisions one document per decision — dated, stating the context, the decision and its consequences — and keep them together wherever your design docs already live (a conventional `docs/adr/` tree with `NNNN-title.md` names is the most discoverable form).
Add a C4 context/container diagram (Structurizr, PlantUML or Mermaid) or an architecture.md overview.
Maturity · Maturity — Whether the repo is organised deliberately — src/test separation and consistent project naming.
Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.
Only 12/35 projects share a common root namespace — the code's module identity is inconsistent.
What to do
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.
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.
Only 3/14 service-like projects use logging (pure contract/DTO projects are excluded — they have nothing to log). Of those 14, 12 ship a process this repository operates; the rest are libraries their consumer hosts, where the logging decision belongs to the host.
What to do
Extend structured logging across the projects you operate, and give the library ones a diagnostics seam instead — an `EventSource`/`ActivitySource` the host can subscribe to, or an optional logger on your options object — rather than taking a logging dependency on your consumers' behalf.
Consider OpenTelemetry tracing/metrics and a health-check endpoint for operability.
Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).
Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.
No static application security testing detected. For this repository's stack, add CodeQL's csharp pack (it analyses VB.NET too), or a security analyzer package (or `semgrep --config=auto`, which runs on any language) as a CI step.
What to do
Add a SAST step to CI running what this repository's stack ships: CodeQL's csharp pack (it analyses VB.NET too), or a security analyzer package — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.
Enable Dependabot/Renovate or a dependency-review gate.
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
Readiness · Readiness — Whether releases are traceable — a maintained changelog and explicit version stamping.
Method: Filesystem scan: changelog file presence and version tags in csproj or git tags. Exhaustive, deterministic.
No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
What to do
Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.
Readiness · Performance — Whether the library protects its performance with benchmarks — a benchmark suite, allocation/memory measurement, and (ideally) a CI gate. Presence is credited as a bonus, never a deduction.
Method: Repo + source scan: BenchmarkDotNet referenced (csproj/source), [Benchmark]/[MemoryDiagnoser] attribute counts, and a benchmark step in CI — scored as a bonus ladder (absence is neutral, never a deduction). Deterministic, presence detection.
A BenchmarkDotNet suite exists but no [MemoryDiagnoser] — allocations (the main way a library pressures its host's GC) aren't being measured.
What to do
Add [MemoryDiagnoser] to the benchmarks so allocation regressions are visible, not just time.
Readiness · Performance — Whether the code is written to minimise allocations so it doesn't pressure its host's memory manager — buffer/slice views over copies, object pooling, stack or value-type allocation, and buffer writers. Reward-only: credited where present, never penalised where a simpler style is fine.
Readiness · Performance — Whether asynchronous code keeps its host responsive — a library awaits with ConfigureAwait(false) (so it never captures and stalls the host's context) and avoids sync-over-async blocking (.Wait()/.GetAwaiter().GetResult()) that wastes threads and risks deadlock.
Method: Production-source scan: sync-over-async blocking (.Wait()/.GetAwaiter().GetResult()) counted everywhere, and — for a library with ≥5 awaits — the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.
57 blocking call(s) on async work (.Wait()/.GetAwaiter().GetResult()) — these waste a thread and can deadlock in a consumer with a synchronization context.
What to do
Make the call chain async end-to-end and await it — never block on a Task with .Wait()/.GetAwaiter().GetResult() in library code.
Do you agree with this assessment?
R1 · Type Safety0.0 / 10Critical✓ Tool-verified
React / JS · Code Health — How much of the frontend is typed TypeScript vs untyped JavaScript.
Method: Frontend file inventory: the share of typed TypeScript vs untyped JavaScript across the source tree. Deterministic, exhaustive over frontend files.
0 typed · 7 plain JS — the untyped files are cs/remote/src/FASTER.client/JavascriptClient/BatchHeader.js, cs/remote/src/FASTER.client/JavascriptClient/CallbackFunctionsBase.js, cs/remote/src/FASTER.client/JavascriptClient/ClientNetworkSession.js, cs/remote/src/FASTER.client/JavascriptClient/ClientSession.js, cs/remote/src/FASTER.client/JavascriptClient/ParameterSerializer.js, cs/remote/src/FASTER.client/JavascriptClient/Queue.js (+1 more).
What to do
Adopt TypeScript for the frontend: add a typecheck step to the build, then either type-check the existing JavaScript in place (`checkJs`/JSDoc types) or convert the highest-traffic modules first — no file is typed today, so this is an adoption, not a clean-up.
React / JS · Code Health — Copy-pasted token-identical blocks across the frontend (the D4 clone algorithm over JS/TS tokens, D-386).
Method: Copy-pasted token-identical blocks across the frontend (the D4 clone algorithm run over JS/TS tokens). Deterministic.
cs/remote/src/FASTER.client/JavascriptClient/ClientSession.js:200 · cs/remote/src/FASTER.client/JavascriptClient/ClientSession.js:215 · cs/remote/src/FASTER.client/JavascriptClient/ClientSession.js:247 · cs/remote/src/FASTER.client/JavascriptClient/ClientSession.js:262 — 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. — ClientSession.js:200
cs/remote/src/FASTER.client/JavascriptClient/ClientSession.js:70 · cs/remote/src/FASTER.client/JavascriptClient/ClientSession.js:88 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — ClientSession.js:70
cs/remote/src/FASTER.client/JavascriptClient/ClientSession.js:132 · cs/remote/src/FASTER.client/JavascriptClient/ClientSession.js:142 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — ClientSession.js:132
cs/remote/src/FASTER.client/JavascriptClient/ClientSession.js:187 · cs/remote/src/FASTER.client/JavascriptClient/ClientSession.js: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. — ClientSession.js:187
cs/remote/src/FASTER.client/JavascriptClient/ClientSession.js:62 · cs/remote/src/FASTER.client/JavascriptClient/ClientSession.js:80 · cs/remote/src/FASTER.client/JavascriptClient/ClientSession.js:98 — all 3 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — ClientSession.js:62
What to do
Extract the duplicated blocks into shared functions/components.
React / JS · Code Health — Per-function cyclomatic/cognitive complexity from the token-level function scanner (D-386) — real branching, not a regex heuristic.
Method: Per-function cyclomatic/cognitive complexity from a token-level function scanner (real branching, not a regex heuristic), computed over every frontend function. Deterministic.
Branch-heavy code is where defects cluster — extract decisions into smaller functions. — ClientSession.js:21
Do you agree with this assessment?
R3 · Large Files10.0 / 10Exemplary✓ Tool-verified
React / JS · Code Health — How many source files exceed the large-file threshold.
Method: Components/modules exceeding the large-file threshold, counted exhaustively across the frontend source tree. Deterministic.
Do you agree with this assessment?
R4 · Test Coverage0.0 / 10Critical✓ Tool-verified
React / JS · Readiness — Static test reachability (D-386): the share of production files reachable from any test via the import graph — measured without running anything.
Method: Static test reachability: the share of production files reachable from any test via the import graph — measured without running anything. Deterministic.
0% of 7 production file(s) reachable from 0 test file(s) via the import graph
What to do
Add tests that import the unreached modules (directly or through their public entry).
React / JS · Architecture — Import cycles in the module graph (D-386) — files that can only be understood and changed together.
Method: Import cycles in the module graph, detected exhaustively over JS/TS imports (the same cycle detection as the .NET coupling dimension). Deterministic.
Do you agree with this assessment?
X1 · Async correctness4.4 / 10Weak✓ Tool-verified
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.
Blocking on a Task with `.Wait()`/`.GetAwaiter().GetResult()` can deadlock (and wastes a thread). Prefer awaiting it: make the caller `async` and `await` instead. Where a synchronous entry point must stay — a public sync API you cannot break, or a process entry point that must not return until the work finishes — the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process. (×24) — FasterSpanByteYcsbBenchmark.cs:416, FasterYcsbBenchmark.cs:380, TestLoader.cs:388, …
Blocking on a Task with `.Wait()`/`.GetAwaiter().GetResult()` wastes a thread and, if the task needs a context this one is holding, deadlocks. `Dispose()` returns void by contract, so it cannot simply `await`: signal the work to stop first (cancel its token, set its stop flag) so the wait is short, give the wait a TIMEOUT so a hung task cannot hang shutdown, and — where callers can use it — add an awaitable teardown (`DisposeAsync`/`StopAsync`) beside the synchronous one and let `Dispose()` remain the bounded fallback. — AzureStorageDevice.cs:311
Other · Code Health — Whether async methods accept a CancellationToken so work can be cancelled (adoption curve).
Method: Roslyn scan: every async method (excluding framework-fixed overrides/Blazor handlers) checked for CancellationToken parameter presence. Deterministic, adoption percentage.
Only 71/108 async methods accept a CancellationToken, so in-flight work can't be stopped early when the caller gives up — whatever ends it in your host (shutdown signal, timeout, abandoned request, user cancel). Thread a token through the call chain and honour it at each await and loop; where a method genuinely cannot be interrupted, omitting it is a deliberate choice — judge against your hosting model.
No CancellationToken parameter — this work can't be stopped early once started. (×18) — SessionWrapper.cs:72, SessionWrapper.cs:110, SessionWrapper.cs:160, …
No CancellationToken parameter — the body observes an ambient token instead (a field or a context object), so the work does stop on cancellation, but a caller cannot cancel this call independently of the owner that created that token. (×7) — AzureStorageDevice.cs:156, AzureStorageDevice.cs:513, AzureStorageDevice.cs:565, …
What to do
Thread a CancellationToken through async methods so work stops promptly on cancellation.
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. On a teardown path letting it propagate is not an option (throwing out of `Dispose()` masks the failure already in flight and abandons the rest of the cleanup), so make the swallow deliberate instead: narrow the catch to the exception this release can actually raise, and record it through whatever this codebase already uses to report problems — or, if it truly cannot matter, say why in a comment on the catch. (×3) — ScanIteratorBase.cs:251, FasterLogSettings.cs:174, FasterKVSettings.cs:191
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. (×22) — WorkQueueFIFO.cs:89, WorkQueueLIFO.cs:89, ManagedLocalStorageDevice.cs:449, …
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. Deterministic.
Other · Code Health — Whether nullable reference types are enabled and not undermined by heavy `!` suppression.
Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.
2/24 NRT-eligible project(s) enable <Nullable>enable</Nullable> (projects targeting a pre-C#-8 framework are excluded — NRTs aren't available there). NRTs catch a whole class of null-deref bugs at compile time.
~1.4 `!` suppressions per 1k syntax nodes — 5 suppression(s) across the 3516 syntax node(s) in code where nullable warnings are ENABLED, which is the only code a `!` can suppress anything in (a `!` under `#nullable disable` is inert and is not counted, and its file's nodes are not in the denominator). Each one tells the compiler to trust you about null, suppressing the very safety NRTs provide.
What to do
Enable <Nullable>enable</Nullable> across all projects and resolve warnings rather than suppressing with `!`.
Do you agree with this assessment?
Reference — by lens
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Not included — 51 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
AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
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.
D11 Test Reliability — Test reliability not measured — test suite did not build
D16 Bus Factor — dormant codebase — no living knowledge left to concentrate
D22 Internal API Consistency — No exposed public API
D23 Boundary Type-Coupling — Bounded contexts not declared
D25 ADR Conformance — no ADRs to check
D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Terraform, Kubernetes/Helm, CloudFormation); nothing to scan.
D32 Data Compliance (PII/GDPR) — No PII/GDPR-handling patterns detected (p/gdpr ruleset) — no data-compliance surface to assess.
D33 JS/npm Dependency Vulnerabilities — No JS/npm manifest or lockfile found outside build output (package.json, package-lock.json, yarn.lock, pnpm-lock.yaml, bun.lockb); no JS dependencies to scan.
D38 OSV Dependency Vulnerabilities — No supported non-.NET dependency lockfile found outside build output (npm package-lock/yarn/pnpm/bun, Go go.mod, Rust Cargo.lock, Maven pom.xml, Gradle lockfiles, Python requirements.txt/poetry.lock/Pipfile.lock/pdm.lock, PHP composer.lock, Ruby Gemfile.lock, Elixir mix.lock, Dart pubspec.lock, Swift Package.resolved); nothing for OSV to scan. A NuGet-only repo stays NotApplicable — .NET CVEs are D30's domain.
D39 IL Efficiency — The target did not build, so no IL was available to measure.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D7 Architectural Integrity — no checkable ADRs and no dependency cycles — architectural integrity not assessed
D8 Code Coverage — Coverage not measured — analyzer environment
DM1 Domain Modelling — not scored — this repository shows none of the 3 signals this check looks for
ED1 Event-Driven — not scored — this repository shows none of the 3 signals this check looks for
ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this check looks for
P12 CI test-gate honesty — Reported, not scored — this card publishes what the CI gate does with the test inventory rather than grading it. The findings above are its output.
P4 Deployment & Rollback — not evidenced — no deploy/rollback/approval signal in the repo; absence of evidence is not evidence of a manual release
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
P7 Outbound HTTP resilience — not applicable — this isn't a service/API/worker
P8 Schema migrations — no EF Core usage detected
P9 Domain vs controller coverage — no coverage report found on disk — produce a coverage report in a standard format (Cobertura — `dotnet test --collect:"XPlat Code Coverage"` with a `coverlet.collector` PackageReference) into the repo working tree before the scan — a CI step is the usual place, since the artefact is commonly gitignored, or wire coverage collection into CI, to enable this cross-layer check
R11 Import Boundaries — No recognizable feature-sliced/layered src layout — boundary rules not applicable.
R5 Dependency Freshness — no package-lock.json — dependency freshness not measured (would require an npm lockfile); JS/npm CVEs are scored in D33 (JS/npm Dependency Vulnerabilities)
R6 Tooling — no package.json in the repository — test/lint/typecheck wiring is read from package.json scripts (corroborated against CI), so this project's own toolchain isn't measured here
R7 Dead Code — Not measured — no application, tooling or test entry point was detected, so no file can be shown to be reachable or unreachable. Declare an entry (package.json main/module/exports, src/index.*, or an index.html script) to enable reachability.
R8 Dependency Hygiene — Not measured — no package.json declares any dependency, so there is nothing to check imports against (imports may resolve through a host runtime rather than node).
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.
SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X6 Hand-rolled structured-format parsing — Reported, not scored — this card publishes what it found rather than grading it. Its content is the findings and the key metric above.
X7 Silent fallback defaults — Reported, not scored — this card publishes what it found rather than grading it. Its content is the findings and the key metric above.
Appendix A — Findings (grouped)
The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.
EmptyCatchBlock cs/performance/BenchmarkDotNet/InliningTests.cs:63— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock cs/performance/BenchmarkDotNet/SyncVsAsyncTests.cs:79— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock cs/playground/MemoryDb/Program.cs:35— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock cs/samples/CacheStore/Program.cs:96— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock cs/samples/FasterLogPubSub/Program.cs:68— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock cs/samples/ReadAddress/VersionedReadApp.cs:73— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock cs/samples/StoreCustomTypes/Program.cs:94— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock cs/src/core/Allocator/ScanIteratorBase.cs:251— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock cs/src/core/Allocator/WorkQueueFIFO.cs:89— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock cs/src/core/Allocator/WorkQueueLIFO.cs:89— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock cs/src/core/Device/ManagedLocalStorageDevice.cs:449— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock cs/src/core/FasterLog/FasterLog.cs:219— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock cs/src/core/FasterLog/FasterLog.cs:2285— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock cs/src/core/FasterLog/FasterLog.cs:2300— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock cs/src/core/FasterLog/FasterLog.cs:2368— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock cs/src/core/FasterLog/FasterLog.cs:2390— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock cs/src/core/FasterLog/FasterLog.cs:2441— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock cs/src/core/FasterLog/FasterLog.cs:2456— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock cs/src/core/FasterLog/FasterLogRecoveryInfo.cs:101— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock cs/src/core/FasterLog/FasterLogRecoveryInfo.cs:122— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock cs/src/core/FasterLog/FasterLogSettings.cs:174— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock cs/src/core/Index/CheckpointManagement/LocalStorageNamedDeviceFactory.cs:89— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock cs/src/core/Index/CheckpointManagement/LocalStorageNamedDeviceFactory.cs:105— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock cs/src/core/Index/Common/FasterKVSettings.cs:191— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock cs/src/core/Index/FASTER/FASTER.cs:251— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
NoWarnInCsproj cs/test/FASTER.test.csproj:41— 1701 — this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or — if some occurrences really are legitimate — narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project.
NoWarnInCsproj cs/remote/test/FASTER.remote.test/FASTER.remote.test.csproj:41— 1701 — this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or — if some occurrences really are legitimate — narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project.
NoWarnInCsproj cs/test/FASTER.test.csproj:41— 1702 — this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or — if some occurrences really are legitimate — narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project.
NoWarnInCsproj cs/remote/test/FASTER.remote.test/FASTER.remote.test.csproj:41— 1702 — this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or — if some occurrences really are legitimate — narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project.
NoWarnInCsproj cs/test/FASTER.test.csproj:41— 1591 — this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or — if some occurrences really are legitimate — narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project.
NoWarnInCsproj cs/remote/test/FASTER.remote.test/FASTER.remote.test.csproj:41— 1591 — this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or — if some occurrences really are legitimate — narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project.
High CVE: System.Net.Http 4.3.0 — System.Net.Http 4.3.0 (transitive) has a High advisory. https://github.com/advisories/[GHSA redacted]
High CVE: System.Text.RegularExpressions 4.3.0 — System.Text.RegularExpressions 4.3.0 (transitive) has a High advisory. https://github.com/advisories/[GHSA redacted]
TodoComment cs/samples/EpvsSample/ListExample.cs:283— // TODO(Tianyu): How to ensure this is correct in the face of concurrent pushes? — 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 cs/src/core/Device/ShardedStorageDevice.cs:226— // TODO: Check if it is incorrect to ignore o — 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 cs/src/core/Device/ShardedStorageDevice.cs:239— // TODO: Check if overlapped wrapper is handled correctly — 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 cs/src/core/Device/ShardedStorageDevice.cs:277— // TODO: this is incorrect if returned "bytes" written is allowed to be less than requested like POSIX. — 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 cs/src/core/Device/ShardedStorageDevice.cs:290— // TODO: Check handling of overlapped wrapper — 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 cs/src/core/FasterLog/FasterLog.cs:2079— // TODO: can change to write this in separate thread for fast commit — 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 cs/src/core/FasterLog/FasterLog.cs:2171— // TODO: Can invoke earlier in the case of fast commit — 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 cs/src/core/Index/Common/RecordInfo.cs:277— // TODO: Interlocked.And is not supported in netstandard2.1 — 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 cs/src/core/Index/Common/RecordInfo.cs:336— // TODO: Interlocked.And is not supported in netstandard2.1 — 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 cs/src/core/Index/FASTER/FASTERBase.cs:52— // TODO verify these — 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 cs/src/core/Index/FASTER/FASTERBase.cs:66— // TODO unused — 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 cs/src/core/Index/FASTER/FASTERBase.cs:69— // TODO verify this number — 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 cs/src/core/Index/FASTER/FASTERBase.cs:519— // TODO local var not used; use or change to byval param — 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 cs/src/core/Index/FASTER/FASTERBase.cs:520— // TODO local var not used; use or change to byval param — 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 cs/src/core/Index/FASTER/FASTERBase.cs:526— // TODO: Why not return orig_bucket and orig_slot if it's not Tentative? — 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 cs/src/core/Index/FASTER/Implementation/BlockAllocate.cs:62— // This allocation is below the necessary address so abandon it and repeat the loop. TODO potential reuse — 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 cs/src/core/Index/FASTER/Implementation/InternalRMW.cs:437— // TODO: Another area where we can stash the record for reuse (not retry; this is canceling of the current operation). — 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 cs/src/core/Index/FASTER/Implementation/InternalRMW.cs:459— // TODO: Another area where we can stash the record for reuse (not retry; this may have been false because the record was too small). — 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 cs/src/core/Index/FASTER/Implementation/InternalUpsert.cs:337— // TODO save allocation for reuse (not retry, because these aren't retry status codes); check other InternalXxx as well — 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 cs/src/core/Index/FASTER/Implementation/ReadCache.cs:298— // TODO: We currently don't save readcache allocations for retry, but we could — 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 cs/src/core/Index/FASTER/Implementation/TryCopyToTail.cs:56— // No SaveAlloc here as we won't retry, but TODO this record could be reused later. — 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 cs/src/devices/AzureStorageDevice/AzureStorageDevice.cs:68— // set this at 512 GB for now TODO consider implications — 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 cs/stress/SpanByteValueFunctions.cs:36— // TODO: we're not using output yet for Upsert, so this would leak: src.CopyTo(ref output, memoryPool); — 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 cs/test/ExpirationTests.cs:87— // - (TODO with revivication) NewRecord (input len > record len): Return false from IPU, true from NCU, set in CU — 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 cs/test/ExpirationTests.cs:143— // TODO - NYI: An Update or RMW operation encounters a tombstoned record of >= size of the new value, so the record is updated. — 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.
Dead code: VerifyValue cs/test/ExpirationTests.cs:151— Method VerifyValue — no references found in solution.
Dead code: RecoverAndReadTest cs/test/RecoveryTests.cs:457— Method RecoverAndReadTest — no references found in solution.
Dead code: RecoverAndReadTest cs/test/RecoveryTests.cs:475— Method RecoverAndReadTest — no references found in solution.
Dead code: RecoverAndReadTest cs/test/RecoveryTests.cs:504— Method RecoverAndReadTest — no references found in solution.
Dead code: PMMFlushStatus cs/src/core/Allocator/AllocatorBase.cs:16— NamedType PMMFlushStatus — no references found in solution.
Dead code: PMMCloseStatus cs/src/core/Allocator/AllocatorBase.cs:18— NamedType PMMCloseStatus — no references found in solution.
Dead code: VerifyPage cs/src/core/Allocator/AllocatorBase.cs:652— Method VerifyPage — no references found in solution.
Dead code: DebugPrintAddresses cs/src/core/Allocator/AllocatorBase.cs:1699— Method DebugPrintAddresses — no references found in solution.
Dead code: PrettyPrint cs/src/core/Allocator/AllocatorBase.cs:2448— Method PrettyPrint — no references found in solution.
Dead code: AtomicOwner cs/src/core/Allocator/AtomicOwner.cs:9— NamedType AtomicOwner — no references found in solution.
Dead code: PopulatePageFrame cs/src/core/Allocator/GenericAllocator.cs:1080— Method PopulatePageFrame — no references found in solution.
Dead code: KeySize cs/src/core/Allocator/VarLenBlittableAllocator.cs:155— Method KeySize — no references found in solution.
Dead code: FastThreadLocal cs/src/core/Epochs/FastThreadLocal.cs:13— NamedType FastThreadLocal — no references found in solution.
Dead code: GetChecksum cs/src/core/FasterLog/FasterLog.cs:2835— Method GetChecksum — no references found in solution.
Dead code: DetachKey cs/src/core/Index/Common/Contexts.cs:189— Method DetachKey — no references found in solution.
Dead code: DetachInput cs/src/core/Index/Common/Contexts.cs:197— Method DetachInput — no references found in solution.
Dead code: GetSize cs/src/core/Index/FASTER/Implementation/Locking/OverflowBucketLockTable.cs:30— Method GetSize — no references found in solution.
Dead code: DirectoryConfiguration cs/src/core/Index/Recovery/DirectoryConfiguration.cs:9— NamedType DirectoryConfiguration — no references found in solution.
Dead code: FastForwardToCurrentCycle cs/src/core/Index/Synchronization/FasterStateMachine.cs:151— Method FastForwardToCurrentCycle — no references found in solution.
Dead code: FoldOverTask cs/src/core/Index/Synchronization/VersionChangeStateMachine.cs:87— NamedType FoldOverTask — no references found in solution.
Dead code: GetFileInformationByHandleEx cs/src/core/Utilities/Native32.cs:175— Method GetFileInformationByHandleEx — no references found in solution.
Dead code: GetCurrentThreadId cs/src/core/Utilities/Native32.cs:186— Method GetCurrentThreadId — no references found in solution.
Dead code: GetCurrentProcessorNumber cs/src/core/Utilities/Native32.cs:188— Method GetCurrentProcessorNumber — no references found in solution.
TooManyMethods: FasterKV cs/src/core/Index/FASTER/FASTER.cs:0— TooManyMethods — 3400 significant lines (blank, comment-only and punctuation-only lines excluded), 206 methods, declared across 34 files: FASTER/FASTER.cs (34), Recovery/Recovery.cs (33), Implementation/ReadCache.cs (11), ClientSession/FASTERClientSession.cs (10), +30 more file(s). 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: ClientSession cs/src/core/ClientSession/ClientSession.cs:0— TooManyMethods — 555 significant lines (blank, comment-only and punctuation-only lines excluded), 111 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: AllocatorBase cs/src/core/Allocator/AllocatorBase.cs:0— TooManyMethods — 1047 significant lines (blank, comment-only and punctuation-only lines excluded), 108 methods, declared across 2 files: Allocator/AllocatorBase.cs (104), Recovery/Recovery.cs (4). 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: FasterLog cs/src/core/FasterLog/FasterLog.cs:0— TooManyMethods — 1355 significant lines (blank, comment-only and punctuation-only lines excluded), 104 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: LockableContext cs/src/core/ClientSession/LockableContext.cs:0— TooManyMethods — 473 significant lines (blank, comment-only and punctuation-only lines excluded), 100 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: LockableUnsafeContext cs/src/core/ClientSession/LockableUnsafeContext.cs:0— TooManyMethods — 336 significant lines (blank, comment-only and punctuation-only lines excluded), 98 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: UnsafeContext cs/src/core/ClientSession/UnsafeContext.cs:0— TooManyMethods — 279 significant lines (blank, comment-only and punctuation-only lines excluded), 77 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: GenericAllocator cs/src/core/Allocator/GenericAllocator.cs:0— TooManyMethods — 544 significant lines (blank, comment-only and punctuation-only lines excluded), 55 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: VariableLengthBlittableAllocator cs/src/core/Allocator/VarLenBlittableAllocator.cs:0— TooManyMethods — 243 significant lines (blank, comment-only and punctuation-only lines excluded), 51 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: InternalFasterSession cs/src/core/ClientSession/ClientSession.cs:0— TooManyMethods — 232 significant lines (blank, comment-only and punctuation-only lines excluded), 49 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: BlittableAllocator cs/src/core/Allocator/BlittableAllocator.cs:0— TooManyMethods — 183 significant lines (blank, comment-only and punctuation-only lines excluded), 41 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Native32 cs/src/core/Utilities/Native32.cs:0— TooManyMethods — 214 significant lines (blank, comment-only and punctuation-only lines excluded), 35 methods. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them.
TooManyMethods: InternalFasterSession cs/src/core/ClientSession/LockableContext.cs:0— TooManyMethods — 121 significant lines (blank, comment-only and punctuation-only lines excluded), 34 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: DeviceLogCommitCheckpointManager cs/src/core/Index/CheckpointManagement/DeviceLogCommitCheckpointManager.cs:0— TooManyMethods — 222 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
BarePragmaDisable cs/performance/BenchmarkDotNet/InliningTests.cs:11— #pragma warning disable 0649 // Field 'field' is never assigned to, and will always have its default value 'value'; happens due to [Params(..)] — the disable has no matching restore, so it does not end with the construct that needed it: it runs to the end of the file and silences the rule for everything written below, including code added years later. Close it with the matching restore directive immediately after the construct it covers, or fix the cause and drop the directive entirely.
BarePragmaDisable cs/performance/BenchmarkDotNet/LightEpochTests.cs:8— #pragma warning disable 0649 // Field 'field' is never assigned to, and will always have its default value 'value'; happens due to [Params(..)] — the disable has no matching restore, so it does not end with the construct that needed it: it runs to the end of the file and silences the rule for everything written below, including code added years later. Close it with the matching restore directive immediately after the construct it covers, or fix the cause and drop the directive entirely.
BarePragmaDisable cs/performance/BenchmarkDotNet/SyncVsAsyncTests.cs:11— #pragma warning disable 0649 // Field 'field' is never assigned to, and will always have its default value 'value'; happens due to [Params(..)] — the disable has no matching restore, so it does not end with the construct that needed it: it runs to the end of the file and silences the rule for everything written below, including code added years later. Close it with the matching restore directive immediately after the construct it covers, or fix the cause and drop the directive entirely.
BarePragmaDisable cs/samples/ResizableCacheStore/Program.cs:11— #pragma warning disable CS0162 // Unreachable code detected — the disable has no matching restore, so it does not end with the construct that needed it: it runs to the end of the file and silences the rule for everything written below, including code added years later. Close it with the matching restore directive immediately after the construct it covers, or fix the cause and drop the directive entirely.
BarePragmaDisable cs/samples/StoreVarLenTypes/AsciiSumSample.cs:8— #pragma warning disable CS0162 // Unreachable code detected — the disable has no matching restore, so it does not end with the construct that needed it: it runs to the end of the file and silences the rule for everything written below, including code added years later. Close it with the matching restore directive immediately after the construct it covers, or fix the cause and drop the directive entirely.
BarePragmaDisable cs/src/core/Allocator/BlittableAllocator.cs:11— #pragma warning disable CS1591 // Missing XML comment for publicly visible type or member — the disable has no matching restore, so it does not end with the construct that needed it: it runs to the end of the file and silences the rule for everything written below, including code added years later. Close it with the matching restore directive immediately after the construct it covers, or fix the cause and drop the directive entirely.
BarePragmaDisable cs/src/core/Allocator/GenericAllocator.cs:13— #pragma warning disable CS1591 // Missing XML comment for publicly visible type or member — the disable has no matching restore, so it does not end with the construct that needed it: it runs to the end of the file and silences the rule for everything written below, including code added years later. Close it with the matching restore directive immediately after the construct it covers, or fix the cause and drop the directive entirely.
BarePragmaDisable cs/src/core/Allocator/VarLenBlittableAllocator.cs:13— #pragma warning disable CS1591 // Missing XML comment for publicly visible type or member — the disable has no matching restore, so it does not end with the construct that needed it: it runs to the end of the file and silences the rule for everything written below, including code added years later. Close it with the matching restore directive immediately after the construct it covers, or fix the cause and drop the directive entirely.
BarePragmaDisable cs/src/core/Index/Common/RecordInfo.cs:4— #pragma warning disable CS1591 // Missing XML comment for publicly visible type or member — the disable has no matching restore, so it does not end with the construct that needed it: it runs to the end of the file and silences the rule for everything written below, including code added years later. Close it with the matching restore directive immediately after the construct it covers, or fix the cause and drop the directive entirely.
BarePragmaDisable cs/src/core/Allocator/MallocFixedPageSize.cs:246— #pragma warning disable 420 — the disable has no matching restore, so it does not end with the construct that needed it: it runs to the end of the file and silences the rule for everything written below, including code added years later. Close it with the matching restore directive immediately after the construct it covers, or fix the cause and drop the directive entirely.
FileTooLong: FasterLog/FasterLog.cs cs/src/core/FasterLog/FasterLog.cs:0— FileTooLong — 1367 significant lines (blank, comment-only and punctuation-only lines excluded). To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: Allocator/AllocatorBase.cs cs/src/core/Allocator/AllocatorBase.cs:0— FileTooLong — 1020 significant lines (blank, comment-only and punctuation-only lines excluded). To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: ClientSession/ClientSession.cs cs/src/core/ClientSession/ClientSession.cs:0— FileTooLong — 795 significant lines (blank, comment-only and punctuation-only lines excluded). To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: Recovery/Recovery.cs cs/src/core/Index/Recovery/Recovery.cs:0— FileTooLong — 608 significant lines (blank, comment-only and punctuation-only lines excluded). To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: ClientSession/LockableContext.cs cs/src/core/ClientSession/LockableContext.cs:0— FileTooLong — 600 significant lines (blank, comment-only and punctuation-only lines excluded). To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: Allocator/GenericAllocator.cs cs/src/core/Allocator/GenericAllocator.cs:0— FileTooLong — 558 significant lines (blank, comment-only and punctuation-only lines excluded). To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
Duplicated block (15 lines × 2) cs/src/core/Allocator/BlittableAllocator.cs:151— cs/src/core/Allocator/BlittableAllocator.cs:151-165 | cs/src/core/Allocator/VarLenBlittableAllocator.cs:259-273 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `cs/src/core/Allocator/BlittableAllocator.cs:151` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15 lines × 2) cs/src/core/Index/FASTER/Implementation/SplitIndex.cs:131— cs/src/core/Index/FASTER/Implementation/SplitIndex.cs:131-145 | cs/src/core/Index/FASTER/Implementation/SplitIndex.cs:164-180 — both copies are in the same file, so extract the 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 `cs/src/core/Index/FASTER/Implementation/SplitIndex.cs:131` 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 (15 lines × 2) cs/playground/ClassRecoveryDurability/Program.cs:193— cs/playground/ClassRecoveryDurability/Program.cs:193-207 | cs/playground/ClassRecoveryDurability/Program.cs:214-230 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `cs/playground/ClassRecoveryDurability/Program.cs:193` 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 (15 lines × 2) cs/samples/HelloWorld/Program.cs:76— cs/samples/HelloWorld/Program.cs:76-90 | cs/samples/HelloWorld/Program.cs:186-200 — both copies are in the same file, so extract the 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) cs/samples/AzureBackedStore/Program.cs:50— cs/samples/AzureBackedStore/Program.cs:50-65 | cs/samples/AzureBackedStore/Program.cs:92-106 — both copies are in the same file, so extract the 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 `cs/samples/AzureBackedStore/Program.cs:50` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (8 lines × 2) cs/src/core/Allocator/BlittableAllocator.cs:242— cs/src/core/Allocator/BlittableAllocator.cs:242-249 | cs/src/core/Allocator/VarLenBlittableAllocator.cs:348-355 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `cs/src/core/Allocator/BlittableAllocator.cs:242` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) cs/src/core/Allocator/GenericAllocator.cs:858— cs/src/core/Allocator/GenericAllocator.cs:858-865 | cs/src/core/Allocator/GenericAllocator.cs:876-883 — both copies are in the same file, so extract the 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) cs/src/core/Index/CheckpointManagement/DeviceLogCommitCheckpointManager.cs:443— cs/src/core/Index/CheckpointManagement/DeviceLogCommitCheckpointManager.cs:443-450 | cs/src/core/Index/CheckpointManagement/DeviceLogCommitCheckpointManager.cs:469-476 — both copies are in the same file, so extract the 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 `cs/src/core/Index/CheckpointManagement/DeviceLogCommitCheckpointManager.cs:443` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) cs/samples/StoreVarLenTypes/MemoryIntSample.cs:33— cs/samples/StoreVarLenTypes/MemoryIntSample.cs:33-41 | cs/samples/StoreVarLenTypes/MemoryIntSample.cs:50-57 — both copies are in the same file, so extract the 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 `cs/samples/StoreVarLenTypes/MemoryIntSample.cs:33` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (16 lines × 2) cs/stress/SpanByteValueTester.cs:73— cs/stress/SpanByteValueTester.cs:73-88 | cs/stress/StringValueTester.cs:71-86 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `cs/stress/SpanByteValueTester.cs:73` 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.
Duplicated block (16 lines × 2) cs/src/core/Allocator/ScanIteratorBase.cs:137— cs/src/core/Allocator/ScanIteratorBase.cs:137-152 | cs/src/core/Allocator/ScanIteratorBase.cs:186-202 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `cs/src/core/Allocator/ScanIteratorBase.cs:137` 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.
Duplicated block (16 lines × 2) cs/src/core/Allocator/WorkQueueFIFO.cs:83— cs/src/core/Allocator/WorkQueueFIFO.cs:83-98 | cs/src/core/Allocator/WorkQueueLIFO.cs:83-98 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `cs/src/core/Allocator/WorkQueueFIFO.cs:83` 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) cs/samples/StoreVarLenTypes/MemoryByteSample.cs:35— cs/samples/StoreVarLenTypes/MemoryByteSample.cs:35-43 | cs/samples/StoreVarLenTypes/MemoryIntSample.cs:35-43 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `cs/samples/StoreVarLenTypes/MemoryByteSample.cs:35` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (9 lines × 2) cs/samples/StoreVarLenTypes/MemoryByteSample.cs:51— cs/samples/StoreVarLenTypes/MemoryByteSample.cs:51-59 | cs/samples/StoreVarLenTypes/MemoryIntSample.cs:51-59 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `cs/samples/StoreVarLenTypes/MemoryByteSample.cs:51` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (9 lines × 2) cs/playground/FasterLogMLSDTest/Program.cs:90— cs/playground/FasterLogMLSDTest/Program.cs:90-98 | cs/playground/FasterLogMLSDTest/Program.cs:139-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.
Low cohesion: BlittableAllocator (LCOM4 12) cs/src/core/Allocator/BlittableAllocator.cs:15— BlittableAllocator's methods form 12 groups that share no state and don't call each other — a sign it may have several responsibilities. Review whether it splits into focused classes.
Low cohesion: VariableLengthBlittableAllocator (LCOM4 8) cs/src/core/Allocator/VarLenBlittableAllocator.cs:17— VariableLengthBlittableAllocator's methods form 8 groups that share no state and don't call each other — a sign it may have several responsibilities. Review whether it splits into focused classes.
Low cohesion: GenericAllocator (LCOM4 4) cs/src/core/Allocator/GenericAllocator.cs:25— GenericAllocator's methods form 4 groups that share no state and don't call each other — a sign it may have several responsibilities. Review whether it splits into focused classes.
Program.Main (cognitive 27) cs/samples/StoreLogCompaction/Program.cs:15— Program.Main 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.
Program.Main (cognitive 27) cs/playground/AsyncStress/Program.cs:63— Program.Main has cognitive complexity 27 (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.
Duplicated block (19 lines × 2) cs/src/core/Allocator/BlittableAllocator.cs:184— cs/src/core/Allocator/BlittableAllocator.cs:184-202 | cs/src/core/Allocator/VarLenBlittableAllocator.cs:292-310 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once.
Duplicated block (19 lines × 2) cs/src/core/Device/LocalStorageDevice.cs:177— cs/src/core/Device/LocalStorageDevice.cs:177-195 | cs/src/core/Device/ManagedLocalStorageDevice.cs:100-118 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `cs/src/core/Device/LocalStorageDevice.cs:177` 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 (18 lines × 2) cs/src/core/Allocator/BlittableScanIterator.cs:157— cs/src/core/Allocator/BlittableScanIterator.cs:157-174 | cs/src/core/Allocator/VarLenBlittableScanIterator.cs:175-192 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `cs/src/core/Allocator/BlittableScanIterator.cs:157` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (18 lines × 2) cs/src/core/Index/FASTER/Implementation/InternalRMW.cs:238— cs/src/core/Index/FASTER/Implementation/InternalRMW.cs:238-255 | cs/src/core/Index/FASTER/Implementation/InternalUpsert.cs:222-239 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `cs/src/core/Index/FASTER/Implementation/InternalRMW.cs:238` 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.
Duplicated block (17 lines × 2) cs/src/core/Allocator/BlittableScanIterator.cs:93— cs/src/core/Allocator/BlittableScanIterator.cs:93-109 | cs/src/core/Allocator/VarLenBlittableScanIterator.cs:96-112 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once.
Duplicated block (17 lines × 2) cs/src/core/Index/FASTER/FASTERBase.cs:161— cs/src/core/Index/FASTER/FASTERBase.cs:161-177 | cs/src/core/Index/FASTER/FASTERBase.cs:199-215 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `cs/src/core/Index/FASTER/FASTERBase.cs:161` 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 (13 lines × 2) cs/src/core/Allocator/BlittableScanIterator.cs:112— cs/src/core/Allocator/BlittableScanIterator.cs:112-124 | cs/src/core/Allocator/VarLenBlittableScanIterator.cs:115-127 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once.
Duplicated block (13 lines × 2) cs/samples/HelloWorld/Program.cs:31— cs/samples/HelloWorld/Program.cs:31-43 | cs/samples/HelloWorld/Program.cs:105-118 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) cs/samples/HelloWorld/Program.cs:62— cs/samples/HelloWorld/Program.cs:62-73 | cs/samples/HelloWorld/Program.cs:172-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.
Duplicated block (12 lines × 2) cs/samples/StoreVarLenTypes/MemoryByteSample.cs:68— cs/samples/StoreVarLenTypes/MemoryByteSample.cs:68-79 | cs/samples/StoreVarLenTypes/MemoryIntSample.cs:68-79 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `cs/samples/StoreVarLenTypes/MemoryByteSample.cs:68` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) cs/src/core/Allocator/GenericAllocator.cs:926— cs/src/core/Allocator/GenericAllocator.cs:926-936 | cs/src/core/Allocator/GenericAllocator.cs:941-951 — both copies are in the same file, so extract the 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 `cs/src/core/Allocator/GenericAllocator.cs:926` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) cs/src/core/Index/CheckpointManagement/DeviceLogCommitCheckpointManager.cs:190— cs/src/core/Index/CheckpointManagement/DeviceLogCommitCheckpointManager.cs:190-200 | cs/src/core/Index/CheckpointManagement/DeviceLogCommitCheckpointManager.cs:237-247 — both copies are in the same file, so extract the 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 `cs/src/core/Index/CheckpointManagement/DeviceLogCommitCheckpointManager.cs:190` 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.
TestLoader.TestLoader.ctor (cyclomatic 39) cs/stress/TestLoader.cs:21— TestLoader.TestLoader.ctor has cyclomatic complexity 39 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
FasterKV.InternalRMW (cyclomatic 37) cs/src/core/Index/FASTER/Implementation/InternalRMW.cs:48— FasterKV.InternalRMW has cyclomatic complexity 37 (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.
Program.ProfileStore (cyclomatic 33) cs/playground/AsyncStress/Program.cs:120— Program.ProfileStore has cyclomatic complexity 33 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
GenericAllocator.WriteAsync (cyclomatic 31) cs/src/core/Allocator/GenericAllocator.cs:375— GenericAllocator.WriteAsync has cyclomatic complexity 31 (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.
FasterKV.ContinuePendingRead (cyclomatic 30) cs/src/core/Index/FASTER/Implementation/ContinuePending.cs:29— FasterKV.ContinuePendingRead has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
FasterKV.CreateNewRecordRMW (cyclomatic 30) cs/src/core/Index/FASTER/Implementation/InternalRMW.cs:354— FasterKV.CreateNewRecordRMW has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
FasterKV.InternalUpsert (cyclomatic 30) cs/src/core/Index/FASTER/Implementation/InternalUpsert.cs:44— FasterKV.InternalUpsert has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
FasterKV.InternalRead (cyclomatic 29) cs/src/core/Index/FASTER/Implementation/InternalRead.cs:45— FasterKV.InternalRead has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
FasterKV.InternalDelete (cyclomatic 28) cs/src/core/Index/FASTER/Implementation/InternalDelete.cs:41— FasterKV.InternalDelete has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
FasterKV.UpdateVarLen (cyclomatic 27) cs/src/core/Index/FASTER/FASTER.cs:769— FasterKV.UpdateVarLen has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Program.GetArgs (cyclomatic 26) cs/samples/ResizableCacheStore/Program.cs:172— Program.GetArgs has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
FasterKV.FasterKV.ctor (cyclomatic 25) cs/src/core/Index/FASTER/FASTER.cs:107— FasterKV.FasterKV.ctor has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Program.AsyncReadOperator (cyclomatic 25) cs/samples/StoreDiskReadBenchmark/Program.cs:118— Program.AsyncReadOperator has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
TestLoader.LoadDataFromFile (cyclomatic 24) cs/benchmark/TestLoader.cs:167— TestLoader.LoadDataFromFile has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Program.Main (cyclomatic 24) cs/playground/AsyncStress/Program.cs:63— Program.Main has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
TestLoader.TestLoader.ctor (cyclomatic 23) cs/benchmark/TestLoader.cs:41— TestLoader.TestLoader.ctor has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
FasterLogScanIterator.GetNextInternal (cyclomatic 22) cs/src/core/FasterLog/FasterLogIterator.cs:760— FasterLogScanIterator.GetNextInternal has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
FasterKV.ThreadStateMachineStep (cyclomatic 22) cs/src/core/Index/Synchronization/FasterStateMachine.cs:189— FasterKV.ThreadStateMachineStep has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
StressApp.Main (cyclomatic 21) cs/stress/StressApp.cs:11— StressApp.Main has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
FasterKV.SplitChunk (cyclomatic 21) cs/src/core/Index/FASTER/Implementation/SplitIndex.cs:62— FasterKV.SplitChunk has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ProcessReplies (cyclomatic 20) cs/remote/src/FASTER.client/JavascriptClient/ClientSession.js:21— ProcessReplies has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
FasterSpanByteYcsbBenchmark.Run (cyclomatic 19) cs/benchmark/FasterSpanByteYcsbBenchmark.cs:321— FasterSpanByteYcsbBenchmark.Run 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.
FASTER_YcsbBenchmark.Run (cyclomatic 19) cs/benchmark/FasterYcsbBenchmark.cs:286— FASTER_YcsbBenchmark.Run 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.
AllocatorBase.AsyncFlushDeltaToDevice (cyclomatic 19) cs/src/core/Allocator/AllocatorBase.cs:444— AllocatorBase.AsyncFlushDeltaToDevice 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.
GenericAllocator.GenericAllocator.ctor (cyclomatic 19) cs/src/core/Allocator/GenericAllocator.cs:44— GenericAllocator.GenericAllocator.ctor 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.
FasterLog.CommitInternal (cyclomatic 19) cs/src/core/FasterLog/FasterLog.cs:2696— FasterLog.CommitInternal has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
FasterLogScanIterator.ExpandGetNextInternal (cyclomatic 19) cs/src/core/FasterLog/FasterLogIterator.cs:872— FasterLogScanIterator.ExpandGetNextInternal 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.
Utils.NumDigits (cyclomatic 19) cs/samples/StoreVarLenTypes/Utils.cs:91— Utils.NumDigits has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Program.RandomWorkload (cyclomatic 19) cs/samples/ResizableCacheStore/Program.cs:462— Program.RandomWorkload 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.
VariableLengthBlittableScanIterator.GetNext (cyclomatic 18) cs/src/core/Allocator/VarLenBlittableScanIterator.cs:85— VariableLengthBlittableScanIterator.GetNext has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
LockableContext.DoInternalTryLock (cyclomatic 18) cs/src/core/ClientSession/LockableContext.cs:91— LockableContext.DoInternalTryLock has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
GenericAllocator.GetObjectInfo (cyclomatic 17) cs/src/core/Allocator/GenericAllocator.cs:912— GenericAllocator.GetObjectInfo has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
FasterLogRecoveryInfo.Initialize (cyclomatic 17) cs/src/core/FasterLog/FasterLogRecoveryInfo.cs:74— FasterLogRecoveryInfo.Initialize has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Program.ManagedLocalStoreBasicTest (cyclomatic 17) cs/playground/FasterLogMLSDTest/Program.cs:43— Program.ManagedLocalStoreBasicTest has cyclomatic complexity 17 (threshold 15). Of this number, 11 points are the body's own statements and 6 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
BlittableScanIterator.GetNext (cyclomatic 16) cs/src/core/Allocator/BlittableScanIterator.cs:82— BlittableScanIterator.GetNext has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
FasterLog.RestoreSpecificCommit (cyclomatic 16) cs/src/core/FasterLog/FasterLog.cs:2349— FasterLog.RestoreSpecificCommit has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
DeltaLog.GetNext (cyclomatic 16) cs/src/core/Index/Recovery/DeltaLog.cs:197— DeltaLog.GetNext has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Worker.RunOneThread (cyclomatic 16) cs/samples/EpvsSample/EpvsBench.cs:72— Worker.RunOneThread has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D11 · Test Reliability· Test reliability not measured · ×1
Test reliability not measured — test suite did not build — Test reliability NOT MEASURED: this repository did not build in our analyzer environment (a C#/MSBuild compiler error), so no test ever ran and flakiness could not be exercised. It is excluded from the score rather than counted as a defect. We did not read WHERE the failing diagnostic is, so this does not claim the fault is in your test code — a repository written for an older SDK band can compile for you and not for us. Run `dotnet build` on this commit: if it succeeds, the gap is ours and nothing here is a defect in your code.
dormant codebase — no living knowledge left to concentrate — All 169 significant source file(s) were last meaningfully changed so long ago that no living knowledge remains — nothing since has been substantial enough to re-establish ownership (a broad, mechanical sweep that touches many files shallowly does not count, and neither does no activity at all). There is no concentration to measure, so the bus factor is not scored. This is not a clean bill: nobody currently holds working knowledge of this code (see D34 Knowledge Freshness).
Build failed — The target solution did not build cleanly (errors: 4), which caps Solution Shape at 3/10 — the most basic shape signal is that it compiles. First errors: CS0023: Operator '.' cannot be applied to operand of type 'void'.
Monorepo: only 1 of 2 solutions was scored — This repository contains 2 .NET solutions, but a scan analyzes ONE. Every score, lens, and finding here reflects only `cs/FASTER.sln` — the other 1 (`cs/remote/FASTER.remote.sln`) were not analyzed and are not represented in the headline. To cover them, scan each solution as its own target and group them in a Solution or Product for a portfolio roll-up. If a secondary solution is an archived or vendored tree, declare it — `.gitattributes` (`path/** linguist-vendored`) or `.editorconfig` (`[path/**] generated_code = true`) — to exclude it from discovery the same way generated code is.
FasterKV.ContinuePendingRead (cognitive 83) cs/src/core/Index/FASTER/Implementation/ContinuePending.cs:29— FasterKV.ContinuePendingRead 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.
FasterKV.SplitChunk (cognitive 80) cs/src/core/Index/FASTER/Implementation/SplitIndex.cs:62— FasterKV.SplitChunk has cognitive complexity 80 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Program.AsyncReadOperator (cognitive 77) cs/samples/StoreDiskReadBenchmark/Program.cs:118— Program.AsyncReadOperator 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.
GenericAllocator.WriteAsync (cognitive 65) cs/src/core/Allocator/GenericAllocator.cs:375— GenericAllocator.WriteAsync has cognitive complexity 65 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Program.ProfileStore (cognitive 62) cs/playground/AsyncStress/Program.cs:120— Program.ProfileStore has cognitive complexity 62 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
TestLoader.LoadDataFromFile (cognitive 58) cs/benchmark/TestLoader.cs:167— TestLoader.LoadDataFromFile 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.
FasterKV.CreateNewRecordRMW (cognitive 55) cs/src/core/Index/FASTER/Implementation/InternalRMW.cs:354— FasterKV.CreateNewRecordRMW 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.
FasterLogScanIterator.GetNextInternal (cognitive 51) cs/src/core/FasterLog/FasterLogIterator.cs:760— FasterLogScanIterator.GetNextInternal 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.
Program.GetArgs (cognitive 50) cs/samples/ResizableCacheStore/Program.cs:172— Program.GetArgs has cognitive complexity 50 (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.
Program.RandomWorkload (cognitive 50) cs/samples/ResizableCacheStore/Program.cs:462— Program.RandomWorkload 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.
Program.AsyncOperator (cognitive 46) cs/samples/StoreAsyncApi/Program.cs:60— Program.AsyncOperator 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.
LockableContext.DoInternalTryLock (cognitive 45) cs/src/core/ClientSession/LockableContext.cs:91— LockableContext.DoInternalTryLock 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.
FasterKV.InternalRMW (cognitive 44) cs/src/core/Index/FASTER/Implementation/InternalRMW.cs:48— FasterKV.InternalRMW has cognitive complexity 44 (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.
TestLoader.TestLoader.ctor (cognitive 40) cs/stress/TestLoader.cs:21— TestLoader.TestLoader.ctor has cognitive complexity 40 (threshold 15). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
GenericAllocator.GetObjectInfo (cognitive 39) cs/src/core/Allocator/GenericAllocator.cs:912— GenericAllocator.GetObjectInfo 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.
FasterLogScanIterator.ExpandGetNextInternal (cognitive 39) cs/src/core/FasterLog/FasterLogIterator.cs:872— FasterLogScanIterator.ExpandGetNextInternal 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.
FasterKV.InternalRead (cognitive 39) cs/src/core/Index/FASTER/Implementation/InternalRead.cs:45— FasterKV.InternalRead has cognitive complexity 39 (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.
FasterKVIterator.PushNext (cognitive 38) cs/src/core/Index/FASTER/FASTERIterator.cs:180— FasterKVIterator.PushNext 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.
FasterKV.InternalDelete (cognitive 38) cs/src/core/Index/FASTER/Implementation/InternalDelete.cs:41— FasterKV.InternalDelete has cognitive complexity 38 (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.
AllocatorBase.AsyncFlushDeltaToDevice (cognitive 37) cs/src/core/Allocator/AllocatorBase.cs:444— AllocatorBase.AsyncFlushDeltaToDevice 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.
GenericAllocator.Deserialize (cognitive 37) cs/src/core/Allocator/GenericAllocator.cs:831— GenericAllocator.Deserialize 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.
FasterKV.InternalUpsert (cognitive 37) cs/src/core/Index/FASTER/Implementation/InternalUpsert.cs:44— FasterKV.InternalUpsert has cognitive complexity 37 (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.
FasterBase.FindTagOrFreeInternal (cognitive 36) cs/src/core/Index/FASTER/FASTERBase.cs:542— FasterBase.FindTagOrFreeInternal 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.
DeltaLog.GetNext (cognitive 36) cs/src/core/Index/Recovery/DeltaLog.cs:197— DeltaLog.GetNext has cognitive complexity 36 (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.
FasterKV.FasterKV.ctor (cognitive 35) cs/src/core/Index/FASTER/FASTER.cs:107— FasterKV.FasterKV.ctor has cognitive complexity 35 (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.
FasterKV.UpdateVarLen (cognitive 34) cs/src/core/Index/FASTER/FASTER.cs:769— FasterKV.UpdateVarLen has cognitive complexity 34 (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.
FasterKV.ThreadStateMachineStep (cognitive 34) cs/src/core/Index/Synchronization/FasterStateMachine.cs:189— FasterKV.ThreadStateMachineStep has cognitive complexity 34 (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.
FasterSpanByteYcsbBenchmark.Run (cognitive 33) cs/benchmark/FasterSpanByteYcsbBenchmark.cs:321— FasterSpanByteYcsbBenchmark.Run 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.
FASTER_YcsbBenchmark.Run (cognitive 33) cs/benchmark/FasterYcsbBenchmark.cs:286— FASTER_YcsbBenchmark.Run 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.
Program.TestData (cognitive 31) cs/playground/ClassRecoveryDurability/Program.cs:157— Program.TestData has cognitive complexity 31 (threshold 15). Most of this is not in the body itself: 0 of the 31 points are its own statements and the rest belongs to one function literal inside it that branches (line 159). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
FasterSpanByteYcsbBenchmark.RunYcsbSafeContext (cognitive 29) cs/benchmark/FasterSpanByteYcsbBenchmark.cs:213— FasterSpanByteYcsbBenchmark.RunYcsbSafeContext 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.
FASTER_YcsbBenchmark.RunYcsbSafeContext (cognitive 29) cs/benchmark/FasterYcsbBenchmark.cs:209— FASTER_YcsbBenchmark.RunYcsbSafeContext 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.
Program.Filldb (cognitive 29) cs/playground/ClassRecoveryDurability/Program.cs:40— Program.Filldb has cognitive complexity 29 (threshold 15). Most of this is not in the body itself: 1 of the 29 points is its own statement and the rest belongs to one function literal inside it that branches (line 66). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
AllocatorBase.AsyncFlushPages (cognitive 27) cs/src/core/Allocator/AllocatorBase.cs:2045— AllocatorBase.AsyncFlushPages has cognitive complexity 27 (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.
GenericScanIterator.GetNext (cognitive 27) cs/src/core/Allocator/GenericScanIterator.cs:76— GenericScanIterator.GetNext has cognitive complexity 27 (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.
VariableLengthBlittableScanIterator.GetNext (cognitive 27) cs/src/core/Allocator/VarLenBlittableScanIterator.cs:85— VariableLengthBlittableScanIterator.GetNext has cognitive complexity 27 (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.
ConcurrentDictionary_YcsbBenchmark.RunYcsb (cognitive 26) cs/benchmark/ConcurrentDictionaryBenchmark.cs:80— ConcurrentDictionary_YcsbBenchmark.RunYcsb 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.
FasterLog.RestoreSpecificCommit (cognitive 26) cs/src/core/FasterLog/FasterLog.cs:2349— FasterLog.RestoreSpecificCommit has cognitive complexity 26 (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.
Worker.RunOneThread (cognitive 26) cs/samples/EpvsSample/EpvsBench.cs:72— Worker.RunOneThread has cognitive complexity 26 (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.
ProcessReplies (cognitive 26) cs/remote/src/FASTER.client/JavascriptClient/ClientSession.js:21— ProcessReplies has cognitive complexity 26 (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.
FasterSpanByteYcsbBenchmark.RunYcsbUnsafeContext (cognitive 25) cs/benchmark/FasterSpanByteYcsbBenchmark.cs:96— FasterSpanByteYcsbBenchmark.RunYcsbUnsafeContext has cognitive complexity 25 (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.
FASTER_YcsbBenchmark.RunYcsbUnsafeContext (cognitive 25) cs/benchmark/FasterYcsbBenchmark.cs:96— FASTER_YcsbBenchmark.RunYcsbUnsafeContext has cognitive complexity 25 (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.
MallocFixedPageSize.InternalAllocate (cognitive 25) cs/src/core/Allocator/MallocFixedPageSize.cs:239— MallocFixedPageSize.InternalAllocate has cognitive complexity 25 (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.
FasterKV.DumpDistributionInternal (cognitive 25) cs/src/core/Index/FASTER/FASTER.cs:865— FasterKV.DumpDistributionInternal 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.
BlobManager.PerformWithRetriesAsync (cognitive 25) cs/src/devices/AzureStorageDevice/StorageOperations.cs:14— BlobManager.PerformWithRetriesAsync has cognitive complexity 25 (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.
AllocatorBase.ApplyDelta (cognitive 24) cs/src/core/Allocator/AllocatorBase.cs:548— AllocatorBase.ApplyDelta 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.
LocalStorageNamedDeviceFactory.Delete (cognitive 24) cs/src/core/Index/CheckpointManagement/LocalStorageNamedDeviceFactory.cs:76— LocalStorageNamedDeviceFactory.Delete has cognitive complexity 24 (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.
FasterKVIterator.GetNext (cognitive 24) cs/src/core/Index/FASTER/FASTERIterator.cs:133— FasterKVIterator.GetNext 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.
BlobManager.AcquireOwnership (cognitive 24) cs/src/devices/AzureStorageDevice/BlobManager.cs:157— BlobManager.AcquireOwnership has cognitive complexity 24 (threshold 15). Of this number, 18 points are the body's own statements and 6 belong to one function literal inside it that branches. To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Program.ManagedLocalStoreBasicTest (cognitive 24) cs/playground/FasterLogMLSDTest/Program.cs:43— Program.ManagedLocalStoreBasicTest has cognitive complexity 24 (threshold 15). Most of this is not in the body itself: 10 of the 24 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 116, 59, 75). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
FasterLog.RestoreLatest (cognitive 23) cs/src/core/FasterLog/FasterLog.cs:2268— FasterLog.RestoreLatest has cognitive complexity 23 (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.
AllocatorBase.OnPagesClosedWorker (cognitive 22) cs/src/core/Allocator/AllocatorBase.cs:1662— AllocatorBase.OnPagesClosedWorker has cognitive complexity 22 (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.
BlittableScanIterator.GetNext (cognitive 22) cs/src/core/Allocator/BlittableScanIterator.cs:82— BlittableScanIterator.GetNext has cognitive complexity 22 (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.
Program.DiskSample (cognitive 22) cs/samples/HelloWorld/Program.cs:98— Program.DiskSample has cognitive complexity 22 (threshold 15). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
AllocatorBase.AsyncGetFromDiskCallback (cognitive 21) cs/src/core/Allocator/AllocatorBase.cs:2235— AllocatorBase.AsyncGetFromDiskCallback has cognitive complexity 21 (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.
ScanIteratorBase.BufferAndLoad (cognitive 21) cs/src/core/Allocator/ScanIteratorBase.cs:135— ScanIteratorBase.BufferAndLoad 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.
FasterBase.BeginMainIndexCheckpoint (cognitive 21) cs/src/core/Index/Recovery/IndexCheckpoint.cs:69— FasterBase.BeginMainIndexCheckpoint has cognitive complexity 21 (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.
GenericAllocator.GenericAllocator.ctor (cognitive 20) cs/src/core/Allocator/GenericAllocator.cs:44— GenericAllocator.GenericAllocator.ctor has cognitive complexity 20 (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.
GenericAllocator.RetrievedFullRecord (cognitive 20) cs/src/core/Allocator/GenericAllocator.cs:979— GenericAllocator.RetrievedFullRecord has cognitive complexity 20 (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.
FasterKV.CompactScan (cognitive 20) cs/src/core/Compaction/FASTERCompaction.cs:73— FasterKV.CompactScan has cognitive complexity 20 (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.
FasterLog.CommitInternal (cognitive 20) cs/src/core/FasterLog/FasterLog.cs:2696— FasterLog.CommitInternal has cognitive complexity 20 (threshold 15). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
VersionChangeTask.OnThreadState (cognitive 20) cs/src/core/Index/Synchronization/VersionChangeStateMachine.cs:32— VersionChangeTask.OnThreadState has cognitive complexity 20 (threshold 15). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Program.Write (cognitive 20) cs/playground/MemoryDb/Program.cs:69— Program.Write has cognitive complexity 20 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
StressApp.Main (cognitive 19) cs/stress/StressApp.cs:11— StressApp.Main 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.
FasterLog.CommitAsync (cognitive 19) cs/src/core/FasterLog/FasterLog.cs:1331— FasterLog.CommitAsync 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.
Utils.NumDigits (cognitive 19) cs/samples/StoreVarLenTypes/Utils.cs:91— Utils.NumDigits has cognitive complexity 19 (threshold 15). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
TestLoader.TestLoader.ctor (cognitive 18) cs/benchmark/TestLoader.cs:41— TestLoader.TestLoader.ctor has cognitive complexity 18 (threshold 15). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
MallocFixedPageSize.BeginCheckpoint (cognitive 18) cs/src/core/Allocator/MallocFixedPageSize.cs:409— MallocFixedPageSize.BeginCheckpoint 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.
FasterLog.RestoreLatestAsync (cognitive 18) cs/src/core/FasterLog/FasterLog.cs:2426— FasterLog.RestoreLatestAsync 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.
FasterLogRecoveryInfo.Initialize (cognitive 18) cs/src/core/FasterLog/FasterLogRecoveryInfo.cs:74— FasterLogRecoveryInfo.Initialize has cognitive complexity 18 (threshold 15). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
HybridLogRecoveryInfo.Initialize (cognitive 18) cs/src/core/Index/Common/Contexts.cs:439— HybridLogRecoveryInfo.Initialize 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.
AzureStorageDevice.StartAsync (cognitive 18) cs/src/devices/AzureStorageDevice/AzureStorageDevice.cs:156— AzureStorageDevice.StartAsync 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.
SpanByteSample.Run (cognitive 18) cs/samples/StoreVarLenTypes/SpanByteSample.cs:39— SpanByteSample.Run 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.
AllocatorBase.IterateKeyVersionsImpl (cognitive 17) cs/src/core/Allocator/AllocatorBase.cs:853— AllocatorBase.IterateKeyVersionsImpl 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.
AllocatorBase.TryAllocate (cognitive 17) cs/src/core/Allocator/AllocatorBase.cs:1376— AllocatorBase.TryAllocate has cognitive complexity 17 (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.
FasterLog.SerialCommitCallbackWorker (cognitive 17) cs/src/core/FasterLog/FasterLog.cs:2105— FasterLog.SerialCommitCallbackWorker has cognitive complexity 17 (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.
FasterLogScanIterator.GetNext (cognitive 17) cs/src/core/FasterLog/FasterLogIterator.cs:247— FasterLogScanIterator.GetNext has cognitive complexity 17 (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.
DeviceLogCommitCheckpointManager.GetLogCheckpointMetadata (cognitive 17) cs/src/core/Index/CheckpointManagement/DeviceLogCommitCheckpointManager.cs:284— DeviceLogCommitCheckpointManager.GetLogCheckpointMetadata 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.
FasterKV.ConditionalCopyToTail (cognitive 17) cs/src/core/Index/FASTER/Implementation/ConditionalCopyToTail.cs:27— FasterKV.ConditionalCopyToTail has cognitive complexity 17 (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.
FasterKV.AcquireCPRLatchRMW (cognitive 17) cs/src/core/Index/FASTER/Implementation/InternalRMW.cs:268— FasterKV.AcquireCPRLatchRMW has cognitive complexity 17 (threshold 15). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
FasterKV.RecoverFromPage (cognitive 17) cs/src/core/Index/Recovery/Recovery.cs:938— FasterKV.RecoverFromPage 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.
AllocatorBase.RestoreHybridLogInitializePages (cognitive 17) cs/src/core/Index/Recovery/Recovery.cs:1101— AllocatorBase.RestoreHybridLogInitializePages has cognitive complexity 17 (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.
TestLoader.GetKeysToLock (cognitive 16) cs/stress/TestLoader.cs:177— TestLoader.GetKeysToLock 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.
ConcurrencyTest.Test (cognitive 16) cs/playground/SumStore/ConcurrencyTest.cs:140— ConcurrencyTest.Test has cognitive complexity 16 (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.
LightEpoch.BumpCurrentEpoch (cognitive 16) cs/src/core/Epochs/LightEpoch.cs:243— LightEpoch.BumpCurrentEpoch 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.
FasterLog.Scan (cognitive 16) cs/src/core/FasterLog/FasterLog.cs:1811— FasterLog.Scan has cognitive complexity 16 (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.
RecordInfo.TryLockExclusive (cognitive 16) cs/src/core/Index/Common/RecordInfo.cs:143— RecordInfo.TryLockExclusive has cognitive complexity 16 (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.
FasterBase.FindOtherSlotForThisTagMaybeTentativeInternal (cognitive 16) cs/src/core/Index/FASTER/FASTERBase.cs:637— FasterBase.FindOtherSlotForThisTagMaybeTentativeInternal 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.
FasterKV.InternalContinue (cognitive 16) cs/src/core/Index/FASTER/FASTERThread.cs:13— FasterKV.InternalContinue 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.
FasterKV.TraceBackForOtherChainStart (cognitive 16) cs/src/core/Index/FASTER/Implementation/SplitIndex.cs:204— FasterKV.TraceBackForOtherChainStart has cognitive complexity 16 (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.
ClassTooLong: FasterLogScanIterator cs/src/core/FasterLog/FasterLogIterator.cs:0— ClassTooLong — 448 significant lines (blank, comment-only and punctuation-only lines excluded), 26 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
Duplicated block (20 lines × 2) cs/src/core/Index/FASTER/Implementation/InternalRMW.cs:269— cs/src/core/Index/FASTER/Implementation/InternalRMW.cs:269-298 | cs/src/core/Index/FASTER/Implementation/InternalUpsert.cs:250-269 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `cs/src/core/Index/FASTER/Implementation/InternalRMW.cs:269` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14 lines × 2) cs/src/core/Allocator/WorkQueueFIFO.cs:60— cs/src/core/Allocator/WorkQueueFIFO.cs:60-73 | cs/src/core/Allocator/WorkQueueLIFO.cs:60-73 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once.
Duplicated block (12 lines × 3) cs/src/core/Allocator/BlittableScanIterator.cs:257— cs/src/core/Allocator/BlittableScanIterator.cs:257-268 | cs/src/core/Allocator/GenericScanIterator.cs:266-277 | cs/src/core/Allocator/VarLenBlittableScanIterator.cs:250-261 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `cs/src/core/Allocator/BlittableScanIterator.cs:257` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (11 lines × 3) cs/src/core/Index/Synchronization/HybridLogCheckpointTask.cs:185— cs/src/core/Index/Synchronization/HybridLogCheckpointTask.cs:185-195 | cs/src/core/Index/Synchronization/HybridLogCheckpointTask.cs:287-297 | cs/src/core/Index/Synchronization/HybridLogCheckpointTask.cs:381-391 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `cs/src/core/Index/Synchronization/HybridLogCheckpointTask.cs:185` 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 (10 lines × 2) cs/src/core/Allocator/ScanIteratorBase.cs:113— cs/src/core/Allocator/ScanIteratorBase.cs:113-122 | cs/src/core/Allocator/ScanIteratorBase.cs:263-272 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 3) cs/src/core/Index/Synchronization/HybridLogCheckpointTask.cs:172— cs/src/core/Index/Synchronization/HybridLogCheckpointTask.cs:172-180 | cs/src/core/Index/Synchronization/HybridLogCheckpointTask.cs:273-281 | cs/src/core/Index/Synchronization/HybridLogCheckpointTask.cs:367-375 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `cs/src/core/Index/Synchronization/HybridLogCheckpointTask.cs:172` 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.
Duplicated block (7 lines × 3) cs/stress/LongValueTester.cs:60— cs/stress/LongValueTester.cs:60-66 | cs/stress/SpanByteValueTester.cs:64-70 | cs/stress/StringValueTester.cs:62-68 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `cs/stress/LongValueTester.cs:60` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 2) cs/src/core/Allocator/BlittableAllocator.cs:276— cs/src/core/Allocator/BlittableAllocator.cs:276-282 | cs/src/core/Allocator/VarLenBlittableAllocator.cs:381-387 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `cs/src/core/Allocator/BlittableAllocator.cs:276` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) cs/src/core/Allocator/GenericAllocator.cs:418— cs/src/core/Allocator/GenericAllocator.cs:418-423 | cs/src/core/Allocator/GenericAllocator.cs:428-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. Read the line range as the matched WINDOW rather than a finished unit: at `cs/src/core/Allocator/GenericAllocator.cs:418` 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.
Off the main sequence: FASTER.core(net7.0) — FASTER.core(net7.0): abstractness 0.27, instability 0.00, distance 0.73 — zone of pain — concrete and depended on by 9 project(s), so it's rigid to change.
Coverage not measured — analyzer environment — Coverage NOT MEASURED: the analyzer environment could not build/run the test suite (a target framework / SDK band or targeting pack the analyzer image doesn't carry). This is OUR limitation, not a defect in the repo — coverage is excluded from the score rather than counted as a near-zero. We track the analyzer-image gap so it can be closed; in the meantime, no coverage collector was found in your CI either, so there is no existing report to hand us — add a collector to your test run and commit (or publish into the working tree) its Cobertura/OpenCover/lcov output, and real coverage will be read.
D34 · Knowledge Freshness· Largest orphaned file · ×3
Largest orphaned file cs/src/core/FasterLog/FasterLog.cs— One of the largest files with no living knowledge remaining — a reasonable place to start a read-through before the aggregate risk above bites.
Largest orphaned file cs/src/core/Allocator/AllocatorBase.cs— One of the largest files with no living knowledge remaining — a reasonable place to start a read-through before the aggregate risk above bites.
Largest orphaned file cs/src/core/ClientSession/ClientSession.cs— One of the largest files with no living knowledge remaining — a reasonable place to start a read-through before the aggregate risk above bites.
Thin analysable surface across projects — 1 project(s) carry only a thin slice of real code (e.g. `TstRunner` with 15 significant line(s)). The mean analysable-surface weight is 97 %, lowering Solution Shape by about 0.21 point(s). Consolidate thin projects or grow them into substantial, well-scoped assemblies.
No ADRs found — No ADRs found at common paths; consider documenting architectural decisions in Docs/ADL/ or similar.
D23 · Boundary Type-Coupling· Bounded contexts not declared · ×1
Bounded contexts not declared — At 49k LoC across 35 projects the codebase is large and multi-module, so explicit bounded contexts are needed. 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"]`.
redundant comment cs/benchmark/ConcurrentDictionaryBenchmark.cs:1— "Copyright (c) Microsoft Corporation. All rights reserved." — ignore - boilerplate license line restating the copyright
D26 · Project Cohesion· Projects may be oversized for their cohesion · ×1
Projects may be oversized for their cohesion — 1 of 28 project(s) overshoot their size bounds, lowering Project Cohesion to 9.3/10. The most over is `FASTER.core(net7.0)` (37241 LoC, 161 public types across 1 namespaces). Review these for cohesion — split a project that spans unrelated responsibilities.
Concentrated knowledge decay — 182 of 182 significant files have no living knowledge, while the repository is still being changed at a low rate (1 commit(s) in the last 90 days) — so this is one repo-wide knowledge-decay state, not 182 separate risks. The code moved on without the people who understood these files: document them or schedule a read-through before the next change lands in them.
No build provenance — No SLSA provenance generation or build attestation found in CI — nothing binds a released artifact to the build that produced it, so a consumer cannot tell your artifact from a substituted one. Emit one from whichever pipeline releases the artifact — `cosign attest` (keyless or with your release key) records the build inputs against the artifact digest and needs nothing forge-specific; publish the attestation as a release asset alongside it.
No artifact signing — No artifact signing found in CI — sign your released artifacts with whatever your ecosystem ships (a GPG/minisign detached signature — or `cosign sign-blob` — over the release archives, or over a checksum file published alongside them, Authenticode via signtool, or `dotnet nuget sign` for packages) so consumers can verify what you built.
D36 · Supply-chain Provenance & Signing· No SBOM · ×1
No SBOM — No SBOM generation or committed SBOM found — produce one with what your ecosystem ships (`sbom-tool generate` (install it with `dotnet tool install --global Microsoft.Sbom.DotNetTool`) or `dotnet CycloneDX` over the solution, `syft` (or `anchore/sbom-action` in CI) over the source tree or released image). Publish it as a release asset (`*.spdx.json` / `*.cdx.json`) so consumers can see what they are installing.
Skipped (documented): MemoryLogCompactionTest1 cs/test/MemoryLogCompactionTests.cs:39— Skipped with a documented reason — a deferral, not lazy debt: Fix required in ReadOnlyMemory<T> AsRef
D22 · Internal API Consistency· No exposed public API · ×1
No exposed public API — No intentionally-exposed types (IsPackable or .Contracts) to evaluate.
Appendix B — Reproduction & audit trail
Every external tool invocation behind a deep-scan dimension — the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative — never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json — kept out of this table so the rendered report stays byte-identical across runs of the same commit.
trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Terraform, Kubernetes/Helm, CloudFormation); nothing to scan.
trivy: not applicable — No JS/npm manifest or lockfile found outside build output (package.json, package-lock.json, yarn.lock, pnpm-lock.yaml, bun.lockb); no JS dependencies to scan.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
0
—
Run 019fd2c5-19e9-7c26-bf66-ecaf6ff49486 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 33 · Warnings: 257 · Recommendations: 15 · Info: 28 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 05-08-2026 @ 16:32 UTC.
Downloadable artifacts
Machine-readable and reproducible from this commit + frozen rubric — drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.