Public report of litedb-org/LiteDB, published 23 October 2026. It has the same score, grades and number of
findings as the full report. The details of security findings (where they are in the code, which known
vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.10.5). Watchdog signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey →
Signed and filed in the standard's public register, 23 October 2026, 09:55 UTC · Survey ID cd_ff460d97ad8a43d6b39e8f411ac3a1a0
litedb-org/LiteDB
Measured 23 October 2026, 09:50 UTC, at code version 7b71bc4
A regression is a drop of 0.5 points or more in the score, or of 2.5 or more out of 10 in a dimension, since the last survey.
Boundary Type-Coupling is not measured: Bounded contexts not declared.
CAI scoreAdequate
CriticalWeakAdequateStrongExemplary
Down 6 since the last survey
The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.
A medium codebase: 78,788 lines of product code in 44 projects, tests not counted · Estimated rebuild effort: about 2.3 person-years · Weakest lens: Security and Compliance, 45
Findings by how serious they are
269 critical712 serious154 minor
2 dimensions are left out of the score. For each one, Watchdog either couldn't measure it in this code, or found no evidence of the safeguard it looks for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.
This survey was produced by
Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
23 October 2026, 09:50 UTC
A measurement, not a certificate. The Code Assurance Index records a number
together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee
the code. The standard was written by Canine Development, which also builds Watchdog. It is open to any tool that
implements it, and today Watchdog is the only one that does.
The score is deterministic, which means the same code always gets the same score. Watchdog works it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸
73of 77 dimensions measured by tools. The other 4 are advisory notes from an AI model, which explain the code but don't count towards the score.
1096of 1135 findings point to an exact file and line, so you can open each one in the code. The other 39 concern the repository as a whole, such as missing documentation.
77dimensions across 6 lenses, read from 78,788 lines of product code in 44 projects.
litedb-org/LiteDB scores 51 out of 100 and is rated Adequate, while four of its six lenses score higher still: Architecture at 91, rated Exemplary, Performance at 72, rated Strong, and Production Readiness at 64 and Maturity at 56, both rated Adequate.
The score is lower than those four because the weakest lens counts most, and here that is Security and Compliance, which scores 45 and is rated Weak. Its Static Analysis (SAST) dimension scores 1.2 out of 10, and until that reaches 4, Security and Compliance can't be rated higher than Adequate. The first actions are to resolve the 6 FileScopedPragmaDisable finding(s) in Explicit Debt and to store passwords with a salted KDF — `Microsoft.AspNetCore.Identity.PasswordHasher<T>`, `Rfc2898DeriveBytes` (PBKDF2), or BCrypt/Argon2 — and compare with `CryptographicOperations.FixedTimeEquals`, and if Security and Compliance rose to 70, the score would rise from 51 to about 55.
269 findings are critical: 137 in Explicit Debt, 119 in Static Analysis (SAST), five in Secrets (history), three in Knowledge Freshness, two in Cryptographic Hygiene, two in Dependency Vulnerabilities and one in Project dependency cycles.
Watchdog couldn't measure Test Reliability in this code, so that dimension is left out of the score. The product code is 78,788 lines, which would take an estimated 2.3 person-years, around €330,000, to rebuild.
A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.
How the score is built: what each lens counts forThe lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
If Security and Compliance rose from 45 to 70, the lowest score rated Strong, the score would rise from 51 to about 55.
Code composition: what the lines of code are
Business logic 26%Supporting code 21%Tests 53%
New since the last survey: 204 findings
These 204 critical or serious findings weren't in the previous survey, on 9 October 2026. The first 100 are listed here, and the findings file in the download package lists them all.
Watchdog compares every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.
Fixed since the last survey: 20 findings
These 20 critical or serious findings were in the previous survey, on 9 October 2026, and are gone from this one.
Coupling · Off the main sequence: LiteDB(netstandard2.0)
Dependency Hygiene · Deprecated: xunit
Supply-chain Provenance & Signing · REDACTED
Supply-chain Provenance & Signing · REDACTED
Supply-chain Provenance & Signing · REDACTED
Exception handling · Swallowed exception (caught, then discarded) LiteDB/Document/Expression/Methods/Vector.cs
Exception handling · Swallowed exception (caught, then discarded) LiteDB/Document/Expression/Methods/Vector.cs
Exception handling · Swallowed exception (caught, then discarded) LiteDB/Engine/Query/QueryOptimization.Vector.cs
Exception handling · Swallowed exception (caught, then discarded) LiteDB/Engine/Services/VectorIndexService.cs
Async & latency hygiene · Awaits without ConfigureAwait(false)
Rebuild cost: about €330,000 · Estimate
Cost to rebuild
€110,000 to €560,000, for 1,815 to 5,891 hours of work, about 2.3 person-years for 1 to 5 engineers
Difficulty of the problem
Standard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor
×0.7 at a score of 51. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
Size
Medium: 78,788 lines of product code
Comment lines
The estimate prices 70,982 lines. Comment lines count towards the size of 78,788 lines but aren't priced as work.
How the estimate is made: Watchdog prices the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Resolve the 6 FileScopedPragmaDisable finding(s) in Explicit Debt — start with CoordinatorHarness.cs, CoordinatorPlatform_Tests.cs, CoordinatorSafety_Tests.cs.
Raises the score by about 4 points · Low effort · Explicit Debt
2
Store passwords with a salted KDF — `Microsoft.AspNetCore.Identity.PasswordHasher<T>`, `Rfc2898DeriveBytes` (PBKDF2), or BCrypt/Argon2 — and compare with `CryptographicOperations.FixedTimeEquals`.
(A fast/plain hash, or a client-hashed value stored and compared verbatim, is not password storage.) Start in `LiteDB/Engine/FileReader/Legacy/AesEncryption.cs:74`.
Resolve the 1 No ADRs found finding(s) in ADR Quality.
Raises the score by about 2 points · Low effort · ADR Quality
Diagnosis: what the measurements show together
Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.
Files that change often carry extra risk · Combined risk
One file is changed often and is hard to read, which makes it the likeliest place for a mistake. It also has under half its code tested, or was written almost entirely by one person, so a mistake there is less likely to be caught, or only one person knows the code well enough to avoid it. A change to this file therefore carries more risk than the overall score suggests.
Based on: Churn × Complexity Hotspots (35 files) · Code Coverage (41 files under half tested) · Bus Factor (0 files written almost entirely by one person) · The files: REDACTED
What to do: Add tests to these files and have a second person review every change to them, starting with REDACTED.
Where the investment is most exposed · Value at risk
This code would cost about €330,000 to build again, about 2.3 person-years of work. Its weakest lens is Security and Compliance, at 45 (Weak). Security and Compliance is about how well the product is protected, and how it handles personal data. Because the weakest lens counts most in the score, work on Security and Compliance also moves the score most.
Based on: the rebuild estimate · the Security and Compliance grade · how much each lens counts
What to do: Start with the Security and Compliance actions in Top priorities.
If you do one thing first · First action
Resolve the 6 FileScopedPragmaDisable finding(s) in Explicit Debt. Of all the actions in this report, it raises the score most for the work it takes: about 4 points for low effort, because it clears the 6 Explicit Debt findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 7.5 out of 10. Code at that level is slower to change than clean code, and Watchdog estimates the extra work at 2% to 5% on every change. The history of the code shows how much it changes: about 146,938 lines over the last 90 days, which is about 595,915 lines a year. At that pace, the extra work comes to an estimated 29.8 to 198.6 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of Watchdog's own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.
Architecture — module dependency graph
Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways — a layering smell or cycle. A clean layered graph has none.
Architecture: which parts of the code depend on which
The code is divided into modules, groups of code that each handle one part of the product, and a module depends on another when it uses code from it. The table lists the modules both down the side and across the top, in an order where each module should only use modules listed above it. A number in a cell means the module on that row uses the module in that column, and it counts the pairs of building blocks (types) that connect them. The one thing to look for is a mark above the diagonal line. It means two or more modules use each other in a loop (a dependency cycle), so none of them can be changed, tested or released on its own.
48 modules, with 56 dependencies between them. One loop runs through 5 of the modules, marked above the diagonal.
The table shows the 40 modules with the most connections; 8 more are left out to keep it readable.
Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
Issue_3071_SharedPeerCallback uses LiteDB.ReproRunner.Shared.Messaging, so a change to LiteDB.ReproRunner.Shared.Messaging can break Issue_3071_SharedPeerCallback, while a change to Issue_3071_SharedPeerCallback can't break LiteDB.ReproRunner.Shared.Messaging.
Position
Below the diagonal: Issue_3071_SharedPeerCallback uses a module listed above it, which is the healthy direction.
LiteDB.Benchmarks.Benchmarks.Generator uses LiteDB.Benchmarks.Models, so a change to LiteDB.Benchmarks.Models can break LiteDB.Benchmarks.Benchmarks.Generator, while a change to LiteDB.Benchmarks.Benchmarks.Generator can't break LiteDB.Benchmarks.Models.
Position
Below the diagonal: LiteDB.Benchmarks.Benchmarks.Generator uses a module listed above it, which is the healthy direction.
15→22 LiteDB.Client.Coordinated uses LiteDB.Enginepart of a loop✕
Connections
6 pairs of types, where a type in LiteDB.Client.Coordinated uses a type in LiteDB.Engine.
LiteDB.Client.Coordinated uses LiteDB.Engine, so a change to LiteDB.Engine can break LiteDB.Client.Coordinated, while a change to LiteDB.Client.Coordinated can't break LiteDB.Engine.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
15→24 LiteDB.Client.Coordinated uses LiteDB.Client.Sharedpart of a loop✕
Connections
1 pair of types, where a type in LiteDB.Client.Coordinated uses a type in LiteDB.Client.Shared.
LiteDB.Client.Coordinated uses LiteDB.Client.Shared, so a change to LiteDB.Client.Shared can break LiteDB.Client.Coordinated, while a change to LiteDB.Client.Coordinated can't break LiteDB.Client.Shared.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
15→25 LiteDB.Client.Coordinated uses LiteDBpart of a loop✕
Connections
12 pairs of types, where a type in LiteDB.Client.Coordinated uses a type in LiteDB.
LiteDB.Client.Coordinated uses LiteDB, so a change to LiteDB can break LiteDB.Client.Coordinated, while a change to LiteDB.Client.Coordinated can't break LiteDB.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
LiteDB.ReproRunner.Cli.Execution uses LiteDB.ReproRunner.Cli.Manifests, so a change to LiteDB.ReproRunner.Cli.Manifests can break LiteDB.ReproRunner.Cli.Execution, while a change to LiteDB.ReproRunner.Cli.Execution can't break LiteDB.ReproRunner.Cli.Manifests.
Position
Below the diagonal: LiteDB.ReproRunner.Cli.Execution uses a module listed above it, which is the healthy direction.
LiteDB.ReproRunner.Cli.Execution uses LiteDB.ReproRunner.Shared.Messaging, so a change to LiteDB.ReproRunner.Shared.Messaging can break LiteDB.ReproRunner.Cli.Execution, while a change to LiteDB.ReproRunner.Cli.Execution can't break LiteDB.ReproRunner.Shared.Messaging.
Position
Below the diagonal: LiteDB.ReproRunner.Cli.Execution uses a module listed above it, which is the healthy direction.
LiteDB.ReproRunner.Cli.Infrastructure uses LiteDB.ReproRunner.Cli.Manifests, so a change to LiteDB.ReproRunner.Cli.Manifests can break LiteDB.ReproRunner.Cli.Infrastructure, while a change to LiteDB.ReproRunner.Cli.Infrastructure can't break LiteDB.ReproRunner.Cli.Manifests.
Position
Below the diagonal: LiteDB.ReproRunner.Cli.Infrastructure uses a module listed above it, which is the healthy direction.
LiteDB.ReproRunner.Shared uses LiteDB.ReproRunner.Shared.Messaging, so a change to LiteDB.ReproRunner.Shared.Messaging can break LiteDB.ReproRunner.Shared, while a change to LiteDB.ReproRunner.Shared can't break LiteDB.ReproRunner.Shared.Messaging.
Position
Below the diagonal: LiteDB.ReproRunner.Shared uses a module listed above it, which is the healthy direction.
Issue_2561_TransactionMonitor uses LiteDB.ReproRunner.Shared.Messaging, so a change to LiteDB.ReproRunner.Shared.Messaging can break Issue_2561_TransactionMonitor, while a change to Issue_2561_TransactionMonitor can't break LiteDB.ReproRunner.Shared.Messaging.
Position
Below the diagonal: Issue_2561_TransactionMonitor uses a module listed above it, which is the healthy direction.
Issue_2561_TransactionMonitor uses LiteDB.ReproRunner.Shared, so a change to LiteDB.ReproRunner.Shared can break Issue_2561_TransactionMonitor, while a change to Issue_2561_TransactionMonitor can't break LiteDB.ReproRunner.Shared.
Position
Below the diagonal: Issue_2561_TransactionMonitor uses a module listed above it, which is the healthy direction.
Issue_2614_DiskServiceDispose uses LiteDB.ReproRunner.Shared.Messaging, so a change to LiteDB.ReproRunner.Shared.Messaging can break Issue_2614_DiskServiceDispose, while a change to Issue_2614_DiskServiceDispose can't break LiteDB.ReproRunner.Shared.Messaging.
Position
Below the diagonal: Issue_2614_DiskServiceDispose uses a module listed above it, which is the healthy direction.
Issue_2614_DiskServiceDispose uses LiteDB.ReproRunner.Shared, so a change to LiteDB.ReproRunner.Shared can break Issue_2614_DiskServiceDispose, while a change to Issue_2614_DiskServiceDispose can't break LiteDB.ReproRunner.Shared.
Position
Below the diagonal: Issue_2614_DiskServiceDispose uses a module listed above it, which is the healthy direction.
LiteDB.Engine uses LiteDB.Client.Coordinated, so a change to LiteDB.Client.Coordinated can break LiteDB.Engine, while a change to LiteDB.Engine can't break LiteDB.Client.Coordinated.
Position
Below the diagonal: LiteDB.Engine uses a module listed above it, which is the healthy direction.
209 pairs of types, where a type in LiteDB.Engine uses a type in LiteDB. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
LiteDB.ReproRunner.Cli.Commands uses LiteDB.ReproRunner.Cli.Manifests, so a change to LiteDB.ReproRunner.Cli.Manifests can break LiteDB.ReproRunner.Cli.Commands, while a change to LiteDB.ReproRunner.Cli.Commands can't break LiteDB.ReproRunner.Cli.Manifests.
Position
Below the diagonal: LiteDB.ReproRunner.Cli.Commands uses a module listed above it, which is the healthy direction.
LiteDB.ReproRunner.Cli.Commands uses LiteDB.ReproRunner.Cli.Execution, so a change to LiteDB.ReproRunner.Cli.Execution can break LiteDB.ReproRunner.Cli.Commands, while a change to LiteDB.ReproRunner.Cli.Commands can't break LiteDB.ReproRunner.Cli.Execution.
Position
Below the diagonal: LiteDB.ReproRunner.Cli.Commands uses a module listed above it, which is the healthy direction.
LiteDB.ReproRunner.Cli.Commands uses LiteDB.ReproRunner.Cli.Infrastructure, so a change to LiteDB.ReproRunner.Cli.Infrastructure can break LiteDB.ReproRunner.Cli.Commands, while a change to LiteDB.ReproRunner.Cli.Commands can't break LiteDB.ReproRunner.Cli.Infrastructure.
Position
Below the diagonal: LiteDB.ReproRunner.Cli.Commands uses a module listed above it, which is the healthy direction.
LiteDB.Client.Shared uses LiteDB.Engine, so a change to LiteDB.Engine can break LiteDB.Client.Shared, while a change to LiteDB.Client.Shared can't break LiteDB.Engine.
Position
Below the diagonal: LiteDB.Client.Shared uses a module listed above it, which is the healthy direction.
24→25 LiteDB.Client.Shared uses LiteDBpart of a loop✕
Connections
4 pairs of types, where a type in LiteDB.Client.Shared uses a type in LiteDB.
Issue_2586_RollbackTransaction uses LiteDB.ReproRunner.Shared.Messaging, so a change to LiteDB.ReproRunner.Shared.Messaging can break Issue_2586_RollbackTransaction, while a change to Issue_2586_RollbackTransaction can't break LiteDB.ReproRunner.Shared.Messaging.
Position
Below the diagonal: Issue_2586_RollbackTransaction uses a module listed above it, which is the healthy direction.
Issue_2586_RollbackTransaction uses LiteDB.ReproRunner.Shared, so a change to LiteDB.ReproRunner.Shared can break Issue_2586_RollbackTransaction, while a change to Issue_2586_RollbackTransaction can't break LiteDB.ReproRunner.Shared.
Position
Below the diagonal: Issue_2586_RollbackTransaction uses a module listed above it, which is the healthy direction.
Issue_2586_RollbackTransaction uses LiteDB, so a change to LiteDB can break Issue_2586_RollbackTransaction, while a change to Issue_2586_RollbackTransaction can't break LiteDB.
Position
Below the diagonal: Issue_2586_RollbackTransaction uses a module listed above it, which is the healthy direction.
LiteDB.Benchmarks.Benchmarks uses LiteDB, so a change to LiteDB can break LiteDB.Benchmarks.Benchmarks, while a change to LiteDB.Benchmarks.Benchmarks can't break LiteDB.
Position
Below the diagonal: LiteDB.Benchmarks.Benchmarks uses a module listed above it, which is the healthy direction.
LiteDB.Internals uses LiteDB.Engine, so a change to LiteDB.Engine can break LiteDB.Internals, while a change to LiteDB.Internals can't break LiteDB.Engine.
Position
Below the diagonal: LiteDB.Internals uses a module listed above it, which is the healthy direction.
LiteDB.Tests.Engine uses LiteDB.Engine, so a change to LiteDB.Engine can break LiteDB.Tests.Engine, while a change to LiteDB.Tests.Engine can't break LiteDB.Engine.
Position
Below the diagonal: LiteDB.Tests.Engine uses a module listed above it, which is the healthy direction.
VectorCompatibility.Current uses LiteDB, so a change to LiteDB can break VectorCompatibility.Current, while a change to VectorCompatibility.Current can't break LiteDB.
Position
Below the diagonal: VectorCompatibility.Current uses a module listed above it, which is the healthy direction.
LiteDB.Benchmarks.Benchmarks.Deletion uses LiteDB.Benchmarks.Models, so a change to LiteDB.Benchmarks.Models can break LiteDB.Benchmarks.Benchmarks.Deletion, while a change to LiteDB.Benchmarks.Benchmarks.Deletion can't break LiteDB.Benchmarks.Models.
Position
Below the diagonal: LiteDB.Benchmarks.Benchmarks.Deletion uses a module listed above it, which is the healthy direction.
LiteDB.Benchmarks.Benchmarks.Deletion uses LiteDB, so a change to LiteDB can break LiteDB.Benchmarks.Benchmarks.Deletion, while a change to LiteDB.Benchmarks.Benchmarks.Deletion can't break LiteDB.
Position
Below the diagonal: LiteDB.Benchmarks.Benchmarks.Deletion uses a module listed above it, which is the healthy direction.
LiteDB.Benchmarks.Benchmarks.Deletion uses LiteDB.Benchmarks.Benchmarks, so a change to LiteDB.Benchmarks.Benchmarks can break LiteDB.Benchmarks.Benchmarks.Deletion, while a change to LiteDB.Benchmarks.Benchmarks.Deletion can't break LiteDB.Benchmarks.Benchmarks.
Position
Below the diagonal: LiteDB.Benchmarks.Benchmarks.Deletion uses a module listed above it, which is the healthy direction.
LiteDB.Benchmarks.Benchmarks.Insertion uses LiteDB.Benchmarks.Models, so a change to LiteDB.Benchmarks.Models can break LiteDB.Benchmarks.Benchmarks.Insertion, while a change to LiteDB.Benchmarks.Benchmarks.Insertion can't break LiteDB.Benchmarks.Models.
Position
Below the diagonal: LiteDB.Benchmarks.Benchmarks.Insertion uses a module listed above it, which is the healthy direction.
LiteDB.Benchmarks.Benchmarks.Insertion uses LiteDB, so a change to LiteDB can break LiteDB.Benchmarks.Benchmarks.Insertion, while a change to LiteDB.Benchmarks.Benchmarks.Insertion can't break LiteDB.
Position
Below the diagonal: LiteDB.Benchmarks.Benchmarks.Insertion uses a module listed above it, which is the healthy direction.
LiteDB.Benchmarks.Benchmarks.Insertion uses LiteDB.Benchmarks.Benchmarks, so a change to LiteDB.Benchmarks.Benchmarks can break LiteDB.Benchmarks.Benchmarks.Insertion, while a change to LiteDB.Benchmarks.Benchmarks.Insertion can't break LiteDB.Benchmarks.Benchmarks.
Position
Below the diagonal: LiteDB.Benchmarks.Benchmarks.Insertion uses a module listed above it, which is the healthy direction.
LiteDB.Benchmarks.Benchmarks.Queries uses LiteDB.Benchmarks.Models, so a change to LiteDB.Benchmarks.Models can break LiteDB.Benchmarks.Benchmarks.Queries, while a change to LiteDB.Benchmarks.Benchmarks.Queries can't break LiteDB.Benchmarks.Models.
Position
Below the diagonal: LiteDB.Benchmarks.Benchmarks.Queries uses a module listed above it, which is the healthy direction.
LiteDB.Benchmarks.Benchmarks.Queries uses LiteDB, so a change to LiteDB can break LiteDB.Benchmarks.Benchmarks.Queries, while a change to LiteDB.Benchmarks.Benchmarks.Queries can't break LiteDB.
Position
Below the diagonal: LiteDB.Benchmarks.Benchmarks.Queries uses a module listed above it, which is the healthy direction.
LiteDB.Benchmarks.Benchmarks.Queries uses LiteDB.Benchmarks.Benchmarks, so a change to LiteDB.Benchmarks.Benchmarks can break LiteDB.Benchmarks.Benchmarks.Queries, while a change to LiteDB.Benchmarks.Benchmarks.Queries can't break LiteDB.Benchmarks.Benchmarks.
Position
Below the diagonal: LiteDB.Benchmarks.Benchmarks.Queries uses a module listed above it, which is the healthy direction.
LiteDB.Fuzz.Targets uses LiteDB.Tests.Mapper, so a change to LiteDB.Tests.Mapper can break LiteDB.Fuzz.Targets, while a change to LiteDB.Fuzz.Targets can't break LiteDB.Tests.Mapper.
Position
Below the diagonal: LiteDB.Fuzz.Targets uses a module listed above it, which is the healthy direction.
LiteDB.Fuzz.Targets uses LiteDB.Vector, so a change to LiteDB.Vector can break LiteDB.Fuzz.Targets, while a change to LiteDB.Fuzz.Targets can't break LiteDB.Vector.
Position
Below the diagonal: LiteDB.Fuzz.Targets uses a module listed above it, which is the healthy direction.
LiteDB.Fuzz.Targets uses LiteDB.Engine, so a change to LiteDB.Engine can break LiteDB.Fuzz.Targets, while a change to LiteDB.Fuzz.Targets can't break LiteDB.Engine.
Position
Below the diagonal: LiteDB.Fuzz.Targets uses a module listed above it, which is the healthy direction.
LiteDB.Fuzz.Targets uses LiteDB.Client.Shared, so a change to LiteDB.Client.Shared can break LiteDB.Fuzz.Targets, while a change to LiteDB.Fuzz.Targets can't break LiteDB.Client.Shared.
Position
Below the diagonal: LiteDB.Fuzz.Targets uses a module listed above it, which is the healthy direction.
80 pairs of types, where a type in LiteDB.Fuzz.Targets uses a type in LiteDB. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
95 pairs of types, where a type in LiteDB.Fuzz.Targets uses a type in LiteDB.Fuzz. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
LiteDB.Fuzz.Targets uses LiteDB.Fuzz, so a change to LiteDB.Fuzz can break LiteDB.Fuzz.Targets, while a change to LiteDB.Fuzz.Targets can't break LiteDB.Fuzz.
Position
Below the diagonal: LiteDB.Fuzz.Targets uses a module listed above it, which is the healthy direction.
27 pairs of types, where a type in LiteDB.Shell.Commands uses a type in LiteDB.Shell. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
LiteDB.Shell.Commands uses LiteDB.Shell, so a change to LiteDB.Shell can break LiteDB.Shell.Commands, while a change to LiteDB.Shell.Commands can't break LiteDB.Shell.
Position
Below the diagonal: LiteDB.Shell.Commands uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 47% · Weak · gated by D2, X1 ·
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
A05:2025 — Injection
127
High / Critical
A03:2025 — Software Supply Chain Failures
12
High / Critical
A07:2025 — Authentication Failures
6
High / Critical
Roadmap
First, secure password storage by implementing salted key derivation functions and constant-time comparison, beginning in the AesEncryption module. Next, address explicit code debt by resolving empty catch blocks, suppressing warnings in project files, and removing file-scoped pragma disables. Finally, eliminate sync-over-async patterns to prevent potential deadlocks and improve concurrency safety.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Resolve the 6 FileScopedPragmaDisable finding(s) in Explicit Debt — start with CoordinatorHarness.cs, CoordinatorPlatform_Tests.cs, CoordinatorSafety_Tests.cs.
Store passwords with a salted KDF — `Microsoft.AspNetCore.Identity.PasswordHasher<T>`, `Rfc2898DeriveBytes` (PBKDF2), or BCrypt/Argon2 — and compare with `CryptographicOperations.FixedTimeEquals`. (A fast/plain hash, or a client-hashed value stored and compared verbatim, is not password storage.) Start in `LiteDB/Engine/FileReader/Legacy/AesEncryption.cs:74`.
Every finding carries one of four grades. Three say how serious it is. The fourth says this
survey could not settle it — and it is a grade, not a gap.
Critical — 269
A definite problem that already costs you something and drags the score down: a
missing authorisation check, a dependency with a known exploit, a build that does not reproduce. Failure here
tends to cause failures elsewhere.
Serious — 712
Likely wrong, but not failing yet. It degrades
the codebase over a longer horizon and can cause failures elsewhere — not urgent this week, not something to
carry for two years either.
Minor — 154
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 2
Something this survey could not settle
from the outside, and which could be critical or serious. Either a control was required and no
positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves
nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean
result. These are excluded from the score rather than awarded a pass, so the number on the cover neither
rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each
one is named under Limitations.
Methodology & how to trust this report
Watchdog is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. 73 of 77 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.9 — 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 — 77 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, 1096 of 1135 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D11 Test Reliability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test reliability not included — no test tier completed within its budget.
D22 Internal API Consistency — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. The loaded project set declares no packable project and no `.Contracts` project, so there is no intentionally-exposed surface for API consistency to be judged over.
D23 Boundary Type-Coupling — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Large codebase (77,359 production LoC in the .NET projects) with no declared bounded contexts — cross-boundary type coupling is unassessed Bounded contexts cannot be inferred from a codebase that is not physically organised by them (D-321), so with none declared there are no boundaries for the coupling pass to measure across. You can widen what we reach: name this codebase's bounded contexts (≥2 module groups, e.g. per subsystem) so cross-boundary type coupling can be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D32 Data Compliance (PII/GDPR) — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `LiteDB.Fuzz/FuzzOptions.cs`, `LiteDB/Client/SqlParser/Commands/Insert.cs`, `LiteDB/Document/BsonVector.cs`, `LiteDB/Document/ObjectId.cs`, `LiteDB/Engine/Query/IndexQuery/VectorIndexQuery.cs` produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
X3 Exception handling — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 73 further occurrence(s) are not listed individually; the score already reflects all 113.
Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.
Limitations & what we did not check
Watchdog assesses the repository exactly as committed, and only the repository. By design it does not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D8 Code Coverage: Coverage is measured by building and running the test suite inside Watchdog's isolated image — the target repo is never modified, and nothing on your systems runs. So coverage exists only when the suite builds and runs within the inline time budget; one that needs external services, can't build, or exceeds the budget yields no coverage (D8 then degrades to not-measured, not a low score). Line coverage also says nothing about assertion quality.
D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
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 REDACTED Scanning: REDACTED detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D18 Solution Shape: Build integrity reflects whether the solution compiled in this environment — a build that needs a private feed, a specific SDK, or a generated file absent from the repo can read as broken when it is merely unreproducible here.
D19 Documentation Quality: Documentation quality is judged by an LLM over a bounded sample of docs — it reads what is written, not whether the docs match the running system, and it is advisory, not a measurement. Its critique rows are drawn from a closed category vocabulary and each row means the same thing in every run, so two scans can be compared row by row; the SET that fires is still a sample, and does not repeat exactly. Measured on one frozen input, six scans at one engine SHA: 2-5 critique rows per scan, 8 distinct rows across the six, 3 of those 8 seen in only one scan. So a D19 row is evidence about the documentation, but a COUNT of D19 rows is not a quantity — never read a change in it as an improvement or a regression.
D20 ADR Quality: ADR quality is an LLM read of the decision records present — it cannot know about decisions made and never recorded, and its verdict is sampled and advisory.
D21 Naming Consistency: Naming quality is an LLM judgement over a bounded sample — it assesses clarity/consistency of the names it sees, not domain-correctness, and is advisory.
D24 Comment Value: Comment value (WHY vs WHAT) is an LLM judgement over a bounded sample — it is advisory and cannot weigh a comment against the precise code change it was written to explain.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a Dockerfile (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
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.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.
The LLM boundary
LLM-set scores this run (4): D19, D21, D24, M4 (model: Local LLM). For these, a model reads a bounded sample and sets the numeric score; each names its own sample and method on its card. They are sampled and advisory by design: they vary at the margins between runs and are never a deterministic measurement. Every other score in this report is tool-computed at confidence 1.0.
What it measures: How tangled the control flow is — methods with many branches are hard to test and change.
Method: Cyclomatic complexity per method (1 + decision points), computed exhaustively across production source; test projects separated by convention. Deterministic.
113 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was ManifestValidator.Validate at 82. A further 31 method(s) were over the threshold but excluded as flat dispatchers (a long switch/match over independent cases: many branches, almost no nesting), the largest being BooleanRangeWorkloads.Run at 38 — they are counted neither in the figure above nor in this dimension's score. 23 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: tools/QueryOptimizationBenchmarks/BooleanRangeWorkloads.cs (BooleanRangeWorkloads.Run at 38), tools/QueryOptimizationBenchmarks/DisjunctionPlanningWorkloads.cs (DisjunctionPlanningWorkloads.Run at 36), LiteDB/Client/Mapper/Linq/TypeResolver/EnumerableResolver.cs (EnumerableResolver.ResolveMethod at 35), tools/QueryOptimizationBenchmarks/BooleanMembershipWorkloads.cs (BooleanMembershipWorkloads.Run at 35), tools/QueryOptimizationBenchmarks/IncludedBooleanWorkloads.cs (IncludedBooleanWorkloads.Run at 34), and 18 more not listed here. They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.
+ 108 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 1 body over 60 down to 60 or less in Cyclomatic Complexity — start with ManifestValidator.Validate (cyclomatic 82). — Refactoring it lifts Cyclomatic Complexity from 6.2 to about 6.5/10.
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.
+ 186 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 1 body over 120 down to 120 or less in Cognitive Complexity — start with ManifestValidator.Validate (cognitive 173). — Refactoring it lifts Cognitive Complexity from 4.0 to about 4.6/10.
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.4 / 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 19 TooManyMethods finding(s) in God Classes — start with DataTypes.cs, SharedEngine.cs, LiteEngine.cs. — One of this dimension's main actionable groups (19 warning-level).
Resolve the 8 MethodTooLong finding(s) in God Classes — start with RunCommand.cs (2), REDACTED (2), ManifestValidator.cs. — One of this dimension's main actionable groups (8 warning-level).
Resolve the 1 ClassTooLong finding(s) in God Classes — start with RunCommand.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.
41 duplicated block group(s) detected. A further 2 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted.
+ 18 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 5 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with WalIndexService.Snapshot.cs, Index.cs, ContentionBenchmarks.cs. — One of this dimension's main actionable groups (5 warning-level).
Resolve the 5 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with REDACTED (2), Update.cs, DateTimeResolver.cs. — One of this dimension's main actionable groups (5 warning-level).
Resolve the 4 Duplicated block (10 lines × 2) finding(s) in Code Duplication — start with ContentionBenchmarks.cs, SharedEngine.Query.cs, BsonExpressionFactory.Path.cs. — One of this dimension's main actionable groups (4 warning-level).
Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D5 · Coupling10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.
Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.
Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.
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.
What it measures: How much of the code is actually exercised by tests.
Method: Coverage from coverlet runs or committed reports (Cobertura/OpenCover/lcov), computed per-file with structured exclusions for generated, trivial, and glue code. When the suite can't be built/run in-image AND no report is committed, coverage is reported NOT-MEASURED (excluded from the score) with the precondition to make it measurable — never a LoC-ratio proxy folded in as if measured. Deterministic.
No test project references QueryOptimizationBenchmarkstools/QueryOptimizationBenchmarks/QueryOptimizationBenchmarks.csproj
No test project references LiteDB.ShellLiteDB.Shell/LiteDB.Shell.csproj
No test project references LiteDB.Demo.Tools.VectorSearchLiteDB.Demo.Tools.VectorSearch/LiteDB.Demo.Tools.VectorSearch.csproj
+ 25 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 18 Low coverage finding(s) in Code Coverage — start with ReproConfigurationReporter.cs, ReproContext.cs, ReproHostClient.cs. — One of this dimension's main actionable groups (18 warning-level).
Resolve the 3 CRAP 72 finding(s) in Code Coverage — start with ListCommand.cs (2), ReproBuildCoordinator.cs. — One of this dimension's main actionable groups (3 warning-level).
Resolve the 1 No test project references QueryOptimizationBenchmarks finding(s) in Code Coverage — start with QueryOptimizationBenchmarks.csproj. — One of this dimension's main actionable groups (1 warning-level).
Enforce Code Coverage in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d8_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D9 · Test 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.
8833 test methods: 8833 unit, 0 integration, 0 BDD, 0 e2e. The Python suite contributes 4 test function(s) across 1 file(s) declaring at least one — every `def test…` in a file pytest or unittest would collect, which is those frameworks' own definition of a case; a parametrize table counts once, so this is a floor. Its tier split is read from file names and paths only.
✓ On the Gold path — maintain.
Detailed fixes: d9_recommendation.md.
Do you agree with this assessment?
D10 · Test Quality10.0 / 10Stronggated by 10 serious findings✓ 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.
5 skipped (5 with a documented reason), 5 zero-assertion, 4 synchronised by a fixed sleep, 1 racing the wall clock, no mocking-framework packages referenced (hand-written doubles or no mocking) across 2186 tests.
No assertions: BsonDocument_Inner · ×5LiteDB.Tests/Document/Implicit_Tests.cs:30
Resolve the 5 No assertions finding(s) in Test Quality — start with Implicit_Tests.cs, BufferWriter_Tests.cs, Disk_Tests.cs. — One of this dimension's main actionable groups (5 warning-level).
Resolve the 4 Fixed-sleep synchronisation finding(s) in Test Quality — start with SharedTeardownOverlap_Tests.cs (2), SharedFinalClose_Tests.cs, Cache_Tests.cs. — One of this dimension's main actionable groups (4 warning-level).
Resolve the 1 Races the wall clock finding(s) in Test Quality — start with Select_Tests.cs. — One of this dimension's main actionable groups (1 warning-level).
Enforce Test Quality in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d10_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
Resolve the 5 Deprecated finding(s) in Dependency Hygiene — start with LiteDB.Tests.csproj (3), REDACTED, LiteDB.Fuzz.Tests.csproj. — One of this dimension's main actionable groups (5 warning-level).
Resolve the 1 Outdated finding(s) in Dependency Hygiene — start with REDACTED. — One of this dimension's main actionable groups (1 recommendation-level).
Enforce Dependency Hygiene in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d12_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
0 of 184 packages use a banned license. ★ DEPTH: this repository's MSBuild projects declare 20 direct `PackageReference`(s), and 150 further package(s) were reached beyond them by closing the graph over nuget.org's own nuspec dependency graph — so a banned licence pulled in only by a dependency's OWN dependencies is inside this verdict. A package whose licence nuget.org could not be asked for is not graded, and version ranges are taken at their lower bound, so this is the closure as that graph states it rather than a restored consumer's exact resolution.
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.
Top hotspots: LiteDB/Engine/Query/Pipeline/QueryPipe.cs (9×53=477); LiteDB/Client/Mapper/BsonMapper.Serialize.cs (7×42=294); LiteDB/Client/Mapper/BsonMapper.Deserialize.cs (9×30=270) Repeated repair below the complexity floor: LiteDB/Engine/Query/QueryExecutor.cs (3 of 5 changes were fixes); LiteDB/Document/BsonDocument.cs (3 of 4 changes were fixes); LiteDB/Document/Expression/Parser/BsonExpressionOperators.cs (3 of 4 changes were fixes)
Resolve the 32 Hotspot finding(s) in Churn × Complexity Hotspots — start with REDACTED (2), QueryPipe.cs, BsonMapper.Serialize.cs. — One of this dimension's main actionable groups (32 warning-level).
Resolve the 4 Repeated repair finding(s) in Churn × Complexity Hotspots — start with QueryExecutor.cs, BsonDocument.cs, BsonExpressionOperators.cs. — One of this dimension's main actionable groups (4 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D16 · Bus Factor6.6 / 10Adequate✓ Tool-verified
What it measures: Whether knowledge is concentrated in too few people (the "bus factor").
Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.
141 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is LiteDB/Engine/Pages/BasePage.cs. Counted over 417 of the 708 production source files in this repository: 281 are under the ~2,400-byte size floor this dimension measures over, and the remaining 10 have no attributable history left to measure.
Off-boarding risk: anonymized user #1
Further sole-owners (lower concentration)
What to do
Resolve the 1 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).
Resolve the 1 Further sole-owners (lower concentration) finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d16_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
Dead code: FlushLog · ×46LiteDB/Engine/Disk/DiskService.Checkpoint.cs:17
+ 4 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 111 EmptyCatchBlock finding(s) in Explicit Debt — start with CoordinatorHost.cs (11), FuzzProcessRunner.cs (6), ConflictFuzzer.cs (6). — One of this dimension's main actionable groups (111 issue-level).
Resolve the 14 NoWarnInCsproj finding(s) in Explicit Debt — start with LiteDB.csproj (5), LiteDB.Tests.csproj (5), LiteDB.Shell.csproj (4). — One of this dimension's main actionable groups (14 issue-level).
Resolve the 6 FileScopedPragmaDisable finding(s) in Explicit Debt — start with CoordinatorHarness.cs, CoordinatorPlatform_Tests.cs, CoordinatorSafety_Tests.cs. — One of this dimension's main actionable groups (6 issue-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.
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.
22 projects, 4396 source files, 147558 hand-written lines of code (71546 production / 76012 test — the split is derived per file: test is what its project, its own path, or a compile-guarded region marks as test, and a file carrying no test signal counts as production), 18 inter-project edges.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic doc sample (READMEs plus first 25 architecture docs), with two-pass stability filtering. Advisory, sampled.
The repository's READMEs and architecture/design docs are complete: the 69 documents listed cover every project in the set (from LiteDB.ReproRunner/Repros to LiteDB.Stress), with no missing overview, installation, usage, or contribution guidance for the root level. The XML-doc coverage is low (<20%) across most projects but high on the fixed-repro runner and shared teardown proof docs, reflecting a focused documentation effort. The repository has a strong documentation set: 15 READMEs plus 54 architecture/design docs (covering v8/v9 header publication, checkpointing, and the cross-thread cursor disposal fix) plus XML coverage of 67% LiteDB.ReproRunner.Cli to 100% LiteDB.Fuzz.Legacy. The visible content is clear and complete for its scope: each README explains what it contains (e.g., the explicit transaction thread-ownership doc says exactly what the project does, not just that it exists). (10 of 25 sampled documents could not be assessed: 1 of 3 evaluation groups failed.)
Documentation: contradicts the code · ×2docs/checksum-merge-review.md
Detailed fixes: d19_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D20 · ADR Quality0.0 / 10Critical✓ Tool-verified
What it measures: Whether architecture decisions are recorded well (context, decision, consequences).
Method: Per-ADR judgment by language model at low temperature with two-pass stability; confidence is share of ADRs evaluated; enforcement-field presence detected deterministically. Advisory.
What it measures: Whether names — types, methods, variables — are clear and consistent.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic random symbol sample (fixed size, not exhaustive), with disclosed confidence band. Advisory, sampled.
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 ValueExemplary◐ 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.
0 of 37 projects flagged as possibly oversized/incoherent.
✓ On the Gold path — maintain.
Detailed fixes: d26_recommendation.md.
Do you agree with this assessment?
D27 · Navigability6.6 / 10Adequate✓ Tool-verified
What it measures: How far you must trace to follow a call — low indirection and co-located slices read easier.
Method: Call indirection (interface hops, cross-namespace calls, slice-locality scaled) over a sampled set of method invocations, size-aware baseline. Sampled; confidence discounted by symbol-resolution gaps. C# also names each pass-through layer (a class whose every public method only forwards its own parameters to one collaborator) as a located finding; the score is not affected.
Coverage: Slice locality from the first namespace segments, SAMPLED (≤400 methods) — not exhaustive.
39 % of calls cross a namespace and 16 % go through an interface, but 84 % of collaborators are co-located — so a call's collaborators sit together and tracing stays easy. Baseline: large — vertical-slice locality expected.
What to do
Improve Navigability — currently 6.6/10. — 39 % of calls cross a namespace and 16 % go through an interface, but 84 % of collaborators are co-located — so a call's collaborators sit together and tracing stays easy. Baseline: large — vertical-slice locality expected.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: REDACTED scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.
5 finding(s): 0 critical, 5 high, 0 medium, 0 low. Remediation for historically-committed secrets is credential rotation — they remain in history regardless of later deletion.
REDACTED
REDACTED
REDACTED
What to do
Resolve the 4 High secret finding(s) in Secrets (history) — start with REDACTED (2), REDACTED, REDACTED. — One of this dimension's main actionable groups (4 issue-level).
Resolve the 1 REDACTED finding(s) in Secrets (history) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 1 Rotate the exposed credentials finding(s) in Secrets (history). — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d28_recommendation.md · top locations in Appendix A, every location in findings.md.
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).
127 finding(s): 0 critical, 119 high, 8 medium, 0 low. 109 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 14 file(s) — `LiteDB.Fuzz/FuzzOptions.cs` (line 135), `LiteDB.Tests/Database/RepositoryIdLookup_Tests.cs` (line 22), `LiteDB.Tests/Expressions/DoubleConstantSource_Tests.cs` (line 27, line 28, line 30, …), `LiteDB.Tests/Issues/Issue2583OrderAlias_Tests.cs` (line 38, line 39), `LiteDB.Tests/Issues/Issue2805_Tests.cs` (lines 8–347), … (+9 more) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. In 1 of those file(s) — `LiteDB/Document/BsonVector.cs` — the break is a C# primary constructor, which semgrep's grammar cannot parse and which hides the type from every rule scoped to it; those files were re-scanned from a shadow copy with the constructor's parameter list blanked (line and column preserving), which restores the type to the rules, and 0 additional row(s) came from that pass. Only the header's own parameter list is unread in them. In 1 of those file(s) — `LiteDB.Tests/Issues/Issue2805_Tests.cs` — the break is at a TYPE DECLARATION (a C# primary constructor semgrep's grammar cannot parse), so the loss is wider than the named lines: rules scoped to that type see no type to scope to and are blind over its whole body, while rules matching statements keep working there. Absence of a type-scoped finding in those types is not evidence of anything. Separately, one or more rules could not re-parse an embedded snippet in 5 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
+ 4 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 5 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (2), REDACTED (2), REDACTED. — One of this dimension's main actionable groups (5 issue-level).
Resolve the 3 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (2), REDACTED. — One of this dimension's main actionable groups (3 issue-level).
No action in Static Analysis (SAST) — all 109 REDACTED finding(s) are reported here at file:line but scored by D36 (supply-chain provenance), so none is charged to this dimension. — One of this dimension's main actionable groups (109 issue-level, 0 of them charged here).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.
Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05.
Resolve the 2 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (2). — One of this dimension's main actionable groups (2 issue-level).
Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
36 of 427 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is ConsoleApp1/Tools/Faker.Names.cs. Counted over 427 of the 708 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Resolve the 3 Orphaned knowledge finding(s) in Knowledge Freshness — start with Faker.Names.cs, MimeTypeConverter.cs, Tokenizer.cs. — One of this dimension's main actionable groups (3 issue-level).
Resolve the 33 Orphaned file finding(s) in Knowledge Freshness — start with DataTypes.cs, LiteRepository.cs, ILiteCollection.cs. — One of this dimension's main actionable groups (33 recommendation-level).
Resolve the 1 Further orphaned files (smaller) 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. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.
Resolve the 3 Change coupling finding(s) in Change Coupling — start with BufferReader.cs, DataService.cs, IndexVirtual.cs. — One of this dimension's main actionable groups (3 warning-level).
Resolve the 1 Change-coupling hub finding(s) in Change Coupling — start with StreamFactory.cs. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d35_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
+ 4 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 2 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d36_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D39 · IL Efficiency9.6 / 10Exemplary✓ Tool-verified
Method: IL instruction count per method, read from the BUILT first-party assemblies via Mono.Cecil (the target is compiled on a deep run); scored on the fraction of methods whose emitted IL body exceeds the size threshold. Sees compiler-generated bloat source can't; not-applicable when the target fails to build. Deterministic.
What it measures: Whether anyone still ships security patches for the platform this repository RUNS ON — the runtime it pins and the framework majors its own constraints hold it to. Separate from D12 because the question differs: a current Django on an end-of-life Python is perfectly up to date and completely unsupported, and the fix is a migration rather than a version bump. What the repository says it merely SUPPORTS is never charged.
Method: End-of-life PLATFORM read from the repository's own declarations and graded against a FROZEN, dated table of vendor support dates — no network, no feed, no API, so this dimension answers identically inside a closed scan fence. Two subjects: a RUNTIME the project pins (a single or all-end-of-life TargetFramework, a .nvmrc or .python-version, a requires-python CAP) and a FRAMEWORK major a dependency constraint cannot move off (a caret, tilde or exact version; `vue@^2.7.16` pins Vue 2). A FLOOR is deliberately never charged — `requires-python = ">=3.8"` states what a package SUPPORTS, not what it runs on — and a multi-target project is charged only when EVERY target is out of support. Runtime 4.0/product capped 8.0, framework 1.5 capped 4.5. The table is safe to freeze because a statement about support that ended in the past cannot become false: it loses recall as it ages, never precision, and a test asserts every entry predates the freeze date. Disjoint from D31 (a container image's OS layer) and D29 (the toolchain a CI workflow installs). Abstains when the repository declares no platform this pass reads — never scores it clean.
0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 37 platform declaration(s) and 0 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.
Other · Architecture — Whether any singleton service captures a scoped/transient dependency — a silent lifetime/threading bug.
Method: Roslyn scan: DI registrations parsed from AddSingleton/Scoped/Transient; each singleton checked for captured shorter-lifetime dependencies. Exhaustive, deterministic.
Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does.
Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.
Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.
What to do
The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all — so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.
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.
The namespaces LiteDB ↔ LiteDB.Client.Coordinated ↔ LiteDB.Client.Shared ↔ LiteDB.Engine ↔ LiteDB.Vector depend on each other. The lightest dependency in the cycle is LiteDB.Client.Coordinated → LiteDB.Client.Shared (LiteDB.Client.Coordinated.CoordinatorClient → LiteDB.Client.Shared.SharedReaderRegistry, 1 type pair(s)); cut that one first, e.g. by moving the shared type to a namespace both can use or inverting it behind an interface. — LiteDB/Client/Coordinated/CoordinatorClient.cs:7
What to do
Break namespace cycles inside a project by moving the shared type to a namespace both sides can use, or by inverting the back edge behind an interface.
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 declared-member counts (accessors fold into their property/event); fat-interface threshold (over 15 declared members) flagged per type. Each finding also reports the distinct-OPERATION count — members counted by name, so an overload group counts once — which decides whether it states the caller-side ISP harm or the implementer-side burden of an overload set. TypeScript: exported interfaces that declare behaviour, counted over their REQUIRED operations (method signatures and function-typed properties with no `?`, once per signature) — data-shape interfaces and ambient .d.ts declarations are outside the population; JavaScript declares no interfaces and is not applicable. Deterministic, type-level.
`ILiteCollection<T>` declares 62 members: `Name`, `AutoId`, `EntityMapper`, `Include`, `Include`, `Upsert`, `Upsert`, `Upsert`, `Update`, `Update`, `Update`, `UpdateMany`, `UpdateMany`, `Insert`, `Insert`, `Insert`, `InsertBulk`, `EnsureIndex`, `EnsureIndex`, `EnsureIndex`, `EnsureIndex`, `DropIndex`, `Query`, `Find`, `Find`, `Find`, `FindById`, `FindOne`, `FindOne`, `FindOne`, `FindOne`, `FindOne`, `FindAll`, `Delete`, `DeleteAll`, `DeleteMany`, `DeleteMany`, `DeleteMany`, `DeleteMany`, `Count`, and 22 more. Counted as the author wrote them — a property is ONE member and its get/set accessors are not counted separately, and an event counts once. Those 62 declarations carry 24 distinct name(s), so part of the width is overloading rather than separate responsibilities — but 24 operations clears the >15 bar on its own, so the row is about responsibilities, not signatures. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — LiteDB/Client/Database/ILiteCollection.cs:7
`ILiteDatabase` declares 27 members: `Mapper`, `FileStorage`, `GetCollection`, `GetCollection`, `GetCollection`, `GetCollection`, `BeginTrans`, `Commit`, `Rollback`, `GetStorage`, `GetCollectionNames`, `CollectionExists`, `DropCollection`, `RenameCollection`, `Execute`, `Execute`, `Execute`, `Checkpoint`, `Rebuild`, `Pragma`, `Pragma`, `UserVersion`, `Timeout`, `UtcDate`, `LimitSize`, `CheckpointSize`, `Collation`. Counted as the author wrote them — a property is ONE member and its get/set accessors are not counted separately, and an event counts once. Those 27 declarations carry 21 distinct name(s), so part of the width is overloading rather than separate responsibilities — but 21 operations clears the >15 bar on its own, so the row is about responsibilities, not signatures. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — LiteDB/Client/Database/ILiteDatabase.cs:8
`ILiteQueryable<T>` declares 21 members under just 10 distinct name(s): `SingleOrDefaultById`, `Include`, `Include`, `Include`, `Where`, `Where`, `Where`, `Where`, `OrderBy`, `OrderBy`, `OrderByDescending`, `OrderByDescending`, `ThenBy`, `ThenBy`, `ThenByDescending`, `ThenByDescending`, `GroupBy`, `GroupBy`, `Having`, `Select`, `Select`. Counted as the author wrote them — a property is ONE member and its get/set accessors are not counted separately, and an event counts once. That is an OVERLOAD SET, not 21 separate responsibilities: a caller binds to 10 operation(s) and uses the overload it selected, so the Interface-Segregation harm does NOT apply on the caller's side and splitting this into role-interfaces would scatter one operation without relieving anything. The burden that does remain is the IMPLEMENTER's — all 21 signatures must be written and kept in step. Reduce it by collapsing overloads (optional or default parameters, or an options object) rather than by segregating the interface. — LiteDB/Client/Database/ILiteQueryable.cs:8
`ILiteQueryableResult<T>` declares 18 members: `Limit`, `Skip`, `Offset`, `ForUpdate`, `GetPlan`, `ExecuteReader`, `ToDocuments`, `ToEnumerable`, `ToList`, `ToArray`, `Into`, `First`, `FirstOrDefault`, `Single`, `SingleOrDefault`, `Count`, `LongCount`, `Exists`. Counted as the author wrote them — a property is ONE member and its get/set accessors are not counted separately, and an event counts once. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — LiteDB/Client/Database/ILiteQueryable.cs:39
`ILiteRepository` declares 33 members under just 15 distinct name(s): `Insert`, `Insert`, `Update`, `Update`, `Upsert`, `Upsert`, `Database`, `Insert`, `Insert`, `Update`, `Update`, `Upsert`, `Upsert`, `Delete`, `DeleteMany`, `DeleteMany`, `Query`, `EnsureIndex`, `EnsureIndex`, `EnsureIndex`, `EnsureIndex`, `SingleById`, `SingleOrDefaultById`, `Fetch`, `Fetch`, `First`, `First`, `FirstOrDefault`, `FirstOrDefault`, `Single`, `Single`, `SingleOrDefault`, `SingleOrDefault`. Counted as the author wrote them — a property is ONE member and its get/set accessors are not counted separately, and an event counts once. That is an OVERLOAD SET, not 33 separate responsibilities: a caller binds to 15 operation(s) and uses the overload it selected, so the Interface-Segregation harm does NOT apply on the caller's side and splitting this into role-interfaces would scatter one operation without relieving anything. The burden that does remain is the IMPLEMENTER's — all 33 signatures must be written and kept in step. Reduce it by collapsing overloads (optional or default parameters, or an options object) rather than by segregating the interface. — LiteDB/Client/Database/ILiteRepository.Collections.cs:5
`ILiteEngine` declares 19 members: `Checkpoint`, `Rebuild`, `BeginTrans`, `Commit`, `Rollback`, `Query`, `Insert`, `Update`, `UpdateMany`, `Upsert`, `Delete`, `DeleteMany`, `DropCollection`, `RenameCollection`, `EnsureIndex`, `EnsureVectorIndex`, `DropIndex`, `Pragma`, `Pragma`. Counted as the author wrote them — a property is ONE member and its get/set accessors are not counted separately, and an event counts once. Those 19 declarations carry 18 distinct name(s), so part of the width is overloading rather than separate responsibilities — but 18 operations clears the >15 bar on its own, so the row is about responsibilities, not signatures. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — LiteDB/Engine/ILiteEngine.cs:14
What to do
Split fat interfaces into focused role-interfaces so clients depend only on what they use.
Where the width is an overload set rather than separate responsibilities, collapse the overloads instead — segregating those relieves no caller.
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.
Do you agree with this assessment?
C2 · Access Controls7.0 / 10Strong✓ Tool-verified
Other · Security — Whether access is authorized by default — a framework authorization attribute/decorator or policy, or imperative guard methods (throw-on-violation) called from handlers.
Method: Roslyn scan: [Authorize] usage and authorization policies, plus imperative throw-on-violation guard methods detected via syntax. Deterministic.
Authorization IS enforced here (by imperative guard methods that throw on violation) — this is NOT a claim that the code is unprotected. What's missing is a NAMED rule set: the guards encode the access rules inline, so the rules can't be listed, reviewed or tested apart from the call sites that apply them. Recommendation, not a defect.
What to do
Name the access rules — give each one a named predicate/policy object your guards consult, so the rule set can be reviewed and unit-tested independently of the call sites that enforce it.
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. (×3) — LiteDB/Document/Expression/Methods/Misc.cs:160, LiteDB/Engine/Query/IndexQuery/IndexVirtual.cs:28, LiteDB.Benchmarks/Benchmarks/BenchmarkBase.cs:11
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.
Method: Roslyn syntax scan: incompleteness by code shape (constant-returning methods, async-never-await, #if false branches, guards that return what the code already falls through to, tests an earlier guard already decided, comparisons against NaN, skeleton types), not keyword-gated. Deterministic, code-shape heuristic.
Both arms of `latestBuild.Succeeded ? … : …` are `"[yellow]⏳[/]"`, so no input can make the condition matter. Implement the distinction that was intended, or drop the condition. — LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Commands/RunCommand.cs:452
`IIF` is a shipped member whose whole body throws NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface. — LiteDB/Document/Expression/Methods/Misc.cs:160
`Execute` is a shipped member whose whole body throws NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface. — LiteDB/Engine/Query/IndexQuery/IndexVirtual.cs:28
`Close` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it. — tools/SharedReadBenchmarks/HolderBenchmarks.cs:58
A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something. (×3) — LiteDB.Tests/Engine/Collation_Tests.cs:79, LiteDB.Tests/Engine/Rebuild_Tests.cs:166, LiteDB.Tests/Issues/Issue2127_Tests.cs:14
A test is skipped ("System.Text.Json is not supported on this target framework for this scenario.") — coverage that looks present but never runs in any gate. If it's an opt-in suite, document how it runs; otherwise re-enable or delete it. — LiteDB.Tests/Issues/Issue2298_Tests.cs:18
A test is skipped ("The report targets net8.0 and net10.0; .NET Framework retains the netstandard fallback contract.") — coverage that looks present but never runs in any gate. If it's an opt-in suite, document how it runs; otherwise re-enable or delete it. — LiteDB.Tests/Issues/Issue2909_Tests.cs:11
`SetLength`'s body only throws NotSupportedException — sometimes a deliberate contract, often an unfinished stub. Confirm it's intentional. — LiteDB/Client/Storage/LiteFileStream.cs:125
A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers). (×8) — LiteDB/Document/Expression/BsonExpressionFactory.Binary.cs:25, LiteDB/Document/Expression/Parser/BsonExpressionOperators.cs:187, LiteDB/Engine/Disk/DiskReader.cs:83, …
`Execute`'s body only throws NotSupportedException — sometimes a deliberate contract, often an unfinished stub. Confirm it's intentional. — LiteDB/Engine/Query/IndexQuery/VectorIndexQuery.cs:49
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.
Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
Add a README to the 25 of 37 project(s) that lack one — worth up to 1.4 pts.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
What to do
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Maturity · Maturity — Whether the repo is organised deliberately — src/test separation and consistent project naming.
Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.
Production code isn't grouped under a src/ folder — it's spread across several top-level directories, so there's no one place that says 'this is the product'.
Only 12/37 projects share a common root namespace — the code's module identity is inconsistent.
What to do
Group production code under src/ (or split deliberately, e.g. backend/ + frontend/) so production and tooling code aren't mixed at the root.
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.
LiteDB.Tests.SharedMutexHarness/README.md runs `dotnet run --project SharedMutexHarness/SharedMutexHarness.csproj`, but `SharedMutexHarness/SharedMutexHarness.csproj` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — LiteDB.Tests.SharedMutexHarness/README.md:8
docs/reprorunner.md names .NET 9, but the projects target .NET 8, 10. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/reprorunner.md:97
LiteDB.ReproRunner/Repros/Issue_2586_RollbackTransaction/README.md names the project `LiteDB.LiteException`, but no project, folder or namespace of that name exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — LiteDB.ReproRunner/Repros/Issue_2586_RollbackTransaction/README.md:4
What to do
Reconcile the README with reality: LiteDB.Tests.SharedMutexHarness/README.md runs `dotnet run --project SharedMutexHarness/SharedMutexHarness.csproj`, but `SharedMutexHarness/SharedMutexHarness.csproj` does not exist; docs/reprorunner.md names .NET 9, but the projects target .NET 8, 10; LiteDB.ReproRunner/Repros/Issue_2586_RollbackTransaction/README.md names the project `LiteDB.LiteException`, but no project, folder or namespace of that name exists.
Readiness · Readiness — Whether an automated pipeline builds and tests every change.
Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.
Do you agree with this assessment?
P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged
Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.
Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.
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, or a .NET security analyzer package (or `semgrep --config=auto`, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 99693 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
What to do
Add a SAST step to CI running what this repository's stack ships: CodeQL's csharp pack, or a .NET 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 automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.
Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.
Readiness · Performance — Whether the code protects its performance with benchmarks — a benchmark suite, allocation/memory measurement, and (ideally) a CI gate. Presence is credited as a bonus, never a deduction.
Method: Repo + source scan: BenchmarkDotNet referenced (csproj/source), [Benchmark]/[MemoryDiagnoser] attribute counts, and a benchmark step in CI; off .NET, the same ladder over Go testing.B, Rust criterion/#[bench]/divan, JMH/kotlinx-benchmark, pytest-benchmark/asv/pyperf, tinybench/mitata/vitest bench/benchmark.js and Swift package-benchmark — scored as a bonus ladder (absence is neutral, never a deduction). Deterministic, presence detection.
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.
Method: Production-source scan: density (per 1k LoC) of allocation-aware APIs — in .NET Span/Memory, ArrayPool/ObjectPool, stackalloc, ValueTask, value-type structs, IBufferWriter, string.Create, SkipLocalsInit; off .NET, with comments and strings blanked, Go's sync.Pool, preallocated slices/maps, Grow, strconv.Append* and buf[:0] reuse; the JVM's NIO buffer views, MemorySegment, primitive collections, pools and literal presizes (plus Kotlin primitive arrays and value classes, Scala AnyVal and @specialized); Swift's reserveCapacity, ContiguousArray, withUnsafe* access and ~Copyable. Activated off .NET on the same floor (400 lines, and benchmarks or 8 uses); Rust and garbage-collected scripting languages are not applicable. Reward-only. Deterministic, syntax/text detection.
What to do
Raise allocation-aware density on the hot paths — currently 105 use(s) across 79,662 production line(s) (~1.3/1k). More Span/Memory, pooling (ArrayPool/ObjectPool), stackalloc and ValueTask on the allocation-heavy paths climbs this toward 10.
Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.
Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from the language model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.
24 blocking call(s) on async work (.Wait()/.GetAwaiter().GetResult()) — these waste a thread and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
`_released.Wait()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one). (×2) — LiteDB/Client/Shared/SharedMutexOwner.cs:237, LiteDB/Client/Shared/SharedMutexPin.cs:201
`_done.Wait()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one). — LiteDB/Client/Shared/SharedMutexOwner.cs:350
`_acquired.Wait()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one). — LiteDB/Client/Shared/SharedMutexPin.cs:106
`.Wait()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one). — LiteDB/Utils/Extensions/IOExceptionExtensions.cs:37
`holdersReady.Wait()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one). — LiteDB.ReproRunner/Repros/Issue_2586_RollbackTransaction/Program.cs:89
`release.Wait()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one). — LiteDB.ReproRunner/Repros/Issue_2586_RollbackTransaction/Program.cs:158
`.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one). (×13) — LiteDB.ReproRunner/LiteDB.ReproRunner.Shared/Messaging/ReproHostClient.cs:124, LiteDB.ReproRunner/LiteDB.ReproRunner.Shared/Messaging/ReproHostClient.cs:135, LiteDB.ReproRunner/LiteDB.ReproRunner.Shared/Messaging/ReproHostClient.cs:145, …
`start.Wait()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one). (×2) — tools/MemoryProfiles/ProfileWorkload.cs:82, tools/MemoryValidation/MemoryWorkload.cs:74
`ready.Wait()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one). (×2) — tools/MemoryProfiles/ProfileWorkload.cs:92, tools/MemoryValidation/MemoryWorkload.cs:84
What to do
Make the call chain async end-to-end and await it — never block on a Task with .Wait()/.GetAwaiter().GetResult().
Other · Security — Cryptographic hygiene (weak hash/cipher, password key-derivation). This codebase has no web surface, so transport/header/cookie/CSRF controls are N/A and only crypto is scored.
Method: Roslyn plus filesystem scan: HSTS/security headers, secure cookies, input validation, middleware order, weak crypto (MD5/SHA1/DES); HTTPS-metadata context-aware. On a repository with no .NET source it reads JavaScript/TypeScript, Dart, Ruby, Scala, Rust or Elixir source itself (test, vendored, generated and minified paths not) for the arms that hold whether or not the code serves HTTP: a weak hash or cipher, key material fixed in the source, a TLS client that accepts any certificate, and (JavaScript/TypeScript, Ruby, Scala, Rust and Elixir) an obsolete TLS version; the server controls are not assessed there, and a Dart, Ruby, Scala, Rust or Elixir repository that serves no HTTP of its own is N/A on them. Deterministic.
`sha.ComputeHash(…)` puts the password `password` through a fast general-purpose digest, so a stolen hash is guessed at billions of candidates a second whether or not it is salted — no key-derivation function (PBKDF2/scrypt/Argon2/bcrypt) stands between the password and the stored value. — LiteDB/Engine/FileReader/Legacy/AesEncryption.cs:74
`parsed.Password == connection.Password` checks a password against the stored one in plaintext, so the store holds the password itself and whoever reads it holds every account. Store a salted KDF hash (PBKDF2/scrypt/Argon2/bcrypt) and verify by deriving again. — LiteDB.Fuzz/Targets/ValueFuzzer.cs:59
MD5/SHA1 is constructed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ for content integrity, or a KDF (PBKDF2/Argon2/BCrypt) for password storage. If it only derives a non-security identifier (a cache key, a file or mutex name), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as `System.IO.Hashing.XxHash64`/`Crc32` says it in code — since the algorithm alone cannot distinguish the two uses. (×2) — LiteDB/Client/Shared/SharedMutexNameFactory.cs:81, LiteDB/Engine/FileReader/Legacy/AesEncryption.cs:73
This code fixes PBKDF2-SHA-1 at 1,000 iterations. A key-derivation function's only defence is the cost of ONE guess, and that cost is this number — the algorithm choice does not set it. Current OWASP guidance is 1,300,000 PBKDF2 iterations with HMAC-SHA1, 600,000 with SHA-256 and 210,000 with SHA-512; scrypt at N=2^17, r=8, p=1 (or an equivalent N·r·p product); Argon2id at 19 MiB of memory and 2 iterations (or an equivalent row); bcrypt at a work factor of at least 10. This figure divides the attacker's work by a factor of tens or hundreds against the same stolen hash, on hardware they already own. Where what is derived is short or low-entropy — a PIN, a numeric parental code, a four-character token — the whole keyspace falls in the time this parameter buys, and no salt or constant-time comparison changes that. Raise the count to the current published figure for the PRF you use, measure it on the slowest hardware that must run it (a target of roughly 100 ms per derivation is the usual budget), and read the value from configuration so a deployment can raise it again without a rebuild. Where the derived value must interoperate with a format someone else fixed, the count cannot move — derive a SEPARATE value for anything you own rather than inheriting the external format's price. (×2) — REDACTED:97, LiteDB/Engine/FileReader/Legacy/AesEncryption.cs:21
What to do
Store passwords with a salted KDF — `Microsoft.AspNetCore.Identity.PasswordHasher<T>`, `Rfc2898DeriveBytes` (PBKDF2), or BCrypt/Argon2 — and compare with `CryptographicOperations.FixedTimeEquals`. (A fast/plain hash, or a client-hashed value stored and compared verbatim, is not password storage.) Start in `LiteDB/Engine/FileReader/Legacy/AesEncryption.cs:74`.
Review each MD5/SHA1 use by what it protects: replace it with SHA-256+ (or a KDF for passwords) where the digest is security-relevant, and switch it to a non-cryptographic hash (`System.IO.Hashing.XxHash64`/`Crc32`) where it only derives an identifier such as a cache key or a mutex name. This repository constructs a collision-broken hash (MD5/SHA1) at 2 sites, not one: `LiteDB/Client/Shared/SharedMutexNameFactory.cs:81` (SHA1), `LiteDB/Engine/FileReader/Legacy/AesEncryption.cs:73` (SHA1). Each is a separate decision — fixing only the line this row cites leaves the others in place.
Raise the cost parameter to current guidance — PBKDF2 at 1,300,000 (HMAC-SHA1), 600,000 (SHA-256) or 210,000 (SHA-512) iterations; scrypt at N=2^17, r=8, p=1; bcrypt at a work factor of 10 or more — or move to a memory-hard KDF (Argon2id, scrypt) where the platform offers one. Read the parameter from configuration and tune it to roughly 100 ms per derivation on the slowest hardware that must run it, so the price can be raised again without shipping new code. This repository constructs a key derivation priced below the floor at 2 sites, not one: `REDACTED:97` (PBKDF2-SHA-1, 1,000 iterations), `LiteDB/Engine/FileReader/Legacy/AesEncryption.cs:21` (PBKDF2-SHA-1, 1,000 iterations). Each is a separate decision — fixing only the line this row cites leaves the others in place.
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. (×13) — LiteDB/Utils/Extensions/IOExceptionExtensions.cs:37, LiteDB.ReproRunner/LiteDB.ReproRunner.Shared/Messaging/ReproHostClient.cs:124, LiteDB.ReproRunner/LiteDB.ReproRunner.Shared/Messaging/ReproHostClient.cs:135, …
`File.ReadAllText` blocks the thread on I/O while `File.ReadAllTextAsync` exists to wait without one — inside a method that is already `async`, await the twin. (×2) — LiteDB.Fuzz/FuzzProcessRunner.cs:234, LiteDB.Fuzz/Targets/SharedProcessFuzzer.cs:83
`.Wait(…)` blocks this thread until the task completes or the bound expires — sync-over-async: it can deadlock under a synchronization context and it parks a thread while it waits. `await` the task (with `.WaitAsync(timeout, token)` where the bound matters). (×4) — LiteDB.Fuzz/Targets/ChaosFuzzer.cs:235, LiteDB.Fuzz/Targets/CursorHandoffFuzzer.cs:100, LiteDB.Fuzz/Targets/ThreadedSnapshotFuzzer.cs:54, …
`Barrier.SignalAndWait` parks the thread until another thread signals it — inside a method that is already `async`, the wait should be awaitable (a `TaskCompletionSource`, `SemaphoreSlim.WaitAsync`, or `WaitHandle` bridged with `Task.Factory.FromAsync`). — LiteDB.Fuzz/Targets/ConcurrentFuzzer.cs:51
`File.AppendAllText` blocks the thread on I/O while `File.AppendAllTextAsync` exists to wait without one — inside a method that is already `async`, await the twin. — LiteDB.Fuzz/Targets/SharedProcessFuzzer.cs:58
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. — LiteDB.Fuzz/Targets/SnapshotWriterProcess.cs:78
`Task.WaitAll` blocks this thread until the tasks complete — sync-over-async: it can deadlock under a synchronization context and it parks a thread for as long as the work runs. `await Task.WhenAll(…)` instead. (×5) — LiteDB.ReproRunner/Repros/SharedSelfTeardownProof/Program.cs:65, LiteDB.ReproRunner/Repros/SharedSelfTeardownProof/Program.cs:68, tools/MemoryProfiles/ProfileWorkload.cs:97, …
Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.
Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X13 · Undrained process stream5.7 / 10Adequate✓ Tool-verified
Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.
Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `spawn` imported from `child_process` whose stdout and stderr are both pipes (no options, no `stdio`, or `stdio` of `'pipe'`), bound to a local that never leaves its scope, where exactly one of the two streams is read, the other never, and the child’s `close`/`exit` (or the read stream’s end) is awaited; a shell redirect in the call’s arguments or a `kill` of the child suppresses it. The same rule reads Python’s `subprocess.Popen`, Dart’s `Process.start`, Ruby’s `Open3.popen3`, and Scala’s JDK process starts (`new ProcessBuilder(…).start()` with no `redirectErrorStream`/`redirectError`/`redirectOutput`/`inheritIO`, `Runtime.getRuntime.exec`) where one of `getInputStream`/`getErrorStream` is read and the other never while `waitFor()` is called or the read stream is read to its end. Deterministic, provable per finding. Advisory.
`RedirectStandardOutput` is set here, but nothing in this type ever reads `StandardOutput` — while `StandardError` is read to the end. The child blocks as soon as it fills the StandardOutput pipe (~4 KB, never more than 64 KB), and it can then never finish writing StandardError, so the read-to-end above never returns and the `WaitForExit` timeout beside it does not help: the timeout bounds the WAIT, not the read that precedes it. Drain both — read one stream on a background thread (`BeginErrorReadLine()` with an `ErrorDataReceived` handler, or a `Task` running the second `ReadToEndAsync()`) and await both before `WaitForExit()` — or stop redirecting the stream you do not consume. — LiteDB.Fuzz/Targets/SnapshotFuzzer.cs:177
What to do
Each finding names the span that makes the branch dead and the span it is dead because of. Confirm from the two, then delete the dead arm or fix the predicate that was meant to be reachable.
Other · Security — Whether a hand-rolled public/private IP check can be walked past — a method that unwraps IPv4-mapped IPv6 but returns the opposite verdict for the same host written as IPv4-compatible, 6to4 or NAT64.
Method: Roslyn syntax + semantics: methods that unwrap IPv4-mapped IPv6 and hand-roll IPv4 range carve-outs, checked for whether the IPv6 branch also accounts for the IPv4-compatible, 6to4 and NAT64 embeddings. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X15 · Unvalidated length from an untrusted reader10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether a length read out of the stream being parsed is bounded before it is allocated or read — an unchecked count taken from the input lets the input choose the allocation.
Method: Roslyn syntax + semantics: integer lengths read from a BinaryReader and spent on a bulk read or an array allocation, checked for any comparison or bounding call on the value anywhere in the method. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a loop that shortens a string until it fits a length budget has a floor — one with none grinds the value down to the empty string, or past it into a negative-length `Substring`.
Method: Roslyn syntax + semantics: while/do loops whose body's only effect on a string is to drop its last character, checked for whether anything — a direct comparison on the length, a body guard, a break — bounds that length below. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `while`/`do` loop whose body’s one assignment to a value is `x = x.slice(0, -1)` or `x = x.slice|substring|substr(0, x.length - 1)`, driven by a condition that reads `x.length` only as a term of a larger expression — never compared directly, never tested for truthiness, and with no other read of `x` — and whose body has no `break`, `return`, `throw` or `if` naming `x`. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X17 · Uncapped recursion over a caller-supplied document10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether a walk that recurses through a JSON/XML tree handed in by its caller bounds how deep it will go — an uncapped walk lets the document's nesting choose the stack depth, and the resulting StackOverflowException cannot be caught.
Method: Roslyn syntax + semantics: methods that take a JSON/XML document node and call themselves with a child of it, reachable from an externally-callable member of the same type that accepts a document, checked for any depth parameter, descent counter or threaded arithmetic anywhere in the walk. On a repository with no .NET source it reads TypeScript off the engine’s own token stream (test, vendored, generated and minified paths and `.d.ts` not) with the same rule: a function or method with a parameter typed as a document value — `unknown`, `any`, `object`, `Record<string, unknown|any>`, a JSON alias (`JsonValue`, `JSONObject`, …) or a DOM node global the file does not rebind — that calls itself (bare, or through `this` for a method, or hands itself to a call over the value as in `value.map(walk)`) with something it took out of that value and never through an ancestor accessor such as `closest()` or `parentElement`, that is exported or reached from an exported function (a public method of the same exported class) taking such a value, and that names no depth, level, nesting, recursion, remaining or budget anywhere and threads no `+`/`-` arithmetic through a self-call. Plain JavaScript is not read: with no annotation nothing tells a parsed document from a tree the code built itself. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a type's disposal matches what it OWNS — releasing what it created, leaving alone what it was handed, and not declaring a finalizer for state that has nothing unmanaged to finalize.
Method: Roslyn syntax + semantics: every assignment to a disposable field is read to decide whether the type CREATED the value or was handed it, and the type's disposal is checked against that answer — an injected interface it disposes, a value it constructed and never releases, a finalizer on a type holding nothing unmanaged, and a disposable local whose every reference is a plain member read. A value handed to a container that disposes its contents (a parent control's `Controls` collection, a component `IContainer`) is released by that container and is not reported; generated code is out of population. On a repository with no .NET source the same ownership questions are read in JavaScript/TypeScript off the engine’s own token stream (test, vendored, generated and minified paths not): a class declaring `dispose()`, `[Symbol.dispose]()` or `[Symbol.asyncDispose]()` that disposes a field it was handed through a constructor parameter typed as a repository interface or resolved by a dependency-injection container; that assigns a field only ever from `new X(…)` of a disposable class and neither releases it anywhere in the class nor names it in its disposal member or a method that member calls, nor hands it to anything else; and a `const`/`let` local built from literals only whose every reference opens a statement operating on a non-release member of it. A class is disposable when every repository declaration of its name declares or inherits a disposal member, or when it is a documented library disposable (`vscode` EventEmitter, CancellationTokenSource and Disposable; three.js geometries, materials, textures, render targets, renderers, controls and composers). The finalizer arm has no JavaScript counterpart: a class cannot declare one. Dart is read for the owned-and-never-released arm: a Flutter `State` (or a class declaring `dispose()`/`close()`) whose library-private field is written only with direct creations of a framework controller, `FocusNode`, `StreamController` or periodic `Timer` (or a `.listen(…)` into a field declared `StreamSubscription`), which nothing in the class or its library releases (`dispose`/`close`/`cancel`) and which is never handed on except as a named argument. Ruby is read for the owned-and-never-released arm and the abandoned-local arm: a class declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose instance variable is written only with a blockless core descriptor creation (`File.open`/`new`, `Tempfile`, `Dir.open`, `IO.popen`, the `socket` and `openssl` socket classes) that no method of the class closes and that is never handed on (passed, returned, stored, exposed by `attr_reader`, delegated) — a class whose superclass or mixin lies outside the repository is not judged — and a blockless creation read through and dropped (`File.open(path).read`) or held in a local that is never closed, returned, passed or stored (a `&:read` block-pass, an `autoclose: false` borrow and a `fileno` hand-over are not abandonment). PHP is read for the same two arms: a class (not a trait, and not one using a trait) declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose `private` property (or a `final` class's `protected` one) is written only with a direct core `fopen`, `tmpfile`, `popen`, `proc_open`, `fsockopen`, `stream_socket_client`/`server` or `opendir` that nothing in the class closes (`fclose`, `pclose`, `closedir`, `unset`, a reset to `null`) and that is never handed on, and a handle held in a function's local, or read through as the argument of a reader, that is never closed, returned, passed, captured or stored; a `php://` stream, `curl_init`, `SplFileObject`, `PDO` and a function the repository declares under the core name are not read. Deterministic, provable per finding. Advisory.
`LiteDatabase` declares a finalizer (line 409), but nothing in the type is unmanaged: no `IntPtr`/`UIntPtr` or pointer field, no `SafeHandle`, no `HandleRef`, no `extern`/`DllImport` member and no `Marshal`/`GCHandle`/`NativeMemory` use. A finalizer can only release what the garbage collector cannot, so on a purely-managed type it releases nothing and costs something: every instance is put on the finalizer queue, survives at least one extra collection, and is then finalized on a thread that is NOT the disposing one — where the managed objects it touches may already have been finalized themselves. Delete the finalizer (and the `GC.SuppressFinalize` that exists to defuse it); if a handle is added later, wrap it in a `SafeHandle`, which brings its own correct finalization. — LiteDB/Client/Database/LiteDatabase.cs:409
`LiteRepository` declares a finalizer (line 389), but nothing in the type is unmanaged: no `IntPtr`/`UIntPtr` or pointer field, no `SafeHandle`, no `HandleRef`, no `extern`/`DllImport` member and no `Marshal`/`GCHandle`/`NativeMemory` use. A finalizer can only release what the garbage collector cannot, so on a purely-managed type it releases nothing and costs something: every instance is put on the finalizer queue, survives at least one extra collection, and is then finalized on a thread that is NOT the disposing one — where the managed objects it touches may already have been finalized themselves. Delete the finalizer (and the `GC.SuppressFinalize` that exists to defuse it); if a handle is added later, wrap it in a `SafeHandle`, which brings its own correct finalization. — LiteDB/Client/Database/LiteRepository.cs:389
`_reader` is never created by `PrefixedDataReader` — every assignment to it takes a constructor parameter — yet this type disposes it here (line 54). Its declared type `IBsonDataReader` is an interface, so the instance came from whoever resolved it, and that owner decides when it ends. Disposing it from here reaches outside this object's lifetime: a dependency shared with the rest of the process is torn down when THIS instance goes away, and the real owner's later `Dispose()` runs a second time on an object already disposed. Drop the call — a type disposes what it constructed, and only that. If this dependency genuinely is exclusive to this instance, construct it here (or take an owned factory) so the ownership is stated in the code rather than assumed. — LiteDB/Client/Shared/PrefixedDataReader.cs:54
`SharedDataReader` declares a finalizer (line 61), but nothing in the type is unmanaged: no `IntPtr`/`UIntPtr` or pointer field, no `SafeHandle`, no `HandleRef`, no `extern`/`DllImport` member and no `Marshal`/`GCHandle`/`NativeMemory` use. A finalizer can only release what the garbage collector cannot, so on a purely-managed type it releases nothing and costs something: every instance is put on the finalizer queue, survives at least one extra collection, and is then finalized on a thread that is NOT the disposing one — where the managed objects it touches may already have been finalized themselves. Delete the finalizer (and the `GC.SuppressFinalize` that exists to defuse it); if a handle is added later, wrap it in a `SafeHandle`, which brings its own correct finalization. — LiteDB/Client/Shared/SharedDataReader.cs:61
`SharedEngine` declares a finalizer (line 437), but nothing in the type is unmanaged: no `IntPtr`/`UIntPtr` or pointer field, no `SafeHandle`, no `HandleRef`, no `extern`/`DllImport` member and no `Marshal`/`GCHandle`/`NativeMemory` use. A finalizer can only release what the garbage collector cannot, so on a purely-managed type it releases nothing and costs something: every instance is put on the finalizer queue, survives at least one extra collection, and is then finalized on a thread that is NOT the disposing one — where the managed objects it touches may already have been finalized themselves. Delete the finalizer (and the `GC.SuppressFinalize` that exists to defuse it); if a handle is added later, wrap it in a `SafeHandle`, which brings its own correct finalization. — LiteDB/Client/Shared/SharedEngine.cs:437
`BsonDataReader` declares a finalizer (line 142), but nothing in the type is unmanaged: no `IntPtr`/`UIntPtr` or pointer field, no `SafeHandle`, no `HandleRef`, no `extern`/`DllImport` member and no `Marshal`/`GCHandle`/`NativeMemory` use. A finalizer can only release what the garbage collector cannot, so on a purely-managed type it releases nothing and costs something: every instance is put on the finalizer queue, survives at least one extra collection, and is then finalized on a thread that is NOT the disposing one — where the managed objects it touches may already have been finalized themselves. Delete the finalizer (and the `GC.SuppressFinalize` that exists to defuse it); if a handle is added later, wrap it in a `SafeHandle`, which brings its own correct finalization. — LiteDB/Document/DataReader/BsonDataReader.cs:142
`_inner` is never created by `ChecksummedWalFactory` — every assignment to it takes a constructor parameter — yet this type disposes it here (line 29). Its declared type `IStreamFactory` is an interface, so the instance came from whoever resolved it, and that owner decides when it ends. Disposing it from here reaches outside this object's lifetime: a dependency shared with the rest of the process is torn down when THIS instance goes away, and the real owner's later `Dispose()` runs a second time on an object already disposed. Drop the call — a type disposes what it constructed, and only that. If this dependency genuinely is exclusive to this instance, construct it here (or take an owned factory) so the ownership is stated in the code rather than assumed. — LiteDB/Engine/Disk/StreamFactory/ChecksummedWalFactory.cs:29
`sha` is a `SHA1`, which implements `IDisposable`, and it is created here (line 73). Every use of it in `HashSHA1` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var sha = …;`), which releases it at the end of the scope on every path including a throw. — LiteDB/Engine/FileReader/Legacy/AesEncryption.cs:73
`CompactDocumentReader` implements `IDisposable` — so it has told every caller it holds something worth releasing — and it constructs `_stream` itself (line 9), which makes that instance its own. But `_stream` is named in none of the methods the disposal search covered: `Dispose` (line 132) — that is `Dispose` plus every method `Dispose` calls BY NAME, so a release reached through an interface, a delegate or a base class is not followed and is worth checking before acting. On what was read, the type's disposal releases everything except the one thing it owns. A disposable the owner never disposes is held until finalization if its type has a finalizer, and forever if it does not — which for a synchronisation primitive, a timer, a stream or a handle means the resource accumulates once per instance for the life of the process. Release it in `Dispose` (`_stream?.Dispose();`), or, if it truly does not need releasing, drop `IDisposable` from the type so the claim and the behaviour agree. — LiteDB/Engine/Storage/CompactDocumentReader.cs:9
`reproObserved` is a `ManualResetEventSlim`, which implements `IDisposable`, and it is created here (line 107). Every use of it in `Run` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var reproObserved = …;`), which releases it at the end of the scope on every path including a throw. — LiteDB.ReproRunner/Repros/Issue_2561_TransactionMonitor/Program.cs:107
What to do
Each finding names the value and the span that decides who owns it — the `new` that created it, or the constructor parameter that handed it over. Confirm ownership from that span, then make the disposal match it: release what this type created, leave what it was injected with to whoever created THAT, and drop a finalizer whose type holds nothing unmanaged to release.
Other · Code Health — Whether a method that temporarily changes state belonging to the whole process — the working directory, an environment variable — puts it back on EVERY path: a restore reached only when nothing throws leaks the change to the rest of the process.
Method: Roslyn syntax + semantics: method bodies that write the process working directory or an environment variable and write it back in the same body, checked for whether that restore sits in a `finally`/`catch` or only on the straight-line path. On a repository with no .NET source the same rule reads production JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not): `process.chdir`, `process.env.NAME =`/`["NAME"] =` and `delete process.env.NAME`, and Deno’s `Deno.chdir`/`Deno.env.set`/`Deno.env.delete`, paired per function body (a nested function or arrow is its own body, and module top-level code is none), where the last write puts back a local the body captured from the same global or deletes a variable the first write set, with at least one statement between them; a write in a `catch`/`finally` of that body silences it. Deterministic, provable per finding. Advisory.
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. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same question: every named async function that itself makes a request an AbortSignal can cancel (global `fetch`, axios and its file-local instances, ky, ofetch) counts, and it is compliant when its parameters or body name a signal or it hands one of its own parameters to the request as options; signatures a framework fixes (JSX event handlers, route and lifecycle exports, request-first handlers, `override`, `'use server'` modules, TanStack `mutationFn`) are exempt unless they take a signal. Deterministic, adoption percentage.
Only 16/39 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) — LiteDB.Fuzz/FuzzArtifacts.cs:30, LiteDB.Fuzz/FuzzArtifacts.cs:122, LiteDB.Fuzz/FuzzArtifacts.cs:153, …
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. (×2) — LiteDB.Fuzz/FuzzProcessRunner.cs:294, LiteDB.Fuzz/Targets/SharedProcessFuzzer.cs:26
Neither takes a CancellationToken nor reads the one of the function it sits in, while it calls something that takes one — this work can't be stopped early once started. Take the token, or pass on the enclosing one. (×3) — LiteDB.Fuzz/Program.cs:180, LiteDB.Fuzz/Targets/ConflictFuzzer.cs:69, LiteDB.Fuzz/Targets/SnapshotWriterProcess.cs:51
What to do
Thread a CancellationToken through async methods so work stops promptly on cancellation.
Other · Code Health — Whether an argument guard throws the exception its own condition describes — a guard that rejects a value for being EMPTY and reports it as `ArgumentNullException` tells the caller a parameter was null when it provably was not.
Method: Roslyn syntax: `throw new ArgumentNullException(nameof(p))` statements controlled by an `if`, whose condition is read for a test that is true of a NON-null `p` — an emptiness test that dereferences it (`p.Count == 0`, `!p.Any()`) or a BCL predicate documented true of the empty value (`string.IsNullOrEmpty(p)`). Deterministic, provable per finding. Advisory.
The guard on line 136 rejects `keySelector` and line 136 reports that rejection as `ArgumentNullException` — but the condition's own test `string.IsNullOrEmpty(keySelector)` is true of a value that is NOT null: it is satisfied by an EMPTY `keySelector`, and on that path `keySelector` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows the empty case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` for the empty case, or split the guard and throw each on its own condition. — LiteDB/Client/Database/Collections/Aggregate.cs:136
The guard on line 173 rejects `keySelector` and line 173 reports that rejection as `ArgumentNullException` — but the condition's own test `string.IsNullOrEmpty(keySelector)` is true of a value that is NOT null: it is satisfied by an EMPTY `keySelector`, and on that path `keySelector` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows the empty case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` for the empty case, or split the guard and throw each on its own condition. — LiteDB/Client/Database/Collections/Aggregate.cs:173
The guard on line 29 rejects `keySelector` and line 29 reports that rejection as `ArgumentNullException` — but the condition's own test `string.IsNullOrEmpty(keySelector)` is true of a value that is NOT null: it is satisfied by an EMPTY `keySelector`, and on that path `keySelector` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows the empty case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` for the empty case, or split the guard and throw each on its own condition. — LiteDB/Client/Database/Collections/Include.cs:29
The guard on line 24 rejects `name` and line 24 reports that rejection as `ArgumentNullException` — but the condition's own test `string.IsNullOrEmpty(name)` is true of a value that is NOT null: it is satisfied by an EMPTY `name`, and on that path `name` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows the empty case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` for the empty case, or split the guard and throw each on its own condition. — LiteDB/Client/Database/Collections/Index.cs:24
The guard on line 32 rejects `name` and line 32 reports that rejection as `ArgumentNullException` — but the condition's own test `string.IsNullOrEmpty(name)` is true of a value that is NOT null: it is satisfied by an EMPTY `name`, and on that path `name` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows the empty case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` for the empty case, or split the guard and throw each on its own condition. — LiteDB/Client/Database/Collections/Index.cs:32
The guard on line 133 rejects `connectionString` and line 133 reports that rejection as `ArgumentNullException` — but the condition's own test `string.IsNullOrEmpty(connectionString)` is true of a value that is NOT null: it is satisfied by an EMPTY `connectionString`, and on that path `connectionString` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows the empty case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` for the empty case, or split the guard and throw each on its own condition. — LiteDB/Client/Structures/ConnectionString.cs:133
The guard on line 31 rejects `vectorField` and line 31 reports that rejection as `ArgumentNullException` — but the condition's own test `string.IsNullOrWhiteSpace(vectorField)` is true of a value that is NOT null: it is satisfied by an EMPTY `vectorField`, and on that path `vectorField` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows the empty case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` for the empty case, or split the guard and throw each on its own condition. — LiteDB/Client/Vector/LiteQueryable.Vector.cs:31
The guard on line 37 rejects `buffer` and line 37 reports that rejection as `ArgumentNullException` — but the condition's own test `buffer.Length == 0` is true of a value that is NOT null: it is satisfied by an EMPTY `buffer`, and on that path `buffer` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows the empty case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` for the empty case, or split the guard and throw each on its own condition. — LiteDB/Document/Bson/BsonSerializer.cs:37
The guard on line 79 rejects `expression` and line 79 reports that rejection as `ArgumentNullException` — but the condition's own test `string.IsNullOrWhiteSpace(expression)` is true of a value that is NOT null: it is satisfied by an EMPTY `expression`, and on that path `expression` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows the empty case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` for the empty case, or split the guard and throw each on its own condition. — LiteDB/Document/Expression/BsonExpression.Compilation.cs:79
The guard on line 134 rejects `value` and line 134 reports that rejection as `ArgumentNullException` — but the condition's own test `string.IsNullOrEmpty(value)` is true of a value that is NOT null: it is satisfied by an EMPTY `value`, and on that path `value` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows the empty case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` for the empty case, or split the guard and throw each on its own condition. — LiteDB/Document/ObjectId.cs:134
The guard on line 17 rejects `collection` and line 17 reports that rejection as `ArgumentNullException` — but the condition's own test `string.IsNullOrWhiteSpace(collection)` is true of a value that is NOT null: it is satisfied by an EMPTY `collection`, and on that path `collection` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows the empty case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` for the empty case, or split the guard and throw each on its own condition. — LiteDB/Engine/Engine/Query.cs:17
The guard on line 585 rejects `filename` and line 585 reports that rejection as `ArgumentNullException` — but the condition's own test `string.IsNullOrEmpty(filename)` is true of a value that is NOT null: it is satisfied by an EMPTY `filename`, and on that path `filename` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows the empty case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` for the empty case, or split the guard and throw each on its own condition. — LiteDB/Utils/MimeTypeConverter.cs:585
The guard on line 26 rejects `projectId` and line 28 reports that rejection as `ArgumentNullException` — but the condition's own test `string.IsNullOrWhiteSpace(projectId)` is true of a value that is NOT null: it is satisfied by an EMPTY `projectId`, and on that path `projectId` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows the empty case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` for the empty case, or split the guard and throw each on its own condition. — LiteDB.Demo.Tools.VectorSearch/Configuration/GeminiEmbeddingOptions.cs:28
The guard on line 31 rejects `location` and line 33 reports that rejection as `ArgumentNullException` — but the condition's own test `string.IsNullOrWhiteSpace(location)` is true of a value that is NOT null: it is satisfied by an EMPTY `location`, and on that path `location` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows the empty case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` for the empty case, or split the guard and throw each on its own condition. — LiteDB.Demo.Tools.VectorSearch/Configuration/GeminiEmbeddingOptions.cs:33
The guard on line 41 rejects `apiKey` and line 43 reports that rejection as `ArgumentNullException` — but the condition's own test `string.IsNullOrWhiteSpace(apiKey)` is true of a value that is NOT null: it is satisfied by an EMPTY `apiKey`, and on that path `apiKey` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows the empty case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` for the empty case, or split the guard and throw each on its own condition. — LiteDB.Demo.Tools.VectorSearch/Configuration/GeminiEmbeddingOptions.cs:43
The guard on line 85 rejects `model` and line 87 reports that rejection as `ArgumentNullException` — but the condition's own test `string.IsNullOrWhiteSpace(model)` is true of a value that is NOT null: it is satisfied by an EMPTY `model`, and on that path `model` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows the empty case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` for the empty case, or split the guard and throw each on its own condition. — LiteDB.Demo.Tools.VectorSearch/Configuration/GeminiEmbeddingOptions.cs:87
What to do
Each finding names the throw and the test in its own condition that is true of a NON-null value. Confirm from the two, then throw the exception that describes what was actually wrong: `ArgumentException` for a value that arrived empty, or the .NET 8 helpers that spell the whole guard in one line and pick the type for you — `ArgumentException.ThrowIfNullOrEmpty(s)` / `ThrowIfNullOrWhiteSpace(s)` for strings, `ArgumentNullException.ThrowIfNull(x)` followed by `ArgumentOutOfRangeException.ThrowIfZero(x.Count)` for a collection. Splitting the two conditions is usually clearer than picking one exception for both: they are different failures and the caller may want to handle them differently.
Other · Code Health — Whether a `when` guard is free of side effects — a guard that increments a counter or assigns while deciding whether its arm matches applies that change during PATTERN MATCHING, on an arm that may not be selected, and skips it entirely when a short-circuit to its left answers first.
Method: Roslyn syntax: `when` guards on case labels and switch-expression arms, read for a mutation (`++`/`--`/assignment) sitting in a position the guard's own `&&`/`||`/`??`/`?:`/`?.` can skip. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a method that TAKES a lock or semaphore and gives it back from a flag-guarded `finally` returns the value that flag implies — reporting success while the guard hands the primitive back admits a second caller the exclusion was there to keep out, and reporting failure while the guard keeps it leaves nothing to ever give it back.
Method: Roslyn syntax: `try` statements whose `finally` releases a synchronisation primitive under a bare local-bool guard, where the method also TOOK that same primitive before the `try`, checked for a `return` of a bool literal whose value disagrees with the flag state the method's own straight-line assignments put it in. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.
Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X24 · Document value interpolated into markup unescaped10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether text read out of the document being converted is escaped before it is written into generated markup — a value the document's author chose, interpolated into an attribute the surrounding literal delimits, can close that attribute and open another.
Method: Roslyn semantic model over the whole compilation: a string-typed `Value`/`InnerText`/`InnerXml`/`Text` member declared inside `DocumentFormat.OpenXml` or `System.Xml` is a taint SOURCE, propagated through assignments, returns, arguments, tuple elements and string composition to its transitive closure, then read at interpolated-string holes that sit in a markup position the surrounding literal itself delimits. Escaper/encoder calls and enclosing validator conditions cut the flow. Flow- and container-insensitive by construction. A second arm needs no provenance at all and reports a type that CONTRADICTS ITSELF — the same expression escaped at one delimited markup hole and interpolated raw at another hole in the same markup position of the same type, which the type's own escaping proves is a defect without knowing where the value came from. On a repository with no .NET source it reads JavaScript/TypeScript off the token stream with the same rule: a DOM read of raw document text (`getAttribute`, `textContent`, `innerText`, `nodeValue`) is the source, propagated through local bindings and string composition, and judged at template-literal and concatenation holes in the same two delimited markup positions; escapers and validating conditions cut it, and documentation-site, test, vendored and minified scripts are not read. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a value the caller is invited to supply is the value the type actually uses — a constructor parameter stored in a private field that nothing ever reads while the default it was given is spelled out a second time at the site that should have read it, a keyed lookup that falls back to a different setting than the one its key names while the same type falls back to the matching one for that same key, or a culture-sensitive parse given no format provider by a type that feeds its own settable culture to the same kind of parse elsewhere, or a number an entry point writes to standard output under the host's culture while the same entry point formats with the invariant culture elsewhere. Either way, every caller who supplies a value silently gets something else.
Method: Roslyn syntax: private instance fields of a non-partial type assigned in a constructor from one of its own parameters with a `??` fallback, checked for whether anything in the type body reads the field and whether that same fallback expression is spelled out again outside the constructor; and `??` fallbacks onto a member access from a lookup call carrying exactly one string literal, grouped by that key across the type and checked for a fallback member whose folded name disagrees with the key while a sibling site for the same key agrees with it. On a repository with no .NET source the first two arms read JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `#x`, `private` or `private` parameter-property instance field filled in the constructor from a parameter (or one member of one) through `??`/`||` or a parameter default, never read anywhere in the file by name, whose constructed default is spelled again in the class body; and `lookup("key") ?? s.member` grouped by key per class, or per module outside every class. The culture arm has no JavaScript counterpart: its parses take no locale. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a value handed from a callback to the body that waits on it crosses on something built to be crossed — a `Queue<T>`/`List<T>`/`Dictionary<K,V>` written inside an event handler and read back outside it is mutated by two flows at once, and the semaphore or completion source beside it orders how MANY items exist while leaving the collection's own head, tail and backing array unprotected.
Method: Roslyn syntax: method, accessor, local-function and lambda bodies that declare BOTH a non-thread-safe generic collection (`Queue`/`Stack`/`List`/`Dictionary`/`HashSet`/`Sorted*`/`LinkedList`) and a synchronisation primitive (`SemaphoreSlim`/`TaskCompletionSource`/`ManualResetEvent(Slim)`/`AutoResetEvent`/`CountdownEvent`) as locals, then read for a `+=`-registered lambda that raises that primitive while the body outside every lambda waits on it — and, in that scope, a mutating call on the collection inside the lambda paired with a mention of it outside. Any `lock` in the scope abstains it. On a repository with no .NET source the same handoff is read in Java off the engine’s own token stream (test source sets, vendored and demonstration paths not): an `ArrayList`/`LinkedList`/`ArrayDeque`/`PriorityQueue`/`Hash*`/`LinkedHash*`/`Tree*` local and a `CountDownLatch`/`Semaphore`/`CompletableFuture` local, a lambda or anonymous class that raises the primitive and mutates the collection, and a wait outside it; any `synchronized` or `lock()` abstains the body. Because each of those primitives orders what the callback wrote before raising it, only a touch that provably overlaps the callback is convicted: one after the registration and before the next wait, or one in a loop registered-before, waiting on every pass and not declaring the collection. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a `foreach` leaves the collection it is walking alone — a body that adds to or removes from the very collection the loop is enumerating invalidates the enumerator it is holding, so the next `MoveNext` throws `InvalidOperationException` and the remaining items are never seen.
Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.
Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X29 · Per-element action decided by a fixed element10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a decision taken once per element is taken ABOUT that element — a test inside a counted loop that reads a fixed subscript of the very collection its guarded statement indexes by the loop variable applies element zero's answer to all of them, so the elements that differ from it are all handled wrongly, and in the same direction.
Method: Roslyn syntax only, no semantic model: every `for` statement declaring exactly ONE loop variable, and every `if` inside its body that is not under a nested loop or a lambda. A site enters the population when the `if`’s condition never mentions the loop variable while the statement it guards indexes some collection by that variable ALONE (`c[i]`; `c[i + 1]` and `c[i, j]` are outside it). A finding additionally needs the AGREEING TWIN at the same-collection grain: the condition must read THAT SAME collection at a subscript that does not move — written into the condition, or reached through a local declared BEFORE the loop, so an alias bound inside the body is not followed. Both collection expressions must be simple identifiers. On a repository with no .NET source the same rule reads JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `for (let|var|const x = …; …; …)` with one declarator and a braced body, an alias followed only when it is declared before the loop in a block that encloses it and never assigned inside the loop. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.
Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.
`catch (FileNotFoundException)` does nothing with the exception it caught — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch. Log it through whatever this codebase already uses to report problems, or let it propagate; if one specific failure genuinely cannot matter, catch exactly that exception type and say why in a comment on the catch. (×2) — LiteDB/Client/Shared/SharedCoordinationFallback.cs:34, LiteDB/Engine/Services/RebuildRecovery.cs:32
`catch (DirectoryNotFoundException)` does nothing with the exception it caught — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch. Log it through whatever this codebase already uses to report problems, or let it propagate; if one specific failure genuinely cannot matter, catch exactly that exception type and say why in a comment on the catch. (×2) — LiteDB/Client/Shared/SharedCoordinationFallback.cs:35, LiteDB/Engine/Services/RebuildRecovery.cs:33
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. (×28) — LiteDB/Client/Shared/SharedCoordinationFile.cs:53, LiteDB/Client/Shared/SharedCoordinationFile.cs:54, LiteDB/Client/Shared/SharedCoordinationFiles.cs:74, …
`catch (Exception) when (…)` does nothing with the exception it caught — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch. Log it through whatever this codebase already uses to report problems, or let it propagate; if one specific failure genuinely cannot matter, catch exactly that exception type and say why in a comment on the catch. (×2) — LiteDB/Client/Shared/SharedEngine.Query.cs:213, LiteDB/Client/Shared/SharedReaderRegistry.cs:166
`catch (AbandonedMutexException)` does nothing with the exception it caught — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch. Log it through whatever this codebase already uses to report problems, or let it propagate; if one specific failure genuinely cannot matter, catch exactly that exception type and say why in a comment on the catch. (×2) — LiteDB/Client/Shared/SharedMutexPin.cs:210, LiteDB/Client/Shared/SharedMutexScope.cs:35
`catch (SecurityException)` does nothing with the exception it caught — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch. Log it through whatever this codebase already uses to report problems, or let it propagate; if one specific failure genuinely cannot matter, catch exactly that exception type and say why in a comment on the catch. — LiteDB/Document/ObjectId.cs:393
`catch (PageChecksumException)` does nothing with the exception it caught — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch. Log it through whatever this codebase already uses to report problems, or let it propagate; if one specific failure genuinely cannot matter, catch exactly that exception type and say why in a comment on the catch. — LiteDB/Engine/Disk/WalRecovery.cs:39
`catch (PageChecksumException) when (…)` does nothing with the exception it caught — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch. Log it through whatever this codebase already uses to report problems, or let it propagate; if one specific failure genuinely cannot matter, catch exactly that exception type and say why in a comment on the catch. — LiteDB/Engine/Disk/WalRetirementReader.cs:32
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: record it through whatever this codebase already uses to report problems — or, if one specific failure truly cannot matter, catch exactly that exception type and say why in a comment on the catch (a comment on a catch-all still swallows everything else). — LiteDB/Engine/Services/LockService.cs:169
What to do
Swallowed exception (caught, then discarded)
Do you agree with this assessment?
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a guard written as a NEGATED `||` says what its author meant — `!(a || b || x != k)` is `!a && !b && x == k` by De Morgan, so a bail-out that mixes capabilities the code needs with a fault it refuses turns inside out: it fires only where the capabilities are ABSENT, and lets every value the fault term names walk straight into the body that cannot handle it.
Method: Roslyn syntax only, no semantic model: every logical-not whose operand is a parenthesised `||` chain of two or more disjuncts, flattened (a left-nested `a || b || c` read once would see `(a || b)` as one disjunct). A site enters the population on that shape alone. A finding additionally needs the disjuncts to DISAGREE in polarity: at least one bare boolean read — an identifier or member access, never an invocation, which is a predicate rather than a capability flag — and at least one `x != <constant>`, the only form that negates into an exact-value pin (`== null` negates into a looser requirement and is outside the fault set). Consistently-polarised disjunctions, all-fault or all-capability, are counted and never reported; a negated `&&` is outside the population entirely. No same-receiver gate: it was measured to cost a real defect and remove no false positive. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X32 · Type resolved by simple name across every loaded assembly10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a plugin lookup names the type it means — searching every assembly loaded into the process for a candidate whose SIMPLE name equals a string supplied at runtime, and taking the first one found, is decided by assembly LOAD ORDER rather than by this source, so the same name can resolve to a different type on the next run.
Method: Roslyn syntax only, no semantic model: every invocation of `First`/`FirstOrDefault`/`Single`/`SingleOrDefault` whose OWN expression subtree contains both a `GetAssemblies()` call and a `GetTypes()`/`GetExportedTypes()` call — a single-element pick out of every type loaded into the process. A nested selector in the same chain sees no `GetAssemblies()` in its own subtree and is outside the population, so one lookup counts once however many links its chain has. A finding additionally needs both remaining halves: the selector must be `First`/`FirstOrDefault` (`Single`/`SingleOrDefault` reports the ambiguity rather than resolving it, and is counted and never reported), and the chain must carry an `==` comparison of `<lambda parameter>.Name` against something that is not a literal. The receiver must be a plain identifier bound by one of the chain’s own lambdas, which places `assembly.GetName().Name == "X"` outside the rule by construction. One exemption: a `.Name` test joined by `&&` to a `FullName`/`AssemblyQualifiedName` test on the same identifier is spared; joined by `||` it is not. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether log calls use message templates (queryable) rather than interpolated strings.
Method: Roslyn syntax scan: every log call-site counted; interpolated-string first-argument violations flagged. Population is all log calls, not estimated. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `trace`/`debug`/`info`/`warn`/`error`/`fatal`/`verbose`/`silly`/`http`/`log` call on a receiver named for a logger, in a package whose own or an enclosing `package.json` declares a logger that carries values as fields (pino, pino-http, nestjs-pino, Fastify, winston, bunyan, tslog, LogTape, roarr), whose first deciding argument is a template literal with substitutions; an object-literal fields argument is stepped over, a plain string message clears the call. Python is read the same way: a `debug`/`info`/`warning`/`error`/`exception`/`critical`/`log` call on a logger in a file that imports the standard library’s `logging` or structlog (loguru, which formats at the call, is not judged), whose message is a whole f-string with a non-constant field; a `%`-formatted, `.format()`-ed or concatenated message is not convicted, as in C#. PHP is read the same way: a PSR-3 level call (`emergency`…`debug`, `log`) on a logger (`$logger`, `$this->logger`, Laravel’s `Log::`, `logger()`, `\Drupal::logger()`) in a package whose `composer.json` requires a PSR-3 logger or a framework that hands one out (psr/log, Monolog, Laravel, Symfony, Drupal, CakePHP), or a file that imports one, whose message is a double-quoted string interpolating a variable; a single-quoted message clears the call, and `sprintf` or `.` concatenation is not convicted, as in C#. Dart is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on Sentry’s structured logger (`Sentry.logger`) whose message is a whole string literal interpolating a value (`$name`, `${…}`); the `Sentry.logger.fmt` template API clears the call. Dart that logs only through loggers with one message and no fields (package:logging, package:logger, talker, dart:developer) is not applicable rather than a reach gap. Ruby is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on the console gem’s `Console` (declared by a Gemfile, gemspec or Gemfile.lock, or required) or, where SemanticLogger, Ougai or dry-logger is declared or required, on a receiver named for a logger (`logger`, `@logger`, `Rails.logger`, `log`), whose first deciding argument is, as the whole argument, a double-quoted string interpolating a non-constant value (`#{…}`, `#@ivar`); a plain literal clears the call, keyword arguments are the fields, and a block, `%`-format or `+` concatenation is not convicted. Ruby that logs only through the standard Logger (Rails.logger) is not applicable rather than a reach gap. Deterministic.
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.
This method contradicts itself about `fieldInfo`: line 49 assigns it with `as FieldInfo`, which hands back null rather than throwing when the value is not a `FieldInfo`, but line 67 then dereferences it directly as `fieldInfo.SetValue` with no null test between them and no guard around it. If the `as` is right, that dereference throws NullReferenceException on the input it was written for — and the NullReferenceException names neither the cast nor the type that failed. Settle it one way — test `fieldInfo` once before the first use and handle the null case, or cast with `(FieldInfo)` so the failure is reported where it happens — rather than leaving the two readings side by side. — LiteDB/Client/Mapper/Reflection/Reflection.Expression.cs:67
This method contradicts itself about `transactionState`: line 74 tests it for null before doing anything with it — the author's own statement that null is an input this code expects — but that `if` scopes only the block beneath it, and line 97 then dereferences `transactionState` as `transactionState.TransactionID` AFTER the block has closed, where the guard no longer applies. A null `transactionState` skips the guarded body and reaches that line anyway, throwing NullReferenceException on exactly the input the guard was written for. If the dereference belongs to the guarded work, move it inside the block; if `transactionState` truly cannot be null by then, the guard above is misleading and should go. — LiteDB/Engine/Disk/DiskService.WalWrite.cs:97
This method contradicts itself about `expression`: line 8 writes `expression?.Left`, which says `expression` can be null, but line 23 then dereferences it directly as `expression.Right` with no null test between them and no guard around it. If the `?.` is right, that dereference throws NullReferenceException on the input it was written for; if `expression` truly cannot be null here, the `?.` is misleading. Settle it one way — test `expression` once before the first use and handle the null case, or drop the `?.` — rather than leaving the two readings side by side. — LiteDB/Engine/Query/QueryOptimization.Range.cs:23
10/32 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.
~0.7 `!` suppressions per 1k syntax nodes — 24 suppression(s) across the 32914 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
Where a method uses `?.` on a symbol and then dereferences it directly, settle the question once: test it before the first use and handle null, or drop the `?.`.
Where a method null-tests a symbol and then uses it after the guarded block closes, move the trailing work inside the block — the guard skips its body on null, it does not stop the method.
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.
Unscored — 4 check(s) recorded observations but carry no score
These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.
P12 CI test-gate honesty — 5 observation(s) recorded · 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.
SC1 Supply-chain hygiene — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X10 Duplicated predicate — 25 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X7 Silent fallback defaults — 5 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 1 control(s) we could not find positive evidence for
These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 39 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.
AX2 Stateful singletons — no singleton implementations detected
AX4 Dependency direction — not applicable to a CQRS architecture (the inward-dependency rule is for layered/clean styles)
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
AXB1 Runtime evidence locked — no reproducible boot — This repository has nothing the runtime tiers could boot or serve — no markup, no UI framework or web-server dependency, no UI component source, no native UI project and no API definition — nothing here is a surface to boot — so runtime a11y/egress/header evidence has no subject here. Not applicable: this is neither a gap in the scan nor a finding about your code.
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.
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 included
D22 Internal API Consistency — No intentionally-exposed public API to evaluate for consistency.
D23 Boundary Type-Coupling — Cross-context type coupling could not be assessed — this codebase's bounded contexts are neither declared nor inferable.
D25 ADR Conformance — no ADRs to check
D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
D32 Data Compliance (PII/GDPR) — 5 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D43 Malicious Dependencies — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Python pyproject.toml/requirements.txt (pip/uv/Poetry), a Swift Package.swift/Package.resolved, a Cargo manifest, a Go module (go.mod/go.sum), a Gradle version catalogue, a Maven POM, an sbt build (build.sbt), composer.json, package.json, a Dart pubspec.yaml, an Elixir mix.exs/mix.lock (Hex), a rebar.config / erlang.mk DEPS (Hex), a Ruby Gemfile/Gemfile.lock or .gemspec (Bundler/RubyGems) — not scanned yet).
D7 Architectural Integrity — no checkable ADRs and no dependency cycles — architectural integrity not assessed
DM1 Domain Modelling — not scored — this repository shows only 1 of the 3 signals this lens looks for (4 value object(s))
ED1 Event-Driven — not scored — this repository shows only 1 of the 3 signals this lens looks for (6 CQRS handler(s))
ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
P2 Observability — This repo is a library, not a deployed service — it has no process to operate, so production observability (structured logging, tracing/metrics, health checks) is N/A. A library may log via an injected ILogger, but the absence of operational telemetry is not a defect here. If it grows a host (web API, worker), the dimension reactivates.
P7 Outbound HTTP resilience — not applicable — this isn't a service/API/worker
P8 Schema migrations — no EF Core usage detected
P9 Domain vs controller coverage — coverage data present for 35 file(s), but no domain-layer files were identified: no covered file's path contains any of the markers this check keys on (/domain/, /aggregates/, /valueobjects/, /domainmodel/, .domain/, /entities/), which are matched case-insensitively anywhere in the path. With no domain partition there is nothing to compare the web/controller layer against — if this repository keeps its business rules under a folder named none of those, that naming is what the check cannot see, not the domain logic.
X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
Appendix A — Findings (grouped)
The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.
EmptyCatchBlock LiteDB.Fuzz/FuzzArtifacts.cs:162— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock LiteDB.Fuzz/FuzzArtifacts.cs:163— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock LiteDB.Fuzz/FuzzArtifacts.cs:262— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock LiteDB.Fuzz/FuzzArtifacts.cs:263— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock LiteDB.Fuzz/FuzzProcessRunner.cs:153— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock LiteDB.Fuzz/FuzzProcessRunner.cs:162— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock LiteDB.Fuzz/FuzzProcessRunner.cs:224— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock LiteDB.Fuzz/FuzzProcessRunner.cs:247— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock LiteDB.Fuzz/FuzzProcessRunner.cs:311— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock LiteDB.Fuzz/FuzzProcessRunner.cs:313— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock LiteDB.Fuzz/Targets/BoundaryFuzzer.cs:62— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock LiteDB.Fuzz/Targets/BoundaryFuzzer.cs:87— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock LiteDB.Fuzz/Targets/BoundaryFuzzer.cs:204— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock LiteDB.Fuzz/Targets/ChecksumCrashFuzzer.cs:99— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock LiteDB.Fuzz/Targets/ChecksumMigrationFuzzer.cs:34— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock LiteDB.Fuzz/Targets/CompactCodecFuzzer.cs:112— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock LiteDB.Fuzz/Targets/CompactCodecFuzzer.cs:119— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock LiteDB.Fuzz/Targets/CompatibilityFuzzer.cs:96— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock LiteDB.Fuzz/Targets/ConcurrentFuzzer.cs:47— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock LiteDB.Fuzz/Targets/ConcurrentFuzzer.cs:71— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock LiteDB.Fuzz/Targets/ConflictFuzzer.cs:27— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock LiteDB.Fuzz/Targets/ConflictFuzzer.cs:73— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock LiteDB.Fuzz/Targets/ConflictFuzzer.cs:87— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock LiteDB.Fuzz/Targets/ConflictFuzzer.cs:93— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock LiteDB.Fuzz/Targets/ConflictFuzzer.cs:113— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
NoWarnInCsproj LiteDB/LiteDB.csproj:21— 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 LiteDB.Tests/LiteDB.Tests.csproj:12— 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 LiteDB.Shell/LiteDB.Shell.csproj:13— 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 LiteDB/LiteDB.csproj:21— 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 LiteDB.Tests/LiteDB.Tests.csproj:12— 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 LiteDB.Shell/LiteDB.Shell.csproj:13— 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 LiteDB/LiteDB.csproj:21— 1705 — 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 LiteDB.Tests/LiteDB.Tests.csproj:12— 1705 — 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 LiteDB.Shell/LiteDB.Shell.csproj:13— 1705 — 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 LiteDB/LiteDB.csproj:21— 1591 — this project generates an XML documentation file as a build output, so its documentation is something it PUBLISHES to whoever consumes the assembly, and this entry switches off a rule whose only job is to report that documentation missing or malformed. The two decisions sit in the same file and the quiet one wins: the documentation this project ships has holes exactly where the rule would have pointed, no build says so, and the people who meet the gap are downstream — in their editor, at the moment they are trying to use the member. Write the documentation the rule is asking for and drop the code from the list; where only some elements genuinely cannot carry it, narrow the suppression to those sites and give each one its reason, so the rest of the API stays covered. If the documentation was never meant to be consumed, the honest fix is the other line — stop generating the file, so the project no longer publishes something it is choosing not to check.
NoWarnInCsproj LiteDB.Tests/LiteDB.Tests.csproj:12— 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 LiteDB.Shell/LiteDB.Shell.csproj:13— 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 LiteDB/LiteDB.csproj:21— 0618 — 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 LiteDB.Tests/LiteDB.Tests.csproj:12— 0618 — 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.
FileScopedPragmaDisable LiteDB.Tests.SharedMutexHarness/CoordinatorHarness.cs:1— #pragma warning disable LITEDB_EXPERIMENTAL_COORDINATOR — the disable has no matching restore anywhere in this file, 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 that nobody weighed against it. Close it with the matching restore directive immediately after the construct it covers — that alone turns a standing exemption into a scoped one — or fix the cause and drop the directive entirely.
FileScopedPragmaDisable LiteDB.Tests/Engine/CoordinatorPlatform_Tests.cs:2— #pragma warning disable LITEDB_EXPERIMENTAL_COORDINATOR — the disable has no matching restore anywhere in this file, 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 that nobody weighed against it. Close it with the matching restore directive immediately after the construct it covers — that alone turns a standing exemption into a scoped one — or fix the cause and drop the directive entirely.
FileScopedPragmaDisable LiteDB.Tests/Engine/CoordinatorSafety_Tests.cs:2— #pragma warning disable LITEDB_EXPERIMENTAL_COORDINATOR — the disable has no matching restore anywhere in this file, 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 that nobody weighed against it. Close it with the matching restore directive immediately after the construct it covers — that alone turns a standing exemption into a scoped one — or fix the cause and drop the directive entirely.
FileScopedPragmaDisable LiteDB.Tests/Engine/CoordinatorSnapshotReads_Tests.cs:2— #pragma warning disable LITEDB_EXPERIMENTAL_COORDINATOR — the disable has no matching restore anywhere in this file, 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 that nobody weighed against it. Close it with the matching restore directive immediately after the construct it covers — that alone turns a standing exemption into a scoped one — or fix the cause and drop the directive entirely.
FileScopedPragmaDisable LiteDB.Tests/Engine/Coordinator_Tests.cs:2— #pragma warning disable LITEDB_EXPERIMENTAL_COORDINATOR — the disable has no matching restore anywhere in this file, 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 that nobody weighed against it. Close it with the matching restore directive immediately after the construct it covers — that alone turns a standing exemption into a scoped one — or fix the cause and drop the directive entirely.
FileScopedPragmaDisable LiteDB.Tests/Internals/CoordinatorProcess_Tests.cs:2— #pragma warning disable LITEDB_EXPERIMENTAL_COORDINATOR — the disable has no matching restore anywhere in this file, 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 that nobody weighed against it. Close it with the matching restore directive immediately after the construct it covers — that alone turns a standing exemption into a scoped one — or fix the cause and drop the directive entirely.
WriteOnlyPrivateField LiteDB.Tests/BsonValue/BsonVector_Tests.cs:12— private Collation _collation — assigned 1 time(s), read never — this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments — or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there.
WriteOnlyPrivateField LiteDB.Tests/BsonValue/BsonVector_Tests.cs:13— private BsonDocument _root — assigned 1 time(s), read never — this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments — or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there.
WriteOnlyPrivateField LiteDB.Tests/Engine/SharedReaderModel_Tests.cs:19— private ITestOutputHelper _output — assigned 1 time(s), read never — this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments — or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there.
WriteOnlyPrivateField LiteDB/Engine/Sort/SortDisk.cs:24— private EnginePragmas _pragmas — assigned 1 time(s), read never — this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments — or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there.
WriteOnlyPrivateField LiteDB/Engine/Sort/SortService.cs:36— private ArrayPool<byte> _bufferPool — assigned 1 time(s), read never — this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments — or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there.
WriteOnlyPrivateField LiteDB/Engine/SystemCollections/SysFileCsv.cs:13— private IFormatProvider _numberFormat — assigned 1 time(s), read never — this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments — or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there.
Orphaned knowledge ConsoleApp1/Tools/Faker.Names.cs:1— No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
Orphaned knowledge LiteDB/Utils/MimeTypeConverter.cs:1— No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
Orphaned knowledge LiteDB/Utils/Tokenizer.cs:1— No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
S1 · Cryptographic Hygiene· Password hashing without a KDF · ×2
Password hashing without a KDF LiteDB/Engine/FileReader/Legacy/AesEncryption.cs:74— `sha.ComputeHash(…)` puts the password `password` through a fast general-purpose digest, so a stolen hash is guessed at billions of candidates a second whether or not it is salted — no key-derivation function (PBKDF2/scrypt/Argon2/bcrypt) stands between the password and the stored value.
Password hashing without a KDF LiteDB.Fuzz/Targets/ValueFuzzer.cs:59— `parsed.Password == connection.Password` checks a password against the stored one in plaintext, so the store holds the password itself and whoever reads it holds every account. Store a salted KDF hash (PBKDF2/scrypt/Argon2/bcrypt) and verify by deriving again.
Namespace dependency cycle LiteDB/Client/Coordinated/CoordinatorClient.cs:7— The namespaces LiteDB ↔ LiteDB.Client.Coordinated ↔ LiteDB.Client.Shared ↔ LiteDB.Engine ↔ LiteDB.Vector depend on each other. The lightest dependency in the cycle is LiteDB.Client.Coordinated → LiteDB.Client.Shared (LiteDB.Client.Coordinated.CoordinatorClient → LiteDB.Client.Shared.SharedReaderRegistry, 1 type pair(s)); cut that one first, e.g. by moving the shared type to a namespace both can use or inverting it behind an interface.
Dead code: FlushLog LiteDB/Engine/Disk/DiskService.Checkpoint.cs:17— Method FlushLog — Roslyn's SymbolFinder walked every project the solution loads, including LiteDB(netstandard2.0), and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: PromoteVectorFormat LiteDB/Engine/Disk/DiskService.FileVersion.cs:14— Method PromoteVectorFormat — Roslyn's SymbolFinder walked every project the solution loads, including LiteDB(netstandard2.0), and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: IndexScan LiteDB/Engine/Query/IndexQuery/IndexScan.cs:11— NamedType IndexScan — Roslyn's SymbolFinder walked every project the solution loads, including LiteDB(netstandard2.0), and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: SharesIncludedRoot LiteDB/Engine/Query/QueryOptimization.IncludedFields.cs:57— Method SharesIncludedRoot — Roslyn's SymbolFinder walked every project the solution loads, including LiteDB(netstandard2.0), and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: PathsMayOverlap LiteDB/Engine/Query/Structures/IndexExpressionIdentity.cs:28— Method PathsMayOverlap — Roslyn's SymbolFinder walked every project the solution loads, including LiteDB(netstandard2.0), and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: AsyncManualResetEvent LiteDB/Utils/AsyncManualResetEvent.cs:10— NamedType AsyncManualResetEvent — Roslyn's SymbolFinder walked every project the solution loads, including LiteDB(netstandard2.0), and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: DatabaseShutdown LiteDB/Utils/LiteException.cs:124— Method DatabaseShutdown — Roslyn's SymbolFinder walked every project the solution loads, including LiteDB(netstandard2.0), and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: CollectionLimitExceeded LiteDB/Utils/LiteException.cs:145— Method CollectionLimitExceeded — Roslyn's SymbolFinder walked every project the solution loads, including LiteDB(netstandard2.0), and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: IndexNameLimitExceeded LiteDB/Utils/LiteException.cs:150— Method IndexNameLimitExceeded — Roslyn's SymbolFinder walked every project the solution loads, including LiteDB(netstandard2.0), and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: TempEngineAlreadyDefined LiteDB/Utils/LiteException.cs:170— Method TempEngineAlreadyDefined — Roslyn's SymbolFinder walked every project the solution loads, including LiteDB(netstandard2.0), and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: CollectionNotFound LiteDB/Utils/LiteException.cs:175— Method CollectionNotFound — Roslyn's SymbolFinder walked every project the solution loads, including LiteDB(netstandard2.0), and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: InvalidExpressionType LiteDB/Utils/LiteException.cs:180— Method InvalidExpressionType — Roslyn's SymbolFinder walked every project the solution loads, including LiteDB(netstandard2.0), and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: CollectionAlreadyExist LiteDB/Utils/LiteException.cs:190— Method CollectionAlreadyExist — Roslyn's SymbolFinder walked every project the solution loads, including LiteDB(netstandard2.0), and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: InvalidCommand LiteDB/Utils/LiteException.cs:268— Method InvalidCommand — Roslyn's SymbolFinder walked every project the solution loads, including LiteDB(netstandard2.0), and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: AlreadyOpenDatafile LiteDB/Utils/LiteException.cs:278— Method AlreadyOpenDatafile — Roslyn's SymbolFinder walked every project the solution loads, including LiteDB(netstandard2.0), and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: InvalidDbRef LiteDB/Utils/LiteException.cs:283— Method InvalidDbRef — Roslyn's SymbolFinder walked every project the solution loads, including LiteDB(netstandard2.0), and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: PropertyReadWrite LiteDB/Utils/LiteException.cs:340— Method PropertyReadWrite — Roslyn's SymbolFinder walked every project the solution loads, including LiteDB(netstandard2.0), and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: PropertyNotMapped LiteDB/Utils/LiteException.cs:345— Method PropertyNotMapped — Roslyn's SymbolFinder walked every project the solution loads, including LiteDB(netstandard2.0), and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: BucketHelper LiteDB/Utils/Pool/BucketHelper.cs:6— NamedType BucketHelper — Roslyn's SymbolFinder walked every project the solution loads, including LiteDB(netstandard2.0), and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: GetBucketIndex LiteDB/Utils/Pool/BucketHelper.cs:21— Method GetBucketIndex — Roslyn's SymbolFinder walked every project the solution loads, including LiteDB(netstandard2.0), and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: ValueSets LiteDB.Tests/Mapper/LinqCacheWideFuzzCampaign.cs:14— Field ValueSets — Roslyn's SymbolFinder walked every project the solution loads, including LiteDB.Tests(net462), and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: Created LiteDB.Tests/Utils/Faker.cs:76— Method Created — Roslyn's SymbolFinder walked every project the solution loads, including LiteDB.Tests(net462), and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: SkuNumber LiteDB.Tests/Utils/Faker.cs:95— Method SkuNumber — Roslyn's SymbolFinder walked every project the solution loads, including LiteDB.Tests(net462), and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: SharedCachedIdleTimer_Tests LiteDB.Tests/Engine/SharedCachedIdleTimer_Tests.cs:14— NamedType SharedCachedIdleTimer_Tests — Roslyn's SymbolFinder walked every project the solution loads, including LiteDB.Tests(net8.0), and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: SharedCleanupFailure_Tests LiteDB.Tests/Engine/SharedCleanupFailure_Tests.cs:12— NamedType SharedCleanupFailure_Tests — Roslyn's SymbolFinder walked every project the solution loads, including LiteDB.Tests(net8.0), and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Hotspot: LiteDB/Engine/Query/Pipeline/QueryPipe.cs LiteDB/Engine/Query/Pipeline/QueryPipe.cs:29— LiteDB/Engine/Query/Pipeline/QueryPipe.cs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in QueryPipe.Pipe at line 29. 6 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 13:00:51 +02:00' --until='2026-10-01 13:00:51 +02:00' --full-history --no-merges -- LiteDB/Engine/Query/Pipeline/QueryPipe.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: LiteDB/Client/Mapper/BsonMapper.Serialize.cs LiteDB/Client/Mapper/BsonMapper.Serialize.cs:57— LiteDB/Client/Mapper/BsonMapper.Serialize.cs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in BsonMapper.Serialize at line 57. 4 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 13:00:51 +02:00' --until='2026-10-01 13:00:51 +02:00' --full-history --no-merges -- LiteDB/Client/Mapper/BsonMapper.Serialize.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: LiteDB/Client/Mapper/BsonMapper.Deserialize.cs LiteDB/Client/Mapper/BsonMapper.Deserialize.cs:98— LiteDB/Client/Mapper/BsonMapper.Deserialize.cs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in BsonMapper.Deserialize at line 98. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 13:00:51 +02:00' --until='2026-10-01 13:00:51 +02:00' --full-history --no-merges -- LiteDB/Client/Mapper/BsonMapper.Deserialize.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: LiteDB/Client/Structures/ConnectionString.cs LiteDB/Client/Structures/ConnectionString.cs:332— LiteDB/Client/Structures/ConnectionString.cs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in ConnectionString.BuildConnectionString at line 332. 3 of those changes were fix/bug commits, and the other 8 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 13:00:51 +02:00' --until='2026-10-01 13:00:51 +02:00' --full-history --no-merges -- LiteDB/Client/Structures/ConnectionString.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: LiteDB.Fuzz/Program.cs LiteDB.Fuzz/Program.cs:22— LiteDB.Fuzz/Program.cs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in Program.Main at line 22. 1 of those changes was a fix/bug commit, and the other 6 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 13:00:51 +02:00' --until='2026-10-01 13:00:51 +02:00' --full-history --no-merges -- LiteDB.Fuzz/Program.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: LiteDB/Engine/Services/TransactionService.cs LiteDB/Engine/Services/TransactionService.cs:153— LiteDB/Engine/Services/TransactionService.cs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in TransactionService.PersistDirtyPages at line 153. 2 of those changes were fix/bug commits, and the other 10 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 13:00:51 +02:00' --until='2026-10-01 13:00:51 +02:00' --full-history --no-merges -- LiteDB/Engine/Services/TransactionService.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: LiteDB/Engine/Services/WalIndexService.cs LiteDB/Engine/Services/WalIndexService.cs:223— LiteDB/Engine/Services/WalIndexService.cs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in WalIndexService.RestoreIndex at line 223. 3 of those changes were fix/bug commits, and the other 7 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 13:00:51 +02:00' --until='2026-10-01 13:00:51 +02:00' --full-history --no-merges -- LiteDB/Engine/Services/WalIndexService.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: LiteDB/Document/BsonValue.cs LiteDB/Document/BsonValue.cs:128— LiteDB/Document/BsonValue.cs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in BsonValue.BsonValue.ctor at line 128. 4 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 13:00:51 +02:00' --until='2026-10-01 13:00:51 +02:00' --full-history --no-merges -- LiteDB/Document/BsonValue.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: LiteDB/Client/Mapper/Linq/TypeResolver/StringResolver.cs LiteDB/Client/Mapper/Linq/TypeResolver/StringResolver.cs:15— LiteDB/Client/Mapper/Linq/TypeResolver/StringResolver.cs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in StringResolver.ResolveMethod at line 15. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 13:00:51 +02:00' --until='2026-10-01 13:00:51 +02:00' --full-history --no-merges -- LiteDB/Client/Mapper/Linq/TypeResolver/StringResolver.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: LiteDB/Engine/Services/RebuildService.cs LiteDB/Engine/Services/RebuildService.cs:143— LiteDB/Engine/Services/RebuildService.cs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in RebuildService.Install at line 143. 2 of those changes were fix/bug commits, and the other 3 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 13:00:51 +02:00' --until='2026-10-01 13:00:51 +02:00' --full-history --no-merges -- LiteDB/Engine/Services/RebuildService.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: tools/VectorCompatibility/Current/Program.cs tools/VectorCompatibility/Current/Program.cs:11— tools/VectorCompatibility/Current/Program.cs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in Program.Main at line 11. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 13:00:51 +02:00' --until='2026-10-01 13:00:51 +02:00' --full-history --no-merges -- tools/VectorCompatibility/Current/Program.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: LiteDB/Engine/Disk/StreamFactory/FileStreamFactory.cs LiteDB/Engine/Disk/StreamFactory/FileStreamFactory.cs:56— LiteDB/Engine/Disk/StreamFactory/FileStreamFactory.cs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in FileStreamFactory.GetStream at line 56. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 13:00:51 +02:00' --until='2026-10-01 13:00:51 +02:00' --full-history --no-merges -- LiteDB/Engine/Disk/StreamFactory/FileStreamFactory.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: LiteDB/Client/Mapper/BsonMapper.GetEntityMapper.cs LiteDB/Client/Mapper/BsonMapper.GetEntityMapper.cs:67— LiteDB/Client/Mapper/BsonMapper.GetEntityMapper.cs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in BsonMapper.BuildEntityMapper at line 67. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 13:00:51 +02:00' --until='2026-10-01 13:00:51 +02:00' --full-history --no-merges -- LiteDB/Client/Mapper/BsonMapper.GetEntityMapper.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: REDACTED REDACTED:52— REDACTED changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in AesStream.AesStream.ctor at line 52. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 13:00:51 +02:00' --until='2026-10-01 13:00:51 +02:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: LiteDB/Engine/Engine/Index.cs LiteDB/Engine/Engine/Index.cs:46— LiteDB/Engine/Engine/Index.cs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in LiteEngine.EnsureIndex at line 46. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 13:00:51 +02:00' --until='2026-10-01 13:00:51 +02:00' --full-history --no-merges -- LiteDB/Engine/Engine/Index.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: LiteDB/Client/Shared/SharedEngine.Query.cs LiteDB/Client/Shared/SharedEngine.Query.cs:31— LiteDB/Client/Shared/SharedEngine.Query.cs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in SharedEngine.QueryCore at line 31. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 13:00:51 +02:00' --until='2026-10-01 13:00:51 +02:00' --full-history --no-merges -- LiteDB/Client/Shared/SharedEngine.Query.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: LiteDB/Document/Expression/Parser/BsonExpressionParser.cs LiteDB/Document/Expression/Parser/BsonExpressionParser.cs:121— LiteDB/Document/Expression/Parser/BsonExpressionParser.cs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in BsonExpressionParser.ParseSelectDocumentBuilder at line 121. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 13:00:51 +02:00' --until='2026-10-01 13:00:51 +02:00' --full-history --no-merges -- LiteDB/Document/Expression/Parser/BsonExpressionParser.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: LiteDB/Utils/Extensions/DictionaryExtensions.cs LiteDB/Utils/Extensions/DictionaryExtensions.cs:34— LiteDB/Utils/Extensions/DictionaryExtensions.cs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in DictionaryExtensions.ParseKeyValue at line 34. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 13:00:51 +02:00' --until='2026-10-01 13:00:51 +02:00' --full-history --no-merges -- LiteDB/Utils/Extensions/DictionaryExtensions.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: LiteDB/Engine/Disk/Serializer/BsonElementReader.cs LiteDB/Engine/Disk/Serializer/BsonElementReader.cs:12— LiteDB/Engine/Disk/Serializer/BsonElementReader.cs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in BsonElementReader.Read at line 12. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 13:00:51 +02:00' --until='2026-10-01 13:00:51 +02:00' --full-history --no-merges -- LiteDB/Engine/Disk/Serializer/BsonElementReader.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: LiteDB.Tests.SharedMutexHarness/MvccHarness.cs LiteDB.Tests.SharedMutexHarness/MvccHarness.cs:6— LiteDB.Tests.SharedMutexHarness/MvccHarness.cs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in MvccHarness.TryRun at line 6. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 13:00:51 +02:00' --until='2026-10-01 13:00:51 +02:00' --full-history --no-merges -- LiteDB.Tests.SharedMutexHarness/MvccHarness.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: LiteDB/Client/Mapper/Linq/TypeResolver/EnumerableResolver.cs LiteDB/Client/Mapper/Linq/TypeResolver/EnumerableResolver.cs:14— LiteDB/Client/Mapper/Linq/TypeResolver/EnumerableResolver.cs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in EnumerableResolver.ResolveMethod at line 14. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 13:00:51 +02:00' --until='2026-10-01 13:00:51 +02:00' --full-history --no-merges -- LiteDB/Client/Mapper/Linq/TypeResolver/EnumerableResolver.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: LiteDB/Engine/Query/IndexQuery/IndexRange.cs LiteDB/Engine/Query/IndexQuery/IndexRange.cs:61— LiteDB/Engine/Query/IndexQuery/IndexRange.cs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in IndexRange.Execute at line 61. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 13:00:51 +02:00' --until='2026-10-01 13:00:51 +02:00' --full-history --no-merges -- LiteDB/Engine/Query/IndexQuery/IndexRange.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: LiteDB/Engine/Query/IndexQuery/IndexLike.cs LiteDB/Engine/Query/IndexQuery/IndexLike.cs:99— LiteDB/Engine/Query/IndexQuery/IndexLike.cs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in IndexLike.ExecuteStartsWith at line 99. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 13:00:51 +02:00' --until='2026-10-01 13:00:51 +02:00' --full-history --no-merges -- LiteDB/Engine/Query/IndexQuery/IndexLike.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: LiteDB.Fuzz/FuzzOptions.cs LiteDB.Fuzz/FuzzOptions.cs:34— LiteDB.Fuzz/FuzzOptions.cs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in FuzzOptions.Parse at line 34. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 13:00:51 +02:00' --until='2026-10-01 13:00:51 +02:00' --full-history --no-merges -- LiteDB.Fuzz/FuzzOptions.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: LiteDB/Engine/Disk/DiskService.HeaderJournal.cs LiteDB/Engine/Disk/DiskService.HeaderJournal.cs:48— LiteDB/Engine/Disk/DiskService.HeaderJournal.cs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in DiskService.RecoverHeaderJournal at line 48. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 13:00:51 +02:00' --until='2026-10-01 13:00:51 +02:00' --full-history --no-merges -- LiteDB/Engine/Disk/DiskService.HeaderJournal.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Swallowed exception (empty catch) LiteDB/Client/Shared/SharedCoordinationFile.cs:53— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) LiteDB/Client/Shared/SharedCoordinationFile.cs:54— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) LiteDB/Client/Shared/SharedCoordinationFiles.cs:74— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) LiteDB/Client/Shared/SharedCoordinationFiles.cs:84— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) LiteDB/Client/Shared/SharedCoordinationFiles.cs:85— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) LiteDB/Client/Shared/SharedCoordinationTemporaryFiles.cs:65— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) LiteDB/Client/Shared/SharedCoordinationTemporaryFiles.cs:66— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) LiteDB/Client/Shared/SharedCoordinationTemporaryFiles.cs:69— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) LiteDB/Client/Shared/SharedCoordinationTemporaryFiles.cs:70— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) LiteDB/Client/Shared/SharedEngine.Coordination.cs:49— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) LiteDB/Client/Shared/SharedMutexOwner.cs:228— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) LiteDB/Client/Shared/SharedMutexOwner.cs:297— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) LiteDB/Client/Shared/SharedMutexOwner.cs:393— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) LiteDB/Client/Shared/SharedMutexOwner.cs:487— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) LiteDB/Client/Shared/SharedMutexTurnstile.cs:52— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) LiteDB/Client/Shared/SharedReaderRegistry.cs:50— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) LiteDB/Client/Shared/SharedReaderRegistry.cs:184— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) LiteDB/Client/Shared/SharedReaderRegistry.cs:185— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) LiteDB/Client/Shared/SharedReaderRegistry.cs:211— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) LiteDB/Client/Shared/SharedReaderSlots.cs:152— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) LiteDB/Client/Shared/SharedReaderSlots.cs:169— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) LiteDB/Document/Expression/Methods/DataTypes.cs:227— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) LiteDB/Document/Expression/Methods/DataTypes.cs:256— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) LiteDB/Document/Expression/Methods/DataTypes.cs:285— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) LiteDB/Document/Expression/Methods/DataTypes.cs:314— 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.
Sync-over-async blocking — 24 blocking call(s) on async work (.Wait()/.GetAwaiter().GetResult()) — these waste a thread and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking LiteDB/Client/Shared/SharedMutexOwner.cs:237— `_released.Wait()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking LiteDB/Client/Shared/SharedMutexOwner.cs:350— `_done.Wait()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking LiteDB/Client/Shared/SharedMutexPin.cs:106— `_acquired.Wait()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking LiteDB/Client/Shared/SharedMutexPin.cs:201— `_released.Wait()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking LiteDB/Utils/Extensions/IOExceptionExtensions.cs:37— `.Wait()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking LiteDB.ReproRunner/Repros/Issue_2586_RollbackTransaction/Program.cs:89— `holdersReady.Wait()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking LiteDB.ReproRunner/Repros/Issue_2586_RollbackTransaction/Program.cs:158— `release.Wait()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking LiteDB.ReproRunner/LiteDB.ReproRunner.Shared/Messaging/ReproHostClient.cs:124— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking LiteDB.ReproRunner/LiteDB.ReproRunner.Shared/Messaging/ReproHostClient.cs:135— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking LiteDB.ReproRunner/LiteDB.ReproRunner.Shared/Messaging/ReproHostClient.cs:145— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking LiteDB.ReproRunner/LiteDB.ReproRunner.Shared/Messaging/ReproHostClient.cs:156— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking LiteDB.ReproRunner/LiteDB.ReproRunner.Shared/Messaging/ReproHostClient.cs:166— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking LiteDB.Fuzz/Targets/ChaosFuzzer.cs:237— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking LiteDB.Fuzz/Targets/CursorHandoffFuzzer.cs:101— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking LiteDB.Fuzz/Targets/SnapshotWriterProcess.cs:34— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking LiteDB.Fuzz/Targets/SnapshotWriterProcess.cs:78— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking LiteDB.Fuzz/Targets/ThreadedSnapshotFuzzer.cs:56— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking LiteDB.Fuzz/Targets/ThreadedSnapshotFuzzer.cs:73— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking tools/MemoryProfiles/ProfileWorkload.cs:82— `start.Wait()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking tools/MemoryProfiles/ProfileWorkload.cs:92— `ready.Wait()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking tools/MemoryValidation/MemoryWorkload.cs:74— `start.Wait()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking tools/MemoryValidation/MemoryWorkload.cs:84— `ready.Wait()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking tools/VectorCompatibility/Current/WalReuseCompatibility.cs:55— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking tools/VectorCompatibility/Current/WalReuseCompatibility.cs:95— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
TooManyMethods: BsonExpressionMethods LiteDB/Document/Expression/Methods/DataTypes.cs— TooManyMethods — 538 significant lines (blank, comment-only and punctuation-only lines excluded), 122 methods, declared across 8 files: Methods/DataTypes.cs (54), Methods/String.cs (19), Methods/Misc.cs (17), Methods/Date.cs (10), +4 more file(s). The bar is 30 methods; this is 92 over it, 4.07× the bar. 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: SharedEngine LiteDB/Client/Shared/SharedEngine.cs— TooManyMethods — 933 significant lines (blank, comment-only and punctuation-only lines excluded), 90 methods, declared across 7 files: Shared/SharedEngine.cs (31), Shared/SharedEngine.Query.cs (13), Shared/SharedEngine.Readers.cs (13), Shared/SharedEngine.Calls.cs (12), +3 more file(s). The bar is 30 methods; this is 60 over it, 3.00× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: LiteEngine LiteDB/Engine/LiteEngine.cs— TooManyMethods — 1083 significant lines (blank, comment-only and punctuation-only lines excluded), 75 methods, declared across 29 files: Engine/LiteEngine.cs (12), Engine/Transaction.cs (8), Engine/IndexMigration.cs (5), Engine/Index.cs (4), +25 more file(s). The bar is 30 methods; this is 45 over it, 2.50× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: LiteCollection LiteDB/Client/Database/Collections/Aggregate.cs— TooManyMethods — 322 significant lines (blank, comment-only and punctuation-only lines excluded), 75 methods, declared across 9 files: Collections/Aggregate.cs (24), Collections/Index.cs (16), Collections/Find.cs (11), Collections/Insert.cs (7), +5 more file(s). The bar is 30 methods; this is 45 over it, 2.50× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: DiskService LiteDB/Engine/Disk/DiskService.cs— TooManyMethods — 843 significant lines (blank, comment-only and punctuation-only lines excluded), 67 methods, declared across 15 files: Disk/DiskService.cs (12), Disk/DiskService.Checksums.cs (9), Disk/DiskService.DurableFlush.cs (8), Disk/DiskService.WalSlots.cs (7), +11 more file(s). The bar is 30 methods; this is 37 over it, 2.23× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: BsonMapper LiteDB/Client/Mapper/BsonMapper.Deserialize.cs— TooManyMethods — 835 significant lines (blank, comment-only and punctuation-only lines excluded), 66 methods, declared across 12 files: Mapper/BsonMapper.Deserialize.cs (14), Mapper/BsonMapper.Serialize.cs (11), Mapper/BsonMapper.cs (11), Mapper/BsonMapper.InterfaceIds.cs (6), +8 more file(s). The bar is 30 methods; this is 36 over it, 2.20× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: BsonValue LiteDB/Document/BsonValue.cs— TooManyMethods — 409 significant lines (blank, comment-only and punctuation-only lines excluded), 64 methods, declared across 3 files: Document/BsonValue.cs (57), Document/BsonValue.Collections.cs (6), Document/BsonValue.DecodedDateTime.cs (1). The bar is 30 methods; this is 34 over it, 2.13× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: QueryOptimization LiteDB/Engine/Query/QueryOptimization.cs— TooManyMethods — 747 significant lines (blank, comment-only and punctuation-only lines excluded), 61 methods, declared across 15 files: Query/QueryOptimization.cs (9), Query/QueryOptimization.BooleanRanges.cs (8), Query/QueryOptimization.IncludedFields.cs (6), Query/QueryOptimization.RangeDisjunction.cs (6), +11 more file(s). The bar is 30 methods; this is 31 over it, 2.03× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: LiteQueryable LiteDB/Client/Database/LiteQueryable.cs— TooManyMethods — 255 significant lines (blank, comment-only and punctuation-only lines excluded), 59 methods, declared across 3 files: Database/LiteQueryable.cs (40), Vector/LiteQueryable.Vector.cs (18), Database/LiteQueryable.Id.cs (1). The bar is 30 methods; this is 29 over it, 1.97× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: LiteException LiteDB/Utils/LiteException.cs— TooManyMethods — 195 significant lines (blank, comment-only and punctuation-only lines excluded), 54 methods. The bar is 30 methods; this is 24 over it, 1.80× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: LiteRepository LiteDB/Client/Database/LiteRepository.cs— TooManyMethods — 132 significant lines (blank, comment-only and punctuation-only lines excluded), 48 methods, declared across 3 files: Database/LiteRepository.cs (41), Database/LiteRepository.Collections.cs (6), Database/LiteRepository.Id.cs (1). The bar is 30 methods; this is 18 over it, 1.60× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: BufferReader LiteDB/Engine/Disk/Serializer/BufferReader.cs— TooManyMethods — 354 significant lines (blank, comment-only and punctuation-only lines excluded), 39 methods, declared across 4 files: Serializer/BufferReader.cs (33), Serializer/BufferReader.NetCore.cs (3), Serializer/BufferReader.SpanCopy.cs (2), Serializer/BufferReader.IndexKey.cs (1). The bar is 30 methods; this is 9 over it, 1.30× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: BsonExpressionOperators LiteDB/Document/Expression/Parser/BsonExpressionOperators.cs— TooManyMethods — 134 significant lines (blank, comment-only and punctuation-only lines excluded), 39 methods. The bar is 30 methods; this is 9 over it, 1.30× the bar. 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: VectorIndexService LiteDB/Engine/Services/VectorIndexService.cs— TooManyMethods — 543 significant lines (blank, comment-only and punctuation-only lines excluded), 35 methods, declared across 3 files: Services/VectorIndexService.cs (33), Services/VectorIndexService.Random.cs (1), Services/VectorIndexService.Search.cs (1). The bar is 30 methods; this is 5 over it, 1.17× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: BufferWriter LiteDB/Engine/Disk/Serializer/BufferWriter.cs— TooManyMethods — 320 significant lines (blank, comment-only and punctuation-only lines excluded), 35 methods, declared across 4 files: Serializer/BufferWriter.cs (29), Serializer/BufferWriter.NetCore.cs (4), Serializer/BufferWriter.BsonArray.cs (1), Serializer/BufferWriter.SpanCopy.cs (1). The bar is 30 methods; this is 5 over it, 1.17× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Snapshot LiteDB/Engine/Services/SnapShot.cs— TooManyMethods — 440 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods, declared across 8 files: Services/SnapShot.cs (18), Services/Snapshot.FileVersion.cs (4), Services/Snapshot.Storage.cs (4), Services/Snapshot.Lifetime.cs (2), +4 more file(s). The bar is 30 methods; this is 3 over it, 1.10× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: BsonExpression LiteDB/Document/Expression/BsonExpression.cs— TooManyMethods — 232 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods, declared across 6 files: Expression/BsonExpression.cs (16), Expression/BsonExpression.Compilation.cs (8), Expression/BsonExpression.Binding.cs (4), Expression/BsonExpression.Streaming.cs (2), +2 more file(s). The bar is 30 methods; this is 2 over it, 1.07× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: LinqExpressionTranslator LiteDB/Client/Mapper/Linq/LinqExpressionTranslator.cs— TooManyMethods — 459 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods, declared across 5 files: Linq/LinqExpressionTranslator.cs (15), Linq/LinqExpressionTranslator.Captures.cs (6), Linq/LinqExpressionTranslator.Projection.cs (5), Linq/LinqExpressionTranslator.Mapping.cs (4), +1 more file(s). The bar is 30 methods; this is 1 over it, 1.03× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: SharedCoordinationPage LiteDB/Client/Shared/SharedCoordinationPage.cs— TooManyMethods — 171 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 30 methods; this is 1 over it, 1.03× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
Low coverage: LiteDB.ReproRunner/LiteDB.ReproRunner.Shared/ReproConfigurationReporter.cs LiteDB.ReproRunner/LiteDB.ReproRunner.Shared/ReproConfigurationReporter.cs:1— 0.0% line coverage (0/45).
Low coverage: LiteDB.ReproRunner/LiteDB.ReproRunner.Shared/ReproContext.cs LiteDB.ReproRunner/LiteDB.ReproRunner.Shared/ReproContext.cs:1— 0.0% line coverage (0/51).
Low coverage: LiteDB.ReproRunner/LiteDB.ReproRunner.Shared/Messaging/ReproHostClient.cs LiteDB.ReproRunner/LiteDB.ReproRunner.Shared/Messaging/ReproHostClient.cs:1— 43.6% line coverage (34/78).
Low coverage: LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Program.cs LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Program.cs:1— 0.0% line coverage (0/74).
Low coverage: LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Manifests/ManifestValidator.cs LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Manifests/ManifestValidator.cs:1— 47.9% line coverage (236/493).
Low coverage: LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Manifests/ReproOsConstraints.cs LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Manifests/ReproOsConstraints.cs:1— 0.0% line coverage (0/15).
Low coverage: LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Infrastructure/CliOutput.cs LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Infrastructure/CliOutput.cs:1— 21.9% line coverage (16/73).
Low coverage: LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Infrastructure/ReproRootLocator.cs LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Infrastructure/ReproRootLocator.cs:1— 38.3% line coverage (18/47).
Low coverage: LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Infrastructure/TypeRegistrar.cs LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Infrastructure/TypeRegistrar.cs:1— 0.0% line coverage (0/41).
Low coverage: LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Execution/ReproBuildCoordinator.cs LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Execution/ReproBuildCoordinator.cs:1— 0.0% line coverage (0/110).
Low coverage: LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Execution/ReproExecutor.cs LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Execution/ReproExecutor.cs:1— 40.2% line coverage (187/465).
Low coverage: LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Execution/RunDirectoryPlanner.cs LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Execution/RunDirectoryPlanner.cs:1— 0.0% line coverage (0/102).
Low coverage: LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Execution/RunReportModels.cs LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Execution/RunReportModels.cs:1— 0.0% line coverage (0/28).
Low coverage: LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Commands/ListCommand.cs LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Commands/ListCommand.cs:1— 0.0% line coverage (0/99).
Low coverage: LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Commands/RunCommand.cs LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Commands/RunCommand.cs:1— 2.4% line coverage (15/618).
Low coverage: LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Commands/RunCommandSettings.cs LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Commands/RunCommandSettings.cs:1— 0.0% line coverage (0/33).
Low coverage: LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Commands/ShowCommand.cs LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Commands/ShowCommand.cs:1— 0.0% line coverage (0/20).
Low coverage: LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Commands/ValidateCommandSettings.cs LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Commands/ValidateCommandSettings.cs:1— 12.5% line coverage (1/8).
X2 · Cancellation propagation· Async method without CancellationToken · ×18
Async method without CancellationToken: WriteResultAsync LiteDB.Fuzz/FuzzArtifacts.cs:30— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: WriteAbnormalTerminationAsync LiteDB.Fuzz/FuzzArtifacts.cs:122— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: WriteArtifactBudgetFailureAsync LiteDB.Fuzz/FuzzArtifacts.cs:153— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: RunEpochsAsync LiteDB.Fuzz/FuzzProcessRunner.cs:16— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: VerifyDeterminismAsync LiteDB.Fuzz/FuzzProcessRunner.cs:88— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: RunCoreAsync LiteDB.Fuzz/FuzzProcessRunner.cs:109— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: RunTrialAsync LiteDB.Fuzz/FuzzProcessRunner.cs:197— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: RunAsync LiteDB.Fuzz/Program.cs:111— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: MinimizeAsync LiteDB.Fuzz/Program.cs:165— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: RunAsync LiteDB.Fuzz/Targets/ConcurrentFuzzer.cs:10— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: RunAsync LiteDB.Fuzz/Targets/ConflictFuzzer.cs:10— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: SchemaAndStorageConflict LiteDB.Fuzz/Targets/ConflictFuzzer.cs:45— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: DropAndWriterConflict LiteDB.Fuzz/Targets/ConflictFuzzer.cs:78— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: RebuildAndWriterConflict LiteDB.Fuzz/Targets/ConflictFuzzer.cs:101— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: RunAsync LiteDB.Fuzz/Targets/CursorHandoffFuzzer.cs:10— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: RunAsync LiteDB.Fuzz/Targets/LinqCacheFuzzer.cs:12— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: RunAsync LiteDB.Fuzz/Targets/ThreadedSnapshotFuzzer.cs:8— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: Capture LiteDB.ReproRunner/Repros/SharedSelfTeardownProof/Program.cs:78— No CancellationToken parameter — this work can't be stopped early once started.
X20 · Mistyped argument guard· Argument guard throws the exception its own condition disproves · ×16
Argument guard throws the exception its own condition disproves LiteDB/Client/Database/Collections/Aggregate.cs:136— The guard on line 136 rejects `keySelector` and line 136 reports that rejection as `ArgumentNullException` — but the condition's own test `string.IsNullOrEmpty(keySelector)` is true of a value that is NOT null: it is satisfied by an EMPTY `keySelector`, and on that path `keySelector` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows the empty case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` for the empty case, or split the guard and throw each on its own condition.
Argument guard throws the exception its own condition disproves LiteDB/Client/Database/Collections/Aggregate.cs:173— The guard on line 173 rejects `keySelector` and line 173 reports that rejection as `ArgumentNullException` — but the condition's own test `string.IsNullOrEmpty(keySelector)` is true of a value that is NOT null: it is satisfied by an EMPTY `keySelector`, and on that path `keySelector` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows the empty case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` for the empty case, or split the guard and throw each on its own condition.
Argument guard throws the exception its own condition disproves LiteDB/Client/Database/Collections/Include.cs:29— The guard on line 29 rejects `keySelector` and line 29 reports that rejection as `ArgumentNullException` — but the condition's own test `string.IsNullOrEmpty(keySelector)` is true of a value that is NOT null: it is satisfied by an EMPTY `keySelector`, and on that path `keySelector` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows the empty case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` for the empty case, or split the guard and throw each on its own condition.
Argument guard throws the exception its own condition disproves LiteDB/Client/Database/Collections/Index.cs:24— The guard on line 24 rejects `name` and line 24 reports that rejection as `ArgumentNullException` — but the condition's own test `string.IsNullOrEmpty(name)` is true of a value that is NOT null: it is satisfied by an EMPTY `name`, and on that path `name` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows the empty case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` for the empty case, or split the guard and throw each on its own condition.
Argument guard throws the exception its own condition disproves LiteDB/Client/Database/Collections/Index.cs:32— The guard on line 32 rejects `name` and line 32 reports that rejection as `ArgumentNullException` — but the condition's own test `string.IsNullOrEmpty(name)` is true of a value that is NOT null: it is satisfied by an EMPTY `name`, and on that path `name` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows the empty case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` for the empty case, or split the guard and throw each on its own condition.
Argument guard throws the exception its own condition disproves LiteDB/Client/Structures/ConnectionString.cs:133— The guard on line 133 rejects `connectionString` and line 133 reports that rejection as `ArgumentNullException` — but the condition's own test `string.IsNullOrEmpty(connectionString)` is true of a value that is NOT null: it is satisfied by an EMPTY `connectionString`, and on that path `connectionString` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows the empty case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` for the empty case, or split the guard and throw each on its own condition.
Argument guard throws the exception its own condition disproves LiteDB/Client/Vector/LiteQueryable.Vector.cs:31— The guard on line 31 rejects `vectorField` and line 31 reports that rejection as `ArgumentNullException` — but the condition's own test `string.IsNullOrWhiteSpace(vectorField)` is true of a value that is NOT null: it is satisfied by an EMPTY `vectorField`, and on that path `vectorField` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows the empty case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` for the empty case, or split the guard and throw each on its own condition.
Argument guard throws the exception its own condition disproves LiteDB/Document/Bson/BsonSerializer.cs:37— The guard on line 37 rejects `buffer` and line 37 reports that rejection as `ArgumentNullException` — but the condition's own test `buffer.Length == 0` is true of a value that is NOT null: it is satisfied by an EMPTY `buffer`, and on that path `buffer` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows the empty case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` for the empty case, or split the guard and throw each on its own condition.
Argument guard throws the exception its own condition disproves LiteDB/Document/Expression/BsonExpression.Compilation.cs:79— The guard on line 79 rejects `expression` and line 79 reports that rejection as `ArgumentNullException` — but the condition's own test `string.IsNullOrWhiteSpace(expression)` is true of a value that is NOT null: it is satisfied by an EMPTY `expression`, and on that path `expression` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows the empty case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` for the empty case, or split the guard and throw each on its own condition.
Argument guard throws the exception its own condition disproves LiteDB/Document/ObjectId.cs:134— The guard on line 134 rejects `value` and line 134 reports that rejection as `ArgumentNullException` — but the condition's own test `string.IsNullOrEmpty(value)` is true of a value that is NOT null: it is satisfied by an EMPTY `value`, and on that path `value` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows the empty case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` for the empty case, or split the guard and throw each on its own condition.
Argument guard throws the exception its own condition disproves LiteDB/Engine/Engine/Query.cs:17— The guard on line 17 rejects `collection` and line 17 reports that rejection as `ArgumentNullException` — but the condition's own test `string.IsNullOrWhiteSpace(collection)` is true of a value that is NOT null: it is satisfied by an EMPTY `collection`, and on that path `collection` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows the empty case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` for the empty case, or split the guard and throw each on its own condition.
Argument guard throws the exception its own condition disproves LiteDB/Utils/MimeTypeConverter.cs:585— The guard on line 585 rejects `filename` and line 585 reports that rejection as `ArgumentNullException` — but the condition's own test `string.IsNullOrEmpty(filename)` is true of a value that is NOT null: it is satisfied by an EMPTY `filename`, and on that path `filename` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows the empty case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` for the empty case, or split the guard and throw each on its own condition.
Argument guard throws the exception its own condition disproves LiteDB.Demo.Tools.VectorSearch/Configuration/GeminiEmbeddingOptions.cs:28— The guard on line 26 rejects `projectId` and line 28 reports that rejection as `ArgumentNullException` — but the condition's own test `string.IsNullOrWhiteSpace(projectId)` is true of a value that is NOT null: it is satisfied by an EMPTY `projectId`, and on that path `projectId` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows the empty case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` for the empty case, or split the guard and throw each on its own condition.
Argument guard throws the exception its own condition disproves LiteDB.Demo.Tools.VectorSearch/Configuration/GeminiEmbeddingOptions.cs:33— The guard on line 31 rejects `location` and line 33 reports that rejection as `ArgumentNullException` — but the condition's own test `string.IsNullOrWhiteSpace(location)` is true of a value that is NOT null: it is satisfied by an EMPTY `location`, and on that path `location` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows the empty case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` for the empty case, or split the guard and throw each on its own condition.
Argument guard throws the exception its own condition disproves LiteDB.Demo.Tools.VectorSearch/Configuration/GeminiEmbeddingOptions.cs:43— The guard on line 41 rejects `apiKey` and line 43 reports that rejection as `ArgumentNullException` — but the condition's own test `string.IsNullOrWhiteSpace(apiKey)` is true of a value that is NOT null: it is satisfied by an EMPTY `apiKey`, and on that path `apiKey` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows the empty case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` for the empty case, or split the guard and throw each on its own condition.
Argument guard throws the exception its own condition disproves LiteDB.Demo.Tools.VectorSearch/Configuration/GeminiEmbeddingOptions.cs:87— The guard on line 85 rejects `model` and line 87 reports that rejection as `ArgumentNullException` — but the condition's own test `string.IsNullOrWhiteSpace(model)` is true of a value that is NOT null: it is satisfied by an EMPTY `model`, and on that path `model` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows the empty case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` for the empty case, or split the guard and throw each on its own condition.
Sync-over-async (deadlock risk) LiteDB/Utils/Extensions/IOExceptionExtensions.cs:37— 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.
Sync-over-async (deadlock risk) LiteDB.ReproRunner/LiteDB.ReproRunner.Shared/Messaging/ReproHostClient.cs:124— 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.
Sync-over-async (deadlock risk) LiteDB.ReproRunner/LiteDB.ReproRunner.Shared/Messaging/ReproHostClient.cs:135— 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.
Sync-over-async (deadlock risk) LiteDB.ReproRunner/LiteDB.ReproRunner.Shared/Messaging/ReproHostClient.cs:145— 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.
Sync-over-async (deadlock risk) LiteDB.ReproRunner/LiteDB.ReproRunner.Shared/Messaging/ReproHostClient.cs:156— 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.
Sync-over-async (deadlock risk) LiteDB.ReproRunner/LiteDB.ReproRunner.Shared/Messaging/ReproHostClient.cs:166— 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.
Sync-over-async (deadlock risk) LiteDB.Fuzz/Targets/ChaosFuzzer.cs:237— 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.
Sync-over-async (deadlock risk) LiteDB.Fuzz/Targets/CursorHandoffFuzzer.cs:101— 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.
Sync-over-async (deadlock risk) LiteDB.Fuzz/Targets/SnapshotWriterProcess.cs:34— 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.
Sync-over-async (deadlock risk) LiteDB.Fuzz/Targets/SnapshotWriterProcess.cs:78— 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.
Sync-over-async (deadlock risk) LiteDB.Fuzz/Targets/ThreadedSnapshotFuzzer.cs:56— 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.
Sync-over-async (deadlock risk) LiteDB.Fuzz/Targets/ThreadedSnapshotFuzzer.cs:73— 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.
Sync-over-async (deadlock risk) tools/VectorCompatibility/Current/WalReuseCompatibility.cs:55— 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.
Sync-over-async (deadlock risk) tools/VectorCompatibility/Current/WalReuseCompatibility.cs:95— 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.
Swallowed exception (caught, then discarded) LiteDB/Client/Shared/SharedCoordinationFallback.cs:34— `catch (FileNotFoundException)` does nothing with the exception it caught — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch. Log it through whatever this codebase already uses to report problems, or let it propagate; if one specific failure genuinely cannot matter, catch exactly that exception type and say why in a comment on the catch.
Swallowed exception (caught, then discarded) LiteDB/Client/Shared/SharedCoordinationFallback.cs:35— `catch (DirectoryNotFoundException)` does nothing with the exception it caught — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch. Log it through whatever this codebase already uses to report problems, or let it propagate; if one specific failure genuinely cannot matter, catch exactly that exception type and say why in a comment on the catch.
Swallowed exception (caught, then discarded) LiteDB/Client/Shared/SharedEngine.Query.cs:213— `catch (Exception) when (…)` does nothing with the exception it caught — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch. Log it through whatever this codebase already uses to report problems, or let it propagate; if one specific failure genuinely cannot matter, catch exactly that exception type and say why in a comment on the catch.
Swallowed exception (caught, then discarded) LiteDB/Client/Shared/SharedMutexPin.cs:210— `catch (AbandonedMutexException)` does nothing with the exception it caught — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch. Log it through whatever this codebase already uses to report problems, or let it propagate; if one specific failure genuinely cannot matter, catch exactly that exception type and say why in a comment on the catch.
Swallowed exception (caught, then discarded) LiteDB/Client/Shared/SharedMutexScope.cs:35— `catch (AbandonedMutexException)` does nothing with the exception it caught — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch. Log it through whatever this codebase already uses to report problems, or let it propagate; if one specific failure genuinely cannot matter, catch exactly that exception type and say why in a comment on the catch.
Swallowed exception (caught, then discarded) LiteDB/Client/Shared/SharedReaderRegistry.cs:166— `catch (Exception) when (…)` does nothing with the exception it caught — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch. Log it through whatever this codebase already uses to report problems, or let it propagate; if one specific failure genuinely cannot matter, catch exactly that exception type and say why in a comment on the catch.
Swallowed exception (caught, then discarded) LiteDB/Document/ObjectId.cs:393— `catch (SecurityException)` does nothing with the exception it caught — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch. Log it through whatever this codebase already uses to report problems, or let it propagate; if one specific failure genuinely cannot matter, catch exactly that exception type and say why in a comment on the catch.
Swallowed exception (caught, then discarded) LiteDB/Engine/Disk/WalRecovery.cs:39— `catch (PageChecksumException)` does nothing with the exception it caught — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch. Log it through whatever this codebase already uses to report problems, or let it propagate; if one specific failure genuinely cannot matter, catch exactly that exception type and say why in a comment on the catch.
Swallowed exception (caught, then discarded) LiteDB/Engine/Disk/WalRetirementReader.cs:32— `catch (PageChecksumException) when (…)` does nothing with the exception it caught — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch. Log it through whatever this codebase already uses to report problems, or let it propagate; if one specific failure genuinely cannot matter, catch exactly that exception type and say why in a comment on the catch.
Swallowed exception (caught, then discarded) LiteDB/Engine/Services/RebuildRecovery.cs:32— `catch (FileNotFoundException)` does nothing with the exception it caught — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch. Log it through whatever this codebase already uses to report problems, or let it propagate; if one specific failure genuinely cannot matter, catch exactly that exception type and say why in a comment on the catch.
Swallowed exception (caught, then discarded) LiteDB/Engine/Services/RebuildRecovery.cs:33— `catch (DirectoryNotFoundException)` does nothing with the exception it caught — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch. Log it through whatever this codebase already uses to report problems, or let it propagate; if one specific failure genuinely cannot matter, catch exactly that exception type and say why in a comment on the catch.
MethodTooLong: ManifestValidator.Validate LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Manifests/ManifestValidator.cs:28— MethodTooLong — Validate runs 224 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 124 over it, 2.24× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: ReaderContentionBenchmarks.Run tools/SharedReadBenchmarks/ReaderContentionBenchmarks.cs:24— MethodTooLong — Run runs 162 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 62 over it, 1.62× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: RunCommand.RunExecutionLoopAsync LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Commands/RunCommand.cs:277— MethodTooLong — RunExecutionLoopAsync runs 161 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 61 over it, 1.61× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Tokenizer.ReadNext LiteDB/Utils/Tokenizer.cs:323— MethodTooLong — ReadNext runs 160 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 60 over it, 1.60× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Program.Run tools/SharedReadBenchmarks/Program.cs:87— MethodTooLong — Run runs 138 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 38 over it, 1.38× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: RunCommand.ExecuteAsync LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Commands/RunCommand.cs:61— MethodTooLong — ExecuteAsync runs 129 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 29 over it, 1.29× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Program.Main tools/QueryOptimizationBenchmarks/Program.cs:13— MethodTooLong — Main runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: TransactionFuzzer.RunAsync LiteDB.Fuzz/Targets/TransactionFuzzer.cs:8— MethodTooLong — RunAsync runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
No assertions: BsonDocument_Inner LiteDB.Tests/Document/Implicit_Tests.cs:30— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: Buffer_Write_CString_Basic LiteDB.Tests/Internals/BufferWriter_Tests.cs:36— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: Disk_ExclusiveScheduler_Write LiteDB.Tests/Internals/Disk_Tests.cs:216— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: Document_Copies_Properties_To_KeyValue_Array LiteDB.Tests/Internals/Document_Tests.cs:11— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: Linq_Array_Navigation_Eval LiteDB.Tests/Mapper/LinqEval_Tests.cs:134— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
Deprecated: xunit LiteDB.Tests/LiteDB.Tests.csproj:51— xunit 2.9.2 — Legacy — the publisher's replacement is `xunit.v3`; that is the next major line under a new package id, so the move is a breaking rename rather than a version bump — budget for API changes in the code that uses it, not only the reference swap.
Deprecated: xunit REDACTED:16— xunit 2.5.3 — Legacy — the publisher's replacement is `xunit.v3`; that is the next major line under a new package id, so the move is a breaking rename rather than a version bump — budget for API changes in the code that uses it, not only the reference swap.
Deprecated: xunit LiteDB.Fuzz.Tests/LiteDB.Fuzz.Tests.csproj:10— xunit 2.9.2 — Legacy — the publisher's replacement is `xunit.v3`; that is the next major line under a new package id, so the move is a breaking rename rather than a version bump — budget for API changes in the code that uses it, not only the reference swap.
Deprecated: xunit.runner.console LiteDB.Tests/LiteDB.Tests.csproj:52— xunit.runner.console 2.9.2 — Legacy — the publisher's replacement is `xunit.v3.runner.console`; migrate the reference to it.
Deprecated: xunit.runner.reporters LiteDB.Tests/LiteDB.Tests.csproj:56— xunit.runner.reporters 2.9.2 — Legacy — the publisher's replacement is `xunit.v3.runner.utility`; migrate the reference to it.
Duplicated block (7 lines × 2) LiteDB/Engine/Services/WalIndexService.Snapshot.cs:64— LiteDB/Engine/Services/WalIndexService.Snapshot.cs:64-70 | LiteDB/Engine/Services/WalIndexService.cs:264-270 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (7 lines × 2) LiteDB/Engine/Engine/Index.cs:150— LiteDB/Engine/Engine/Index.cs:150-156 | LiteDB/Engine/Engine/Upsert.cs:19-25 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `LiteDB/Engine/Engine/Index.cs:150` 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 (7 lines × 2) tools/SharedReadBenchmarks/ContentionBenchmarks.cs:90— tools/SharedReadBenchmarks/ContentionBenchmarks.cs:90-99 | tools/SharedReadBenchmarks/ReaderContentionBenchmarks.cs:174-180 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `tools/SharedReadBenchmarks/ReaderContentionBenchmarks.cs:174` 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 (7 lines × 2) LiteDB/Document/Expression/BorrowedPredicateEvaluator.cs:153— LiteDB/Document/Expression/BorrowedPredicateEvaluator.cs:153-159 | LiteDB/Document/Expression/BorrowedScalarEvaluator.cs:81-87 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (7 lines × 2) tools/QueryOptimizationBenchmarks/ConstraintWorkloads.cs:27— tools/QueryOptimizationBenchmarks/ConstraintWorkloads.cs:27-33 | tools/QueryOptimizationBenchmarks/SetUnionWorkloads.cs:50-56 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (5 lines × 2) LiteDB.ReproRunner/Repros/Issue_2561_TransactionMonitor/Program.cs:35— LiteDB.ReproRunner/Repros/Issue_2561_TransactionMonitor/Program.cs:35-39 | LiteDB.ReproRunner/Repros/Issue_2586_RollbackTransaction/Program.cs:46-50 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `LiteDB.ReproRunner/Repros/Issue_2561_TransactionMonitor/Program.cs:35` 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 (5 lines × 2) LiteDB/Engine/Engine/Update.cs:21— LiteDB/Engine/Engine/Update.cs:21-25 | LiteDB/Engine/Engine/Upsert.cs:22-26 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (5 lines × 2) LiteDB/Client/Mapper/Linq/TypeResolver/DateTimeResolver.cs:27— LiteDB/Client/Mapper/Linq/TypeResolver/DateTimeResolver.cs:27-31 | LiteDB/Client/Mapper/Linq/TypeResolver/NumberResolver.cs:28-33 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (5 lines × 2) LiteDB.Fuzz/Targets/ChaosFuzzer.cs:129— LiteDB.Fuzz/Targets/ChaosFuzzer.cs:129-133 | LiteDB.Fuzz/Targets/TransactionFuzzer.cs:163-167 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (5 lines × 2) tools/MemoryProfiles/Program.cs:41— tools/MemoryProfiles/Program.cs:41-45 | tools/MemoryValidation/Program.cs:47-51 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `tools/MemoryProfiles/Program.cs:41` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Sync-over-async (deadlock risk) through `Task.WaitAll` LiteDB.ReproRunner/Repros/SharedSelfTeardownProof/Program.cs:65— `Task.WaitAll` blocks this thread until the tasks complete — sync-over-async: it can deadlock under a synchronization context and it parks a thread for as long as the work runs. `await Task.WhenAll(…)` instead.
Sync-over-async (deadlock risk) through `Task.WaitAll` LiteDB.ReproRunner/Repros/SharedSelfTeardownProof/Program.cs:68— `Task.WaitAll` blocks this thread until the tasks complete — sync-over-async: it can deadlock under a synchronization context and it parks a thread for as long as the work runs. `await Task.WhenAll(…)` instead.
Sync-over-async (deadlock risk) through `Task.WaitAll` tools/MemoryProfiles/ProfileWorkload.cs:97— `Task.WaitAll` blocks this thread until the tasks complete — sync-over-async: it can deadlock under a synchronization context and it parks a thread for as long as the work runs. `await Task.WhenAll(…)` instead.
Sync-over-async (deadlock risk) through `Task.WaitAll` tools/MemoryValidation/MemoryWorkload.cs:87— `Task.WaitAll` blocks this thread until the tasks complete — sync-over-async: it can deadlock under a synchronization context and it parks a thread for as long as the work runs. `await Task.WhenAll(…)` instead.
Sync-over-async (deadlock risk) through `Task.WaitAll` tools/QueryOptimizationBenchmarks/ParsedExpressionParallel.cs:78— `Task.WaitAll` blocks this thread until the tasks complete — sync-over-async: it can deadlock under a synchronization context and it parks a thread for as long as the work runs. `await Task.WhenAll(…)` instead.
X18 · Disposal-pattern correctness· Finalizer on a type that owns no unmanaged resource · ×5
Finalizer on a type that owns no unmanaged resource LiteDB/Client/Database/LiteDatabase.cs:409— `LiteDatabase` declares a finalizer (line 409), but nothing in the type is unmanaged: no `IntPtr`/`UIntPtr` or pointer field, no `SafeHandle`, no `HandleRef`, no `extern`/`DllImport` member and no `Marshal`/`GCHandle`/`NativeMemory` use. A finalizer can only release what the garbage collector cannot, so on a purely-managed type it releases nothing and costs something: every instance is put on the finalizer queue, survives at least one extra collection, and is then finalized on a thread that is NOT the disposing one — where the managed objects it touches may already have been finalized themselves. Delete the finalizer (and the `GC.SuppressFinalize` that exists to defuse it); if a handle is added later, wrap it in a `SafeHandle`, which brings its own correct finalization.
Finalizer on a type that owns no unmanaged resource LiteDB/Client/Database/LiteRepository.cs:389— `LiteRepository` declares a finalizer (line 389), but nothing in the type is unmanaged: no `IntPtr`/`UIntPtr` or pointer field, no `SafeHandle`, no `HandleRef`, no `extern`/`DllImport` member and no `Marshal`/`GCHandle`/`NativeMemory` use. A finalizer can only release what the garbage collector cannot, so on a purely-managed type it releases nothing and costs something: every instance is put on the finalizer queue, survives at least one extra collection, and is then finalized on a thread that is NOT the disposing one — where the managed objects it touches may already have been finalized themselves. Delete the finalizer (and the `GC.SuppressFinalize` that exists to defuse it); if a handle is added later, wrap it in a `SafeHandle`, which brings its own correct finalization.
Finalizer on a type that owns no unmanaged resource LiteDB/Client/Shared/SharedDataReader.cs:61— `SharedDataReader` declares a finalizer (line 61), but nothing in the type is unmanaged: no `IntPtr`/`UIntPtr` or pointer field, no `SafeHandle`, no `HandleRef`, no `extern`/`DllImport` member and no `Marshal`/`GCHandle`/`NativeMemory` use. A finalizer can only release what the garbage collector cannot, so on a purely-managed type it releases nothing and costs something: every instance is put on the finalizer queue, survives at least one extra collection, and is then finalized on a thread that is NOT the disposing one — where the managed objects it touches may already have been finalized themselves. Delete the finalizer (and the `GC.SuppressFinalize` that exists to defuse it); if a handle is added later, wrap it in a `SafeHandle`, which brings its own correct finalization.
Finalizer on a type that owns no unmanaged resource LiteDB/Client/Shared/SharedEngine.cs:437— `SharedEngine` declares a finalizer (line 437), but nothing in the type is unmanaged: no `IntPtr`/`UIntPtr` or pointer field, no `SafeHandle`, no `HandleRef`, no `extern`/`DllImport` member and no `Marshal`/`GCHandle`/`NativeMemory` use. A finalizer can only release what the garbage collector cannot, so on a purely-managed type it releases nothing and costs something: every instance is put on the finalizer queue, survives at least one extra collection, and is then finalized on a thread that is NOT the disposing one — where the managed objects it touches may already have been finalized themselves. Delete the finalizer (and the `GC.SuppressFinalize` that exists to defuse it); if a handle is added later, wrap it in a `SafeHandle`, which brings its own correct finalization.
Finalizer on a type that owns no unmanaged resource LiteDB/Document/DataReader/BsonDataReader.cs:142— `BsonDataReader` declares a finalizer (line 142), but nothing in the type is unmanaged: no `IntPtr`/`UIntPtr` or pointer field, no `SafeHandle`, no `HandleRef`, no `extern`/`DllImport` member and no `Marshal`/`GCHandle`/`NativeMemory` use. A finalizer can only release what the garbage collector cannot, so on a purely-managed type it releases nothing and costs something: every instance is put on the finalizer queue, survives at least one extra collection, and is then finalized on a thread that is NOT the disposing one — where the managed objects it touches may already have been finalized themselves. Delete the finalizer (and the `GC.SuppressFinalize` that exists to defuse it); if a handle is added later, wrap it in a `SafeHandle`, which brings its own correct finalization.
D10 · Test Quality· Fixed-sleep synchronisation · ×4
Fixed-sleep synchronisation: A_writer_closing_while_a_read_only_connection_owns_the_mutex_still_checkpoints LiteDB.Tests/Engine/SharedFinalClose_Tests.cs:32— This test starts a thread it started and then orders itself against it with `Thread.Sleep(200)` — a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer's box and random in CI. Wait for the event itself instead: the process's own exit or output, a completion handle, or a condition polled to a timeout.
Fixed-sleep synchronisation: A_waiter_admitted_during_Dispose_neither_runs_on_a_closing_engine_nor_leaks_one LiteDB.Tests/Engine/SharedTeardownOverlap_Tests.cs:67— This test starts a thread it started and then orders itself against it with `Thread.Sleep(50)` — a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer's box and random in CI. Wait for the event itself instead: the process's own exit or output, a completion handle, or a condition polled to a timeout.
Fixed-sleep synchronisation: Dispose_racing_tight_loops_of_the_connection_leaks_no_engine_or_page LiteDB.Tests/Engine/SharedTeardownOverlap_Tests.cs:113— This test starts a thread it started and then orders itself against it with `Thread.Sleep(30)` — a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer's box and random in CI. Wait for the event itself instead: the process's own exit or output, a completion handle, or a condition polled to a timeout.
Fixed-sleep synchronisation: Pin_AfterLookup_ExcludesEvictionAndReuse LiteDB.Tests/Internals/Cache_Tests.cs:186— This test starts a background task and then orders itself against it with `Task.Delay(100)` — a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer's box and random in CI. Wait for the event itself instead: the process's own exit or output, a completion handle, or a condition polled to a timeout.
Repeated repair: LiteDB/Engine/Query/QueryExecutor.cs LiteDB/Engine/Query/QueryExecutor.cs:70— LiteDB/Engine/Query/QueryExecutor.cs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 11 (its worst body is QueryExecutor.ExecuteQuery at line 70), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “Fix #2929: explain why a literal of another type cannot match an indexed field”; “Fix #2775 stream scalar scans and simple aggregates”; “Fix #2870 preserve original exception stacks”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 13:00:51 +02:00' --until='2026-10-01 13:00:51 +02:00' --full-history --no-merges -- LiteDB/Engine/Query/QueryExecutor.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: LiteDB/Document/BsonDocument.cs LiteDB/Document/BsonDocument.cs:77— LiteDB/Document/BsonDocument.cs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 8 (its worst body is BsonDocument.CompareTo at line 77), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “Fix enumerable projection materialization #2033”; “Fix #2801: support arrays, lists and dictionaries in BsonValue(object) (#2755)”; “Fix #2190: avoid duplicate id element enumeration (#2758)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 13:00:51 +02:00' --until='2026-10-01 13:00:51 +02:00' --full-history --no-merges -- LiteDB/Document/BsonDocument.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: LiteDB/Document/Expression/Parser/BsonExpressionOperators.cs LiteDB/Document/Expression/Parser/BsonExpressionOperators.cs:347— LiteDB/Document/Expression/Parser/BsonExpressionOperators.cs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 13 (its worst body is BsonExpressionOperators.DOCUMENT_INIT at line 347), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix: honor execution collation in scalar range comparisons”; “Fix #2928: return null for negative array indexes beyond the start”; “Fix #2800: pass current parameters through cached nested expressions”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 13:00:51 +02:00' --until='2026-10-01 13:00:51 +02:00' --full-history --no-merges -- LiteDB/Document/Expression/Parser/BsonExpressionOperators.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: LiteDB/Client/Mapper/EntityBuilder.cs LiteDB/Client/Mapper/EntityBuilder.cs:115— LiteDB/Client/Mapper/EntityBuilder.cs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 5 (its worst body is EntityBuilder.GetMember at line 115), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “Fix #2324 preserve repeated ID mapping”; “Fix #2873: add explicit constructor-only materialization”; “Fix #1159: make repeated member ignores idempotent”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 13:00:51 +02:00' --until='2026-10-01 13:00:51 +02:00' --full-history --no-merges -- LiteDB/Client/Mapper/EntityBuilder.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Duplicated block (10 lines × 2) tools/SharedReadBenchmarks/ContentionBenchmarks.cs:28— tools/SharedReadBenchmarks/ContentionBenchmarks.cs:28-37 | tools/SharedReadBenchmarks/ReaderContentionBenchmarks.cs:63-72 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (10 lines × 2) LiteDB/Client/Shared/SharedEngine.Query.cs:135— LiteDB/Client/Shared/SharedEngine.Query.cs:135-144 | LiteDB/Client/Shared/SharedEngine.Query.cs:287-296 — 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 `LiteDB/Client/Shared/SharedEngine.Query.cs:135` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) LiteDB/Document/Expression/BsonExpressionFactory.Path.cs:16— LiteDB/Document/Expression/BsonExpressionFactory.Path.cs:16-25 | LiteDB/Document/Expression/BsonExpressionFactory.cs:81-90 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `LiteDB/Document/Expression/BsonExpressionFactory.Path.cs:16` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (10 lines × 2) LiteDB/Utils/Extensions/DictionaryExtensions.cs:228— LiteDB/Utils/Extensions/DictionaryExtensions.cs:228-237 | REDACTED:142-151 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `LiteDB/Utils/Extensions/DictionaryExtensions.cs:228` 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 (6 lines × 2) LiteDB/Engine/Engine/Index.cs:63— LiteDB/Engine/Engine/Index.cs:63-68 | LiteDB/Engine/Engine/Index.cs:150-155 — 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 `LiteDB/Engine/Engine/Index.cs:63` 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) LiteDB/Engine/Engine/CollationValidation.cs:31— LiteDB/Engine/Engine/CollationValidation.cs:31-36 | LiteDB/Engine/Engine/IndexMigration.cs:37-42 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `LiteDB/Engine/Engine/CollationValidation.cs:31` 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) LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Commands/ShowCommand.cs:34— LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Commands/ShowCommand.cs:34-40 | LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Commands/ValidateCommand.cs:37-42 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind `settings` to `ShowCommandSettings` in one and `ValidateCommandSettings` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (6 lines × 2) LiteDB.ReproRunner/Repros/Issue_3071_SharedPeerCallback/Program.cs:271— LiteDB.ReproRunner/Repros/Issue_3071_SharedPeerCallback/Program.cs:271-276 | LiteDB.ReproRunner/Repros/SharedSelfTeardownProof/Fixture.cs:25-30 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Sync-over-async (deadlock risk) through `.Wait(…)` LiteDB.Fuzz/Targets/ChaosFuzzer.cs:235— `.Wait(…)` blocks this thread until the task completes or the bound expires — sync-over-async: it can deadlock under a synchronization context and it parks a thread while it waits. `await` the task (with `.WaitAsync(timeout, token)` where the bound matters).
Sync-over-async (deadlock risk) through `.Wait(…)` LiteDB.Fuzz/Targets/CursorHandoffFuzzer.cs:100— `.Wait(…)` blocks this thread until the task completes or the bound expires — sync-over-async: it can deadlock under a synchronization context and it parks a thread while it waits. `await` the task (with `.WaitAsync(timeout, token)` where the bound matters).
Sync-over-async (deadlock risk) through `.Wait(…)` LiteDB.Fuzz/Targets/ThreadedSnapshotFuzzer.cs:54— `.Wait(…)` blocks this thread until the task completes or the bound expires — sync-over-async: it can deadlock under a synchronization context and it parks a thread while it waits. `await` the task (with `.WaitAsync(timeout, token)` where the bound matters).
Sync-over-async (deadlock risk) through `.Wait(…)` LiteDB.Fuzz/Targets/ThreadedSnapshotFuzzer.cs:71— `.Wait(…)` blocks this thread until the task completes or the bound expires — sync-over-async: it can deadlock under a synchronization context and it parks a thread while it waits. `await` the task (with `.WaitAsync(timeout, token)` where the bound matters).
D17 · Explicit Debt· Whole file has no live code · ×3
Whole file has no live code — 6 debt markers inside it LiteDB.Tests/Database/DbRef_Interface_Tests.cs:1— Every line in this file is a comment or blank — it declares no type, member, using or attribute, so nothing in it reaches the build. Its 6 debt markers (6 CommentedOutCode) all sit inside that dead text: one decision to leave the whole file switched off, not 6 independent debts. It records no note anywhere: the file is switched off with nothing in it saying why, so a reader cannot tell whether it is waiting on something or was simply abandoned — which is the harder of the two to bring back. Decide the FILE rather than its lines — restore it, or delete it and let version control hold the history. (Every occurrence still counts toward the score and metrics.)
Whole file has no live code — 2 debt markers inside it LiteDB.Tests/Query/Aggregate_Tests.cs:1— Every line in this file is a comment or blank — it declares no type, member, using or attribute, so nothing in it reaches the build. Its 2 debt markers (2 CommentedOutCode) all sit inside that dead text: one decision to leave the whole file switched off, not 2 independent debts. It records no note anywhere: the file is switched off with nothing in it saying why, so a reader cannot tell whether it is waiting on something or was simply abandoned — which is the harder of the two to bring back. Decide the FILE rather than its lines — restore it, or delete it and let version control hold the history. (Every occurrence still counts toward the score and metrics.)
Whole file has no live code — 4 debt markers inside it LiteDB.Tests/Query/Include_Tests.cs:1— Every line in this file is a comment or blank — it declares no type, member, using or attribute, so nothing in it reaches the build. Its 4 debt markers (4 CommentedOutCode) all sit inside that dead text: one decision to leave the whole file switched off, not 4 independent debts. It records no note anywhere: the file is switched off with nothing in it saying why, so a reader cannot tell whether it is waiting on something or was simply abandoned — which is the harder of the two to bring back. Decide the FILE rather than its lines — restore it, or delete it and let version control hold the history. (Every occurrence still counts toward the score and metrics.)
TodoComment LiteDB.Tests/Database/DbRef_Include_Tests.cs:154— //TODO: v5 are not removing references after delete. There is no BsonValue#Destroy - must fix/discuss better this — 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 LiteDB/Engine/Services/SnapShot.cs:178— //TODO: remove this — 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 LiteDB/Utils/Extensions/DictionaryExtensions.cs:214— //TODO: fix string connection parser — 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.
Change coupling: BufferReader.cs ↔ BufferWriter.cs LiteDB/Engine/Disk/Serializer/BufferReader.cs:1— `LiteDB/Engine/Disk/Serializer/BufferReader.cs` and `LiteDB/Engine/Disk/Serializer/BufferWriter.cs` change together 79% of the time (26 of the 33 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package — so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 26 shared commits counted here, the most recent 3 are `e4e87790` Use spans for Guid and ObjectId serialization (#2697); `ea600ac1` make sure all arrays are cleaned when returned to Pool; `39c2d87d` rename bufferPool > _bufferPool — run `git show` on any of them.
Change coupling: DataService.cs ↔ IndexService.cs LiteDB/Engine/Services/DataService.cs:1— `LiteDB/Engine/Services/DataService.cs` and `LiteDB/Engine/Services/IndexService.cs` change together 52% of the time (21 of the 40 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package — so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 21 shared commits counted here, the most recent 3 are `583faa5c` Fix #2827: include unflushed allocations in traversal limits; `3fb34cc1` Lazy string interpolation in ENSURE; `6bd88f4d` New page list slot persist — run `git show` on any of them.
Change coupling: IndexVirtual.cs ↔ QueryExecutor.cs LiteDB/Engine/Query/IndexQuery/IndexVirtual.cs:1— `LiteDB/Engine/Query/IndexQuery/IndexVirtual.cs` and `LiteDB/Engine/Query/QueryExecutor.cs` change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in different directories, but in this ecosystem the namespace is declared in the FILE, not by the folder — so the two may well share one namespace and reference each other with no import for this pass to see. Read the pair before acting: if one derives from or overrides the other, the dependency is explicit in the type declaration and the co-change is definitional; if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE and the thing to add is a comment saying so; if they simply belong together, co-locate them; if none of these holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are `0dcd077e` Fix #2775 stream scalar scans and simple aggregates; `7c5e38cd` Rename DocumentLoader to lookup; `c622b4cd` Ensure Index but has poblem yet — run `git show` on any of them.
Duplicated block (11 lines × 2) LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Execution/ReproExecutor.cs:668— LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Execution/ReproExecutor.cs:668-678 | LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Execution/RunDirectoryPlanner.cs:83-93 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (11 lines × 2) LiteDB/Engine/Pages/BasePage.cs:409— LiteDB/Engine/Pages/BasePage.cs:409-419 | LiteDB/Engine/Pages/BasePage.cs:478-489 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `LiteDB/Engine/Pages/BasePage.cs:478` calls `ENSURE` and `LiteDB/Engine/Pages/BasePage.cs:409` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (11 lines × 2) LiteDB.ReproRunner/Repros/Issue_2561_TransactionMonitor/Program.cs:157— LiteDB.ReproRunner/Repros/Issue_2561_TransactionMonitor/Program.cs:157-167 | LiteDB.ReproRunner/Repros/Issue_2586_RollbackTransaction/Program.cs:594-604 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (8 lines × 2) LiteDB/Engine/Disk/Serializer/BufferReader.IndexKey.cs:19— LiteDB/Engine/Disk/Serializer/BufferReader.IndexKey.cs:19-26 | LiteDB/Engine/FileReader/Legacy/ByteReader.cs:203-210 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `LiteDB/Engine/Disk/Serializer/BufferReader.IndexKey.cs:19` 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 (8 lines × 2) LiteDB/Engine/Disk/Serializer/BufferReader.IndexKey.cs:38— LiteDB/Engine/Disk/Serializer/BufferReader.IndexKey.cs:38-45 | LiteDB/Engine/FileReader/Legacy/ByteReader.cs:218-225 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `LiteDB/Engine/Disk/Serializer/BufferReader.IndexKey.cs:38` 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 (8 lines × 2) LiteDB.Fuzz/Targets/ChecksumPageFuzzer.cs:59— LiteDB.Fuzz/Targets/ChecksumPageFuzzer.cs:59-66 | LiteDB.Fuzz/Targets/ChecksumWalFuzzer.cs:92-99 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `LiteDB.Fuzz/Targets/ChecksumPageFuzzer.cs:59` 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.
CRAP 72: ListCommand.Execute LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Commands/ListCommand.cs:34— Cyclomatic 8 with 0.0% file coverage — too complex for how untested it is (CRAP = CC²·(1−cov)³ + CC; ≥30 needs tests or simplification).
CRAP 72: ListCommand.WriteJson LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Commands/ListCommand.cs:89— Cyclomatic 8 with 0.0% file coverage — too complex for how untested it is (CRAP = CC²·(1−cov)³ + CC; ≥30 needs tests or simplification).
CRAP 72: ReproBuildCoordinator.BuildAsync LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Execution/ReproBuildCoordinator.cs:17— Cyclomatic 8 with 0.0% file coverage — too complex for how untested it is (CRAP = CC²·(1−cov)³ + CC; ≥30 needs tests or simplification).
Unfinished stub — throws NotImplementedException LiteDB/Document/Expression/Methods/Misc.cs:160— A shipped member still throws NotImplementedException — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — throws NotImplementedException LiteDB/Engine/Query/IndexQuery/IndexVirtual.cs:28— A shipped member still throws NotImplementedException — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — throws NotImplementedException LiteDB.Benchmarks/Benchmarks/BenchmarkBase.cs:11— A shipped member still throws NotImplementedException — generated scaffolding that was never completed. Implement it or remove the dead surface.
X2 · Cancellation propagation· Async local function without CancellationToken · ×3
Async local function without CancellationToken: Replay LiteDB.Fuzz/Program.cs:180— Neither takes a CancellationToken nor reads the one of the function it sits in, while it calls something that takes one — this work can't be stopped early once started. Take the token, or pass on the enclosing one.
Async local function without CancellationToken: Run LiteDB.Fuzz/Targets/ConflictFuzzer.cs:69— Neither takes a CancellationToken nor reads the one of the function it sits in, while it calls something that takes one — this work can't be stopped early once started. Take the token, or pass on the enclosing one.
Async local function without CancellationToken: Exchange LiteDB.Fuzz/Targets/SnapshotWriterProcess.cs:51— Neither takes a CancellationToken nor reads the one of the function it sits in, while it calls something that takes one — this work can't be stopped early once started. Take the token, or pass on the enclosing one.
Duplicated block (6 lines × 3) LiteDB/Client/SqlParser/Commands/Begin.cs:18— LiteDB/Client/SqlParser/Commands/Begin.cs:18-23 | LiteDB/Client/SqlParser/Commands/Commit.cs:18-23 | LiteDB/Client/SqlParser/Commands/Rollback.cs:18-23 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once.
Duplicated block (6 lines × 3) LiteDB/Engine/Engine/Index.cs:63— LiteDB/Engine/Engine/Index.cs:63-68 | LiteDB/Engine/Engine/Index.cs:150-155 | LiteDB/Engine/Engine/Upsert.cs:19-24 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `LiteDB/Engine/Engine/Index.cs:63` 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 (7 lines × 3) LiteDB/Document/BsonValue.cs:472— LiteDB/Document/BsonValue.cs:472-478 | LiteDB/Document/BsonValue.cs:491-497 | LiteDB/Document/BsonValue.cs:510-516 — 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 `LiteDB/Document/BsonValue.cs:472` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 3) tools/QueryOptimizationBenchmarks/ExclusionWorkloads.cs:32— tools/QueryOptimizationBenchmarks/ExclusionWorkloads.cs:32-38 | tools/QueryOptimizationBenchmarks/ExclusiveRangeWorkloads.cs:32-38 | tools/QueryOptimizationBenchmarks/Program.cs:126-132 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. 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.
Unfinished stub — throws NotImplementedException LiteDB/Document/Expression/Methods/Misc.cs:160— `IIF` is a shipped member whose whole body throws NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — throws NotImplementedException LiteDB/Engine/Query/IndexQuery/IndexVirtual.cs:28— `Execute` is a shipped member whose whole body throws NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface.
Weak hash algorithm LiteDB/Client/Shared/SharedMutexNameFactory.cs:81— MD5/SHA1 is constructed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ for content integrity, or a KDF (PBKDF2/Argon2/BCrypt) for password storage. If it only derives a non-security identifier (a cache key, a file or mutex name), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as `System.IO.Hashing.XxHash64`/`Crc32` says it in code — since the algorithm alone cannot distinguish the two uses.
Weak hash algorithm LiteDB/Engine/FileReader/Legacy/AesEncryption.cs:73— MD5/SHA1 is constructed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ for content integrity, or a KDF (PBKDF2/Argon2/BCrypt) for password storage. If it only derives a non-security identifier (a cache key, a file or mutex name), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as `System.IO.Hashing.XxHash64`/`Crc32` says it in code — since the algorithm alone cannot distinguish the two uses.
S1 · Cryptographic Hygiene· Password key derivation is priced too cheaply · ×2
Password key derivation is priced too cheaply REDACTED:97— This code fixes PBKDF2-SHA-1 at 1,000 iterations. A key-derivation function's only defence is the cost of ONE guess, and that cost is this number — the algorithm choice does not set it. Current OWASP guidance is 1,300,000 PBKDF2 iterations with HMAC-SHA1, 600,000 with SHA-256 and 210,000 with SHA-512; scrypt at N=2^17, r=8, p=1 (or an equivalent N·r·p product); Argon2id at 19 MiB of memory and 2 iterations (or an equivalent row); bcrypt at a work factor of at least 10. This figure divides the attacker's work by a factor of tens or hundreds against the same stolen hash, on hardware they already own. Where what is derived is short or low-entropy — a PIN, a numeric parental code, a four-character token — the whole keyspace falls in the time this parameter buys, and no salt or constant-time comparison changes that. Raise the count to the current published figure for the PRF you use, measure it on the slowest hardware that must run it (a target of roughly 100 ms per derivation is the usual budget), and read the value from configuration so a deployment can raise it again without a rebuild. Where the derived value must interoperate with a format someone else fixed, the count cannot move — derive a SEPARATE value for anything you own rather than inheriting the external format's price.
Password key derivation is priced too cheaply LiteDB/Engine/FileReader/Legacy/AesEncryption.cs:21— This code fixes PBKDF2-SHA-1 at 1,000 iterations. A key-derivation function's only defence is the cost of ONE guess, and that cost is this number — the algorithm choice does not set it. Current OWASP guidance is 1,300,000 PBKDF2 iterations with HMAC-SHA1, 600,000 with SHA-256 and 210,000 with SHA-512; scrypt at N=2^17, r=8, p=1 (or an equivalent N·r·p product); Argon2id at 19 MiB of memory and 2 iterations (or an equivalent row); bcrypt at a work factor of at least 10. This figure divides the attacker's work by a factor of tens or hundreds against the same stolen hash, on hardware they already own. Where what is derived is short or low-entropy — a PIN, a numeric parental code, a four-character token — the whole keyspace falls in the time this parameter buys, and no salt or constant-time comparison changes that. Raise the count to the current published figure for the PRF you use, measure it on the slowest hardware that must run it (a target of roughly 100 ms per derivation is the usual budget), and read the value from configuration so a deployment can raise it again without a rebuild. Where the derived value must interoperate with a format someone else fixed, the count cannot move — derive a SEPARATE value for anything you own rather than inheriting the external format's price.
Blocking `File.ReadAllText` inside an `async` method LiteDB.Fuzz/FuzzProcessRunner.cs:234— `File.ReadAllText` blocks the thread on I/O while `File.ReadAllTextAsync` exists to wait without one — inside a method that is already `async`, await the twin.
Blocking `File.ReadAllText` inside an `async` method LiteDB.Fuzz/Targets/SharedProcessFuzzer.cs:83— `File.ReadAllText` blocks the thread on I/O while `File.ReadAllTextAsync` exists to wait without one — inside a method that is already `async`, await the twin.
X18 · Disposal-pattern correctness· Disposes a dependency it does not own · ×2
Disposes a dependency it does not own LiteDB/Client/Shared/PrefixedDataReader.cs:54— `_reader` is never created by `PrefixedDataReader` — every assignment to it takes a constructor parameter — yet this type disposes it here (line 54). Its declared type `IBsonDataReader` is an interface, so the instance came from whoever resolved it, and that owner decides when it ends. Disposing it from here reaches outside this object's lifetime: a dependency shared with the rest of the process is torn down when THIS instance goes away, and the real owner's later `Dispose()` runs a second time on an object already disposed. Drop the call — a type disposes what it constructed, and only that. If this dependency genuinely is exclusive to this instance, construct it here (or take an owned factory) so the ownership is stated in the code rather than assumed.
Disposes a dependency it does not own LiteDB/Engine/Disk/StreamFactory/ChecksummedWalFactory.cs:29— `_inner` is never created by `ChecksummedWalFactory` — every assignment to it takes a constructor parameter — yet this type disposes it here (line 29). Its declared type `IStreamFactory` is an interface, so the instance came from whoever resolved it, and that owner decides when it ends. Disposing it from here reaches outside this object's lifetime: a dependency shared with the rest of the process is torn down when THIS instance goes away, and the real owner's later `Dispose()` runs a second time on an object already disposed. Drop the call — a type disposes what it constructed, and only that. If this dependency genuinely is exclusive to this instance, construct it here (or take an owned factory) so the ownership is stated in the code rather than assumed.
X18 · Disposal-pattern correctness· Disposable created and abandoned in the method that made it · ×2
Disposable created and abandoned in the method that made it LiteDB/Engine/FileReader/Legacy/AesEncryption.cs:73— `sha` is a `SHA1`, which implements `IDisposable`, and it is created here (line 73). Every use of it in `HashSHA1` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var sha = …;`), which releases it at the end of the scope on every path including a throw.
Disposable created and abandoned in the method that made it LiteDB.ReproRunner/Repros/Issue_2561_TransactionMonitor/Program.cs:107— `reproObserved` is a `ManualResetEventSlim`, which implements `IDisposable`, and it is created here (line 107). Every use of it in `Run` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var reproObserved = …;`), which releases it at the end of the scope on every path including a throw.
X5 · Nullable reference types· Symbol treated as nullable, then dereferenced unguarded · ×2
Symbol treated as nullable, then dereferenced unguarded LiteDB/Client/Mapper/Reflection/Reflection.Expression.cs:67— This method contradicts itself about `fieldInfo`: line 49 assigns it with `as FieldInfo`, which hands back null rather than throwing when the value is not a `FieldInfo`, but line 67 then dereferences it directly as `fieldInfo.SetValue` with no null test between them and no guard around it. If the `as` is right, that dereference throws NullReferenceException on the input it was written for — and the NullReferenceException names neither the cast nor the type that failed. Settle it one way — test `fieldInfo` once before the first use and handle the null case, or cast with `(FieldInfo)` so the failure is reported where it happens — rather than leaving the two readings side by side.
Symbol treated as nullable, then dereferenced unguarded LiteDB/Engine/Query/QueryOptimization.Range.cs:23— This method contradicts itself about `expression`: line 8 writes `expression?.Left`, which says `expression` can be null, but line 23 then dereferences it directly as `expression.Right` with no null test between them and no guard around it. If the `?.` is right, that dereference throws NullReferenceException on the input it was written for; if `expression` truly cannot be null here, the `?.` is misleading. Settle it one way — test `expression` once before the first use and handle the null case, or drop the `?.` — rather than leaving the two readings side by side.
ManifestValidator.Validate (cyclomatic 82) LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Manifests/ManifestValidator.cs:28— ManifestValidator.Validate has cyclomatic complexity 82 (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.
QueryPipe.Pipe (cyclomatic 53) LiteDB/Engine/Query/Pipeline/QueryPipe.cs:29— QueryPipe.Pipe has cyclomatic complexity 53 (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.
Tokenizer.ReadNext (cyclomatic 53) LiteDB/Utils/Tokenizer.cs:323— Tokenizer.ReadNext has cyclomatic complexity 53 (threshold 15). 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. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
compose_repro_matrix.main (cyclomatic 53) .github/scripts/compose_repro_matrix.py:16— compose_repro_matrix.main has cyclomatic complexity 53 (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.Run (cyclomatic 49) tools/SharedReadBenchmarks/Program.cs:87— Program.Run has cyclomatic complexity 49 (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 45) tools/QueryOptimizationBenchmarks/Program.cs:13— Program.Main has cyclomatic complexity 45 (threshold 15). Of this number, 34 points are the body's own statements and 11 belong to 11 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.
BsonMapper.Serialize (cyclomatic 42) LiteDB/Client/Mapper/BsonMapper.Serialize.cs:57— BsonMapper.Serialize has cyclomatic complexity 42 (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.
ReaderContentionBenchmarks.Run (cyclomatic 41) tools/SharedReadBenchmarks/ReaderContentionBenchmarks.cs:24— ReaderContentionBenchmarks.Run has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
LinqExpressionTranslator.TranslateMethod (cyclomatic 40) LiteDB/Client/Mapper/Linq/LinqExpressionTranslator.cs:135— LinqExpressionTranslator.TranslateMethod has cyclomatic complexity 40 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
WalRetirement.Load (cyclomatic 39) LiteDB/Engine/Disk/WalRetirement.cs:57— WalRetirement.Load has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
MvccHarness.TryRun (cyclomatic 38) LiteDB.Tests.SharedMutexHarness/MvccHarness.cs:6— MvccHarness.TryRun has cyclomatic complexity 38 (threshold 15). Of this number, 37 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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.
RunCommand.RunExecutionLoopAsync (cyclomatic 35) LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Commands/RunCommand.cs:277— RunCommand.RunExecutionLoopAsync has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
StringResolver.ResolveMethod (cyclomatic 34) LiteDB/Client/Mapper/Linq/TypeResolver/StringResolver.cs:15— StringResolver.ResolveMethod has cyclomatic complexity 34 (threshold 15). 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. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
IndexRange.Execute (cyclomatic 34) LiteDB/Engine/Query/IndexQuery/IndexRange.cs:61— IndexRange.Execute has cyclomatic complexity 34 (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 33) tools/SharedReadBenchmarks/Program.cs:18— Program.Main has cyclomatic complexity 33 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
Program.Main (cyclomatic 32) tools/VectorCompatibility/Current/Program.cs:11— Program.Main has cyclomatic complexity 32 (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.
Scenario.Run (cyclomatic 31) LiteDB.ReproRunner/Repros/SharedSelfTeardownProof/Scenario.cs:11— Scenario.Run has cyclomatic complexity 31 (threshold 15). Of this number, 21 points are the body's own statements and 10 belong to 2 function literals inside it that branch. 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.
BsonMapper.Deserialize (cyclomatic 30) LiteDB/Client/Mapper/BsonMapper.Deserialize.cs:98— BsonMapper.Deserialize 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.
BsonValue.CompareTo (cyclomatic 28) LiteDB/Document/BsonValue.cs:552— BsonValue.CompareTo 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.
LiteEngine.MigrateIndexOrdering (cyclomatic 28) LiteDB/Engine/Engine/IndexMigration.cs:11— LiteEngine.MigrateIndexOrdering has cyclomatic complexity 28 (threshold 15). Of this number, 27 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
QueryOptimization.TrySelectVectorIndex (cyclomatic 28) LiteDB/Engine/Query/QueryOptimization.Vector.cs:8— QueryOptimization.TrySelectVectorIndex has cyclomatic complexity 28 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
SharedFollowupHarness.TryRun (cyclomatic 28) LiteDB.Tests.SharedMutexHarness/SharedFollowupHarness.cs:9— SharedFollowupHarness.TryRun 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.
Program.Main (cyclomatic 28) LiteDB.Fuzz/Program.cs:22— Program.Main has cyclomatic complexity 28 (threshold 15). Of this number, 26 points are the body's own statements and 2 belong to 2 function literals inside it that branch. 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.
ChecksumWalFuzzer.RunAsync (cyclomatic 28) LiteDB.Fuzz/Targets/ChecksumWalFuzzer.cs:10— ChecksumWalFuzzer.RunAsync 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.
TransactionFuzzer.RunAsync (cyclomatic 28) LiteDB.Fuzz/Targets/TransactionFuzzer.cs:8— TransactionFuzzer.RunAsync has cyclomatic complexity 28 (threshold 15). 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. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
LinqExpressionTranslator.TranslateBinary (cyclomatic 27) LiteDB/Client/Mapper/Linq/LinqExpressionTranslator.cs:235— LinqExpressionTranslator.TranslateBinary has cyclomatic complexity 27 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
LinqExpressionTranslator.TryDbRef (cyclomatic 27) LiteDB/Client/Mapper/Linq/LinqExpressionTranslator.Projection.cs:41— LinqExpressionTranslator.TryDbRef has cyclomatic complexity 27 (threshold 15). Of this number, 25 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
WalIndexService.TryCheckpointCore (cyclomatic 27) LiteDB/Engine/Services/WalIndexService.Checkpoint.cs:81— WalIndexService.TryCheckpointCore has cyclomatic complexity 27 (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.
DictionaryExtensions.ParseKeyValue (cyclomatic 27) LiteDB/Utils/Extensions/DictionaryExtensions.cs:34— DictionaryExtensions.ParseKeyValue 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.
MvccRetirementScenario.Run (cyclomatic 27) LiteDB.Tests/Internals/MvccRetirementScenario.cs:31— MvccRetirementScenario.Run has cyclomatic complexity 27 (threshold 15). Of this number, 16 points are the body's own statements and 11 belong to 5 function literals inside it that branch. 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.
regression_proof.main (cyclomatic 27) .github/scripts/regression_proof.py:361— regression_proof.main 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.
LinqExpressionTranslator.IsSafeRuntimeUnary (cyclomatic 26) LiteDB/Client/Mapper/Linq/LinqExpressionTranslator.Captures.cs:44— LinqExpressionTranslator.IsSafeRuntimeUnary has cyclomatic complexity 26 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
BsonElementReader.Read (cyclomatic 26) LiteDB/Engine/Disk/Serializer/BsonElementReader.cs:12— BsonElementReader.Read has cyclomatic complexity 26 (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.
QueryOptimization.ChooseIndex (cyclomatic 26) LiteDB/Engine/Query/QueryOptimization.Index.cs:18— QueryOptimization.ChooseIndex has cyclomatic complexity 26 (threshold 15). Of this number, 24 points are the body's own statements and 2 belong to 2 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.
RebuildService.Install (cyclomatic 26) LiteDB/Engine/Services/RebuildService.cs:143— RebuildService.Install has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 12 of the 26 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 235, 207, 267, …). 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.
JsonWriter.WriteValue (cyclomatic 25) LiteDB/Document/Json/JsonWriter.cs:58— JsonWriter.WriteValue has cyclomatic complexity 25 (threshold 15). 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. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file's highest cyclomatic complexity: JsonWriter.WriteString (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
SharedEngine.EnsureCoordination (cyclomatic 25) LiteDB/Client/Shared/SharedEngine.CoordinatedReads.cs:48— SharedEngine.EnsureCoordination 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.
SharedStorageHarness.TryRun (cyclomatic 25) LiteDB.Tests.SharedMutexHarness/SharedStorageHarness.cs:6— SharedStorageHarness.TryRun has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
Node.Evaluate (cyclomatic 25) LiteDB.Fuzz/Targets/QueryFuzzer.cs:174— Node.Evaluate has cyclomatic complexity 25 (threshold 15). 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. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
SharedCoordinationProtocol.Inspect (cyclomatic 24) LiteDB/Client/Shared/SharedCoordinationProtocol.cs:65— SharedCoordinationProtocol.Inspect 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.
SharedMutexOwner.Run (cyclomatic 24) LiteDB/Client/Shared/SharedMutexOwner.cs:361— SharedMutexOwner.Run 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.
BsonValue.BsonValue.ctor (cyclomatic 24) LiteDB/Document/BsonValue.cs:128— BsonValue.BsonValue.ctor has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
CompactDocumentReader.ReadValue (cyclomatic 24) LiteDB/Engine/Storage/CompactDocumentReader.cs:90— CompactDocumentReader.ReadValue has cyclomatic complexity 24 (threshold 15). 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. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
SharedEngine.TryQueryCoordinated (cyclomatic 24) LiteDB/Client/Shared/SharedEngine.CoordinatedReads.cs:118— SharedEngine.TryQueryCoordinated 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.
LiteCollection.RemoveDocId (cyclomatic 23) LiteDB/Client/Database/Collections/Insert.cs:90— LiteCollection.RemoveDocId has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
LinqQueryShape.Visit (cyclomatic 23) LiteDB/Client/Mapper/Linq/LinqQueryShape.cs:42— LinqQueryShape.Visit 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.
ConnectionString.BuildConnectionString (cyclomatic 23) LiteDB/Client/Structures/ConnectionString.cs:332— ConnectionString.BuildConnectionString 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.
BsonExpression.SourceUses (cyclomatic 23) LiteDB/Document/Expression/BsonExpression.Streaming.cs:13— BsonExpression.SourceUses has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
CompactDocumentWriter.WriteValue (cyclomatic 23) LiteDB/Engine/Storage/CompactDocumentWriter.cs:85— CompactDocumentWriter.WriteValue has cyclomatic complexity 23 (threshold 15). 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. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
ChaosFuzzer.RunAsync (cyclomatic 23) LiteDB.Fuzz/Targets/ChaosFuzzer.cs:10— ChaosFuzzer.RunAsync has cyclomatic complexity 23 (threshold 15). 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. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
SqlParser.ParseSelect (cyclomatic 22) LiteDB/Client/SqlParser/Commands/Select.cs:26— SqlParser.ParseSelect 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.
QueryOptimization.TryGetMemberPath (cyclomatic 22) LiteDB/Engine/Query/QueryOptimization.IncludedFields.cs:34— QueryOptimization.TryGetMemberPath has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
QueryOptimization.TryGetScalarBound (cyclomatic 22) LiteDB/Engine/Query/QueryOptimization.Range.cs:5— QueryOptimization.TryGetScalarBound has cyclomatic complexity 22 (threshold 15). 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. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
Tokenizer.ReadString (cyclomatic 22) LiteDB/Utils/Tokenizer.String.cs:11— Tokenizer.ReadString has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
ContentionBenchmarks.Run (cyclomatic 22) tools/SharedReadBenchmarks/ContentionBenchmarks.cs:11— ContentionBenchmarks.Run 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.
LinqExpressionTranslator.TranslateMember (cyclomatic 21) LiteDB/Client/Mapper/Linq/LinqExpressionTranslator.cs:99— LinqExpressionTranslator.TranslateMember has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
SharedEngine.QueryCore (cyclomatic 21) LiteDB/Client/Shared/SharedEngine.Query.cs:31— SharedEngine.QueryCore 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.
BsonExpressionParser.ParseSelectDocumentBuilder (cyclomatic 21) LiteDB/Document/Expression/Parser/BsonExpressionParser.cs:121— BsonExpressionParser.ParseSelectDocumentBuilder 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.
DiskService.WriteLogDisk (cyclomatic 21) LiteDB/Engine/Disk/DiskService.WalWrite.cs:29— DiskService.WriteLogDisk 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.
HeaderJournal.ReadComplete (cyclomatic 21) LiteDB/Engine/Disk/HeaderJournal.cs:110— HeaderJournal.ReadComplete has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
IndexLike.ExecuteStartsWith (cyclomatic 21) LiteDB/Engine/Query/IndexQuery/IndexLike.cs:99— IndexLike.ExecuteStartsWith 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.
VectorIndexService.Search (cyclomatic 21) LiteDB/Engine/Services/VectorIndexService.Search.cs:10— VectorIndexService.Search 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.
SharedProcessFuzzer.RunAsync (cyclomatic 21) LiteDB.Fuzz/Targets/SharedProcessFuzzer.cs:26— SharedProcessFuzzer.RunAsync has cyclomatic complexity 21 (threshold 15). Of this number, 18 points are the body's own statements and 3 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.
SqlDmlFuzzer.RunAsync (cyclomatic 21) LiteDB.Fuzz/Targets/SqlDmlFuzzer.cs:8— SqlDmlFuzzer.RunAsync has cyclomatic complexity 21 (threshold 15). 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. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
StorageFuzzer.RunAsync (cyclomatic 21) LiteDB.Fuzz/Targets/StorageFuzzer.cs:8— StorageFuzzer.RunAsync 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.
PromotionPowerLossScenario.Run (cyclomatic 21) LiteDB.Tests/Engine/PromotionPowerLossScenario.cs:24— PromotionPowerLossScenario.Run has cyclomatic complexity 21 (threshold 15). Of this number, 13 points are the body's own statements and 8 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.
InteropBenchmarks.Run (cyclomatic 21) tools/SharedReadBenchmarks/InteropBenchmarks.cs:9— InteropBenchmarks.Run has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
WalReuseCompatibility.Run (cyclomatic 21) tools/VectorCompatibility/Current/WalReuseCompatibility.cs:13— WalReuseCompatibility.Run has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body's own statements and 2 belong to 2 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.
SharedCoordinationTemporaryFiles.Cleanup (cyclomatic 20) LiteDB/Client/Shared/SharedCoordinationTemporaryFiles.cs:33— SharedCoordinationTemporaryFiles.Cleanup has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
BsonExpressionParser.TryParsePath (cyclomatic 20) LiteDB/Document/Expression/Parser/BsonExpressionParser.cs:518— BsonExpressionParser.TryParsePath has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
FileStreamFactory.GetStream (cyclomatic 20) LiteDB/Engine/Disk/StreamFactory/FileStreamFactory.cs:56— FileStreamFactory.GetStream has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
FileReaderV8.GetDocuments (cyclomatic 20) LiteDB/Engine/FileReader/FileReaderV8.Documents.cs:10— FileReaderV8.GetDocuments has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
BsonReader.ReadElement (cyclomatic 20) LiteDB/Engine/FileReader/Legacy/BsonReader.cs:70— BsonReader.ReadElement has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
SharedMappedHarness.TryRun (cyclomatic 20) LiteDB.Tests.SharedMutexHarness/SharedMappedHarness.cs:9— SharedMappedHarness.TryRun has cyclomatic complexity 20 (threshold 15). Of this number, 16 points are the body's own statements and 4 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.
DiskService.RecoverHeaderJournal (cyclomatic 19) LiteDB/Engine/Disk/DiskService.HeaderJournal.cs:48— DiskService.RecoverHeaderJournal 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.
BorrowedBsonValue.TryCompare (cyclomatic 19) LiteDB/Engine/Disk/Serializer/BorrowedBsonValue.cs:151— BorrowedBsonValue.TryCompare has cyclomatic complexity 19 (threshold 15). 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. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
FuzzArtifacts.MergeInterestingCorpus (cyclomatic 19) LiteDB.Fuzz/FuzzArtifacts.cs:172— FuzzArtifacts.MergeInterestingCorpus 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.
FuzzProcessRunner.RunCoreAsync (cyclomatic 19) LiteDB.Fuzz/FuzzProcessRunner.cs:109— FuzzProcessRunner.RunCoreAsync 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.
regression_proof.verify (cyclomatic 19) .github/scripts/regression_proof.py:317— regression_proof.verify has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
model-shared-admission.admission (cyclomatic 19) scripts/model-shared-admission.py:20— model-shared-admission.admission 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.
EncryptedLogPreamble.Open (cyclomatic 18) LiteDB/Engine/Disk/Streams/EncryptedLogPreamble.cs:16— EncryptedLogPreamble.Open has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
LiteEngine.EnsureIndex (cyclomatic 18) LiteDB/Engine/Engine/Index.cs:46— LiteEngine.EnsureIndex has cyclomatic complexity 18 (threshold 15). Of this number, 12 points are the body's own statements and 6 belong to one function literal inside it that branches. 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.
LiteEngine.EnsureVectorIndex (cyclomatic 18) LiteDB/Engine/Engine/Index.cs:135— LiteEngine.EnsureVectorIndex has cyclomatic complexity 18 (threshold 15). Of this number, 10 points are the body's own statements and 8 belong to one function literal inside it that branches. 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.
QueryPlan.GetExecutionPlan (cyclomatic 18) LiteDB/Engine/Query/Structures/QueryPlan.cs:164— QueryPlan.GetExecutionPlan 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.
check_fault_points.check_entry (cyclomatic 18) .github/scripts/check_fault_points.py:170— check_fault_points.check_entry 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.
SharedReaderSlots.ReadVersions (cyclomatic 17) LiteDB/Client/Shared/SharedReaderSlots.cs:189— SharedReaderSlots.ReadVersions 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.
WalChecksum.Validate (cyclomatic 17) LiteDB/Engine/Disk/WalChecksum.cs:102— WalChecksum.Validate has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
FileReaderV7.ReadPage (cyclomatic 17) LiteDB/Engine/FileReader/FileReaderV7.cs:187— FileReaderV7.ReadPage 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.
Query.ToSQL (cyclomatic 17) LiteDB/Engine/Query/Query.cs:61— Query.ToSQL has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
QueryOptimization.ChooseBooleanIntersectionIndex (cyclomatic 17) LiteDB/Engine/Query/QueryOptimization.BooleanRanges.cs:22— QueryOptimization.ChooseBooleanIntersectionIndex 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.
ScalarIntervals.Intersect (cyclomatic 17) LiteDB/Engine/Query/Structures/ScalarIntervals.cs:50— ScalarIntervals.Intersect 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.
WalIndexService.RestoreIndex (cyclomatic 17) LiteDB/Engine/Services/WalIndexService.cs:223— WalIndexService.RestoreIndex 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.
SchemaCatalog.Select (cyclomatic 17) LiteDB/Engine/Storage/SchemaCatalog.cs:45— SchemaCatalog.Select has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ManifestValidator.ParseOutcomeExpectation (cyclomatic 17) LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Manifests/ManifestValidator.Outcomes.cs:65— ManifestValidator.ParseOutcomeExpectation 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.
ChecksumPageFuzzer.RunAsync (cyclomatic 17) LiteDB.Fuzz/Targets/ChecksumPageFuzzer.cs:10— ChecksumPageFuzzer.RunAsync has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
LinqBindingContext.Quantifier (cyclomatic 16) LiteDB/Client/Mapper/Linq/LinqBindingContext.cs:87— LinqBindingContext.Quantifier 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.
BsonExpressionMethods.DATEADD (cyclomatic 16) LiteDB/Document/Expression/Methods/Date.cs:84— BsonExpressionMethods.DATEADD has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (BsonExpressionMethods.DATEDIFF) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
BsonExpressionMethods.DATEDIFF (cyclomatic 16) LiteDB/Document/Expression/Methods/Date.cs:108— BsonExpressionMethods.DATEDIFF has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (BsonExpressionMethods.DATEADD) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
HeaderJournal.IsPublished (cyclomatic 16) LiteDB/Engine/Disk/HeaderJournal.cs:47— HeaderJournal.IsPublished 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.
AesStream.AesStream.ctor (cyclomatic 16) REDACTED:52— AesStream.AesStream.ctor has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. Note what this body is, though: it works in explicit hardware vector and instruction-set types. A kernel divided across a call boundary passes its vectors between the parts and depends on the runtime putting them back together, so the division can cost more than the complexity it removes. The measurement stands — a hot path is not a licence to be unreadable — but the move that pays here is to lift the COLD parts out first (argument validation, fallback and error paths, one-off setup) and leave the kernel whole. Where the kernel itself has to be divided, ask for the extracted parts to be inlined as well, and measure the result rather than assuming the division is free.
LiteEngine.UpdateDocument (cyclomatic 16) LiteDB/Engine/Engine/Update.cs:98— LiteEngine.UpdateDocument has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body's own statements and 3 belong to 3 function literals inside it that branch. To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
QueryOptimization.ChooseConstraintIndex (cyclomatic 16) LiteDB/Engine/Query/QueryOptimization.Constraints.cs:8— QueryOptimization.ChooseConstraintIndex 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.
TransactionService.PersistDirtyPages (cyclomatic 16) LiteDB/Engine/Services/TransactionService.cs:153— TransactionService.PersistDirtyPages has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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.
Tokenizer.ReadNumber (cyclomatic 16) LiteDB/Utils/Tokenizer.cs:582— Tokenizer.ReadNumber 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.
CoordinatorClient.TryRefresh (cyclomatic 16) LiteDB/Client/Coordinated/CoordinatorClient.Snapshots.cs:167— CoordinatorClient.TryRefresh has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
IngestCommand.ExecuteAsync (cyclomatic 16) LiteDB.Demo.Tools.VectorSearch/Commands/IngestCommand.cs:20— IngestCommand.ExecuteAsync has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 59). 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.
HarnessOptions.Parse (cyclomatic 16) LiteDB.Tests.SharedMutexHarness/Program.cs:228— HarnessOptions.Parse 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.
CursorHandoffFuzzer.RunAsync (cyclomatic 16) LiteDB.Fuzz/Targets/CursorHandoffFuzzer.cs:10— CursorHandoffFuzzer.RunAsync has cyclomatic complexity 16 (threshold 15). Of this number, 9 points are the body's own statements and 7 belong to 2 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.
IndexFuzzer.RunAsync (cyclomatic 16) LiteDB.Fuzz/Targets/IndexFuzzer.cs:14— IndexFuzzer.RunAsync 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.
PageFuzzer.RunAsync (cyclomatic 16) LiteDB.Fuzz/Targets/PageFuzzer.cs:11— PageFuzzer.RunAsync 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.
Node.Evaluate (cyclomatic 16) tools/QueryConfidenceChecks/Program.cs:138— Node.Evaluate has cyclomatic complexity 16 (threshold 15). 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. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
check_coverage_regression.validate_disposition (cyclomatic 16) .github/scripts/check_coverage_regression.py:247— check_coverage_regression.validate_disposition 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.
check_fault_points.source_hooks (cyclomatic 16) .github/scripts/check_fault_points.py:48— check_fault_points.source_hooks 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.
Races the wall clock: Query_With_No_Collection LiteDB.Tests/Query/Select_Tests.cs:79— This test reads `DateTime.Now` and compares it against the value the code under test computed from its own clock read, compared exactly in `r.Current["DIA"].Should().Be(DateTime.Now.Day)`. Those are two independent clock reads, so the test passes only while no boundary falls between them — a second ticking over between the code's read and the test's, or, for a date, a day that differs between the machine's local zone and UTC. It passes or fails on the time of day and the build agent's time zone, and re-running the suite on one machine cannot reveal it. Read the clock once: give the code under test a clock the test controls (a fake time provider, fake timers with a fixed system time) and build the expectation from that same instant, or assert a range rather than an exact value.
ManifestValidator.Validate (cognitive 173) LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Manifests/ManifestValidator.cs:28— ManifestValidator.Validate has cognitive complexity 173 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
compose_repro_matrix.main (cognitive 102) .github/scripts/compose_repro_matrix.py:16— compose_repro_matrix.main has cognitive complexity 102 (threshold 15). Drivers by points: if/else 36 (75 pts), loops 9 (16 pts), boolean chains 8, ternaries 1 (3 pts) (nesting depth added 48). 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.
RunCommand.RunExecutionLoopAsync (cognitive 75) LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Commands/RunCommand.cs:277— RunCommand.RunExecutionLoopAsync has cognitive complexity 75 (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.Main (cognitive 68) tools/QueryOptimizationBenchmarks/Program.cs:13— Program.Main has cognitive complexity 68 (threshold 15). Of this number, 56 points are the body's own statements and 12 belong to 11 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
QueryPipe.Pipe (cognitive 63) LiteDB/Engine/Query/Pipeline/QueryPipe.cs:29— QueryPipe.Pipe has cognitive complexity 63 (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.Main (cognitive 60) tools/VectorCompatibility/Current/Program.cs:11— Program.Main has cognitive complexity 60 (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.Run (cognitive 59) tools/SharedReadBenchmarks/Program.cs:87— Program.Run has cognitive complexity 59 (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.
ReaderContentionBenchmarks.Run (cognitive 59) tools/SharedReadBenchmarks/ReaderContentionBenchmarks.cs:24— ReaderContentionBenchmarks.Run has cognitive complexity 59 (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.
SharedFollowupHarness.TryRun (cognitive 55) LiteDB.Tests.SharedMutexHarness/SharedFollowupHarness.cs:9— SharedFollowupHarness.TryRun has cognitive complexity 55 (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.
LiteEngine.MigrateIndexOrdering (cognitive 54) LiteDB/Engine/Engine/IndexMigration.cs:11— LiteEngine.MigrateIndexOrdering has cognitive complexity 54 (threshold 15). Of this number, 53 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BsonMapper.Serialize (cognitive 51) LiteDB/Client/Mapper/BsonMapper.Serialize.cs:57— BsonMapper.Serialize has cognitive complexity 51 (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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
DictionaryExtensions.ParseKeyValue (cognitive 48) LiteDB/Utils/Extensions/DictionaryExtensions.cs:34— DictionaryExtensions.ParseKeyValue has cognitive complexity 48 (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.
BsonMapper.Deserialize (cognitive 44) LiteDB/Client/Mapper/BsonMapper.Deserialize.cs:98— BsonMapper.Deserialize 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.
WalRetirement.Load (cognitive 40) LiteDB/Engine/Disk/WalRetirement.cs:57— WalRetirement.Load has cognitive complexity 40 (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.
IndexRange.Execute (cognitive 40) LiteDB/Engine/Query/IndexQuery/IndexRange.cs:61— IndexRange.Execute has cognitive complexity 40 (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.
CompactCompatibility.Run (cognitive 40) tools/VectorCompatibility/Legacy/CompactCompatibility.cs:11— CompactCompatibility.Run has cognitive complexity 40 (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.
FileReaderV8.GetDocuments (cognitive 39) LiteDB/Engine/FileReader/FileReaderV8.Documents.cs:10— FileReaderV8.GetDocuments 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.
CursorHandoffFuzzer.RunAsync (cognitive 38) LiteDB.Fuzz/Targets/CursorHandoffFuzzer.cs:10— CursorHandoffFuzzer.RunAsync has cognitive complexity 38 (threshold 15). Of this number, 17 points are the body's own statements and 21 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SharedProcessFuzzer.RunAsync (cognitive 38) LiteDB.Fuzz/Targets/SharedProcessFuzzer.cs:26— SharedProcessFuzzer.RunAsync has cognitive complexity 38 (threshold 15). Of this number, 35 points are the body's own statements and 3 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
QueryOptimization.ChooseIndex (cognitive 36) LiteDB/Engine/Query/QueryOptimization.Index.cs:18— QueryOptimization.ChooseIndex has cognitive complexity 36 (threshold 15). Of this number, 34 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
RebuildService.Install (cognitive 36) LiteDB/Engine/Services/RebuildService.cs:143— RebuildService.Install has cognitive complexity 36 (threshold 15). Of this number, 18 points are the body's own statements and 18 belong to 5 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MvccRetirementScenario.Run (cognitive 36) LiteDB.Tests/Internals/MvccRetirementScenario.cs:31— MvccRetirementScenario.Run has cognitive complexity 36 (threshold 15). Of this number, 20 points are the body's own statements and 16 belong to 5 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
BsonExpressionParser.TryParsePath (cognitive 34) LiteDB/Document/Expression/Parser/BsonExpressionParser.cs:518— BsonExpressionParser.TryParsePath 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.
WalIndexService.RestoreIndex (cognitive 34) LiteDB/Engine/Services/WalIndexService.cs:223— WalIndexService.RestoreIndex 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.
Program.Main (cognitive 34) LiteDB.Fuzz/Program.cs:22— Program.Main has cognitive complexity 34 (threshold 15). Of this number, 32 points are the body's own statements and 2 belong to 2 function literals inside it that branch. 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.
DisjunctionPlanningWorkloads.Run (cognitive 34) tools/QueryOptimizationBenchmarks/DisjunctionPlanningWorkloads.cs:8— DisjunctionPlanningWorkloads.Run has cognitive complexity 34 (threshold 15). Most of this is not in the body itself: 2 of the 34 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 15, 13, 18, …). 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.
CompactCompatibility.Run (cognitive 34) tools/VectorCompatibility/Current/CompactCompatibility.cs:12— CompactCompatibility.Run has cognitive complexity 34 (threshold 15). Of this number, 31 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
regression_proof.main (cognitive 34) .github/scripts/regression_proof.py:361— regression_proof.main has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 6, ternaries 4 (6 pts), loops 3 (4 pts), error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SqlParser.ParseSelect (cognitive 33) LiteDB/Client/SqlParser/Commands/Select.cs:26— SqlParser.ParseSelect has cognitive complexity 33 (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.
MvccHarness.TryRun (cognitive 33) LiteDB.Tests.SharedMutexHarness/MvccHarness.cs:6— MvccHarness.TryRun has cognitive complexity 33 (threshold 15). Of this number, 31 points are the body's own statements and 2 belong to one function literal inside it that branches. 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.
Scenario.Run (cognitive 33) LiteDB.ReproRunner/Repros/SharedSelfTeardownProof/Scenario.cs:11— Scenario.Run has cognitive complexity 33 (threshold 15). Of this number, 22 points are the body's own statements and 11 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
BooleanRangeWorkloads.Run (cognitive 33) tools/QueryOptimizationBenchmarks/BooleanRangeWorkloads.cs:8— BooleanRangeWorkloads.Run has cognitive complexity 33 (threshold 15). Most of this is not in the body itself: 3 of the 33 points are its own statements and the rest belongs to 11 function literals inside it that branch (lines 28, 42, 48, …). 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.
IncludedBooleanWorkloads.Run (cognitive 33) tools/QueryOptimizationBenchmarks/IncludedBooleanWorkloads.cs:8— IncludedBooleanWorkloads.Run has cognitive complexity 33 (threshold 15). Most of this is not in the body itself: 2 of the 33 points are its own statements and the rest belongs to 16 function literals inside it that branch (lines 66, 25, 27, …). 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.
LinqExpressionTranslator.TranslateMethod (cognitive 32) LiteDB/Client/Mapper/Linq/LinqExpressionTranslator.cs:135— LinqExpressionTranslator.TranslateMethod has cognitive complexity 32 (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.
SharedEngine.QueryCore (cognitive 32) LiteDB/Client/Shared/SharedEngine.Query.cs:31— SharedEngine.QueryCore has cognitive complexity 32 (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.
BsonValue.BsonValue.ctor (cognitive 32) LiteDB/Document/BsonValue.cs:128— BsonValue.BsonValue.ctor has cognitive complexity 32 (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.
ChecksumWalFuzzer.RunAsync (cognitive 32) LiteDB.Fuzz/Targets/ChecksumWalFuzzer.cs:10— ChecksumWalFuzzer.RunAsync has cognitive complexity 32 (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.
BooleanMembershipWorkloads.Run (cognitive 32) tools/QueryOptimizationBenchmarks/BooleanMembershipWorkloads.cs:8— BooleanMembershipWorkloads.Run has cognitive complexity 32 (threshold 15). Most of this is not in the body itself: 2 of the 32 points are its own statements and the rest belongs to 12 function literals inside it that branch (lines 18, 56, 29, …). 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.
SharedMutexOwner.Run (cognitive 31) LiteDB/Client/Shared/SharedMutexOwner.cs:361— SharedMutexOwner.Run has cognitive complexity 31 (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.
FileReaderV7.GetDocuments (cognitive 31) LiteDB/Engine/FileReader/FileReaderV7.cs:126— FileReaderV7.GetDocuments has cognitive complexity 31 (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.
QueryOptimization.ChooseConstraintIndex (cognitive 31) LiteDB/Engine/Query/QueryOptimization.Constraints.cs:8— QueryOptimization.ChooseConstraintIndex has cognitive complexity 31 (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.
PromotionPowerLossScenario.Run (cognitive 31) LiteDB.Tests/Engine/PromotionPowerLossScenario.cs:24— PromotionPowerLossScenario.Run has cognitive complexity 31 (threshold 15). Of this number, 16 points are the body's own statements and 15 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
IndexLike.ExecuteStartsWith (cognitive 30) LiteDB/Engine/Query/IndexQuery/IndexLike.cs:99— IndexLike.ExecuteStartsWith has cognitive complexity 30 (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.
RangeUnionWorkloads.Run (cognitive 30) tools/QueryOptimizationBenchmarks/RangeUnionWorkloads.cs:8— RangeUnionWorkloads.Run has cognitive complexity 30 (threshold 15). Most of this is not in the body itself: 2 of the 30 points are its own statements and the rest belongs to 13 function literals inside it that branch (lines 17, 29, 32, …). 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.
WalReuseCompatibility.Run (cognitive 30) tools/VectorCompatibility/Current/WalReuseCompatibility.cs:13— WalReuseCompatibility.Run has cognitive complexity 30 (threshold 15). Of this number, 26 points are the body's own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BufferReader.ReadCString (cognitive 29) LiteDB/Engine/Disk/Serializer/BufferReader.NetCore.cs:89— BufferReader.ReadCString has cognitive complexity 29 (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.
FuzzArtifacts.MergeInterestingCorpus (cognitive 29) LiteDB.Fuzz/FuzzArtifacts.cs:172— FuzzArtifacts.MergeInterestingCorpus has cognitive complexity 29 (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.
ChecksumMigrationFuzzer.RunAsync (cognitive 29) LiteDB.Fuzz/Targets/ChecksumMigrationFuzzer.cs:10— ChecksumMigrationFuzzer.RunAsync has cognitive complexity 29 (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.
MvccCheckpointFuzzer.RunAsync (cognitive 29) LiteDB.Fuzz/Targets/MvccCheckpointFuzzer.cs:10— MvccCheckpointFuzzer.RunAsync 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.Main (cognitive 29) tools/SharedReadBenchmarks/Program.cs:18— Program.Main has cognitive complexity 29 (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.
InterruptedConversion.VerifyUnsealed (cognitive 29) tools/VectorCompatibility/Current/InterruptedConversion.cs:51— InterruptedConversion.VerifyUnsealed has cognitive complexity 29 (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.
check_coverage_regression.test_findings (cognitive 29) .github/scripts/check_coverage_regression.py:53— check_coverage_regression.test_findings has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (20 pts), ternaries 2 (5 pts), loops 3, boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BsonElementReader.Read (cognitive 28) LiteDB/Engine/Disk/Serializer/BsonElementReader.cs:12— BsonElementReader.Read has cognitive complexity 28 (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.
check_fault_points.source_hooks (cognitive 28) .github/scripts/check_fault_points.py:48— check_fault_points.source_hooks has cognitive complexity 28 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (9 pts), boolean chains 5, ternaries 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
check_fault_points.check_entry (cognitive 28) .github/scripts/check_fault_points.py:170— check_fault_points.check_entry has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 5, ternaries 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
LinqBindingContext.Quantifier (cognitive 27) LiteDB/Client/Mapper/Linq/LinqBindingContext.cs:87— LinqBindingContext.Quantifier 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.
LinqExpressionTranslator.TranslateBinary (cognitive 27) LiteDB/Client/Mapper/Linq/LinqExpressionTranslator.cs:235— LinqExpressionTranslator.TranslateBinary 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.
SharedCoordinationTemporaryFiles.Cleanup (cognitive 27) LiteDB/Client/Shared/SharedCoordinationTemporaryFiles.cs:33— SharedCoordinationTemporaryFiles.Cleanup 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.
BsonExpressionParser.ParseSelectDocumentBuilder (cognitive 27) LiteDB/Document/Expression/Parser/BsonExpressionParser.cs:121— BsonExpressionParser.ParseSelectDocumentBuilder 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.
BasePipe.Include (cognitive 27) LiteDB/Engine/Query/Pipeline/BasePipe.cs:48— BasePipe.Include has cognitive complexity 27 (threshold 15). Of this number, 26 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SysFileCsv.Output (cognitive 27) LiteDB/Engine/SystemCollections/SysFileCsv.cs:80— SysFileCsv.Output 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.
SharedMappedHarness.TryRun (cognitive 27) LiteDB.Tests.SharedMutexHarness/SharedMappedHarness.cs:9— SharedMappedHarness.TryRun has cognitive complexity 27 (threshold 15). Of this number, 20 points are the body's own statements and 7 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FuzzProcessRunner.RunCoreAsync (cognitive 27) LiteDB.Fuzz/FuzzProcessRunner.cs:109— FuzzProcessRunner.RunCoreAsync 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.
StorageFuzzer.RunAsync (cognitive 27) LiteDB.Fuzz/Targets/StorageFuzzer.cs:8— StorageFuzzer.RunAsync 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.
InteropBenchmarks.Run (cognitive 27) tools/SharedReadBenchmarks/InteropBenchmarks.cs:9— InteropBenchmarks.Run 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.
BsonValue.CompareTo (cognitive 26) LiteDB/Document/BsonValue.cs:552— BsonValue.CompareTo 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.
FileReaderV7.ReadPage (cognitive 26) LiteDB/Engine/FileReader/FileReaderV7.cs:187— FileReaderV7.ReadPage 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.
ScalarIntervals.Intersect (cognitive 26) LiteDB/Engine/Query/Structures/ScalarIntervals.cs:50— ScalarIntervals.Intersect 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.
WalIndexService.TryCheckpointCore (cognitive 26) LiteDB/Engine/Services/WalIndexService.Checkpoint.cs:81— WalIndexService.TryCheckpointCore has cognitive complexity 26 (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.
Tokenizer.ReadNext (cognitive 26) LiteDB/Utils/Tokenizer.cs:323— Tokenizer.ReadNext 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.
OptionSet.Parse (cognitive 26) LiteDB.Shell/Utils/OptionSet.cs:45— OptionSet.Parse 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.
MvccRetirementFuzzer.RunAsync (cognitive 26) LiteDB.Fuzz/Targets/MvccRetirementFuzzer.cs:10— MvccRetirementFuzzer.RunAsync 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.
WalFuzzer.RunAsync (cognitive 26) LiteDB.Fuzz/Targets/WalFuzzer.cs:10— WalFuzzer.RunAsync 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.
ContentionBenchmarks.Run (cognitive 26) tools/SharedReadBenchmarks/ContentionBenchmarks.cs:11— ContentionBenchmarks.Run 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.
Query.ToSQL (cognitive 25) LiteDB/Engine/Query/Query.cs:61— Query.ToSQL has cognitive complexity 25 (threshold 15). Of this number, 23 points are the body's own statements and 2 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.
VectorIndexService.Search (cognitive 25) LiteDB/Engine/Services/VectorIndexService.Search.cs:10— VectorIndexService.Search 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.
SharedEngine.EnsureCoordination (cognitive 25) LiteDB/Client/Shared/SharedEngine.CoordinatedReads.cs:48— SharedEngine.EnsureCoordination 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.
IngestCommand.ExecuteAsync (cognitive 25) LiteDB.Demo.Tools.VectorSearch/Commands/IngestCommand.cs:20— IngestCommand.ExecuteAsync has cognitive complexity 25 (threshold 15). Most of this is not in the body itself: 9 of the 25 points are its own statements and the rest belongs to one function literal inside it that branches (line 59). 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.
ReproExecutor.HandleConfigurationHandshake (cognitive 25) LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Execution/ReproExecutor.cs:341— ReproExecutor.HandleConfigurationHandshake 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.
BooleanValueWorkloads.Run (cognitive 25) tools/QueryOptimizationBenchmarks/BooleanValueWorkloads.cs:8— BooleanValueWorkloads.Run has cognitive complexity 25 (threshold 15). Most of this is not in the body itself: 3 of the 25 points are its own statements and the rest belongs to 12 function literals inside it that branch (lines 37, 39, 45, …). 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.
safety_common._attach_methods (cognitive 25) .github/scripts/safety_common.py:318— safety_common._attach_methods has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
LiteCollection.RemoveDocId (cognitive 24) LiteDB/Client/Database/Collections/Insert.cs:90— LiteCollection.RemoveDocId has cognitive complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
BsonMapper.RegisterDbRefList (cognitive 24) LiteDB/Client/Mapper/BsonMapper.cs:313— BsonMapper.RegisterDbRefList has cognitive complexity 24 (threshold 15). None of this is in the body itself: all 24 points belong to 2 function literals inside it that branch (lines 351, 318). 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.
SharedCoordinationProtocol.Inspect (cognitive 24) LiteDB/Client/Shared/SharedCoordinationProtocol.cs:65— SharedCoordinationProtocol.Inspect 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.
CacheReclaimer.TrimToLimit (cognitive 24) LiteDB/Engine/Disk/CacheReclaimer.cs:97— CacheReclaimer.TrimToLimit 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.
DiskService.WriteLogDisk (cognitive 24) LiteDB/Engine/Disk/DiskService.WalWrite.cs:29— DiskService.WriteLogDisk has cognitive complexity 24 (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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
LiteEngine.ValidateLegacyCollation (cognitive 24) LiteDB/Engine/Engine/CollationValidation.cs:22— LiteEngine.ValidateLegacyCollation 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.
QueryPlan.GetExecutionPlan (cognitive 24) LiteDB/Engine/Query/Structures/QueryPlan.cs:164— QueryPlan.GetExecutionPlan 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.
SharedEngine.TryQueryCoordinated (cognitive 24) LiteDB/Client/Shared/SharedEngine.CoordinatedReads.cs:118— SharedEngine.TryQueryCoordinated 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.
HarnessOptions.Parse (cognitive 24) LiteDB.Tests.SharedMutexHarness/Program.cs:228— HarnessOptions.Parse 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.
CompactPowerLossFuzzer.RunAsync (cognitive 24) LiteDB.Fuzz/Targets/CompactPowerLossFuzzer.cs:10— CompactPowerLossFuzzer.RunAsync 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.
SharedProcessFuzzer.RunChild (cognitive 24) LiteDB.Fuzz/Targets/SharedProcessFuzzer.cs:137— SharedProcessFuzzer.RunChild has cognitive complexity 24 (threshold 15). Of this number, 22 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SetUnionWorkloads.Run (cognitive 24) tools/QueryOptimizationBenchmarks/SetUnionWorkloads.cs:8— SetUnionWorkloads.Run has cognitive complexity 24 (threshold 15). Most of this is not in the body itself: 3 of the 24 points are its own statements and the rest belongs to 10 function literals inside it that branch (lines 30, 39, 47, …). 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.
BsonMapper.GetTypeCtor (cognitive 23) LiteDB/Client/Mapper/BsonMapper.GetEntityMapper.cs:212— BsonMapper.GetTypeCtor has cognitive complexity 23 (threshold 15). Of this number, 21 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RunCommand.ExecuteAsync (cognitive 23) LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Commands/RunCommand.cs:61— RunCommand.ExecuteAsync has cognitive complexity 23 (threshold 15). Of this number, 21 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Program.Main (cognitive 23) tools/IndexCompatibility/Program.cs:8— Program.Main 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.
regression_proof._check_guard (cognitive 23) .github/scripts/regression_proof.py:144— regression_proof._check_guard has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 3, ternaries 1 (3 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
safety_common._string_end (cognitive 23) .github/scripts/safety_common.py:200— safety_common._string_end has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 5, ternaries 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ConnectionString.BuildConnectionString (cognitive 22) LiteDB/Client/Structures/ConnectionString.cs:332— ConnectionString.BuildConnectionString 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.
LiteEngine.EnsureIndex (cognitive 22) LiteDB/Engine/Engine/Index.cs:46— LiteEngine.EnsureIndex has cognitive complexity 22 (threshold 15). Of this number, 11 points are the body's own statements and 11 belong to one function literal inside it that branches. 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.
BsonReader.ReadElement (cognitive 22) LiteDB/Engine/FileReader/Legacy/BsonReader.cs:70— BsonReader.ReadElement has cognitive complexity 22 (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.
GroupByPipe.SelectGroupBy (cognitive 22) LiteDB/Engine/Query/Pipeline/GroupByPipe.cs:153— GroupByPipe.SelectGroupBy 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.
QueryOptimization.ChooseBooleanIntersectionIndex (cognitive 22) LiteDB/Engine/Query/QueryOptimization.BooleanRanges.cs:22— QueryOptimization.ChooseBooleanIntersectionIndex 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.
IndexService.Find (cognitive 22) LiteDB/Engine/Services/IndexService.cs:390— IndexService.Find 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.
SharedStorageHarness.TryRun (cognitive 22) LiteDB.Tests.SharedMutexHarness/SharedStorageHarness.cs:6— SharedStorageHarness.TryRun 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.
ChecksumPageFuzzer.RunAsync (cognitive 22) LiteDB.Fuzz/Targets/ChecksumPageFuzzer.cs:10— ChecksumPageFuzzer.RunAsync has cognitive complexity 22 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
CompactCodecFuzzer.VerifyVectorBounds (cognitive 22) LiteDB.Fuzz/Targets/CompactCodecFuzzer.cs:95— CompactCodecFuzzer.VerifyVectorBounds 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.
LiteCollection.LiteCollection.ctor (cognitive 21) LiteDB/Client/Database/LiteCollection.cs:38— LiteCollection.LiteCollection.ctor 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.
BsonMapper.BuildEntityMapper (cognitive 21) LiteDB/Client/Mapper/BsonMapper.GetEntityMapper.cs:67— BsonMapper.BuildEntityMapper 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.
BsonMapper.SerializeDictionary (cognitive 21) LiteDB/Client/Mapper/BsonMapper.Serialize.cs:212— BsonMapper.SerializeDictionary 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.
WalRetirementReader.Read (cognitive 21) LiteDB/Engine/Disk/WalRetirementReader.cs:16— WalRetirementReader.Read 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.
QueryOptimization.TrySelectVectorIndex (cognitive 21) LiteDB/Engine/Query/QueryOptimization.Vector.cs:8— QueryOptimization.TrySelectVectorIndex 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.
SchemaCatalog.Select (cognitive 21) LiteDB/Engine/Storage/SchemaCatalog.cs:45— SchemaCatalog.Select has cognitive complexity 21 (threshold 15). Of this number, 20 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FuzzProcessRunner.RunEpochsAsync (cognitive 21) LiteDB.Fuzz/FuzzProcessRunner.cs:16— FuzzProcessRunner.RunEpochsAsync 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.
ChecksumPageFuzzer.CheckPolicyBoundary (cognitive 21) LiteDB.Fuzz/Targets/ChecksumPageFuzzer.cs:91— ChecksumPageFuzzer.CheckPolicyBoundary 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.
check_contracts.validate (cognitive 21) .github/scripts/check_contracts.py:40— check_contracts.validate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 5 (8 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
safety_common.blank_code (cognitive 21) .github/scripts/safety_common.py:162— safety_common.blank_code has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 3 (9 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
LinqExpressionTranslator.TryDbRef (cognitive 20) LiteDB/Client/Mapper/Linq/LinqExpressionTranslator.Projection.cs:41— LinqExpressionTranslator.TryDbRef has cognitive complexity 20 (threshold 15). Of this number, 17 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
HeaderJournal.IsPublished (cognitive 20) LiteDB/Engine/Disk/HeaderJournal.cs:47— HeaderJournal.IsPublished 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.
EncryptedLogPreamble.Open (cognitive 20) LiteDB/Engine/Disk/Streams/EncryptedLogPreamble.cs:16— EncryptedLogPreamble.Open has cognitive complexity 20 (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.
Tokenizer.ReadString (cognitive 20) LiteDB/Utils/Tokenizer.String.cs:11— Tokenizer.ReadString 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.
Program.RunFailingTransaction (cognitive 20) LiteDB.ReproRunner/Repros/Issue_2586_RollbackTransaction/Program.cs:173— Program.RunFailingTransaction 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.
ManifestValidator.ParseOutcomeExpectation (cognitive 20) LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Manifests/ManifestValidator.Outcomes.cs:65— ManifestValidator.ParseOutcomeExpectation 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.
Program.Verify (cognitive 20) tools/IndexCompatibility/Program.cs:148— Program.Verify 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.
BsonExpression.Compile (cognitive 19) LiteDB/Document/Expression/BsonExpression.Compilation.cs:137— BsonExpression.Compile 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.
FileStreamFactory.GetStream (cognitive 19) LiteDB/Engine/Disk/StreamFactory/FileStreamFactory.cs:56— FileStreamFactory.GetStream has cognitive complexity 19 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
AesStream.AesStream.ctor (cognitive 19) REDACTED:52— AesStream.AesStream.ctor 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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. Note what this body is, though: it works in explicit hardware vector and instruction-set types. A kernel divided across a call boundary passes its vectors between the parts and depends on the runtime putting them back together, so the division can cost more than the complexity it removes. The measurement stands — a hot path is not a licence to be unreadable — but the move that pays here is to lift the COLD parts out first (argument validation, fallback and error paths, one-off setup) and leave the kernel whole. Where the kernel itself has to be divided, ask for the extracted parts to be inlined as well, and measure the result rather than assuming the division is free.
LiteEngine.EnsureVectorIndex (cognitive 19) LiteDB/Engine/Engine/Index.cs:135— LiteEngine.EnsureVectorIndex has cognitive complexity 19 (threshold 15). Most of this is not in the body itself: 9 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 150). 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.
SysFileCsv.ReadString (cognitive 19) LiteDB/Engine/SystemCollections/SysFileCsv.cs:185— SysFileCsv.ReadString 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.
safety_common.parse_tests (cognitive 19) .github/scripts/safety_common.py:289— safety_common.parse_tests has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), ternaries 1 (3 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SharedReaderRegistry.LiveVersions (cognitive 18) LiteDB/Client/Shared/SharedReaderRegistry.cs:110— SharedReaderRegistry.LiveVersions 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.
SharedReaderSlots.ReadVersions (cognitive 18) LiteDB/Client/Shared/SharedReaderSlots.cs:189— SharedReaderSlots.ReadVersions 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.
IndexEquals.Execute (cognitive 18) LiteDB/Engine/Query/IndexQuery/IndexEquals.cs:30— IndexEquals.Execute 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.
QueryOptimization.SplitWherePredicateInTerms (cognitive 18) LiteDB/Engine/Query/QueryOptimization.cs:87— QueryOptimization.SplitWherePredicateInTerms 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.
ScalarIndexConstraint.IntersectSets (cognitive 18) LiteDB/Engine/Query/Structures/ScalarIndexConstraint.cs:116— ScalarIndexConstraint.IntersectSets 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.
IndexService.AddNode (cognitive 18) LiteDB/Engine/Services/IndexService.cs:86— IndexService.AddNode 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.
SysFileCsv.Input (cognitive 18) LiteDB/Engine/SystemCollections/SysFileCsv.cs:19— SysFileCsv.Input 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.
StringExtensions.SqlLike (cognitive 18) LiteDB/Utils/Extensions/StringExtensions.cs:44— StringExtensions.SqlLike 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.
Tokenizer.ReadNumber (cognitive 18) LiteDB/Utils/Tokenizer.cs:582— Tokenizer.ReadNumber 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.
CoordinatorClient.AcquireSnapshot (cognitive 18) LiteDB/Client/Coordinated/CoordinatorClient.Snapshots.cs:83— CoordinatorClient.AcquireSnapshot 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.
TestExecution.CreateThreads (cognitive 18) LiteDB.Stress/Test/TestExecution.cs:71— TestExecution.CreateThreads has cognitive complexity 18 (threshold 15). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 77). 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.
IndexFuzzer.RunAsync (cognitive 18) LiteDB.Fuzz/Targets/IndexFuzzer.cs:14— IndexFuzzer.RunAsync 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.
Node.Like (cognitive 18) LiteDB.Fuzz/Targets/QueryFuzzer.cs:208— Node.Like 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.
SnapshotWriterProcess.RunChild (cognitive 18) LiteDB.Fuzz/Targets/SnapshotWriterProcess.cs:85— SnapshotWriterProcess.RunChild 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.
Program.Main (cognitive 18) tools/VectorCompatibility/Legacy/Program.cs:10— Program.Main 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.
check_coverage_regression.validate_disposition (cognitive 18) .github/scripts/check_coverage_regression.py:247— check_coverage_regression.validate_disposition has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, loops 3 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
regression_proof.verify (cognitive 18) .github/scripts/regression_proof.py:317— regression_proof.verify has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 10, if/else 8. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
LinqExpressionTranslator.TranslateMember (cognitive 17) LiteDB/Client/Mapper/Linq/LinqExpressionTranslator.cs:99— LinqExpressionTranslator.TranslateMember 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.
SharedMutexOwner.Exit (cognitive 17) LiteDB/Client/Shared/SharedMutexOwner.cs:165— SharedMutexOwner.Exit 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.
BsonExpressionMethods.VECTOR_SIM (cognitive 17) LiteDB/Document/Expression/Methods/Vector.cs:8— BsonExpressionMethods.VECTOR_SIM has cognitive complexity 17 (threshold 15). Of this number, 15 points are the body's own statements and 2 belong to one function literal inside it that branches. 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.
DiskService.RecoverHeaderJournal (cognitive 17) LiteDB/Engine/Disk/DiskService.HeaderJournal.cs:48— DiskService.RecoverHeaderJournal has cognitive complexity 17 (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.
LiteEngine.FindStaleMemberPathDocuments (cognitive 17) LiteDB/Engine/Engine/IndexMigrationStaleKeys.cs:24— LiteEngine.FindStaleMemberPathDocuments has cognitive complexity 17 (threshold 15). Of this number, 16 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FileReaderV8.LoadIndexes (cognitive 17) LiteDB/Engine/FileReader/FileReaderV8.cs:229— FileReaderV8.LoadIndexes 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.
QueryOptimization.ChooseDisjunctionIndex (cognitive 17) LiteDB/Engine/Query/QueryOptimization.Disjunction.cs:5— QueryOptimization.ChooseDisjunctionIndex 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.
QueryOptimization.TryGetMemberPath (cognitive 17) LiteDB/Engine/Query/QueryOptimization.IncludedFields.cs:34— QueryOptimization.TryGetMemberPath has cognitive complexity 17 (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.
Snapshot.ReadPage (cognitive 17) LiteDB/Engine/Services/SnapShot.cs:214— Snapshot.ReadPage 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.
CompactDocumentWriter.WriteDocument (cognitive 17) LiteDB/Engine/Storage/CompactDocumentWriter.cs:46— CompactDocumentWriter.WriteDocument has cognitive complexity 17 (threshold 15). Of this number, 16 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RunCommand.ProcessUiUpdatesAsync (cognitive 17) LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Commands/RunCommand.cs:754— RunCommand.ProcessUiUpdatesAsync 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.
ManifestValidator.ParsePlatformArray (cognitive 17) LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Manifests/ManifestValidator.cs:499— ManifestValidator.ParsePlatformArray 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.
SharedPolicyHarness.TryRun (cognitive 17) LiteDB.Tests.SharedMutexHarness/SharedPolicyHarness.cs:8— SharedPolicyHarness.TryRun 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.
FuzzContext.DeleteStepFiles (cognitive 17) LiteDB.Fuzz/FuzzContext.cs:129— FuzzContext.DeleteStepFiles 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.
ChaosFuzzer.RunAsync (cognitive 17) LiteDB.Fuzz/Targets/ChaosFuzzer.cs:10— ChaosFuzzer.RunAsync 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.
ChecksumCrashFuzzer.RunAsync (cognitive 17) LiteDB.Fuzz/Targets/ChecksumCrashFuzzer.cs:10— ChecksumCrashFuzzer.RunAsync 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.
PageFuzzer.RunAsync (cognitive 17) LiteDB.Fuzz/Targets/PageFuzzer.cs:11— PageFuzzer.RunAsync 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.
Node.Source.get (cognitive 17) LiteDB.Fuzz/Targets/QueryFuzzer.cs:169— Node.Source.get 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.
RebuildTransitionFuzzer.RunAsync (cognitive 17) LiteDB.Fuzz/Targets/RebuildTransitionFuzzer.cs:16— RebuildTransitionFuzzer.RunAsync has cognitive complexity 17 (threshold 15). Of this number, 15 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Program.Main (cognitive 17) LiteDB.ReproRunner/Repros/SharedSelfTeardownProof/Program.cs:11— Program.Main has cognitive complexity 17 (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.
BsonMapper.Clone (cognitive 16) LiteDB/Client/Mapper/BsonMapper.Clone.cs:12— BsonMapper.Clone 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.
LinqExpressionCache.Publish (cognitive 16) LiteDB/Client/Mapper/Linq/LinqExpressionCache.cs:79— LinqExpressionCache.Publish 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.
LinqExpressionTranslator.IsSafeRuntimeUnary (cognitive 16) LiteDB/Client/Mapper/Linq/LinqExpressionTranslator.Captures.cs:44— LinqExpressionTranslator.IsSafeRuntimeUnary has cognitive complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
StringResolver.ResolveMethod (cognitive 16) LiteDB/Client/Mapper/Linq/TypeResolver/StringResolver.cs:15— StringResolver.ResolveMethod 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.
SharedCoordinationFiles.TryRetire (cognitive 16) LiteDB/Client/Shared/SharedCoordinationFiles.cs:39— SharedCoordinationFiles.TryRetire 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.
BsonExpressionMethods.DATEADD (cognitive 16) LiteDB/Document/Expression/Methods/Date.cs:84— BsonExpressionMethods.DATEADD has cognitive complexity 16 (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. This shape REPEATS in the file: one other method here (BsonExpressionMethods.DATEDIFF) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
BsonExpressionMethods.DATEDIFF (cognitive 16) LiteDB/Document/Expression/Methods/Date.cs:108— BsonExpressionMethods.DATEDIFF has cognitive complexity 16 (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. This shape REPEATS in the file: one other method here (BsonExpressionMethods.DATEADD) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
DiskService.WriteLogPage (cognitive 16) LiteDB/Engine/Disk/DiskService.WalWrite.cs:154— DiskService.WriteLogPage 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.
BorrowedDocumentReader.ReadDocument (cognitive 16) LiteDB/Engine/Disk/Serializer/BorrowedDocumentReader.cs:42— BorrowedDocumentReader.ReadDocument 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.
LiteEngine.UpdateDocument (cognitive 16) LiteDB/Engine/Engine/Update.cs:98— LiteEngine.UpdateDocument has cognitive complexity 16 (threshold 15). Of this number, 13 points are the body's own statements and 3 belong to 3 function literals inside it that branch. To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
BasePipe.ExtractBorrowedKeys (cognitive 16) LiteDB/Engine/Query/Pipeline/BasePipe.cs:326— BasePipe.ExtractBorrowedKeys 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.
QueryOptimization.FindPredicateIndex (cognitive 16) LiteDB/Engine/Query/QueryOptimization.Index.cs:78— QueryOptimization.FindPredicateIndex 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.
TransactionRegistry.Add (cognitive 16) LiteDB/Engine/Services/TransactionRegistry.cs:19— TransactionRegistry.Add 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.
TransactionService.PersistDirtyPages (cognitive 16) LiteDB/Engine/Services/TransactionService.cs:153— TransactionService.PersistDirtyPages has cognitive complexity 16 (threshold 15). Of this number, 14 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
VectorIndexService.Insert (cognitive 16) LiteDB/Engine/Services/VectorIndexService.cs:101— VectorIndexService.Insert 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.
VectorIndexService.SelectNewRoot (cognitive 16) LiteDB/Engine/Services/VectorIndexService.cs:437— VectorIndexService.SelectNewRoot 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.
TextUtilities.SplitIntoChunks (cognitive 16) LiteDB.Demo.Tools.VectorSearch/Utilities/TextUtilities.cs:117— TextUtilities.SplitIntoChunks 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.
DatabaseIntegrityVerifier.ValidateCollection (cognitive 16) LiteDB.Fuzz/DatabaseIntegrityVerifier.cs:105— DatabaseIntegrityVerifier.ValidateCollection 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.
DatabaseIntegrityVerifier.TraverseIndex (cognitive 16) LiteDB.Fuzz/DatabaseIntegrityVerifier.cs:213— DatabaseIntegrityVerifier.TraverseIndex 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.
CompactCrashFuzzer.Verify (cognitive 16) LiteDB.Fuzz/Targets/CompactCrashFuzzer.cs:53— CompactCrashFuzzer.Verify 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.
MalformedFileFuzzer.RunAsync (cognitive 16) LiteDB.Fuzz/Targets/MalformedFileFuzzer.cs:10— MalformedFileFuzzer.RunAsync 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.
ParserFuzzer.RunAsync (cognitive 16) LiteDB.Fuzz/Targets/ParserFuzzer.cs:19— ParserFuzzer.RunAsync has cognitive complexity 16 (threshold 15). Of this number, 12 points are the body's own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
check_coverage_regression.validate_quarantine (cognitive 16) .github/scripts/check_coverage_regression.py:278— check_coverage_regression.validate_quarantine has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
regression_proof.check_provenance (cognitive 16) .github/scripts/regression_proof.py:166— regression_proof.check_provenance has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ClassTooLong: RunCommand LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Commands/RunCommand.cs— ClassTooLong — 478 significant lines (blank, comment-only and punctuation-only lines excluded), 19 methods. The bar is 400 significant lines; this is 78 over it, 1.20× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
FileTooLong: Commands/RunCommand.cs LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Commands/RunCommand.cs— FileTooLong — 508 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 8 over it, 1.02× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
Change-coupling hub: StreamFactory.cs → FileStreamFactory.cs, StreamPool.cs, LiteEngine.cs LiteDB/Engine/Disk/StreamFactory/StreamFactory.cs— `LiteDB/Engine/Disk/StreamFactory/StreamFactory.cs` changes together with 3 other files — `LiteDB/Engine/Disk/StreamFactory/FileStreamFactory.cs`, `LiteDB/Engine/Disk/StreamFactory/StreamPool.cs`, `LiteDB/Engine/LiteEngine.cs` — none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3.
D4 · Code Duplication· Edited copy of a member (21 corresponding lines) · ×1
Edited copy of a member (21 corresponding lines) tools/QueryIrBenchmarks/Program.cs:116— tools/QueryIrBenchmarks/Program.cs:116-138 | tools/QueryOptimizationBenchmarks/Program.cs:134-158 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (4 members, 50+ identical tokens) LiteDB/Engine/Engine/Index.cs:47— LiteDB/Engine/Engine/Index.cs:47-130 | LiteDB/Engine/Engine/Index.cs:136-201 | LiteDB/Engine/Engine/Update.cs:14-45 | LiteDB/Engine/Engine/Upsert.cs:15-49 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Duplicated block (18–41 lines × 2) LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Manifests/ManifestValidator.cs:500— LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Manifests/ManifestValidator.cs:500-517 | LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Manifests/ManifestValidator.cs:551-591 — 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 `LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Manifests/ManifestValidator.cs:500` 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 (29 lines × 2) LiteDB/Engine/Disk/Serializer/BufferWriter.NetCore.cs:22— LiteDB/Engine/Disk/Serializer/BufferWriter.NetCore.cs:22-50 | LiteDB/Engine/Disk/Serializer/BufferWriter.NetCore.cs:75-103 — 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 `LiteDB/Engine/Disk/Serializer/BufferWriter.NetCore.cs:22` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (19 lines × 2) tools/QueryIrBenchmarks/Program.cs:118— tools/QueryIrBenchmarks/Program.cs:118-136 | tools/QueryOptimizationBenchmarks/Program.cs:138-156 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `tools/QueryOptimizationBenchmarks/Program.cs:136` calls `StartsWith`, `checked`, `Parse` and `tools/QueryIrBenchmarks/Program.cs:117` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (9 lines × 2) LiteDB/Engine/Disk/Serializer/BufferWriter.cs:242— LiteDB/Engine/Disk/Serializer/BufferWriter.cs:242-250 | LiteDB/Engine/Disk/Serializer/BufferWriter.cs:266-274 — 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 `LiteDB/Engine/Disk/Serializer/BufferWriter.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. Note first that the copies are not typed on the same thing: the declarations holding them bind `value` to `Guid` in one and `ObjectId` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (17 lines × 2) LiteDB/Engine/Query/Pipeline/BasePipe.cs:248— LiteDB/Engine/Query/Pipeline/BasePipe.cs:248-264 | LiteDB/Engine/Query/Pipeline/BasePipe.cs:282-298 — 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 `LiteDB/Engine/Query/Pipeline/BasePipe.cs:248` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15 lines × 2) LiteDB/Engine/Pages/BasePage.cs:170— LiteDB/Engine/Pages/BasePage.cs:170-184 | LiteDB/Engine/Pages/BasePage.cs:267-281 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (13 lines × 2) LiteDB/Engine/Disk/Serializer/BsonElementReader.cs:71— LiteDB/Engine/Disk/Serializer/BsonElementReader.cs:71-83 | LiteDB/Engine/FileReader/Legacy/BsonReader.cs:107-119 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `LiteDB/Engine/Disk/Serializer/BsonElementReader.cs:71` 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. Note first that the copies are not typed on the same thing: the declarations holding them bind `reader` to `BufferReader` in one and `ByteReader` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (11–13 lines × 2) LiteDB/Client/Mapper/Linq/LinqExpressionTranslator.Captures.cs:12— LiteDB/Client/Mapper/Linq/LinqExpressionTranslator.Captures.cs:12-24 | LiteDB/Client/Mapper/Linq/LinqExpressionTranslator.cs:159-169 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. 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 first that the copies are not typed on the same thing: the declarations holding them bind `node` to `IndexExpression` in one and `MethodCallExpression` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (12 lines × 2) LiteDB/Document/Expression/Parser/BsonExpressionFunctions.cs:34— LiteDB/Document/Expression/Parser/BsonExpressionFunctions.cs:34-45 | LiteDB/Document/Expression/Parser/BsonExpressionOperators.cs:326-337 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (7–8 lines × 2) LiteDB/Document/Expression/CompiledExpressionCache.cs:28— LiteDB/Document/Expression/CompiledExpressionCache.cs:28-34 | LiteDB/Document/Expression/CompiledExpressionCache.cs:43-50 — 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 `LiteDB/Document/Expression/CompiledExpressionCache.cs:28` 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 (4–7 lines × 3) tools/QueryIrBenchmarks/Program.cs:70— tools/QueryIrBenchmarks/Program.cs:70-76 | tools/QueryOptimizationBenchmarks/OverallWorkloads.cs:24-27 | tools/QueryOptimizationBenchmarks/Program.cs:105-111 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `tools/QueryIrBenchmarks/Program.cs:70` 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 (5–6 lines × 2) LiteDB/Utils/Extensions/BufferExtensions.cs:165— LiteDB/Utils/Extensions/BufferExtensions.cs:165-170 | LiteDB/Utils/Extensions/BufferExtensions.cs:176-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.
Duplicated block (5 lines × 4) LiteDB.Fuzz/Targets/BoundaryFuzzer.cs:236— LiteDB.Fuzz/Targets/BoundaryFuzzer.cs:236-240 | LiteDB.Fuzz/Targets/ChecksumFixture.cs:42-46 | LiteDB.Fuzz/Targets/StorageFuzzer.cs:250-254 | LiteDB.Fuzz/Targets/WalFuzzer.cs:192-196 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 4 call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
D8 · Code Coverage· No test project references QueryOptimizationBenchmarks · ×1
No test project references QueryOptimizationBenchmarks tools/QueryOptimizationBenchmarks/QueryOptimizationBenchmarks.csproj— No test project in this repository references QueryOptimizationBenchmarks (41 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references LiteDB.Shell · ×1
No test project references LiteDB.Shell LiteDB.Shell/LiteDB.Shell.csproj— No test project in this repository references LiteDB.Shell (18 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references LiteDB.Demo.Tools.VectorSearch · ×1
No test project references LiteDB.Demo.Tools.VectorSearch LiteDB.Demo.Tools.VectorSearch/LiteDB.Demo.Tools.VectorSearch.csproj— No test project in this repository references LiteDB.Demo.Tools.VectorSearch (12 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references SharedReadBenchmarks · ×1
No test project references SharedReadBenchmarks tools/SharedReadBenchmarks/SharedReadBenchmarks.csproj— No test project in this repository references SharedReadBenchmarks (6 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references Current · ×1
No test project references Current tools/VectorCompatibility/Current/Current.csproj— No test project in this repository references Current (4 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references ConsoleApp1 · ×1
No test project references ConsoleApp1 ConsoleApp1/ConsoleApp1.csproj— No test project in this repository references ConsoleApp1 (3 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references Legacy · ×1
No test project references Legacy tools/VectorCompatibility/Legacy/Legacy.csproj— No test project in this repository references Legacy (2 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references MemoryProfiles · ×1
No test project references MemoryProfiles tools/MemoryProfiles/MemoryProfiles.csproj— No test project in this repository references MemoryProfiles (2 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references MemoryValidation · ×1
No test project references MemoryValidation tools/MemoryValidation/MemoryValidation.csproj— No test project in this repository references MemoryValidation (2 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references WalChecksumBenchmarks · ×1
No test project references WalChecksumBenchmarks tools/WalChecksumBenchmarks/WalChecksumBenchmarks.csproj— No test project in this repository references WalChecksumBenchmarks (2 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references CompactStorage · ×1
No test project references CompactStorage tools/CompactStorage/CompactStorage.csproj— No test project in this repository references CompactStorage (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references IndexMigrationFixture · ×1
No test project references IndexMigrationFixture tools/IndexMigrationFixture/IndexMigrationFixture.csproj— No test project in this repository references IndexMigrationFixture (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references IndexMigrationRecovery · ×1
No test project references IndexMigrationRecovery tools/IndexMigrationRecovery/IndexMigrationRecovery.csproj— No test project in this repository references IndexMigrationRecovery (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references Issue_2561_TransactionMonitor · ×1
No test project references Issue_2561_TransactionMonitor LiteDB.ReproRunner/Repros/Issue_2561_TransactionMonitor/Issue_2561_TransactionMonitor.csproj— No test project in this repository references Issue_2561_TransactionMonitor (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references Issue_2586_RollbackTransaction · ×1
No test project references Issue_2586_RollbackTransaction LiteDB.ReproRunner/Repros/Issue_2586_RollbackTransaction/Issue_2586_RollbackTransaction.csproj— No test project in this repository references Issue_2586_RollbackTransaction (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references Issue_2614_DiskServiceDispose · ×1
No test project references Issue_2614_DiskServiceDispose LiteDB.ReproRunner/Repros/Issue_2614_DiskServiceDispose/Issue_2614_DiskServiceDispose.csproj— No test project in this repository references Issue_2614_DiskServiceDispose (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references Issue_3071_SharedPeerCallback · ×1
No test project references Issue_3071_SharedPeerCallback LiteDB.ReproRunner/Repros/Issue_3071_SharedPeerCallback/Issue_3071_SharedPeerCallback.csproj— No test project in this repository references Issue_3071_SharedPeerCallback (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references LiteDB.Fuzz.Legacy · ×1
No test project references LiteDB.Fuzz.Legacy LiteDB.Fuzz.Legacy/LiteDB.Fuzz.Legacy.csproj— No test project in this repository references LiteDB.Fuzz.Legacy (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references LiteDB.Stress · ×1
No test project references LiteDB.Stress LiteDB.Stress/LiteDB.Stress.csproj— No test project in this repository references LiteDB.Stress (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references QueryConfidenceChecks · ×1
No test project references QueryConfidenceChecks tools/QueryConfidenceChecks/QueryConfidenceChecks.csproj— No test project in this repository references QueryConfidenceChecks (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references QueryIrBenchmarks · ×1
No test project references QueryIrBenchmarks tools/QueryIrBenchmarks/QueryIrBenchmarks.csproj— No test project in this repository references QueryIrBenchmarks (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references QueryParameterLifetimeBenchmarks · ×1
No test project references QueryParameterLifetimeBenchmarks tools/QueryParameterLifetimeBenchmarks/QueryParameterLifetimeBenchmarks.csproj— No test project in this repository references QueryParameterLifetimeBenchmarks (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
D8 · Code Coverage· No test project references VectorFlushProbe · ×1
No test project references VectorFlushProbe tools/VectorFlushProbe/VectorFlushProbe.csproj— No test project in this repository references VectorFlushProbe (1 production source file(s)), so `dotnet test` never loads it and no coverage tool can measure it — its code is absent from the 32.1% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured.
CRAP 1173: RunCommand.RunExecutionLoopAsync LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Commands/RunCommand.cs:277— Cyclomatic 35 with 2.4% file coverage — too complex for how untested it is (CRAP = CC²·(1−cov)³ + CC; ≥30 needs tests or simplification).
CRAP 1035: ManifestValidator.Validate LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Manifests/ManifestValidator.cs:28— Cyclomatic 82 with 47.9% file coverage — too complex for how untested it is (CRAP = CC²·(1−cov)³ + CC; ≥30 needs tests or simplification).
CRAP 240: RunCommandSettings.Validate LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Commands/RunCommandSettings.cs:75— Cyclomatic 15 with 0.0% file coverage — too complex for how untested it is (CRAP = CC²·(1−cov)³ + CC; ≥30 needs tests or simplification).
CRAP 170: RunCommand.ExecuteAsync LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Commands/RunCommand.cs:61— Cyclomatic 13 with 2.4% file coverage — too complex for how untested it is (CRAP = CC²·(1−cov)³ + CC; ≥30 needs tests or simplification).
CRAP 146: RunCommand.ProcessUiUpdatesAsync LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Commands/RunCommand.cs:754— Cyclomatic 12 with 2.4% file coverage — too complex for how untested it is (CRAP = CC²·(1−cov)³ + CC; ≥30 needs tests or simplification).
IC1 · Incompleteness & stubs· Both branches are identical · ×1
Both branches are identical — the condition decides nothing LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Commands/RunCommand.cs:452— Both arms of `latestBuild.Succeeded ? … : …` are `"[yellow]⏳[/]"`, so no input can make the condition matter. Implement the distinction that was intended, or drop the condition.
IC1 · Incompleteness & stubs· Empty method body · ×1
Empty method body — does nothing with its inputs tools/SharedReadBenchmarks/HolderBenchmarks.cs:58— `Close` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it.
P12 · CI test-gate honesty· CI test gate excludes suites by filter · ×1
CI test gate excludes suites by filter REDACTED:123— `dotnet test LiteDB.Tests/LiteDB.Tests.csproj --configuration Release --framework net8.0 /p:TestingEnabled=true /p:LiteDBPreDev=true --fil…` filters with `FullyQualifiedName~PreDevRelease_Tests` — 2174 test(s) it drops — run by no other gate before merge (categories Memory; e.g. BsonVector_Tests.BsonVector_RoundTrip_Success, BsonVector_Tests.BsonVector_RoundTrip_UInt16Limit). Run what it drops in another job before merge (a complementary filter), or remove the filter.
P12 · CI test-gate honesty· Test failure does not fail the CI gate · ×1
Test failure does not fail the CI gate REDACTED:256— `continue-on-error: true` lets the step or job that runs `dotnet run --project LiteDB.Fuzz -c Release -f "$FUZZ_FRAMEWORK" --no-build -- --target "$FUZZ_TARGETS" --seed "$FUZZ_SEED" --duration…` fail without failing the pipeline — the suite can go red and the change still merges. Remove it from the test step, or quarantine the specific failing tests instead.
P12 · CI test-gate honesty· Tests run only outside the merge gate · ×1
Tests run only outside the merge gate REDACTED:77— `dotnet test LiteDB.sln --configuration Release --no-build --verbosity normal --settings tests.runsettings --logger "trx;LogFileName=TestR…` is the only CI command that runs 2200 test(s) (categories Memory; e.g. CliApplicationTests.Validate_ReturnsErrorCodeWhenManifestInvalid, ManifestValidatorTests.Validate_AllowsValidManifest), and the workflow runs only on workflow_dispatch — a failure there is found after the change merged, when the only remedy is a revert. Run them on pull requests (or in the merge queue).
P12 · CI test-gate honesty· Coverage collected but not gated · ×1
Coverage collected but not gated — CI collects a coverage report but no step enforces a minimum — coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool's minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository's CI files AND its coverage configuration — the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited — matched against the threshold settings this check knows by name. A floor set in your coverage service's web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here.
SC1 · Supply-chain hygiene· NuGet dependencies are not locked · ×1
NuGet dependencies are not locked — No packages.lock.json and no central package management — restores aren't reproducible or pinned (SSDF PW.4.4). Enable <RestorePackagesWithLockFile>true</RestorePackagesWithLockFile> (commit the lockfile) or adopt Directory.Packages.props. Advisory — never scored.
Blocking `Barrier.SignalAndWait` inside an `async` method LiteDB.Fuzz/Targets/ConcurrentFuzzer.cs:51— `Barrier.SignalAndWait` parks the thread until another thread signals it — inside a method that is already `async`, the wait should be awaitable (a `TaskCompletionSource`, `SemaphoreSlim.WaitAsync`, or `WaitHandle` bridged with `Task.Factory.FromAsync`).
Blocking `File.AppendAllText` inside an `async` method LiteDB.Fuzz/Targets/SharedProcessFuzzer.cs:58— `File.AppendAllText` blocks the thread on I/O while `File.AppendAllTextAsync` exists to wait without one — inside a method that is already `async`, await the twin.
X13 · Undrained process stream· Redirected process stream is never drained (deadlock) · ×1
Redirected process stream is never drained (deadlock) LiteDB.Fuzz/Targets/SnapshotFuzzer.cs:177— `RedirectStandardOutput` is set here, but nothing in this type ever reads `StandardOutput` — while `StandardError` is read to the end. The child blocks as soon as it fills the StandardOutput pipe (~4 KB, never more than 64 KB), and it can then never finish writing StandardError, so the read-to-end above never returns and the `WaitForExit` timeout beside it does not help: the timeout bounds the WAIT, not the read that precedes it. Drain both — read one stream on a background thread (`BeginErrorReadLine()` with an `ErrorDataReceived` handler, or a `Task` running the second `ReadToEndAsync()`) and await both before `WaitForExit()` — or stop redirecting the stream you do not consume.
X18 · Disposal-pattern correctness· Owned disposable field is never released · ×1
Owned disposable field is never released LiteDB/Engine/Storage/CompactDocumentReader.cs:9— `CompactDocumentReader` implements `IDisposable` — so it has told every caller it holds something worth releasing — and it constructs `_stream` itself (line 9), which makes that instance its own. But `_stream` is named in none of the methods the disposal search covered: `Dispose` (line 132) — that is `Dispose` plus every method `Dispose` calls BY NAME, so a release reached through an interface, a delegate or a base class is not followed and is worth checking before acting. On what was read, the type's disposal releases everything except the one thing it owns. A disposable the owner never disposes is held until finalization if its type has a finalizer, and forever if it does not — which for a synchronisation primitive, a timer, a stream or a handle means the resource accumulates once per instance for the life of the process. Release it in `Dispose` (`_stream?.Dispose();`), or, if it truly does not need releasing, drop `IDisposable` from the type so the claim and the behaviour agree.
X5 · Nullable reference types· Null guard scopes only part of the work it protects · ×1
Null guard scopes only part of the work it protects LiteDB/Engine/Disk/DiskService.WalWrite.cs:97— This method contradicts itself about `transactionState`: line 74 tests it for null before doing anything with it — the author's own statement that null is an input this code expects — but that `if` scopes only the block beneath it, and line 97 then dereferences `transactionState` as `transactionState.TransactionID` AFTER the block has closed, where the guard no longer applies. A null `transactionState` skips the guarded body and reaches that line anyway, throwing NullReferenceException on exactly the input the guard was written for. If the dereference belongs to the guarded work, move it inside the block; if `transactionState` truly cannot be null by then, the guard above is misleading and should go.
Orphaned file LiteDB/Document/Expression/Methods/DataTypes.cs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file LiteDB/Client/Database/LiteRepository.cs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file LiteDB/Client/Database/ILiteCollection.cs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file LiteDB/Engine/EnginePragmas.cs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file LiteDB/Document/Expression/Methods/String.cs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file LiteDB/Engine/SystemCollections/SysFileCsv.cs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file LiteDB/Engine/Structures/IndexNode.cs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file LiteDB/Engine/Sort/SortService.cs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file LiteDB/Utils/BufferSlice.cs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file REDACTED:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file LiteDB/Document/Expression/Methods/Date.cs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file LiteDB/Engine/Structures/CollectionIndex.cs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file LiteDB/Engine/Pages/DataPage.cs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file LiteDB/Engine/Engine/Delete.cs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file REDACTED:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file LiteDB/Engine/SystemCollections/SysPageList.cs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file LiteDB/Engine/SystemCollections/SysDump.cs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file LiteDB/Client/Database/Collections/Update.cs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file LiteDB/Engine/Disk/Streams/TempStream.cs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file LiteDB/Engine/Sort/SortDisk.cs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file LiteDB/Engine/Engine/Sequence.cs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file LiteDB/Engine/FileReader/Legacy/AesEncryption.cs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file LiteDB/Document/Json/JsonSerializer.cs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file LiteDB/Utils/Collation.cs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file LiteDB/Engine/SystemCollections/SysFileJson.cs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Duplicated predicate LiteDB/Engine/Query/QueryOptimization.BooleanRanges.cs:57— `!TryGetUnionConstraint(expression, out var current, out var value, out _) || !IndexExpressionIdentity.IsMemberPath(current) || !IsRangeValue…` appears character-identically in 2 files — LiteDB/Engine/Query/QueryOptimization.BooleanRanges.cs, LiteDB/Engine/Query/QueryOptimization.RangeDisjunction.cs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate tools/QueryOptimizationBenchmarks/BooleanRangeWorkloads.cs:39— `(x.Score >= 1000 && x.Score < 1010) || (x.Score >= 15000 && x.Score < 15010)` appears character-identically in 5 files — tools/QueryOptimizationBenchmarks/BooleanRangeWorkloads.cs, tools/QueryOptimizationBenchmarks/DisjunctionPlanningWorkloads.cs, tools/QueryOptimizationBenchmarks/IncludedBooleanWorkloads.cs, tools/QueryOptimizationBenchmarks/RangeUnionWorkloads.cs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate LiteDB.Fuzz/Targets/QueryFuzzer.cs:176— `Left.Evaluate(document, parameters, collation) && Right.Evaluate(document, parameters, collation)` appears character-identically in 2 files — LiteDB.Fuzz/Targets/QueryFuzzer.cs, tools/QueryConfidenceChecks/Program.cs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate LiteDB.Fuzz/Targets/QueryFuzzer.cs:177— `Left.Evaluate(document, parameters, collation) || Right.Evaluate(document, parameters, collation)` appears character-identically in 2 files — LiteDB.Fuzz/Targets/QueryFuzzer.cs, tools/QueryConfidenceChecks/Program.cs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate LiteDB/Client/Shared/SharedCoordinationProtocol.cs:115— `RuntimeInformation.IsOSPlatform(OSPlatform.Windows) || RuntimeInformation.IsOSPlatform(OSPlatform.OSX)` appears character-identically in 2 files — LiteDB/Client/Shared/SharedCoordinationProtocol.cs, LiteDB/Client/Shared/SharedCoordinationTemporaryFiles.cs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate LiteDB/Engine/Pages/BasePage.cs:761— `_ownerSnapshot == null || _ownerSnapshot.Epoch == _ownerSnapshotEpoch` appears character-identically in 2 files — LiteDB/Engine/Pages/BasePage.cs, LiteDB/Utils/BufferSlice.cs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate LiteDB/Engine/Query/QueryOptimization.BooleanRanges.cs:47— `best == null || candidate.Cost < best.Cost` appears character-identically in 3 files — LiteDB/Engine/Query/QueryOptimization.BooleanRanges.cs, LiteDB/Engine/Query/QueryOptimization.Constraints.cs, LiteDB/Engine/Query/QueryOptimization.Disjunction.cs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate LiteDB.Fuzz/Targets/QueryFuzzer.cs:193— `comparison >= 0 && value.CompareTo(parameters["q" + Id], collation) <= 0` appears character-identically in 2 files — LiteDB.Fuzz/Targets/QueryFuzzer.cs, tools/QueryConfidenceChecks/Program.cs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate LiteDB.Fuzz/Targets/ChecksumCrashFuzzer.cs:100— `data.ToArray().SequenceEqual(dataBytes) && log.ToArray().SequenceEqual(logBytes)` appears character-identically in 4 files — LiteDB.Fuzz/Targets/ChecksumCrashFuzzer.cs, LiteDB.Fuzz/Targets/ChecksumWalFuzzer.cs, LiteDB.Fuzz/Targets/CompactCrashFuzzer.cs, LiteDB.Tests/Internals/MvccRetirementScenario.cs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate LiteDB/Engine/Disk/Serializer/BufferWriter.cs:421— `date == DateTime.MinValue || date == DateTime.MaxValue` appears character-identically in 3 files — LiteDB/Engine/Disk/Serializer/BufferWriter.cs, LiteDB/Engine/Query/Lookup/IndexKeyLoader.cs, LiteDB/Engine/Storage/CompactDocumentWriter.cs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate LiteDB/Client/Shared/SharedEngine.Query.cs:193— `ex is IOException || ex is UnauthorizedAccessException` appears character-identically in 4 files — LiteDB/Client/Coordinated/CoordinatorMarker.cs, LiteDB/Client/Shared/SharedEngine.Query.cs, LiteDB/Client/Shared/SharedEngine.Readers.cs, LiteDB/Client/Shared/SharedReaderRegistry.cs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate LiteDB/Document/Expression/BorrowedPredicateEvaluator.cs:69— `expression.Type == BsonExpressionType.And || expression.Type == BsonExpressionType.Or` appears character-identically in 2 files — LiteDB/Document/Expression/BorrowedPredicateEvaluator.cs, LiteDB/Engine/Query/QueryOptimization.BooleanRanges.cs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate LiteDB/Engine/Query/QueryOptimization.BooleanRanges.cs:126— `expression.Type == BsonExpressionType.In || expression.IsANY` appears character-identically in 2 files — LiteDB/Engine/Query/QueryOptimization.BooleanRanges.cs, LiteDB/Engine/Query/QueryOptimization.RangeDisjunction.cs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate LiteDB/Engine/Query/QueryOptimization.BooleanRanges.cs:59— `field != null && !IndexExpressionIdentity.Matches(field.Source, current)` appears character-identically in 2 files — LiteDB/Engine/Query/QueryOptimization.BooleanRanges.cs, LiteDB/Engine/Query/QueryOptimization.RangeDisjunction.cs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate LiteDB/Engine/Engine/Insert.cs:67— `id.IsNull || id.IsMinValue || id.IsMaxValue` appears character-identically in 2 files — LiteDB/Engine/Engine/Insert.cs, LiteDB/Engine/Engine/Update.cs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate LiteDB/Engine/Disk/DiskService.HeaderJournal.cs:72— `journal.ConfirmsLegacyBackup && !published && journal.FooterBytes != 0` appears character-identically in 2 files — LiteDB/Engine/Disk/DiskService.HeaderJournal.cs, LiteDB/Engine/FileReader/FileReaderV8.Checksums.cs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate LiteDB/Engine/Engine/IndexMigration.cs:213— `key.IsMinValue || key.IsMaxValue || IndexNode.GetKeyLength(key, true) > MAX_INDEX_KEY_LENGTH` appears character-identically in 2 files — LiteDB/Engine/Engine/IndexMigration.cs, LiteDB/Engine/Engine/IndexMigrationStaleKeys.cs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate tools/QueryOptimizationBenchmarks/BooleanWorkloads.cs:12— `keys.Contains(x.Score) && x.Score >= 990` appears character-identically in 3 files — tools/QueryOptimizationBenchmarks/BooleanWorkloads.cs, tools/QueryOptimizationBenchmarks/ConstraintWorkloads.cs, tools/QueryOptimizationBenchmarks/OverallWorkloads.cs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate LiteDB/Engine/Disk/Serializer/BorrowedDocumentReader.cs:48— `length >= 5 && length <= MAX_DOCUMENT_SIZE` appears character-identically in 2 files — LiteDB/Engine/Disk/Serializer/BorrowedDocumentReader.cs, LiteDB/Engine/Disk/Serializer/BufferReader.cs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate LiteDB/Engine/Query/IndexQuery/IndexEquals.cs:50— `node.Key.IsMinValue || node.Key.IsMaxValue` appears character-identically in 4 files — LiteDB/Engine/Query/IndexQuery/IndexEquals.cs, LiteDB/Engine/Query/IndexQuery/IndexLike.cs, LiteDB/Engine/Query/IndexQuery/IndexNotEquals.cs, LiteDB/Engine/Query/IndexQuery/IndexRange.cs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate LiteDB.Fuzz/DatabaseIntegrityVerifier.cs:270— `node.Slot == 0 && !node.DataBlock.IsEmpty` appears character-identically in 2 files — LiteDB.Fuzz/DatabaseIntegrityVerifier.cs, LiteDB.Fuzz/Targets/IntegrityFuzzer.cs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate LiteDB/Engine/Disk/CacheReclaimer.cs:125— `page.State == FrameState.Readable && page.ShareCounter == 0` appears character-identically in 3 files — LiteDB/Engine/Disk/CacheReclaimer.cs, LiteDB/Engine/Disk/MemoryCache.Writable.cs, LiteDB/Engine/Disk/MemoryCache.cs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate LiteDB/Client/Mapper/Linq/TypeResolver/DateTimeResolver.cs:28— `pars.Length == 1 && pars[0].ParameterType == typeof(string)` appears character-identically in 2 files — LiteDB/Client/Mapper/Linq/TypeResolver/DateTimeResolver.cs, LiteDB/Client/Mapper/Linq/TypeResolver/NumberResolver.cs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate LiteDB/Document/Expression/BorrowedPredicateEvaluator.cs:119— `paths.Count == 64 || !BorrowedFieldPath.TryCreate(segments, paths.Count, out var path)` appears character-identically in 2 files — LiteDB/Document/Expression/BorrowedPredicateEvaluator.cs, LiteDB/Document/Expression/BorrowedScalarEvaluator.cs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate LiteDB/Engine/Disk/HeaderJournal.cs:164— `position < PAGE_SIZE || stream.Length < position + PAGE_SIZE` appears character-identically in 2 files — LiteDB/Engine/Disk/HeaderJournal.LegacyTail.cs, LiteDB/Engine/Disk/HeaderJournal.cs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Commented-out code LiteDB/Document/Expression/BsonExpressionFactory.Binary.cs:25— A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
Commented-out code LiteDB/Document/Expression/Parser/BsonExpressionOperators.cs:187— A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
Commented-out code LiteDB/Engine/Disk/DiskReader.cs:83— A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
Commented-out code LiteDB/Utils/BufferSlice.cs:110— A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
Commented-out code LiteDB/Utils/Constants.cs:121— A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
Commented-out code LiteDB/Utils/Constants.cs:122— A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
Commented-out code LiteDB/Utils/Extensions/BufferExtensions.cs:197— A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
Commented-out code LiteDB/Utils/Extensions/BufferExtensions.cs:210— A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
Fat interface: ILiteCollection<T> (62 members) LiteDB/Client/Database/ILiteCollection.cs:7— `ILiteCollection<T>` declares 62 members: `Name`, `AutoId`, `EntityMapper`, `Include`, `Include`, `Upsert`, `Upsert`, `Upsert`, `Update`, `Update`, `Update`, `UpdateMany`, `UpdateMany`, `Insert`, `Insert`, `Insert`, `InsertBulk`, `EnsureIndex`, `EnsureIndex`, `EnsureIndex`, `EnsureIndex`, `DropIndex`, `Query`, `Find`, `Find`, `Find`, `FindById`, `FindOne`, `FindOne`, `FindOne`, `FindOne`, `FindOne`, `FindAll`, `Delete`, `DeleteAll`, `DeleteMany`, `DeleteMany`, `DeleteMany`, `DeleteMany`, `Count`, and 22 more. Counted as the author wrote them — a property is ONE member and its get/set accessors are not counted separately, and an event counts once. Those 62 declarations carry 24 distinct name(s), so part of the width is overloading rather than separate responsibilities — but 24 operations clears the >15 bar on its own, so the row is about responsibilities, not signatures. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
Fat interface: ILiteDatabase (27 members) LiteDB/Client/Database/ILiteDatabase.cs:8— `ILiteDatabase` declares 27 members: `Mapper`, `FileStorage`, `GetCollection`, `GetCollection`, `GetCollection`, `GetCollection`, `BeginTrans`, `Commit`, `Rollback`, `GetStorage`, `GetCollectionNames`, `CollectionExists`, `DropCollection`, `RenameCollection`, `Execute`, `Execute`, `Execute`, `Checkpoint`, `Rebuild`, `Pragma`, `Pragma`, `UserVersion`, `Timeout`, `UtcDate`, `LimitSize`, `CheckpointSize`, `Collation`. Counted as the author wrote them — a property is ONE member and its get/set accessors are not counted separately, and an event counts once. Those 27 declarations carry 21 distinct name(s), so part of the width is overloading rather than separate responsibilities — but 21 operations clears the >15 bar on its own, so the row is about responsibilities, not signatures. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
Fat interface: ILiteQueryable<T> (21 members) LiteDB/Client/Database/ILiteQueryable.cs:8— `ILiteQueryable<T>` declares 21 members under just 10 distinct name(s): `SingleOrDefaultById`, `Include`, `Include`, `Include`, `Where`, `Where`, `Where`, `Where`, `OrderBy`, `OrderBy`, `OrderByDescending`, `OrderByDescending`, `ThenBy`, `ThenBy`, `ThenByDescending`, `ThenByDescending`, `GroupBy`, `GroupBy`, `Having`, `Select`, `Select`. Counted as the author wrote them — a property is ONE member and its get/set accessors are not counted separately, and an event counts once. That is an OVERLOAD SET, not 21 separate responsibilities: a caller binds to 10 operation(s) and uses the overload it selected, so the Interface-Segregation harm does NOT apply on the caller's side and splitting this into role-interfaces would scatter one operation without relieving anything. The burden that does remain is the IMPLEMENTER's — all 21 signatures must be written and kept in step. Reduce it by collapsing overloads (optional or default parameters, or an options object) rather than by segregating the interface.
Fat interface: ILiteQueryableResult<T> (18 members) LiteDB/Client/Database/ILiteQueryable.cs:39— `ILiteQueryableResult<T>` declares 18 members: `Limit`, `Skip`, `Offset`, `ForUpdate`, `GetPlan`, `ExecuteReader`, `ToDocuments`, `ToEnumerable`, `ToList`, `ToArray`, `Into`, `First`, `FirstOrDefault`, `Single`, `SingleOrDefault`, `Count`, `LongCount`, `Exists`. Counted as the author wrote them — a property is ONE member and its get/set accessors are not counted separately, and an event counts once. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
Fat interface: ILiteRepository (33 members) LiteDB/Client/Database/ILiteRepository.Collections.cs:5— `ILiteRepository` declares 33 members under just 15 distinct name(s): `Insert`, `Insert`, `Update`, `Update`, `Upsert`, `Upsert`, `Database`, `Insert`, `Insert`, `Update`, `Update`, `Upsert`, `Upsert`, `Delete`, `DeleteMany`, `DeleteMany`, `Query`, `EnsureIndex`, `EnsureIndex`, `EnsureIndex`, `EnsureIndex`, `SingleById`, `SingleOrDefaultById`, `Fetch`, `Fetch`, `First`, `First`, `FirstOrDefault`, `FirstOrDefault`, `Single`, `Single`, `SingleOrDefault`, `SingleOrDefault`. Counted as the author wrote them — a property is ONE member and its get/set accessors are not counted separately, and an event counts once. That is an OVERLOAD SET, not 33 separate responsibilities: a caller binds to 15 operation(s) and uses the overload it selected, so the Interface-Segregation harm does NOT apply on the caller's side and splitting this into role-interfaces would scatter one operation without relieving anything. The burden that does remain is the IMPLEMENTER's — all 33 signatures must be written and kept in step. Reduce it by collapsing overloads (optional or default parameters, or an options object) rather than by segregating the interface.
Fat interface: ILiteEngine (19 members) LiteDB/Engine/ILiteEngine.cs:14— `ILiteEngine` declares 19 members: `Checkpoint`, `Rebuild`, `BeginTrans`, `Commit`, `Rollback`, `Query`, `Insert`, `Update`, `UpdateMany`, `Upsert`, `Delete`, `DeleteMany`, `DropCollection`, `RenameCollection`, `EnsureIndex`, `EnsureVectorIndex`, `DropIndex`, `Pragma`, `Pragma`. Counted as the author wrote them — a property is ONE member and its get/set accessors are not counted separately, and an event counts once. Those 19 declarations carry 18 distinct name(s), so part of the width is overloading rather than separate responsibilities — but 18 operations clears the >15 bar on its own, so the row is about responsibilities, not signatures. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
Disabled test LiteDB.Tests/Engine/Collation_Tests.cs:79— A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
Disabled test LiteDB.Tests/Engine/Rebuild_Tests.cs:166— A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
Disabled test LiteDB.Tests/Issues/Issue2127_Tests.cs:14— A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
Disabled test LiteDB.Tests/Issues/Issue2298_Tests.cs:18— A test is skipped ("System.Text.Json is not supported on this target framework for this scenario.") — coverage that looks present but never runs in any gate. If it's an opt-in suite, document how it runs; otherwise re-enable or delete it.
Disabled test LiteDB.Tests/Issues/Issue2909_Tests.cs:11— A test is skipped ("The report targets net8.0 and net10.0; .NET Framework retains the netstandard fallback contract.") — coverage that looks present but never runs in any gate. If it's an opt-in suite, document how it runs; otherwise re-enable or delete it.
README/code drift LiteDB.Tests.SharedMutexHarness/README.md:8— LiteDB.Tests.SharedMutexHarness/README.md runs `dotnet run --project SharedMutexHarness/SharedMutexHarness.csproj`, but `SharedMutexHarness/SharedMutexHarness.csproj` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/reprorunner.md:97— docs/reprorunner.md names .NET 9, but the projects target .NET 8, 10. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift LiteDB.ReproRunner/Repros/Issue_2586_RollbackTransaction/README.md:4— LiteDB.ReproRunner/Repros/Issue_2586_RollbackTransaction/README.md names the project `LiteDB.LiteException`, but no project, folder or namespace of that name exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
Silent fallback default in catch LiteDB/Document/Expression/Methods/Vector.cs:22— `VECTOR_SIM` swallows every exception into `return float.NaN;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch LiteDB.Fuzz/FuzzArtifacts.cs:401— `Git` swallows every exception into `return null;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch LiteDB.Fuzz/Targets/RebuildFuzzer.cs:149— `ProbeCorruption` swallows `Exception` into `return true;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Documentation: contradicts the code docs/checksum-merge-review.md— The header-recovery gap section references v10 checksums and v11 index ordering but the document is written for v12 format (compact-storage mode Compact) and claims to cover all bounded fault models. Update the bounded-fault model table to reflect the current compact-storage format.
Documentation: contradicts the code docs/connection-string-parsing.md— The rejection of nonexistent local times (#2357) is described for a UTC-only storage, but the document does not address how non-UTC values are handled in the new CompactStorage mode. Add a sentence on what happens when a Local/Unspecified DateTime value appears in a CompactStorage file.
redundant comment LiteDB.Tests/Database/AutoId_Tests.cs:179— "insert as 7" — delete - restates the comment on the assignment
redundant comment LiteDB/Engine/Pages/BasePage.cs:179— "block information" — delete - restates ItemsCount = 0; the comment is a generated stub.
IC1 · Incompleteness & stubs· Member throws NotSupportedException · ×2
Member throws NotSupportedException LiteDB/Client/Storage/LiteFileStream.cs:125— `SetLength`'s body only throws NotSupportedException — sometimes a deliberate contract, often an unfinished stub. Confirm it's intentional.
Member throws NotSupportedException LiteDB/Engine/Query/IndexQuery/VectorIndexQuery.cs:49— `Execute`'s body only throws NotSupportedException — sometimes a deliberate contract, often an unfinished stub. Confirm it's intentional.
Silent fallback default on parse failure LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Execution/ReproExecutor.cs:298— `TryProcessStructuredLine` returns `false` when `ReproHostMessageEnvelope.TryParse(line, out var envelope, out _)` is false, with no log or throw — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer to the test rather than a stand-in for a value that could not be read, this is not a silent default: say so in a comment on the member and the row stops firing.
Silent fallback default on parse failure LiteDB.Fuzz/FuzzFindingRegistry.cs:114— `ReadFailureId` falls back to `"UNKNOWN_FUZZ_FAILURE"` when `runDocument.RootElement.TryGetProperty("failureId", out var failureId)` is false, with no log or throw — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer to the test rather than a stand-in for a value that could not be read, this is not a silent default: say so in a comment on the member and the row stops firing.
C2 · Access Controls· No named authorization policies · ×1
No named authorization policies — Authorization IS enforced here (by imperative guard methods that throw on violation) — this is NOT a claim that the code is unprotected. What's missing is a NAMED rule set: the guards encode the access rules inline, so the rules can't be listed, reviewed or tested apart from the call sites that apply them. Recommendation, not a defect.
Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 139 significant file(s) lose their only recent owner: LiteDB/Engine/Pages/BasePage.cs, LiteDB/Engine/Services/VectorIndexService.cs, LiteDB/Document/Expression/Parser/BsonExpressionParser.cs, LiteDB/Engine/Services/SnapShot.cs, LiteDB.Fuzz/FuzzArtifacts.cs, LiteDB.ReproRunner/Repros/Issue_2586_RollbackTransaction/Program.cs, LiteDB/Engine/Services/TransactionService.cs, LiteDB/Client/Shared/SharedEngine.cs (+131 more). Pair on, review, or document these before any departure.
D16 · Bus Factor· Further sole-owners (lower concentration) · ×1
Further sole-owners (lower concentration) — 2 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold — folded into the bus-factor score and metrics (141 single-owned of 417 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 417 of the 708 production source files in this repository met that bar). They are anonymized user #2 (1 file(s)), anonymized user #3 (1 file(s)) — spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: LiteDB/Utils/LCID.cs, LiteDB/Utils/Extensions/BufferExtensions.cs.
No ADRs found — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`.
D28 · Secrets (history)· Rotate the exposed credentials · ×1
REDACTED
D34 · Knowledge Freshness· Further orphaned files (smaller) · ×1
Further orphaned files (smaller) — 33 smaller file(s) also have no living knowledge — folded into the freshness score and metrics rather than raised one row each — most significant first: LiteDB/Document/Expression/Methods/DataTypes.cs, LiteDB/Client/Database/LiteRepository.cs, LiteDB/Client/Database/ILiteCollection.cs, LiteDB/Engine/EnginePragmas.cs, LiteDB/Document/Expression/Methods/String.cs, LiteDB/Engine/SystemCollections/SysFileCsv.cs, LiteDB/Engine/Structures/IndexNode.cs, LiteDB/Engine/Sort/SortService.cs (and 25 more) (36 orphaned of 427 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 427 of the 708 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway.
IL efficiency: 88 authored method(s) exceed the IL budget LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Manifests/ManifestValidator.cs:30— 88 of 4517 first-party methods compile to oversized IL bodies (> 250 instructions); worst: LiteDB.ReproRunner.Cli.Manifests.ManifestValidator.Validate @ LiteDB.ReproRunner/LiteDB.ReproRunner.Cli/Manifests/ManifestValidator.cs:30, 975 IL instructions; that pulled this dimension to 9.6/10. These bodies are far past the JIT's inline budget, so splitting them does not make them inlinable — what moves the number is emitting less: collapsing LINQ chains and closures on hot paths, and interpolation built eagerly where it is only sometimes used.
No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
No src/ separation — Production code isn't grouped under a src/ folder — it's spread across several top-level directories, so there's no one place that says 'this is the product'.
Inconsistent root namespaces — Only 12/37 projects share a common root namespace — the code's module identity is inconsistent.
P12 · CI test-gate honesty· Sleep-based test synchronization · ×1
Sleep-based test synchronization — 28 Task.Delay/Thread.Sleep call(s) in test code synchronize with background work by sleeping — a known flakiness precursor on slow runners. Prefer polling with a deadline or completion signals.
No SAST — No static application security testing detected. For this repository's stack, add CodeQL's csharp pack, or a .NET security analyzer package (or `semgrep --config=auto`, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 99693 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
X2 · Cancellation propagation· Not all async methods take a CancellationToken · ×1
Not all async methods take a CancellationToken — Only 16/39 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.
Nullable reference types not enabled everywhere — 10/32 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.
Null-forgiving operator (`!`) suppressions reduce the NRT score — ~0.7 `!` suppressions per 1k syntax nodes — 24 suppression(s) across the 32914 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.
Skipped (documented): Create_Database_Using_Current_Culture LiteDB.Tests/Engine/Collation_Tests.cs:79— Skipped with a documented reason — a deferral, not lazy debt: Passes only as the first LiteDB use in the process (e.g. run alone locally): Collation.Default snapshots the culture once per process, so after another test created a database this gets 'de-DE/IgnoreCase' (the culture at first use) instead of 'fi/IgnoreCase'.
Skipped (documented): Rebuild_Change_Culture_Error LiteDB.Tests/Engine/Rebuild_Tests.cs:166— Skipped with a documented reason — a deferral, not lazy debt: Not supported yet: rebuilding 'ana'/'ANA' from en-US/None to en-US/IgnoreCase throws LiteException 'Cannot insert duplicate key in unique index '_id'' from RebuildContent instead of recording the collision in _rebuild_errors and keeping en-US/None.
Skipped (documented): InsertItemBackToBack_Test LiteDB.Tests/Issues/Issue2127_Tests.cs:14— Skipped with a documented reason — a deferral, not lazy debt: Too slow for a unit test in a build process: 100 iterations with a 1 s sleep take ~102 s (passed 5/5 locally on net10.0). The DiskWriterQueue race of #2127 no longer exists; the queue was removed in 198f0a672.
Skipped (documented): We_Dont_Need_Ctor LiteDB.Tests/Issues/Issue2298_Tests.cs:18— Skipped with a documented reason — a deferral, not lazy debt: System.Text.Json is not supported on this target framework for this scenario.
Skipped (documented): ObjectId_uses_the_current_process_and_machine_on_NETCoreApp LiteDB.Tests/Issues/Issue2909_Tests.cs:11— Skipped with a documented reason — a deferral, not lazy debt: The report targets net8.0 and net10.0; .NET Framework retains the netstandard fallback contract.
Off the main sequence: LiteDB.ReproRunner.Shared LiteDB.ReproRunner/LiteDB.ReproRunner.Shared/LiteDB.ReproRunner.Shared.csproj:1— LiteDB.ReproRunner.Shared: abstractness 0.00, instability 0.00, distance 1.00 — the shape a shared-kernel / building-block library has BY DESIGN — concrete and widely depended-on is what makes it useful, and this dimension does not penalise it (the distance is reported for completeness, not as a defect). Worth a look only if it has grown past one coherent kernel into an everything-bucket.
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, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that. semgrep could not parse 5 file(s) — `LiteDB.Fuzz/FuzzOptions.cs`, `LiteDB/Client/SqlParser/Commands/Insert.cs`, `LiteDB/Document/BsonVector.cs`, `LiteDB/Document/ObjectId.cs`, `LiteDB/Engine/Query/IndexQuery/VectorIndexQuery.cs` — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.
disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
none (no readable dependency manifest): not applicable — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Python pyproject.toml/requirements.txt (pip/uv/Poetry), a Swift Package.swift/Package.resolved, a Cargo manifest, a Go module (go.mod/go.sum), a Gradle version catalogue, a Maven POM, an sbt build (build.sbt), composer.json, package.json, a Dart pubspec.yaml, an Elixir mix.exs/mix.lock (Hex), a rebar.config / erlang.mk DEPS (Hex), a Ruby Gemfile/Gemfile.lock or .gemspec (Bundler/RubyGems) — not scanned yet).
0
—
Run 01a1682b-10df-7749-813d-953fe926846f · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 269 · Warnings: 712 · Recommendations: 110 · Info: 44 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 23-10-2026 @ 09:50 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.