Public report of skyzh/mini-lsm, published 28 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). Assert signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey →
Signed and filed in the standard's public register, 28 October 2026, 16:09 UTC · Survey ID cd_72679b68db7e467d9dfa7624065c5f98
skyzh/mini-lsm
Measured 28 October 2026, 16:08 UTC, at code version 2f7ce31
No regression since the last survey
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.
CAI scoreAdequate
CriticalWeakAdequateStrongExemplary
Up 1 since the last survey
The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.
A small codebase: 14,339 lines of product code in 4 projects, tests not counted · Estimated rebuild effort: about 0.2 person-years · Weakest lens: Production Readiness, 35
Findings by how serious they are
10 critical162 serious25 minor
22 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
28 October 2026, 16:08 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 ▸
48of 48 dimensions measured by tools.
175of 197 findings point to an exact file and line, so you can open each one in the code. The other 22 concern the repository as a whole, such as missing documentation.
48dimensions across 5 lenses, read from 14,339 lines of product code in 4 projects.
skyzh/mini-lsm falls short of our standard for production because we found no logging, tracing or health checks in the code and no automated security scanning of the code, its secrets or its dependencies. It scores 58 out of 100 and is rated Adequate, and all ten of its critical findings are security problems in the build pipeline.
Production Readiness, at 35, is the weakest lens and counts most in the score. The best first step for the work it takes is recording design decisions, worth about 5 points. Adding a diagnostic log would lift Production Readiness itself, worth about 7 points. Raising Production Readiness to 70 would lift the score to about 74.
Ten pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Pinning each tool to an exact version would close this risk.
The product code is 14,339 lines, about €22,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.
Watchdog compares every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.
Fixed since the last survey: 2 findings
These 2 critical or serious findings were in the previous survey, on 14 October 2026, and are gone from this one.
Explicit Debt · TodoComment repeated across 22 files mini-lsm-mvcc/src/mvcc.rs
Supply-chain Provenance & Signing REDACTED
Rebuild cost: about €22,000 · Estimate
Cost to rebuild
€7,300 to €37,000, for 121 to 385 hours of work, about 0.2 person-years for one engineer
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.8 at a score of 58. 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
Small: 14,339 lines of product code
What it is not
Not a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.
How the estimate is made: 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. For this code, every line is priced as straight logic, which keeps the estimate on the low side.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Resolve the 1 No ADRs found finding(s) in ADR Quality.
Raises the score by about 5 points · Low effort · ADR Quality
2
Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag.
Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.
Raises the score by about 7 points · Medium effort · Observability
3
Add a SAST step to CI running what this repository's stack ships: cargo-audit / cargo-deny (or clippy) — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.
Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.
Where the investment is most exposed · Value at risk
This code would cost about €22,000 to build again, about 0.2 person-years of work. Its weakest lens is Production Readiness, at 35 (Weak). Production Readiness is about whether the product is ready to run in production and to change without breaking. Because the weakest lens counts most in the score, work on Production Readiness also moves the score most.
Based on: the rebuild estimate · the Production Readiness grade · how much each lens counts
What to do: Start with the Production Readiness actions in Top priorities.
If you do one thing first · First action
Resolve the 1 No ADRs found finding(s) in ADR Quality. Of all the actions in this report, it raises the score most for the work it takes: about 5 points for low effort, because it clears the 1 ADR Quality findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
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.
75 modules, with 106 dependencies between them. One loop runs through 4 of the modules, marked above the diagonal.
The table shows the 40 modules with the most connections; 35 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.
mini_lsm.block.builder uses mini_lsm.block, so a change to mini_lsm.block can break mini_lsm.block.builder, while a change to mini_lsm.block.builder can't break mini_lsm.block.
Position
Below the diagonal: mini_lsm.block.builder uses a module listed above it, which is the healthy direction.
mini_lsm.block.iterator uses mini_lsm.block, so a change to mini_lsm.block can break mini_lsm.block.iterator, while a change to mini_lsm.block.iterator can't break mini_lsm.block.
Position
Below the diagonal: mini_lsm.block.iterator uses a module listed above it, which is the healthy direction.
mini_lsm.iterators.merge_iterator uses mini_lsm.iterators, so a change to mini_lsm.iterators can break mini_lsm.iterators.merge_iterator, while a change to mini_lsm.iterators.merge_iterator can't break mini_lsm.iterators.
Position
Below the diagonal: mini_lsm.iterators.merge_iterator uses a module listed above it, which is the healthy direction.
mini_lsm.iterators.two_merge_iterator uses mini_lsm.iterators, so a change to mini_lsm.iterators can break mini_lsm.iterators.two_merge_iterator, while a change to mini_lsm.iterators.two_merge_iterator can't break mini_lsm.iterators.
Position
Below the diagonal: mini_lsm.iterators.two_merge_iterator uses a module listed above it, which is the healthy direction.
mini_lsm.table uses mini_lsm.table.bloom, so a change to mini_lsm.table.bloom can break mini_lsm.table, while a change to mini_lsm.table can't break mini_lsm.table.bloom.
Position
Below the diagonal: mini_lsm.table uses a module listed above it, which is the healthy direction.
mini_lsm.table.builder uses mini_lsm.block.builder, so a change to mini_lsm.block.builder can break mini_lsm.table.builder, while a change to mini_lsm.table.builder can't break mini_lsm.block.builder.
Position
Below the diagonal: mini_lsm.table.builder uses a module listed above it, which is the healthy direction.
mini_lsm.table.builder uses mini_lsm.table, so a change to mini_lsm.table can break mini_lsm.table.builder, while a change to mini_lsm.table.builder can't break mini_lsm.table.
Position
Below the diagonal: mini_lsm.table.builder uses a module listed above it, which is the healthy direction.
mini_lsm.table.iterator uses mini_lsm.iterators, so a change to mini_lsm.iterators can break mini_lsm.table.iterator, while a change to mini_lsm.table.iterator can't break mini_lsm.iterators.
Position
Below the diagonal: mini_lsm.table.iterator uses a module listed above it, which is the healthy direction.
mini_lsm.table.iterator uses mini_lsm.block.iterator, so a change to mini_lsm.block.iterator can break mini_lsm.table.iterator, while a change to mini_lsm.table.iterator can't break mini_lsm.block.iterator.
Position
Below the diagonal: mini_lsm.table.iterator uses a module listed above it, which is the healthy direction.
mini_lsm.table.iterator uses mini_lsm.table, so a change to mini_lsm.table can break mini_lsm.table.iterator, while a change to mini_lsm.table.iterator can't break mini_lsm.table.
Position
Below the diagonal: mini_lsm.table.iterator uses a module listed above it, which is the healthy direction.
mini_lsm_mvcc.iterators.merge_iterator uses mini_lsm.iterators, so a change to mini_lsm.iterators can break mini_lsm_mvcc.iterators.merge_iterator, while a change to mini_lsm_mvcc.iterators.merge_iterator can't break mini_lsm.iterators.
Position
Below the diagonal: mini_lsm_mvcc.iterators.merge_iterator uses a module listed above it, which is the healthy direction.
mini_lsm_mvcc.iterators.merge_iterator uses mini_lsm.iterators.merge_iterator, so a change to mini_lsm.iterators.merge_iterator can break mini_lsm_mvcc.iterators.merge_iterator, while a change to mini_lsm_mvcc.iterators.merge_iterator can't break mini_lsm.iterators.merge_iterator.
Position
Below the diagonal: mini_lsm_mvcc.iterators.merge_iterator uses a module listed above it, which is the healthy direction.
mini_lsm_mvcc.mvcc.txn uses mini_lsm.iterators, so a change to mini_lsm.iterators can break mini_lsm_mvcc.mvcc.txn, while a change to mini_lsm_mvcc.mvcc.txn can't break mini_lsm.iterators.
Position
Below the diagonal: mini_lsm_mvcc.mvcc.txn uses a module listed above it, which is the healthy direction.
mini_lsm_mvcc.mvcc.txn uses mini_lsm.iterators.two_merge_iterator, so a change to mini_lsm.iterators.two_merge_iterator can break mini_lsm_mvcc.mvcc.txn, while a change to mini_lsm_mvcc.mvcc.txn can't break mini_lsm.iterators.two_merge_iterator.
Position
Below the diagonal: mini_lsm_mvcc.mvcc.txn uses a module listed above it, which is the healthy direction.
14→24 mini_lsm_mvcc.mvcc.txn uses mini_lsm.lsm_storagepart of a loop✕
Connections
1 pair of types, where a type in mini_lsm_mvcc.mvcc.txn uses a type in mini_lsm.lsm_storage.
mini_lsm_mvcc.mvcc.txn uses mini_lsm.lsm_storage, so a change to mini_lsm.lsm_storage can break mini_lsm_mvcc.mvcc.txn, while a change to mini_lsm_mvcc.mvcc.txn can't break mini_lsm.lsm_storage.
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.
mini_lsm_mvcc.table uses mini_lsm.table.bloom, so a change to mini_lsm.table.bloom can break mini_lsm_mvcc.table, while a change to mini_lsm_mvcc.table can't break mini_lsm.table.bloom.
Position
Below the diagonal: mini_lsm_mvcc.table uses a module listed above it, which is the healthy direction.
mini_lsm_mvcc.table uses mini_lsm.table, so a change to mini_lsm.table can break mini_lsm_mvcc.table, while a change to mini_lsm_mvcc.table can't break mini_lsm.table.
Position
Below the diagonal: mini_lsm_mvcc.table uses a module listed above it, which is the healthy direction.
mini_lsm_mvcc.table.builder uses mini_lsm.block.builder, so a change to mini_lsm.block.builder can break mini_lsm_mvcc.table.builder, while a change to mini_lsm_mvcc.table.builder can't break mini_lsm.block.builder.
Position
Below the diagonal: mini_lsm_mvcc.table.builder uses a module listed above it, which is the healthy direction.
mini_lsm_mvcc.table.builder uses mini_lsm.table, so a change to mini_lsm.table can break mini_lsm_mvcc.table.builder, while a change to mini_lsm_mvcc.table.builder can't break mini_lsm.table.
Position
Below the diagonal: mini_lsm_mvcc.table.builder uses a module listed above it, which is the healthy direction.
mini_lsm_mvcc.table.iterator uses mini_lsm.iterators, so a change to mini_lsm.iterators can break mini_lsm_mvcc.table.iterator, while a change to mini_lsm_mvcc.table.iterator can't break mini_lsm.iterators.
Position
Below the diagonal: mini_lsm_mvcc.table.iterator uses a module listed above it, which is the healthy direction.
mini_lsm_mvcc.table.iterator uses mini_lsm.block.iterator, so a change to mini_lsm.block.iterator can break mini_lsm_mvcc.table.iterator, while a change to mini_lsm_mvcc.table.iterator can't break mini_lsm.block.iterator.
Position
Below the diagonal: mini_lsm_mvcc.table.iterator uses a module listed above it, which is the healthy direction.
mini_lsm_mvcc.table.iterator uses mini_lsm.table, so a change to mini_lsm.table can break mini_lsm_mvcc.table.iterator, while a change to mini_lsm_mvcc.table.iterator can't break mini_lsm.table.
Position
Below the diagonal: mini_lsm_mvcc.table.iterator uses a module listed above it, which is the healthy direction.
mini_lsm_starter.table.iterator uses mini_lsm.iterators, so a change to mini_lsm.iterators can break mini_lsm_starter.table.iterator, while a change to mini_lsm_starter.table.iterator can't break mini_lsm.iterators.
Position
Below the diagonal: mini_lsm_starter.table.iterator uses a module listed above it, which is the healthy direction.
mini_lsm_starter.table.iterator uses mini_lsm.block.iterator, so a change to mini_lsm.block.iterator can break mini_lsm_starter.table.iterator, while a change to mini_lsm_starter.table.iterator can't break mini_lsm.block.iterator.
Position
Below the diagonal: mini_lsm_starter.table.iterator uses a module listed above it, which is the healthy direction.
mini_lsm_starter.table.iterator uses mini_lsm.table, so a change to mini_lsm.table can break mini_lsm_starter.table.iterator, while a change to mini_lsm_starter.table.iterator can't break mini_lsm.table.
Position
Below the diagonal: mini_lsm_starter.table.iterator uses a module listed above it, which is the healthy direction.
mini_lsm.iterators.concat_iterator uses mini_lsm.iterators, so a change to mini_lsm.iterators can break mini_lsm.iterators.concat_iterator, while a change to mini_lsm.iterators.concat_iterator can't break mini_lsm.iterators.
Position
Below the diagonal: mini_lsm.iterators.concat_iterator uses a module listed above it, which is the healthy direction.
mini_lsm.iterators.concat_iterator uses mini_lsm.table, so a change to mini_lsm.table can break mini_lsm.iterators.concat_iterator, while a change to mini_lsm.iterators.concat_iterator can't break mini_lsm.table.
Position
Below the diagonal: mini_lsm.iterators.concat_iterator uses a module listed above it, which is the healthy direction.
mini_lsm.iterators.concat_iterator uses mini_lsm.table.iterator, so a change to mini_lsm.table.iterator can break mini_lsm.iterators.concat_iterator, while a change to mini_lsm.iterators.concat_iterator can't break mini_lsm.table.iterator.
Position
Below the diagonal: mini_lsm.iterators.concat_iterator uses a module listed above it, which is the healthy direction.
mini_lsm.mem_table uses mini_lsm.iterators, so a change to mini_lsm.iterators can break mini_lsm.mem_table, while a change to mini_lsm.mem_table can't break mini_lsm.iterators.
Position
Below the diagonal: mini_lsm.mem_table uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in mini_lsm.mem_table uses a type in mini_lsm.wal.
The types involved
mini_lsm.mem_table.MemTable → mini_lsm.wal.Wal
Direction
mini_lsm.mem_table uses mini_lsm.wal, so a change to mini_lsm.wal can break mini_lsm.mem_table, while a change to mini_lsm.mem_table can't break mini_lsm.wal.
Position
Below the diagonal: mini_lsm.mem_table uses a module listed above it, which is the healthy direction.
mini_lsm.mem_table uses mini_lsm.table.builder, so a change to mini_lsm.table.builder can break mini_lsm.mem_table, while a change to mini_lsm.mem_table can't break mini_lsm.table.builder.
Position
Below the diagonal: mini_lsm.mem_table uses a module listed above it, which is the healthy direction.
mini_lsm_mvcc.iterators.concat_iterator uses mini_lsm.iterators, so a change to mini_lsm.iterators can break mini_lsm_mvcc.iterators.concat_iterator, while a change to mini_lsm_mvcc.iterators.concat_iterator can't break mini_lsm.iterators.
Position
Below the diagonal: mini_lsm_mvcc.iterators.concat_iterator uses a module listed above it, which is the healthy direction.
mini_lsm_mvcc.iterators.concat_iterator uses mini_lsm.table, so a change to mini_lsm.table can break mini_lsm_mvcc.iterators.concat_iterator, while a change to mini_lsm_mvcc.iterators.concat_iterator can't break mini_lsm.table.
Position
Below the diagonal: mini_lsm_mvcc.iterators.concat_iterator uses a module listed above it, which is the healthy direction.
mini_lsm_mvcc.iterators.concat_iterator uses mini_lsm.table.iterator, so a change to mini_lsm.table.iterator can break mini_lsm_mvcc.iterators.concat_iterator, while a change to mini_lsm_mvcc.iterators.concat_iterator can't break mini_lsm.table.iterator.
Position
Below the diagonal: mini_lsm_mvcc.iterators.concat_iterator uses a module listed above it, which is the healthy direction.
mini_lsm_mvcc.mvcc uses mini_lsm_mvcc.mvcc.txn, so a change to mini_lsm_mvcc.mvcc.txn can break mini_lsm_mvcc.mvcc, while a change to mini_lsm_mvcc.mvcc can't break mini_lsm_mvcc.mvcc.txn.
Position
Below the diagonal: mini_lsm_mvcc.mvcc uses a module listed above it, which is the healthy direction.
22→24 mini_lsm_mvcc.mvcc uses mini_lsm.lsm_storagepart of a loop✕
Connections
1 pair of types, where a type in mini_lsm_mvcc.mvcc uses a type in mini_lsm.lsm_storage.
mini_lsm_mvcc.mvcc uses mini_lsm.lsm_storage, so a change to mini_lsm.lsm_storage can break mini_lsm_mvcc.mvcc, while a change to mini_lsm_mvcc.mvcc can't break mini_lsm.lsm_storage.
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.
mini_lsm_starter.iterators.concat_iterator uses mini_lsm.iterators, so a change to mini_lsm.iterators can break mini_lsm_starter.iterators.concat_iterator, while a change to mini_lsm_starter.iterators.concat_iterator can't break mini_lsm.iterators.
Position
Below the diagonal: mini_lsm_starter.iterators.concat_iterator uses a module listed above it, which is the healthy direction.
mini_lsm_starter.iterators.concat_iterator uses mini_lsm.table, so a change to mini_lsm.table can break mini_lsm_starter.iterators.concat_iterator, while a change to mini_lsm_starter.iterators.concat_iterator can't break mini_lsm.table.
Position
Below the diagonal: mini_lsm_starter.iterators.concat_iterator uses a module listed above it, which is the healthy direction.
mini_lsm_starter.iterators.concat_iterator uses mini_lsm.table.iterator, so a change to mini_lsm.table.iterator can break mini_lsm_starter.iterators.concat_iterator, while a change to mini_lsm_starter.iterators.concat_iterator can't break mini_lsm.table.iterator.
Position
Below the diagonal: mini_lsm_starter.iterators.concat_iterator uses a module listed above it, which is the healthy direction.
mini_lsm.lsm_storage uses mini_lsm.manifest, so a change to mini_lsm.manifest can break mini_lsm.lsm_storage, while a change to mini_lsm.lsm_storage can't break mini_lsm.manifest.
Position
Below the diagonal: mini_lsm.lsm_storage uses a module listed above it, which is the healthy direction.
mini_lsm.lsm_storage uses mini_lsm.mem_table, so a change to mini_lsm.mem_table can break mini_lsm.lsm_storage, while a change to mini_lsm.lsm_storage can't break mini_lsm.mem_table.
Position
Below the diagonal: mini_lsm.lsm_storage uses a module listed above it, which is the healthy direction.
mini_lsm.lsm_storage uses mini_lsm_mvcc.mvcc, so a change to mini_lsm_mvcc.mvcc can break mini_lsm.lsm_storage, while a change to mini_lsm.lsm_storage can't break mini_lsm_mvcc.mvcc.
Position
Below the diagonal: mini_lsm.lsm_storage uses a module listed above it, which is the healthy direction.
24→27 mini_lsm.lsm_storage uses mini_lsm.compactpart of a loop✕
Connections
3 pairs of types, where a type in mini_lsm.lsm_storage uses a type in mini_lsm.compact.
mini_lsm.lsm_storage uses mini_lsm.compact, so a change to mini_lsm.compact can break mini_lsm.lsm_storage, while a change to mini_lsm.lsm_storage can't break mini_lsm.compact.
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.
mini_lsm_mvcc.mem_table uses mini_lsm.iterators, so a change to mini_lsm.iterators can break mini_lsm_mvcc.mem_table, while a change to mini_lsm_mvcc.mem_table can't break mini_lsm.iterators.
Position
Below the diagonal: mini_lsm_mvcc.mem_table uses a module listed above it, which is the healthy direction.
mini_lsm_mvcc.mem_table uses mini_lsm.wal, so a change to mini_lsm.wal can break mini_lsm_mvcc.mem_table, while a change to mini_lsm_mvcc.mem_table can't break mini_lsm.wal.
Position
Below the diagonal: mini_lsm_mvcc.mem_table uses a module listed above it, which is the healthy direction.
mini_lsm_mvcc.mem_table uses mini_lsm.table.builder, so a change to mini_lsm.table.builder can break mini_lsm_mvcc.mem_table, while a change to mini_lsm_mvcc.mem_table can't break mini_lsm.table.builder.
Position
Below the diagonal: mini_lsm_mvcc.mem_table uses a module listed above it, which is the healthy direction.
mini_lsm_mvcc.mem_table uses mini_lsm.mem_table, so a change to mini_lsm.mem_table can break mini_lsm_mvcc.mem_table, while a change to mini_lsm_mvcc.mem_table can't break mini_lsm.mem_table.
Position
Below the diagonal: mini_lsm_mvcc.mem_table uses a module listed above it, which is the healthy direction.
mini_lsm_starter.mem_table uses mini_lsm.iterators, so a change to mini_lsm.iterators can break mini_lsm_starter.mem_table, while a change to mini_lsm_starter.mem_table can't break mini_lsm.iterators.
Position
Below the diagonal: mini_lsm_starter.mem_table uses a module listed above it, which is the healthy direction.
mini_lsm_starter.mem_table uses mini_lsm.wal, so a change to mini_lsm.wal can break mini_lsm_starter.mem_table, while a change to mini_lsm_starter.mem_table can't break mini_lsm.wal.
Position
Below the diagonal: mini_lsm_starter.mem_table uses a module listed above it, which is the healthy direction.
mini_lsm_starter.mem_table uses mini_lsm.table.builder, so a change to mini_lsm.table.builder can break mini_lsm_starter.mem_table, while a change to mini_lsm_starter.mem_table can't break mini_lsm.table.builder.
Position
Below the diagonal: mini_lsm_starter.mem_table uses a module listed above it, which is the healthy direction.
mini_lsm_starter.mem_table uses mini_lsm.mem_table, so a change to mini_lsm.mem_table can break mini_lsm_starter.mem_table, while a change to mini_lsm_starter.mem_table can't break mini_lsm.mem_table.
Position
Below the diagonal: mini_lsm_starter.mem_table uses a module listed above it, which is the healthy direction.
mini_lsm.compact uses mini_lsm.lsm_storage, so a change to mini_lsm.lsm_storage can break mini_lsm.compact, while a change to mini_lsm.compact can't break mini_lsm.lsm_storage.
Position
Below the diagonal: mini_lsm.compact uses a module listed above it, which is the healthy direction.
mini_lsm.compact.leveled uses mini_lsm.lsm_storage, so a change to mini_lsm.lsm_storage can break mini_lsm.compact.leveled, while a change to mini_lsm.compact.leveled can't break mini_lsm.lsm_storage.
Position
Below the diagonal: mini_lsm.compact.leveled uses a module listed above it, which is the healthy direction.
mini_lsm.compact.simple_leveled uses mini_lsm.lsm_storage, so a change to mini_lsm.lsm_storage can break mini_lsm.compact.simple_leveled, while a change to mini_lsm.compact.simple_leveled can't break mini_lsm.lsm_storage.
Position
Below the diagonal: mini_lsm.compact.simple_leveled uses a module listed above it, which is the healthy direction.
mini_lsm.compact.tiered uses mini_lsm.lsm_storage, so a change to mini_lsm.lsm_storage can break mini_lsm.compact.tiered, while a change to mini_lsm.compact.tiered can't break mini_lsm.lsm_storage.
Position
Below the diagonal: mini_lsm.compact.tiered uses a module listed above it, which is the healthy direction.
mini_lsm_starter.mvcc.txn uses mini_lsm.iterators, so a change to mini_lsm.iterators can break mini_lsm_starter.mvcc.txn, while a change to mini_lsm_starter.mvcc.txn can't break mini_lsm.iterators.
Position
Below the diagonal: mini_lsm_starter.mvcc.txn uses a module listed above it, which is the healthy direction.
mini_lsm_starter.mvcc.txn uses mini_lsm.iterators.two_merge_iterator, so a change to mini_lsm.iterators.two_merge_iterator can break mini_lsm_starter.mvcc.txn, while a change to mini_lsm_starter.mvcc.txn can't break mini_lsm.iterators.two_merge_iterator.
Position
Below the diagonal: mini_lsm_starter.mvcc.txn uses a module listed above it, which is the healthy direction.
mini_lsm_starter.mvcc.txn uses mini_lsm_mvcc.mvcc.txn, so a change to mini_lsm_mvcc.mvcc.txn can break mini_lsm_starter.mvcc.txn, while a change to mini_lsm_starter.mvcc.txn can't break mini_lsm_mvcc.mvcc.txn.
Position
Below the diagonal: mini_lsm_starter.mvcc.txn uses a module listed above it, which is the healthy direction.
mini_lsm_starter.mvcc.txn uses mini_lsm.lsm_storage, so a change to mini_lsm.lsm_storage can break mini_lsm_starter.mvcc.txn, while a change to mini_lsm_starter.mvcc.txn can't break mini_lsm.lsm_storage.
Position
Below the diagonal: mini_lsm_starter.mvcc.txn uses a module listed above it, which is the healthy direction.
mini_lsm_mvcc.compact uses mini_lsm.lsm_storage, so a change to mini_lsm.lsm_storage can break mini_lsm_mvcc.compact, while a change to mini_lsm_mvcc.compact can't break mini_lsm.lsm_storage.
Position
Below the diagonal: mini_lsm_mvcc.compact uses a module listed above it, which is the healthy direction.
mini_lsm_mvcc.compact uses mini_lsm.compact, so a change to mini_lsm.compact can break mini_lsm_mvcc.compact, while a change to mini_lsm_mvcc.compact can't break mini_lsm.compact.
Position
Below the diagonal: mini_lsm_mvcc.compact uses a module listed above it, which is the healthy direction.
mini_lsm_mvcc.compact.leveled uses mini_lsm.lsm_storage, so a change to mini_lsm.lsm_storage can break mini_lsm_mvcc.compact.leveled, while a change to mini_lsm_mvcc.compact.leveled can't break mini_lsm.lsm_storage.
Position
Below the diagonal: mini_lsm_mvcc.compact.leveled uses a module listed above it, which is the healthy direction.
mini_lsm_mvcc.compact.leveled uses mini_lsm.compact.leveled, so a change to mini_lsm.compact.leveled can break mini_lsm_mvcc.compact.leveled, while a change to mini_lsm_mvcc.compact.leveled can't break mini_lsm.compact.leveled.
Position
Below the diagonal: mini_lsm_mvcc.compact.leveled uses a module listed above it, which is the healthy direction.
mini_lsm_mvcc.compact.simple_leveled uses mini_lsm.lsm_storage, so a change to mini_lsm.lsm_storage can break mini_lsm_mvcc.compact.simple_leveled, while a change to mini_lsm_mvcc.compact.simple_leveled can't break mini_lsm.lsm_storage.
Position
Below the diagonal: mini_lsm_mvcc.compact.simple_leveled uses a module listed above it, which is the healthy direction.
mini_lsm_mvcc.compact.simple_leveled uses mini_lsm.compact.simple_leveled, so a change to mini_lsm.compact.simple_leveled can break mini_lsm_mvcc.compact.simple_leveled, while a change to mini_lsm_mvcc.compact.simple_leveled can't break mini_lsm.compact.simple_leveled.
Position
Below the diagonal: mini_lsm_mvcc.compact.simple_leveled uses a module listed above it, which is the healthy direction.
mini_lsm_mvcc.compact.tiered uses mini_lsm.lsm_storage, so a change to mini_lsm.lsm_storage can break mini_lsm_mvcc.compact.tiered, while a change to mini_lsm_mvcc.compact.tiered can't break mini_lsm.lsm_storage.
Position
Below the diagonal: mini_lsm_mvcc.compact.tiered uses a module listed above it, which is the healthy direction.
mini_lsm_mvcc.compact.tiered uses mini_lsm.compact.tiered, so a change to mini_lsm.compact.tiered can break mini_lsm_mvcc.compact.tiered, while a change to mini_lsm_mvcc.compact.tiered can't break mini_lsm.compact.tiered.
Position
Below the diagonal: mini_lsm_mvcc.compact.tiered uses a module listed above it, which is the healthy direction.
mini_lsm_mvcc.lsm_storage uses mini_lsm.manifest, so a change to mini_lsm.manifest can break mini_lsm_mvcc.lsm_storage, while a change to mini_lsm_mvcc.lsm_storage can't break mini_lsm.manifest.
Position
Below the diagonal: mini_lsm_mvcc.lsm_storage uses a module listed above it, which is the healthy direction.
mini_lsm_mvcc.lsm_storage uses mini_lsm.mem_table, so a change to mini_lsm.mem_table can break mini_lsm_mvcc.lsm_storage, while a change to mini_lsm_mvcc.lsm_storage can't break mini_lsm.mem_table.
Position
Below the diagonal: mini_lsm_mvcc.lsm_storage uses a module listed above it, which is the healthy direction.
mini_lsm_mvcc.lsm_storage uses mini_lsm_mvcc.mvcc, so a change to mini_lsm_mvcc.mvcc can break mini_lsm_mvcc.lsm_storage, while a change to mini_lsm_mvcc.lsm_storage can't break mini_lsm_mvcc.mvcc.
Position
Below the diagonal: mini_lsm_mvcc.lsm_storage uses a module listed above it, which is the healthy direction.
mini_lsm_mvcc.lsm_storage uses mini_lsm.lsm_storage, so a change to mini_lsm.lsm_storage can break mini_lsm_mvcc.lsm_storage, while a change to mini_lsm_mvcc.lsm_storage can't break mini_lsm.lsm_storage.
Position
Below the diagonal: mini_lsm_mvcc.lsm_storage uses a module listed above it, which is the healthy direction.
mini_lsm_mvcc.lsm_storage uses mini_lsm.compact, so a change to mini_lsm.compact can break mini_lsm_mvcc.lsm_storage, while a change to mini_lsm_mvcc.lsm_storage can't break mini_lsm.compact.
Position
Below the diagonal: mini_lsm_mvcc.lsm_storage uses a module listed above it, which is the healthy direction.
mini_lsm_starter.compact uses mini_lsm.lsm_storage, so a change to mini_lsm.lsm_storage can break mini_lsm_starter.compact, while a change to mini_lsm_starter.compact can't break mini_lsm.lsm_storage.
Position
Below the diagonal: mini_lsm_starter.compact uses a module listed above it, which is the healthy direction.
mini_lsm_starter.compact uses mini_lsm.compact, so a change to mini_lsm.compact can break mini_lsm_starter.compact, while a change to mini_lsm_starter.compact can't break mini_lsm.compact.
Position
Below the diagonal: mini_lsm_starter.compact uses a module listed above it, which is the healthy direction.
mini_lsm_starter.compact.leveled uses mini_lsm.lsm_storage, so a change to mini_lsm.lsm_storage can break mini_lsm_starter.compact.leveled, while a change to mini_lsm_starter.compact.leveled can't break mini_lsm.lsm_storage.
Position
Below the diagonal: mini_lsm_starter.compact.leveled uses a module listed above it, which is the healthy direction.
mini_lsm_starter.compact.leveled uses mini_lsm.compact.leveled, so a change to mini_lsm.compact.leveled can break mini_lsm_starter.compact.leveled, while a change to mini_lsm_starter.compact.leveled can't break mini_lsm.compact.leveled.
Position
Below the diagonal: mini_lsm_starter.compact.leveled uses a module listed above it, which is the healthy direction.
mini_lsm_starter.compact.simple_leveled uses mini_lsm.lsm_storage, so a change to mini_lsm.lsm_storage can break mini_lsm_starter.compact.simple_leveled, while a change to mini_lsm_starter.compact.simple_leveled can't break mini_lsm.lsm_storage.
Position
Below the diagonal: mini_lsm_starter.compact.simple_leveled uses a module listed above it, which is the healthy direction.
mini_lsm_starter.compact.simple_leveled uses mini_lsm.compact.simple_leveled, so a change to mini_lsm.compact.simple_leveled can break mini_lsm_starter.compact.simple_leveled, while a change to mini_lsm_starter.compact.simple_leveled can't break mini_lsm.compact.simple_leveled.
Position
Below the diagonal: mini_lsm_starter.compact.simple_leveled uses a module listed above it, which is the healthy direction.
mini_lsm_starter.lsm_storage uses mini_lsm.manifest, so a change to mini_lsm.manifest can break mini_lsm_starter.lsm_storage, while a change to mini_lsm_starter.lsm_storage can't break mini_lsm.manifest.
Position
Below the diagonal: mini_lsm_starter.lsm_storage uses a module listed above it, which is the healthy direction.
mini_lsm_starter.lsm_storage uses mini_lsm.mem_table, so a change to mini_lsm.mem_table can break mini_lsm_starter.lsm_storage, while a change to mini_lsm_starter.lsm_storage can't break mini_lsm.mem_table.
Position
Below the diagonal: mini_lsm_starter.lsm_storage uses a module listed above it, which is the healthy direction.
mini_lsm_starter.lsm_storage uses mini_lsm_mvcc.mvcc, so a change to mini_lsm_mvcc.mvcc can break mini_lsm_starter.lsm_storage, while a change to mini_lsm_starter.lsm_storage can't break mini_lsm_mvcc.mvcc.
Position
Below the diagonal: mini_lsm_starter.lsm_storage uses a module listed above it, which is the healthy direction.
mini_lsm_starter.lsm_storage uses mini_lsm.lsm_storage, so a change to mini_lsm.lsm_storage can break mini_lsm_starter.lsm_storage, while a change to mini_lsm_starter.lsm_storage can't break mini_lsm.lsm_storage.
Position
Below the diagonal: mini_lsm_starter.lsm_storage uses a module listed above it, which is the healthy direction.
mini_lsm_starter.lsm_storage uses mini_lsm.compact, so a change to mini_lsm.compact can break mini_lsm_starter.lsm_storage, while a change to mini_lsm_starter.lsm_storage can't break mini_lsm.compact.
Position
Below the diagonal: mini_lsm_starter.lsm_storage uses a module listed above it, which is the healthy direction.
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
11
High / Critical
A03:2025 — Software Supply Chain Failures
7
Medium
Roadmap
First, implement user-facing diagnostic logging to capture error details for reproducible bug reports, and integrate automated security scanning into the CI pipeline to prevent regressions. Next, establish a structured repository for architecture decision records to document key design choices and their consequences. Finally, enforce a mandatory approval gate for all releases to ensure human oversight before deployment.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Resolve the 1 No ADRs found finding(s) in ADR Quality.
Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag. Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.
Add a SAST step to CI running what this repository's stack ships: cargo-audit / cargo-deny (or clippy) — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.
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.
Make sure a person approves each release. The release job names an environment, but its approval rules live in the code host's settings, where Watchdog can't see them. Check that a reviewer must approve each release, or publish releases as drafts first, so a bad build can be stopped before anyone downloads it.
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 — 10
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 — 162
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 — 25
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 22
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. 48 of 48 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); none rely on LLM judgement. 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 — 48 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, 175 of 197 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.
D8 Code Coverage — 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. Coverage NOT MEASURED: test source is present (.rs) but the built-in coverage collector has no runner for this repository's ecosystem — so this suite was never executed by it. Not scored — this is a gap in the analyzer's language coverage, not a defect in the repo. To have real coverage read, produce a coverage report in a standard format (lcov — `cargo install cargo-llvm-cov`, then `cargo llvm-cov --lcov --output-path lcov.info`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures. You can widen what we reach: optional: produce a coverage report in a standard format (lcov — `cargo install cargo-llvm-cov`, then `cargo llvm-cov --lcov --output-path lcov.info`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures — then the real number is read on the next scan.
D19 Documentation Quality — 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. Each ecosystem's manifests (what makes a folder runnable or a published package) need their own proof before D19 judges its units. Until then those folders' READMEs are judged only as documents (boilerplate, structure), never counted as complete.
D21 Naming Consistency — 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. D21's deterministic naming rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. Until then its declarations carry no naming verdict this run — this says nothing about whether its names are consistent.
D22 Internal API Consistency — 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. D22's deterministic call-shape rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. This says nothing about whether that surface is consistent.
D24 Comment Value — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
D27 Navigability — 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. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
AX6 Interface segregation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is computed over the public interfaces this run's compilations declare, and none was loaded, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
AXB1 Runtime evidence locked — no reproducible boot — 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. Subject: 1 markup document(s) — HTML, Razor, JSX, Vue, Svelte or server templates. The Runtime Evidence tier boots an app only via docker-compose, an Aspire AppHost, a Dockerfile, an npm dev script, a web service's own toolchain entry point (cargo, go, dotnet, Python, Spring Boot), or an Android app's own Gradle wrapper (run on an emulator); an Apple or Flutter app needs a host it lacks. None applied, so no live runtime a11y/egress/header evidence was collected. You can widen what we reach: add a docker-compose.yml (or an Aspire AppHost) that brings the app up with its dependencies. Watchdog then boots it in an isolated sandbox and gathers real runtime evidence — you change nothing in your pipeline (no CI step, no SDK).
GD1 Unfinished & placeholder code — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby and Scala source only, and no C#, F#, JavaScript/TypeScript, Dart, Ruby or Scala was found, and this repository's Rust is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
IC1 Incompleteness & stubs — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby and Scala source only, and no C#, JavaScript/TypeScript, Java, Dart, Ruby or Scala was found, and this repository's Rust is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
M4 Documentation accuracy — 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. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
P1 CI/CD gates — 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. A CI pipeline exists and the word "test" appears, but no explicit test-runner invocation (your stack's test command, or a test job) was matched — so either the gate runs tests through a step this pass could not recognise, or "test" is incidental here (a path, "latest", a reporter). Which of the two it is cannot be settled from this dimension's evidence; the coverage dimensions report whether a suite exists at all. You can widen what we reach: name the test runner explicitly in the pipeline step (your stack's test command, or a job named for the suite) so the gate is unambiguous to a reader and to this pass.
P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
X12 Unreachable branch — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Python, Dart, Ruby, Scala and Kotlin source only, and no C# was loaded and no JavaScript/TypeScript, Python, Dart, Ruby, Scala or Kotlin was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X13 Undrained process stream — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Python, Dart, Ruby, Scala and Kotlin source only, and no C# was loaded and no JavaScript/TypeScript, Python, Dart, Ruby, Scala or Kotlin was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X16 Unfloored truncation loop — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, PHP, Dart, Ruby, Scala and Kotlin source only, and no C# was loaded and no JavaScript/TypeScript, Java, PHP, Dart, Ruby, Scala or Kotlin was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X17 Uncapped recursion over a caller-supplied document — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Python, Dart, Ruby, Scala and Kotlin source only, and no C# was loaded and no JavaScript/TypeScript, Python, Dart, Ruby, Scala or Kotlin was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X18 Disposal-pattern correctness — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Kotlin, Dart, Ruby, Scala and PHP source only, and no C# was loaded and no JavaScript/TypeScript, Java, Kotlin, Dart, Ruby, Scala or PHP was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X19 Unrestored process-global state — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Kotlin, Python, Dart, Ruby, Scala and PHP source only, and no C# was loaded and no JavaScript/TypeScript, Java, Kotlin, Python, Dart, Ruby, Scala or PHP was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X22 Contradicted release guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and Java, TypeScript/JavaScript, Python, Dart, Ruby, Scala, Kotlin and PHP source only, and no C# was loaded, and this repository's Rust is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X23 Unguarded diagnostic materialisation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, F#, Python, Dart, Ruby, Scala, Kotlin and PHP source only, and no C# was loaded and no JavaScript/TypeScript, Java, F#, Python, Dart, Ruby, Scala, Kotlin or PHP was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X24 Document value interpolated into markup unescaped — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Scala, Ruby and Python source only, and no C# was loaded and no JavaScript/TypeScript, Java, Scala, Ruby or Python was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X25 Inert configuration knob — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Kotlin, Scala, PHP, Erlang, Python, Dart and Ruby source only, and no C# was loaded and no JavaScript/TypeScript, Java, Kotlin, Scala, PHP, Erlang, Python, Dart or Ruby was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X3 Exception handling — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and PHP, Java, Kotlin, Python, Ruby, Scala, Dart, Swift, Erlang, Go and JavaScript/TypeScript source only, and no C# was loaded and no PHP, Java, Kotlin, Python, Ruby, Scala, Dart, Swift, Erlang, Go, JavaScript or TypeScript was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X5 Nullable reference types — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax and MSBuild project configuration, TypeScript source and its tsconfig files, Java source and its package and module declarations, PHP source and its PHPStan and Psalm configuration, Dart source and its pubspec language version, Ruby source and its Sorbet and Steep configuration, Scala source and its build's explicit-nulls, WartRemover and Scalafix settings, and Kotlin source only, and no C# was loaded, no TypeScript was found, and this repository's Rust is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.
Limitations & what we did not check
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.
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.
D11 Test Reliability: Flakiness is inferred from history/markers — Watchdog runs the suite once (for coverage), not the repeated runs under varied conditions that reveal nondeterminism, so a flaky test never recorded as failing is invisible here.
D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
D20 ADR Quality: ADR quality 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.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a Dockerfile (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
AX9 CQS / query purity: Handlers are found by interface/name convention — a query handler using neither is not seen. Mutation is a resolved write/publish invocation (SaveChanges/repository/bus), so a write hidden behind a hand-rolled wrapper, reflection, or a string-keyed service locator resolves to a non-persistence type and isn't flagged; it detects that a query writes state, not whether the write is a legitimate read-side cache update. Clean means "no resolved write/publish in a query body", not a proof of CQS purity.
M4 Documentation accuracy: 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.
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.
Bring the 5 bodies over 15 down to 15 or less in Cyclomatic Complexity — start with mini_lsm_starter::bin::compaction-simulator::main (cyclomatic 38), LsmStorageInner::open (cyclomatic 17), LsmStorageInner::open (cyclomatic 17). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 5 together lifts Cyclomatic Complexity from 8.6 to about 10.0/10, projected with the scoring formula itself and assuming each lands exactly at 15.
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.
Bring the 1 body over 60 down to 60 or less in Cognitive Complexity — start with mini_lsm_starter::bin::compaction-simulator::main (cognitive 113). — Refactoring it lifts Cognitive Complexity from 6.8 to about 7.5/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 Classes9.1 / 10Stronggated by 8 serious findings✓ 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 3 FileTooLong finding(s) in God Classes — start with lsm_storage.rs (2), compaction-simulator.rs. — One of this dimension's main actionable groups (3 warning-level).
Resolve the 2 MethodTooLong finding(s) in God Classes — start with lsm_storage.rs (2). — One of this dimension's main actionable groups (2 warning-level).
Resolve the 1 FunctionTooLong finding(s) in God Classes — start with compaction-simulator.rs. — 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.
119 duplicated block group(s) detected. A further 4 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted.
+ 54 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 11 Duplicated block (9 lines × 2) finding(s) in Code Duplication — start with iterator.rs (4), two_merge_iterator.rs (2), builder.rs (2). — One of this dimension's main actionable groups (11 warning-level).
Resolve the 7 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with mem_table.rs (3), manifest.rs, wal.rs. — One of this dimension's main actionable groups (7 warning-level).
Resolve the 6 Duplicated block (6 lines × 2) finding(s) in Code Duplication — start with table.rs (2), iterator.rs (2), two_merge_iterator.rs. — One of this dimension's main actionable groups (6 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.
4 production modules (Cargo), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; 0 module(s) off the main sequence.
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.
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.
171 test methods: 171 unit, 0 integration, 0 BDD, 0 e2e. The Rust suite contributes 171 `#[test]` function(s) across 37 file(s) declaring at least one; its unit/integration split is Cargo's own — 0 of those file(s) are integration-test targets under a crate's tests/ directory, and the rest are #[test] functions compiled into the crate they test.
✓ On the Gold path — maintain.
Detailed fixes: d9_recommendation.md.
Do you agree with this assessment?
D11 · Test Reliability10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the tests pass reliably, with no flakiness.
Method: Suite re-run N times within tiered wall-clock budgets (unit to e2e); tests failing non-deterministically across runs flagged; guarded tests retried when #if guards detected.
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.
10 outdated, 0 yanked direct Cargo dependencies. Only DIRECT edges are graded: a transitive crate cannot be moved past what its parent's requirement admits, so reporting one would be advice its owner cannot take. A newer release is reported only where this repository's OWN requirement already admits it, so the remedy is `cargo update` and never a manifest edit — which means a release outside the declared range is deliberately NOT charged, because a written-down constraint is a decision rather than a defect. Note that a bare requirement is a CARET, and for a 0.x crate its ceiling is the minor. Whether any crate is UNMAINTAINED is not graded — crates.io publishes no maintenance status, and release age does not stand in for one. Known CVEs in this dependency graph are D30's question, read from Cargo.lock there.
Outdated: arc-swap · ×10
✓ On the Gold path — maintain.
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 112 shipped crate(s) use a banned license. Licences were resolved from crates.io over the crates a consumer compiles — this repository's Cargo.lock closed over its manifests' `[dependencies]` and `[build-dependencies]`. Crates it asks for ONLY under `[dev-dependencies]` are excluded: they are not compiled by anything that depends on this repository. This repository publishes itself under Apache-2.0, which is its own choice and is not judged here.
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.
Resolve the 1 Hotspot finding(s) in Churn × Complexity Hotspots — start with compact.rs. — One of this dimension's main actionable groups (1 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 Factor8.7 / 10Strong✓ Tool-verified
What it measures: Whether knowledge is concentrated in too few people (the "bus factor").
Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.
7 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is mini-lsm/src/lsm_storage.rs. Counted over 54 of the 81 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Off-boarding risk: anonymized user #1
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).
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.
49 deducted task-comment markers across 14339 LoC (0.3/KLoC) → score 9.4. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.
TodoComment repeated across 22 filesmini-lsm-starter/src/block.rs:15
What to do
Resolve the 5 TodoComment finding(s) in Explicit Debt — start with lsm_storage.rs (3), bloom.rs (2). — One of this dimension's main actionable groups (5 warning-level).
Resolve the 1 TodoComment repeated across 22 files finding(s) in Explicit Debt — start with block.rs. — One of this dimension's main actionable groups (1 warning-level).
Enforce Explicit Debt in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Every README, docs/ document and root guide parsed by its markup and measured in Unicode letters. Published: a runnable or packaged .NET project whose README (or a document it links, or a root guide) shows no example, and a root README naming none of three or more projects. Overview, licence, boilerplate, wall-of-text, empty-section and XML-doc rows are measured and withheld (counted in gaps) after adjudication. Deterministic, exhaustive, advisory.
1 of 1 documentation facets pass in full. 6 document(s) read across 1 unit(s).
✓ On the Gold path — maintain.
Detailed fixes: d19_recommendation.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 any secrets were ever committed — scanned across the full git history, not just now.
Method: Secret scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.
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).
11 finding(s): 0 critical, 10 high, 1 medium, 0 low. 10 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.
REDACTED
REDACTED
What to do
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
No action in Static Analysis (SAST) — all 10 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 (10 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.
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.
Every significant source file has living knowledge — recently and meaningfully worked. Counted over 54 of the 81 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
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.
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.
+ 2 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
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).
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.
What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Scored apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.
Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. SCORED, not informational.
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 2 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 — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.
Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.
Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.
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.
Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.
Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.
Other · Architecture — Whether read (query) handlers stay side-effect-free — a query that writes persistent state or raises events breaks CQS and makes reads unsafe to retry, cache, or route to a read replica.
Method: Roslyn scan: CQRS handlers classified query-vs-command by interface (IQueryHandler/ICommandHandler/IRequestHandler<TQuery,TResult>) and name convention (*Query/Get*/Find* vs *Command); each query handler's body checked for persistent-state writes (SaveChanges/repository Add-Update) or event publishes by resolved invocation. Deterministic, type-level, exhaustive over the detected handlers.
Coverage: Population: CQRS handlers identified by IQueryHandler/ICommandHandler/IRequestHandler interface + *Query/Get*/Find*/*Command NAME convention; query purity then checked exhaustively within that set — a query handler using neither convention is invisible, and mutation is a resolved persistence/publish CALL, not full dataflow.
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
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 a README to the 1 of 4 project(s) that lack one — worth up to 0.5 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 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.
Do you agree with this assessment?
P1 · CI/CD gates8.5 / 10Strong✓ Tool-verified
Readiness · Readiness — Whether an automated pipeline builds and tests every change.
Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.
What to do
Run the test suite in CI via an explicit runner step (`cargo test` for the toolchain this pipeline already uses) and gate merges on it.
Do you agree with this assessment?
P10 · Library API & versioning6.0 / 10Adequate✓ Tool-verified
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.
76/90 types (84%) declared in the published library are public. For a library, every public type is a stability contract — keep implementation types off the surface and expose only the intended API.
What to do
Keep implementation types off the public surface (Rust: `pub(crate)`, or keep the module private) so internals can change without breaking consumers.
Do you agree with this assessment?
P2 · Observability0.0 / 10Critical✓ Tool-verified
Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.
No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page — but when a run fails on a user's machine, neither they nor you have anything to read.
What to do
Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag. Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.
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 cargo-audit / cargo-deny (or clippy) (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 1933 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: cargo-audit / cargo-deny (or clippy) — 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.
What to do
Make sure a person approves each release. The release job names an environment, but its approval rules live in the code host's settings, where Watchdog can't see them. Check that a reviewer must approve each release, or publish releases as drafts first, so a bad build can be stopped before anyone downloads it.
Readiness · Readiness — Whether releases are traceable — a maintained changelog and explicit version stamping.
Method: Filesystem scan: changelog file presence and version tags in csproj or git tags. Exhaustive, deterministic.
No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
What to do
Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.
Other · Security — Read from this repository's Rust source: cryptographic hygiene (weak hash or cipher, key material fixed in the source) and outbound TLS (certificate validation, protocol version) — facts about code that hold whether or not it serves anything itself. Markup this repository SHIPS is scored for third-party script integrity whether or not the repository serves it itself, since a page handed to a consumer runs in that consumer’s origin. The server controls — HTTPS enforcement, HSTS, cookie flags, input validation — are read from a Rust server this repository starts itself, and its production Rust starts none. What serves its HTTP is outside the Rust source, and only what this card names about it was assessed.
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.
`https://eu.umami.is/script.js` is executed by this page with no Subresource Integrity. Whoever can answer that request — the CDN, anyone who compromises it, anyone on the network path — runs arbitrary script in this page's origin, with its session. The URL also names no version, so it resolves to whatever that origin serves at fetch time — the executed bytes can change with nobody touching this repository. — mini-lsm-book/theme/head.hbs:1
What to do
Pin third-party scripts and verify them: name an exact version in the URL and add an `integrity="sha384-…"` hash alongside `crossorigin="anonymous"` (both are required — an integrity hash on a cross-origin script without `crossorigin` is not evaluated, it blocks the script). Where the vendor ships a continuously-updated loader and publishes no stable hash (tag managers, analytics, chat widgets), Subresource Integrity is not available: constrain it instead with a `Content-Security-Policy` that names the exact origins allowed to execute, and drop the script from the pages that do not need it. Where the page is shipped inside a package that others host, prefer vendoring the asset and serving it from the app’s own origin, so no consumer inherits a third-party dependency they did not choose.
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.
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 `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.
Do you agree with this assessment?
X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a `for` loop leaves the `RefCell` it is walking alone — safe Rust rejects a body that changes the collection its loop borrows at compile time, except through interior mutability: a `RefCell` borrowed in the loop's header stays borrowed until the loop ends, so a `borrow_mut()` of it inside the body panics with `already borrowed: BorrowMutError` and the remaining elements are never seen.
Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.
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.
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?
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.
Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Unscored — 1 check(s) recorded observations but carry no score
These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.
X10 Duplicated predicate — 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 — 69 check(s) not relevant to this codebase
These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.
AC1 Text alternatives — Frontend below the scale floor (17 DOM element(s) < 25) — too little surface to assess accessibility.
AC2 Forms & labels — Frontend below the scale floor (17 DOM element(s) < 25) — too little surface to assess accessibility.
AC3 Page structure — Frontend below the scale floor (17 DOM element(s) < 25) — too little surface to assess accessibility.
AC4 Keyboard semantics — Frontend below the scale floor (17 DOM element(s) < 25) — too little surface to assess accessibility.
AC5 ARIA correctness — Frontend below the scale floor (17 DOM element(s) < 25) — too little surface to assess accessibility.
AC6 Visual & motion safety — Frontend below the scale floor (17 DOM element(s) < 25) — too little surface to assess accessibility.
AC7 A11y enforcement — Frontend below the scale floor (17 DOM element(s) < 25) — too little surface to assess accessibility.
AX1 Captive dependencies — Not applicable: Rust with no dependency-injection crate has no container to hand one lifetime's instance to another — every value is owned by the code that builds it, and the borrow checker rejects a longer-lived value keeping a borrow of a shorter-lived one.
AX2 Stateful singletons — Not applicable: Rust's compiler refuses unsynchronised shared mutation — a value shared across threads must be Sync — so the race this check looks for cannot be written.
AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX6 Interface segregation — not assessed — interface segregation is computed over a type surface that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX8 Test isolation — no test/production split to check
AXB1 Runtime evidence locked — no reproducible boot — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
C1 Data Protection — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no data at rest for these controls to protect.
C2 Access Controls — No access-control surface detected in the analyzed source — this repository starts no server another machine can reach (no actix-web HttpServer, axum::serve, Rocket launch, warp::serve, poem or salvo Server, tonic Server::builder, hyper or tiny_http server outside examples and tests, none bound beyond loopback). Access control is therefore N/A here — a crate is authorized by the application that serves it, not by itself. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
C3 Audit Trail — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a store configured outside this repository, for instance), the trail belongs to wherever that data is stored.
C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no personal data whose lifetime a retention limit would bound.
C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no personal data for a data subject to erase, export or consent over.
D10 Test Quality — ~6782 lines of test source are present (.rs) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
D21 Naming Consistency — Naming consistency is measured on C# only; Rust not measured.
D22 Internal API Consistency — API consistency is measured on C# only; the exposed Rust surface was not measured.
D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ projects each declaring an entity of their own. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D24 Comment Value — D24 reads C# and Visual Basic comments only — this repository's production source is .rs, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D25 ADR Conformance — no ADRs to check
D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.rs), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
D32 Data Compliance (PII/GDPR) — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
D8 Code Coverage — Coverage not included — suite not readable by the collector
DM1 Domain Modelling — not scored — this repository shows only 1 of the 3 signals this lens looks for (2 value object(s))
ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and a call made through an inferred or generic receiver has no resolvable owner in the source. Reported as guidance rather than measured
ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby and Scala, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the Rust source, so there is no service whose uptime a failing dependency could take down
P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
P9 Domain vs controller coverage — no coverage report found on disk — produce a coverage report in a standard format (lcov — `cargo install cargo-llvm-cov`, then `cargo llvm-cov --lcov --output-path lcov.info`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for `#[bench]`, criterion's `bench_function`/`bench_with_input`, `#[divan::bench]` or `#[library_benchmark]` in any `.rs` file, or criterion, divan, iai or a `[[bench]]` target in a Cargo.toml, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
PF2 Allocation hygiene — Not applicable: Rust spells out every heap allocation and makes borrowed slices (&[T], &str) its ordinary parameter types, so the allocation-aware style this card rewards elsewhere is the language's baseline rather than a rung to climb.
PF3 Async & latency hygiene — Not applicable: this repository declares no async functions, so there is no asynchronous code for a blocking call to stall.
X12 Unreachable branch — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X13 Undrained process stream — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X16 Unfloored truncation loop — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X17 Uncapped recursion over a caller-supplied document — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X18 Disposal-pattern correctness — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X19 Unrestored process-global state — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X2 Cancellation propagation — no C# was loaded; this repository's Rust was read, and no request in it can be cancelled by a caller — a Rust request takes no token: a future is cancelled by dropping it, from outside the call (select!, a timeout, an aborted task), and reqwest, hyper and tonic take none
X20 Mistyped argument guard — This check asks whether an argument guard reports an EMPTY value as a NULL one, which needs a language that throws a null-specific argument exception — .NET's ArgumentNullException, the JVM's NullPointerException, Dart's ArgumentError.notNull. This repository contains none of those languages: the ones it is written in have a single exception for a bad argument, so there is no pair of exceptions to confuse and nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X22 Contradicted release guard — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X23 Unguarded diagnostic materialisation — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X24 Document value interpolated into markup unescaped — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X25 Inert configuration knob — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X26 Unsynchronised callback handoff — Not applicable: this check looks for a collection written by a callback on one thread while the body waiting on it touches it on another, and in this repository's languages no collection is reachable from two threads at once. Rust's compiler refuses the unsynchronised version: a collection shared between a callback's thread and the waiting body must be `Sync`, which a `Vec`, `VecDeque` or `HashMap` is only behind a `Mutex`/`RwLock`, so the race this check looks for cannot be written in safe Rust. Not a gap in the analyzer and not a finding about your code.
X3 Exception handling — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X4 Structured logging — This check asks whether log calls keep a message's values apart from its text, which needs a logger that can carry them as fields. This repository's Rust was read, and it logs through none: the `log` crate's macros take one finished message (as log4net does in C#; its `kv` values are an opt-in its backends mostly drop), `println!`/`eprintln!` are not loggers, or it makes no log call outside its tests and examples at all. Calls through `tracing` (`tracing::info!`, or `info!` imported from it) would be judged.
X5 Nullable reference types — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X7 Silent fallback defaults — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
Appendix A — Findings (grouped)
The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.
Duplicated block (9 lines × 2) mini-lsm-mvcc/src/block/iterator.rs:100— mini-lsm-mvcc/src/block/iterator.rs:100-108 | mini-lsm/src/block/iterator.rs:99-107 — before extracting anything, compare `mini-lsm-mvcc/src/block/iterator.rs` and `mini-lsm/src/block/iterator.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) mini-lsm-mvcc/src/iterators/concat_iterator.rs:36— mini-lsm-mvcc/src/iterators/concat_iterator.rs:36-44 | mini-lsm/src/iterators/concat_iterator.rs:36-44 — before extracting anything, compare `mini-lsm-mvcc/src/iterators/concat_iterator.rs` and `mini-lsm/src/iterators/concat_iterator.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) mini-lsm-mvcc/src/iterators/two_merge_iterator.rs:95— mini-lsm-mvcc/src/iterators/two_merge_iterator.rs:95-103 | mini-lsm/src/iterators/two_merge_iterator.rs:93-101 — before extracting anything, compare `mini-lsm-mvcc/src/iterators/two_merge_iterator.rs` and `mini-lsm/src/iterators/two_merge_iterator.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) mini-lsm-mvcc/src/table.rs:357— mini-lsm-mvcc/src/table.rs:357-365 | mini-lsm/src/table.rs:335-343 — before extracting anything, compare `mini-lsm-mvcc/src/table.rs` and `mini-lsm/src/table.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 172 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) mini-lsm-mvcc/src/table/builder.rs:87— mini-lsm-mvcc/src/table/builder.rs:87-95 | mini-lsm/src/table/builder.rs:82-90 — before extracting anything, compare `mini-lsm-mvcc/src/table/builder.rs` and `mini-lsm/src/table/builder.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) mini-lsm-mvcc/src/block/builder.rs:118— mini-lsm-mvcc/src/block/builder.rs:118-126 | mini-lsm/src/block/builder.rs:116-124 — before extracting anything, compare `mini-lsm-mvcc/src/block/builder.rs` and `mini-lsm/src/block/builder.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) mini-lsm-mvcc/src/block/iterator.rs:52— mini-lsm-mvcc/src/block/iterator.rs:52-60 | mini-lsm/src/block/iterator.rs:51-59 — before extracting anything, compare `mini-lsm-mvcc/src/block/iterator.rs` and `mini-lsm/src/block/iterator.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) mini-lsm-mvcc/src/iterators/two_merge_iterator.rs:32— mini-lsm-mvcc/src/iterators/two_merge_iterator.rs:32-40 | mini-lsm/src/iterators/two_merge_iterator.rs:32-40 — before extracting anything, compare `mini-lsm-mvcc/src/iterators/two_merge_iterator.rs` and `mini-lsm/src/iterators/two_merge_iterator.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) mini-lsm-mvcc/src/lsm_iterator.rs:70— mini-lsm-mvcc/src/lsm_iterator.rs:70-78 | mini-lsm/src/lsm_iterator.rs:62-70 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (9 lines × 2) mini-lsm-mvcc/src/table/iterator.rs:40— mini-lsm-mvcc/src/table/iterator.rs:40-48 | mini-lsm/src/table/iterator.rs:40-48 — before extracting anything, compare `mini-lsm-mvcc/src/table/iterator.rs` and `mini-lsm/src/table/iterator.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) mini-lsm-mvcc/src/table/iterator.rs:73— mini-lsm-mvcc/src/table/iterator.rs:73-81 | mini-lsm/src/table/iterator.rs:73-81 — before extracting anything, compare `mini-lsm-mvcc/src/table/iterator.rs` and `mini-lsm/src/table/iterator.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
LsmStorageInner::compact_generate_sst_from_iter (cognitive 38) mini-lsm-mvcc/src/compact.rs:130— LsmStorageInner::compact_generate_sst_from_iter has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 2 (5 pts), match/switch 1 (5 pts), boolean chains 3 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
LsmStorageInner::open (cognitive 33) mini-lsm/src/lsm_storage.rs:346— LsmStorageInner::open has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 4 (10 pts), match/switch 2 (4 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
LsmStorageInner::open (cognitive 33) mini-lsm-mvcc/src/lsm_storage.rs:361— LsmStorageInner::open has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 4 (10 pts), match/switch 2 (4 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
LsmStorageInner::get (cognitive 27) mini-lsm/src/lsm_storage.rs:496— LsmStorageInner::get has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
LsmStorageInner::compact (cognitive 24) mini-lsm/src/compact.rs:183— LsmStorageInner::compact has cognitive complexity 24 (threshold 15). Drivers by points: loops 8 (21 pts), match/switch 2 (3 pts) (nesting depth added 14). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
LsmStorageInner::scan (cognitive 24) mini-lsm/src/lsm_storage.rs:754— LsmStorageInner::scan has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (5 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
LsmStorageInner::compact (cognitive 24) mini-lsm-mvcc/src/compact.rs:229— LsmStorageInner::compact has cognitive complexity 24 (threshold 15). Drivers by points: loops 8 (21 pts), match/switch 2 (3 pts) (nesting depth added 14). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
LsmStorageInner::scan_with_ts (cognitive 24) mini-lsm-mvcc/src/lsm_storage.rs:826— LsmStorageInner::scan_with_ts has cognitive complexity 24 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 2 (5 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
LsmStorageInner::get_with_ts (cognitive 19) mini-lsm-mvcc/src/lsm_storage.rs:525— LsmStorageInner::get_with_ts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Duplicated block (8 lines × 2) mini-lsm-mvcc/src/manifest.rs:137— mini-lsm-mvcc/src/manifest.rs:137-144 | mini-lsm/src/manifest.rs:137-144 — before extracting anything, compare `mini-lsm-mvcc/src/manifest.rs` and `mini-lsm/src/manifest.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 2) mini-lsm-mvcc/src/mem_table.rs:114— mini-lsm-mvcc/src/mem_table.rs:114-121 | mini-lsm/src/mem_table.rs:74-81 — before extracting anything, compare `mini-lsm-mvcc/src/mem_table.rs` and `mini-lsm/src/mem_table.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 2) mini-lsm-mvcc/src/wal.rs:47— mini-lsm-mvcc/src/wal.rs:47-54 | mini-lsm/src/wal.rs:47-54 — before extracting anything, compare `mini-lsm-mvcc/src/wal.rs` and `mini-lsm/src/wal.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 2) mini-lsm-mvcc/src/block/builder.rs:49— mini-lsm-mvcc/src/block/builder.rs:49-56 | mini-lsm/src/block/builder.rs:49-56 — before extracting anything, compare `mini-lsm-mvcc/src/block/builder.rs` and `mini-lsm/src/block/builder.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 2) mini-lsm-mvcc/src/iterators/concat_iterator.rs:119— mini-lsm-mvcc/src/iterators/concat_iterator.rs:119-126 | mini-lsm/src/iterators/concat_iterator.rs:119-126 — before extracting anything, compare `mini-lsm-mvcc/src/iterators/concat_iterator.rs` and `mini-lsm/src/iterators/concat_iterator.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 2) mini-lsm-mvcc/src/mem_table.rs:93— mini-lsm-mvcc/src/mem_table.rs:93-100 | mini-lsm/src/mem_table.rs:53-60 — before extracting anything, compare `mini-lsm-mvcc/src/mem_table.rs` and `mini-lsm/src/mem_table.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 2) mini-lsm-mvcc/src/mem_table.rs:103— mini-lsm-mvcc/src/mem_table.rs:103-110 | mini-lsm/src/mem_table.rs:63-70 — before extracting anything, compare `mini-lsm-mvcc/src/mem_table.rs` and `mini-lsm/src/mem_table.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 2) mini-lsm-mvcc/src/table.rs:141— mini-lsm-mvcc/src/table.rs:141-147 | mini-lsm/src/table.rs:117-122 — before extracting anything, compare `mini-lsm-mvcc/src/table.rs` and `mini-lsm/src/table.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 172 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 2) mini-lsm-mvcc/src/iterators/two_merge_iterator.rs:42— mini-lsm-mvcc/src/iterators/two_merge_iterator.rs:42-47 | mini-lsm/src/iterators/two_merge_iterator.rs:42-47 — before extracting anything, compare `mini-lsm-mvcc/src/iterators/two_merge_iterator.rs` and `mini-lsm/src/iterators/two_merge_iterator.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 2) mini-lsm-mvcc/src/table.rs:34— mini-lsm-mvcc/src/table.rs:34-39 | mini-lsm/src/table.rs:34-39 — before extracting anything, compare `mini-lsm-mvcc/src/table.rs` and `mini-lsm/src/table.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 172 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 2) mini-lsm-mvcc/src/table/iterator.rs:51— mini-lsm-mvcc/src/table/iterator.rs:51-56 | mini-lsm/src/table/iterator.rs:51-56 — before extracting anything, compare `mini-lsm-mvcc/src/table/iterator.rs` and `mini-lsm/src/table/iterator.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 2) mini-lsm-mvcc/src/table/iterator.rs:84— mini-lsm-mvcc/src/table/iterator.rs:84-89 | mini-lsm/src/table/iterator.rs:84-89 — before extracting anything, compare `mini-lsm-mvcc/src/table/iterator.rs` and `mini-lsm/src/table/iterator.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 2) mini-lsm-mvcc/src/wal.rs:153— mini-lsm-mvcc/src/wal.rs:153-158 | mini-lsm/src/wal.rs:139-144 — before extracting anything, compare `mini-lsm-mvcc/src/wal.rs` and `mini-lsm/src/wal.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
TodoComment mini-lsm-starter/src/table/bloom.rs:95— // TODO: build the bloom filter — 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 mini-lsm-starter/src/table/bloom.rs:112— // TODO: probe the bloom filter — 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 mini-lsm-mvcc/src/lsm_storage.rs:417— // TODO: apply remove again — 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 mini-lsm/src/lsm_storage.rs:401— // TODO: apply remove again — 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 mini-lsm-mvcc/src/lsm_storage.rs:864— // TODO: we can implement `key.next()` so that we can directly seek to the — 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.
Duplicated block (13 lines × 2) mini-lsm-mvcc/src/compact.rs:215— mini-lsm-mvcc/src/compact.rs:215-227 | mini-lsm/src/compact.rs:169-181 — before extracting anything, compare `mini-lsm-mvcc/src/compact.rs` and `mini-lsm/src/compact.rs` as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 308 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (13 lines × 2) mini-lsm-mvcc/src/lsm_storage.rs:738— mini-lsm-mvcc/src/lsm_storage.rs:738-750 | mini-lsm/src/lsm_storage.rs:668-680 — before extracting anything, compare `mini-lsm-mvcc/src/lsm_storage.rs` and `mini-lsm/src/lsm_storage.rs` as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (13 lines × 2) mini-lsm-mvcc/src/table.rs:179— mini-lsm-mvcc/src/table.rs:179-191 | mini-lsm/src/table.rs:157-169 — before extracting anything, compare `mini-lsm-mvcc/src/table.rs` and `mini-lsm/src/table.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 172 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (13 lines × 2) mini-lsm-mvcc/src/table/builder.rs:65— mini-lsm-mvcc/src/table/builder.rs:65-77 | mini-lsm/src/table/builder.rs:60-72 — before extracting anything, compare `mini-lsm-mvcc/src/table/builder.rs` and `mini-lsm/src/table/builder.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (13 lines × 2) mini-lsm-mvcc/src/lsm_iterator.rs:177— mini-lsm-mvcc/src/lsm_iterator.rs:177-189 | mini-lsm/src/lsm_iterator.rs:147-159 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (10 lines × 2) mini-lsm-mvcc/src/compact.rs:190— mini-lsm-mvcc/src/compact.rs:190-199 | mini-lsm/src/compact.rs:156-165 — before extracting anything, compare `mini-lsm-mvcc/src/compact.rs` and `mini-lsm/src/compact.rs` as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 308 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) mini-lsm-starter/src/bin/compaction-simulator.rs:345— mini-lsm-starter/src/bin/compaction-simulator.rs:345-354 | mini-lsm-starter/src/bin/compaction-simulator.rs:446-455 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) mini-lsm-mvcc/src/block.rs:33— mini-lsm-mvcc/src/block.rs:33-42 | mini-lsm/src/block.rs:33-42 — before extracting anything, compare `mini-lsm-mvcc/src/block.rs` and `mini-lsm/src/block.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) mini-lsm-mvcc/src/iterators/two_merge_iterator.rs:49— mini-lsm-mvcc/src/iterators/two_merge_iterator.rs:49-58 | mini-lsm/src/iterators/two_merge_iterator.rs:49-58 — before extracting anything, compare `mini-lsm-mvcc/src/iterators/two_merge_iterator.rs` and `mini-lsm/src/iterators/two_merge_iterator.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) mini-lsm-mvcc/src/wal.rs:115— mini-lsm-mvcc/src/wal.rs:115-124 | mini-lsm/src/wal.rs:101-110 — before extracting anything, compare `mini-lsm-mvcc/src/wal.rs` and `mini-lsm/src/wal.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 2) mini-lsm-mvcc/src/lsm_storage.rs:69— mini-lsm-mvcc/src/lsm_storage.rs:69-73 | mini-lsm/src/lsm_storage.rs:67-71 — before extracting anything, compare `mini-lsm-mvcc/src/lsm_storage.rs` and `mini-lsm/src/lsm_storage.rs` as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 2) mini-lsm-mvcc/src/mvcc.rs:52— mini-lsm-mvcc/src/mvcc.rs:52-56 | mini-lsm-starter/src/mvcc.rs:50-54 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) mini-lsm-mvcc/src/table.rs:201— mini-lsm-mvcc/src/table.rs:201-205 | mini-lsm/src/table.rs:179-183 — before extracting anything, compare `mini-lsm-mvcc/src/table.rs` and `mini-lsm/src/table.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 172 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 2) mini-lsm-mvcc/src/iterators/concat_iterator.rs:128— mini-lsm-mvcc/src/iterators/concat_iterator.rs:128-132 | mini-lsm/src/iterators/concat_iterator.rs:128-132 — before extracting anything, compare `mini-lsm-mvcc/src/iterators/concat_iterator.rs` and `mini-lsm/src/iterators/concat_iterator.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 2) mini-lsm-mvcc/src/mem_table.rs:269— mini-lsm-mvcc/src/mem_table.rs:269-273 | mini-lsm/src/mem_table.rs:214-218 — before extracting anything, compare `mini-lsm-mvcc/src/mem_table.rs` and `mini-lsm/src/mem_table.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
LsmStorageInner::open (cyclomatic 17) mini-lsm/src/lsm_storage.rs:346— LsmStorageInner::open 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.
LsmStorageInner::open (cyclomatic 17) mini-lsm-mvcc/src/lsm_storage.rs:361— LsmStorageInner::open 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.
LsmStorageInner::get (cyclomatic 16) mini-lsm/src/lsm_storage.rs:496— LsmStorageInner::get 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.
LsmStorageInner::compact_generate_sst_from_iter (cyclomatic 16) mini-lsm-mvcc/src/compact.rs:130— LsmStorageInner::compact_generate_sst_from_iter 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.
Duplicated block (16 lines × 2) mini-lsm-mvcc/src/compact.rs:420— mini-lsm-mvcc/src/compact.rs:420-435 | mini-lsm/src/compact.rs:376-391 — before extracting anything, compare `mini-lsm-mvcc/src/compact.rs` and `mini-lsm/src/compact.rs` as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 308 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (16 lines × 2) mini-lsm-mvcc/src/compact/leveled.rs:84— mini-lsm-mvcc/src/compact/leveled.rs:84-99 | mini-lsm/src/compact/leveled.rs:84-99 — before extracting anything, compare `mini-lsm-mvcc/src/compact/leveled.rs` and `mini-lsm/src/compact/leveled.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 179 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (16 lines × 2) mini-lsm-mvcc/src/table/bloom.rs:125— mini-lsm-mvcc/src/table/bloom.rs:125-140 | mini-lsm/src/table/bloom.rs:125-140 — before extracting anything, compare `mini-lsm-mvcc/src/table/bloom.rs` and `mini-lsm/src/table/bloom.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (16 lines × 2) mini-lsm-mvcc/src/table/builder.rs:108— mini-lsm-mvcc/src/table/builder.rs:108-123 | mini-lsm/src/table/builder.rs:103-118 — before extracting anything, compare `mini-lsm-mvcc/src/table/builder.rs` and `mini-lsm/src/table/builder.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (14 lines × 2) mini-lsm-mvcc/src/block.rs:90— mini-lsm-mvcc/src/block.rs:90-103 | mini-lsm/src/block.rs:90-103 — before extracting anything, compare `mini-lsm-mvcc/src/block.rs` and `mini-lsm/src/block.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (14 lines × 2) mini-lsm-mvcc/src/block/iterator.rs:142— mini-lsm-mvcc/src/block/iterator.rs:142-155 | mini-lsm/src/block/iterator.rs:137-150 — before extracting anything, compare `mini-lsm-mvcc/src/block/iterator.rs` and `mini-lsm/src/block/iterator.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (14 lines × 2) mini-lsm-mvcc/src/compact.rs:382— mini-lsm-mvcc/src/compact.rs:382-395 | mini-lsm/src/compact.rs:336-349 — before extracting anything, compare `mini-lsm-mvcc/src/compact.rs` and `mini-lsm/src/compact.rs` as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 308 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (14 lines × 2) mini-lsm-mvcc/src/lsm_storage.rs:721— mini-lsm-mvcc/src/lsm_storage.rs:721-734 | mini-lsm/src/lsm_storage.rs:651-664 — before extracting anything, compare `mini-lsm-mvcc/src/lsm_storage.rs` and `mini-lsm/src/lsm_storage.rs` as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (13 lines × 3) mini-lsm-mvcc/src/compact.rs:71— mini-lsm-mvcc/src/compact.rs:71-83 | mini-lsm-starter/src/compact.rs:67-79 | mini-lsm/src/compact.rs:71-83 — before extracting anything, compare `mini-lsm-mvcc/src/compact.rs` and `mini-lsm-starter/src/compact.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (13 lines × 3) mini-lsm-mvcc/src/compact.rs:92— mini-lsm-mvcc/src/compact.rs:92-104 | mini-lsm-starter/src/compact.rs:88-100 | mini-lsm/src/compact.rs:92-104 — before extracting anything, compare `mini-lsm-mvcc/src/compact.rs` and `mini-lsm-starter/src/compact.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (13 lines × 3) mini-lsm-mvcc/src/compact.rs:479— mini-lsm-mvcc/src/compact.rs:479-491 | mini-lsm-starter/src/compact.rs:172-184 | mini-lsm/src/compact.rs:435-447 — before extracting anything, compare `mini-lsm-mvcc/src/compact.rs` and `mini-lsm-starter/src/compact.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (13 lines × 3) mini-lsm-mvcc/src/table.rs:310— mini-lsm-mvcc/src/table.rs:310-322 | mini-lsm-starter/src/table.rs:134-146 | mini-lsm/src/table.rs:288-300 — before extracting anything, compare `mini-lsm-mvcc/src/table.rs` and `mini-lsm/src/table.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 172 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) mini-lsm-mvcc/src/lsm_storage.rs:687— mini-lsm-mvcc/src/lsm_storage.rs:687-697 | mini-lsm/src/lsm_storage.rs:617-627 — before extracting anything, compare `mini-lsm-mvcc/src/lsm_storage.rs` and `mini-lsm/src/lsm_storage.rs` as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) mini-lsm-mvcc/src/table/iterator.rs:108— mini-lsm-mvcc/src/table/iterator.rs:108-118 | mini-lsm/src/table/iterator.rs:108-118 — before extracting anything, compare `mini-lsm-mvcc/src/table/iterator.rs` and `mini-lsm/src/table/iterator.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) mini-lsm-mvcc/src/compact.rs:462— mini-lsm-mvcc/src/compact.rs:462-472 | mini-lsm/src/compact.rs:418-428 — before extracting anything, compare `mini-lsm-mvcc/src/compact.rs` and `mini-lsm/src/compact.rs` as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 308 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) mini-lsm-mvcc/src/iterators/merge_iterator.rs:156— mini-lsm-mvcc/src/iterators/merge_iterator.rs:156-166 | mini-lsm/src/iterators/merge_iterator.rs:156-166 — before extracting anything, compare `mini-lsm-mvcc/src/iterators/merge_iterator.rs` and `mini-lsm/src/iterators/merge_iterator.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 90 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
FileTooLong: src/lsm_storage.rs mini-lsm-mvcc/src/lsm_storage.rs— FileTooLong — 619 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 66% of them inside a single declaration: LsmStorageInner (2 blocks, 202-923). The bar is 500 significant lines; this is 119 over it, 1.24× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: src/lsm_storage.rs mini-lsm/src/lsm_storage.rs— FileTooLong — 551 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 64% of them inside a single declaration: LsmStorageInner (2 blocks, 189-845). The bar is 500 significant lines; this is 51 over it, 1.10× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: bin/compaction-simulator.rs mini-lsm-starter/src/bin/compaction-simulator.rs— FileTooLong — 535 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 35 over it, 1.07× 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.
Duplicated block (30 lines × 2) mini-lsm-mvcc/src/iterators/merge_iterator.rs:60— mini-lsm-mvcc/src/iterators/merge_iterator.rs:60-89 | mini-lsm/src/iterators/merge_iterator.rs:60-89 — before extracting anything, compare `mini-lsm-mvcc/src/iterators/merge_iterator.rs` and `mini-lsm/src/iterators/merge_iterator.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 90 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (30 lines × 2) mini-lsm-mvcc/src/lsm_storage.rs:867— mini-lsm-mvcc/src/lsm_storage.rs:867-896 | mini-lsm/src/lsm_storage.rs:790-819 — before extracting anything, compare `mini-lsm-mvcc/src/lsm_storage.rs` and `mini-lsm/src/lsm_storage.rs` as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (30 lines × 2) mini-lsm-mvcc/src/table.rs:270— mini-lsm-mvcc/src/table.rs:270-299 | mini-lsm/src/table.rs:248-277 — before extracting anything, compare `mini-lsm-mvcc/src/table.rs` and `mini-lsm/src/table.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 172 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (24 lines × 2) mini-lsm-mvcc/src/compact.rs:322— mini-lsm-mvcc/src/compact.rs:322-345 | mini-lsm/src/compact.rs:276-299 — before extracting anything, compare `mini-lsm-mvcc/src/compact.rs` and `mini-lsm/src/compact.rs` as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 308 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (24 lines × 2) mini-lsm-mvcc/src/lsm_storage.rs:440— mini-lsm-mvcc/src/lsm_storage.rs:440-463 | mini-lsm/src/lsm_storage.rs:423-446 — before extracting anything, compare `mini-lsm-mvcc/src/lsm_storage.rs` and `mini-lsm/src/lsm_storage.rs` as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (24 lines × 2) mini-lsm-mvcc/src/lsm_storage.rs:544— mini-lsm-mvcc/src/lsm_storage.rs:544-567 | mini-lsm/src/lsm_storage.rs:522-545 — before extracting anything, compare `mini-lsm-mvcc/src/lsm_storage.rs` and `mini-lsm/src/lsm_storage.rs` as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (18 lines × 2) mini-lsm-mvcc/src/block/builder.rs:78— mini-lsm-mvcc/src/block/builder.rs:78-95 | mini-lsm/src/block/builder.rs:78-95 — before extracting anything, compare `mini-lsm-mvcc/src/block/builder.rs` and `mini-lsm/src/block/builder.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (18 lines × 2) mini-lsm-mvcc/src/iterators/concat_iterator.rs:47— mini-lsm-mvcc/src/iterators/concat_iterator.rs:47-64 | mini-lsm/src/iterators/concat_iterator.rs:47-64 — before extracting anything, compare `mini-lsm-mvcc/src/iterators/concat_iterator.rs` and `mini-lsm/src/iterators/concat_iterator.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (18 lines × 2) mini-lsm-mvcc/src/table/bloom.rs:64— mini-lsm-mvcc/src/table/bloom.rs:64-81 | mini-lsm/src/table/bloom.rs:64-81 — before extracting anything, compare `mini-lsm-mvcc/src/table/bloom.rs` and `mini-lsm/src/table/bloom.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (15 lines × 2) mini-lsm-mvcc/src/iterators/concat_iterator.rs:91— mini-lsm-mvcc/src/iterators/concat_iterator.rs:91-105 | mini-lsm/src/iterators/concat_iterator.rs:91-105 — before extracting anything, compare `mini-lsm-mvcc/src/iterators/concat_iterator.rs` and `mini-lsm/src/iterators/concat_iterator.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (15 lines × 2) mini-lsm-mvcc/src/lsm_storage.rs:840— mini-lsm-mvcc/src/lsm_storage.rs:840-854 | mini-lsm/src/lsm_storage.rs:766-780 — before extracting anything, compare `mini-lsm-mvcc/src/lsm_storage.rs` and `mini-lsm/src/lsm_storage.rs` as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (15 lines × 2) mini-lsm-mvcc/src/lsm_storage.rs:905— mini-lsm-mvcc/src/lsm_storage.rs:905-919 | mini-lsm/src/lsm_storage.rs:828-842 — before extracting anything, compare `mini-lsm-mvcc/src/lsm_storage.rs` and `mini-lsm/src/lsm_storage.rs` as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (12 lines × 2) mini-lsm-mvcc/src/table/iterator.rs:59— mini-lsm-mvcc/src/table/iterator.rs:59-70 | mini-lsm/src/table/iterator.rs:59-70 — before extracting anything, compare `mini-lsm-mvcc/src/table/iterator.rs` and `mini-lsm/src/table/iterator.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (12 lines × 2) mini-lsm-mvcc/src/manifest.rs:39— mini-lsm-mvcc/src/manifest.rs:39-50 | mini-lsm/src/manifest.rs:39-50 — before extracting anything, compare `mini-lsm-mvcc/src/manifest.rs` and `mini-lsm/src/manifest.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (12 lines × 2) mini-lsm-mvcc/src/wal.rs:33— mini-lsm-mvcc/src/wal.rs:33-44 | mini-lsm/src/wal.rs:33-44 — before extracting anything, compare `mini-lsm-mvcc/src/wal.rs` and `mini-lsm/src/wal.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 3) mini-lsm-mvcc/src/table/bloom.rs:101— mini-lsm-mvcc/src/table/bloom.rs:101-107 | mini-lsm-starter/src/table/bloom.rs:87-93 | mini-lsm/src/table/bloom.rs:101-107 — before extracting anything, compare `mini-lsm-mvcc/src/table/bloom.rs` and `mini-lsm/src/table/bloom.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 3) mini-lsm-mvcc/src/iterators/merge_iterator.rs:42— mini-lsm-mvcc/src/iterators/merge_iterator.rs:42-48 | mini-lsm-starter/src/iterators/merge_iterator.rs:44-50 | mini-lsm/src/iterators/merge_iterator.rs:42-48 — before extracting anything, compare `mini-lsm-mvcc/src/iterators/merge_iterator.rs` and `mini-lsm/src/iterators/merge_iterator.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 90 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 3) mini-lsm-mvcc/src/mem_table.rs:43— mini-lsm-mvcc/src/mem_table.rs:43-49 | mini-lsm-starter/src/mem_table.rs:45-51 | mini-lsm/src/mem_table.rs:43-49 — before extracting anything, compare `mini-lsm-mvcc/src/mem_table.rs` and `mini-lsm/src/mem_table.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) mini-lsm-mvcc/src/block/iterator.rs:119— mini-lsm-mvcc/src/block/iterator.rs:119-125 | mini-lsm/src/block/iterator.rs:118-124 — before extracting anything, compare `mini-lsm-mvcc/src/block/iterator.rs` and `mini-lsm/src/block/iterator.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) mini-lsm-mvcc/src/table.rs:89— mini-lsm-mvcc/src/table.rs:89-96 | mini-lsm/src/table.rs:77-83 — before extracting anything, compare `mini-lsm-mvcc/src/table.rs` and `mini-lsm/src/table.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 172 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) mini-lsm-mvcc/src/table/bloom.rs:84— mini-lsm-mvcc/src/table/bloom.rs:84-90 | mini-lsm/src/table/bloom.rs:84-90 — before extracting anything, compare `mini-lsm-mvcc/src/table/bloom.rs` and `mini-lsm/src/table/bloom.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
MethodTooLong: LsmStorageInner.open mini-lsm-mvcc/src/lsm_storage.rs:361— MethodTooLong — open runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12× 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: LsmStorageInner.open mini-lsm/src/lsm_storage.rs:346— MethodTooLong — open runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03× 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.
Duplicated block (34 lines × 2) mini-lsm-mvcc/src/compact.rs:346— mini-lsm-mvcc/src/compact.rs:346-379 | mini-lsm/src/compact.rs:300-333 — before extracting anything, compare `mini-lsm-mvcc/src/compact.rs` and `mini-lsm/src/compact.rs` as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 308 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (34 lines × 2) mini-lsm-mvcc/src/compact/tiered.rs:121— mini-lsm-mvcc/src/compact/tiered.rs:121-154 | mini-lsm/src/compact/tiered.rs:121-154 — before extracting anything, compare `mini-lsm-mvcc/src/compact/tiered.rs` and `mini-lsm/src/compact/tiered.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 99 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (23–24 lines × 2) mini-lsm-mvcc/src/compact.rs:396— mini-lsm-mvcc/src/compact.rs:396-418 | mini-lsm/src/compact.rs:350-373 — before extracting anything, compare `mini-lsm-mvcc/src/compact.rs` and `mini-lsm/src/compact.rs` as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 308 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (23–24 lines × 2) mini-lsm-mvcc/src/compact/simple_leveled.rs:54— mini-lsm-mvcc/src/compact/simple_leveled.rs:54-76 | mini-lsm/src/compact/simple_leveled.rs:58-81 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (23 lines × 2) mini-lsm-mvcc/src/compact/leveled.rs:54— mini-lsm-mvcc/src/compact/leveled.rs:54-76 | mini-lsm/src/compact/leveled.rs:54-76 — before extracting anything, compare `mini-lsm-mvcc/src/compact/leveled.rs` and `mini-lsm/src/compact/leveled.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 179 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (23 lines × 2) mini-lsm-mvcc/src/lsm_storage.rs:362— mini-lsm-mvcc/src/lsm_storage.rs:362-384 | mini-lsm/src/lsm_storage.rs:347-369 — before extracting anything, compare `mini-lsm-mvcc/src/lsm_storage.rs` and `mini-lsm/src/lsm_storage.rs` as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (12 lines × 3) mini-lsm-mvcc/src/lsm_storage.rs:283— mini-lsm-mvcc/src/lsm_storage.rs:283-294 | mini-lsm-starter/src/lsm_storage.rs:179-190 | mini-lsm/src/lsm_storage.rs:272-283 — before extracting anything, compare `mini-lsm-mvcc/src/lsm_storage.rs` and `mini-lsm-starter/src/lsm_storage.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (12 lines × 3) mini-lsm-mvcc/src/lsm_storage.rs:368— mini-lsm-mvcc/src/lsm_storage.rs:368-379 | mini-lsm-starter/src/lsm_storage.rs:261-272 | mini-lsm/src/lsm_storage.rs:353-364 — before extracting anything, compare `mini-lsm-mvcc/src/lsm_storage.rs` and `mini-lsm-starter/src/lsm_storage.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 3) mini-lsm-mvcc/src/table.rs:207— mini-lsm-mvcc/src/table.rs:207-211 | mini-lsm-starter/src/table.rs:93-97 | mini-lsm/src/table.rs:185-189 — before extracting anything, compare `mini-lsm-mvcc/src/table.rs` and `mini-lsm/src/table.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 172 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 3) mini-lsm-mvcc/src/table/bloom.rs:93— mini-lsm-mvcc/src/table/bloom.rs:93-97 | mini-lsm-starter/src/table/bloom.rs:79-83 | mini-lsm/src/table/bloom.rs:93-97 — before extracting anything, compare `mini-lsm-mvcc/src/table/bloom.rs` and `mini-lsm/src/table/bloom.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
mini_lsm_starter::bin::compaction-simulator::main (cyclomatic 38) mini-lsm-starter/src/bin/compaction-simulator.rs:284— mini_lsm_starter::bin::compaction-simulator::main has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Hotspot: mini-lsm-mvcc/src/compact.rs mini-lsm-mvcc/src/compact.rs:130— mini-lsm-mvcc/src/compact.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in LsmStorageInner::compact_generate_sst_from_iter at line 130. 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-06-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-24 18:11:21 -07:00' --until='2026-09-22 18:11:21 -07:00' --full-history --no-merges -- mini-lsm-mvcc/src/compact.rs`: 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.
TodoComment repeated across 22 files mini-lsm-starter/src/block.rs:15— The identical TodoComment appears in 22 files (44 occurrences) — almost certainly one boilerplate line from a single migration or decision, not 44 independent debts. Fix the systemic cause once rather than file-by-file. Text: "// TODO(you): remove this lint after implementing this mod". Source code is not a task system: track the cleanup where tasks live. (Every occurrence still counts toward the score and metrics.)
mini_lsm_starter::bin::compaction-simulator::main (cognitive 113) mini-lsm-starter/src/bin/compaction-simulator.rs:284— mini_lsm_starter::bin::compaction-simulator::main has cognitive complexity 113 (threshold 15). Drivers by points: if/else 31 (72 pts), loops 13 (40 pts), match/switch 1 (nesting depth added 68). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Transaction::commit (cognitive 26) mini-lsm-mvcc/src/mvcc/txn.rs:114— Transaction::commit has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 3 (9 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Wal::recover (cognitive 18) mini-lsm/src/wal.rs:46— Wal::recover has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SimpleLeveledCompactionController::generate_compaction_task (cognitive 16) mini-lsm-mvcc/src/compact/simple_leveled.rs:50— SimpleLeveledCompactionController::generate_compaction_task has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FunctionTooLong: mini_lsm_starter::bin::compaction-simulator::main mini-lsm-starter/src/bin/compaction-simulator.rs:284— FunctionTooLong — mini_lsm_starter::bin::compaction-simulator::main runs 349 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 249 over it, 3.49× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
TooManyMethods: LsmStorageInner mini-lsm-mvcc/src/lsm_storage.rs:202— TooManyMethods — 31 methods, declared across 2 files: src/lsm_storage.rs (24), src/compact.rs (7). The bar is 30 methods; this is 1 over it, 1.03× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: LsmStorageInner mini-lsm-mvcc/src/lsm_storage.rs:202— ClassTooLong — 411 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 31 methods, 2 blocks, lines 202-923. The bar is 400 significant lines; this is 11 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.
Near-duplicate member pair (125 shared lines) mini-lsm-mvcc/src/lsm_storage.rs:361— mini-lsm-mvcc/src/lsm_storage.rs:361-507 | mini-lsm/src/lsm_storage.rs:346-483 — These two members are variants of one another: 125 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (63 shared lines) mini-lsm-mvcc/src/block.rs:48— mini-lsm-mvcc/src/block.rs:48-123 | mini-lsm/src/block.rs:48-119 — These two members are variants of one another: 63 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication· Members sharing a duplicated core (6 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (6 members, 50+ identical tokens) mini-lsm-mvcc/src/compact.rs:440— mini-lsm-mvcc/src/compact.rs:440-460 | mini-lsm-mvcc/src/compact.rs:477-491 | mini-lsm-starter/src/compact.rs:141-161 | mini-lsm-starter/src/compact.rs:170-184 | mini-lsm/src/compact.rs:396-416 | mini-lsm/src/compact.rs:433-447 — These 6 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 6 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 6 times.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (4 members, 50+ identical tokens) mini-lsm-mvcc/src/lsm_storage.rs:525— mini-lsm-mvcc/src/lsm_storage.rs:525-602 | mini-lsm-mvcc/src/lsm_storage.rs:831-922 | mini-lsm/src/lsm_storage.rs:496-571 | mini-lsm/src/lsm_storage.rs:758-844 — 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 (90 lines × 2) mini-lsm-mvcc/src/compact.rs:230— mini-lsm-mvcc/src/compact.rs:230-319 | mini-lsm/src/compact.rs:184-273 — before extracting anything, compare `mini-lsm-mvcc/src/compact.rs` and `mini-lsm/src/compact.rs` as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 308 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (72 lines × 2) mini-lsm-mvcc/src/manifest.rs:53— mini-lsm-mvcc/src/manifest.rs:53-124 | mini-lsm/src/manifest.rs:53-124 — before extracting anything, compare `mini-lsm-mvcc/src/manifest.rs` and `mini-lsm/src/manifest.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (70–71 lines × 2) mini-lsm-mvcc/src/compact/leveled.rs:100— mini-lsm-mvcc/src/compact/leveled.rs:100-170 | mini-lsm/src/compact/leveled.rs:100-169 — before extracting anything, compare `mini-lsm-mvcc/src/compact/leveled.rs` and `mini-lsm/src/compact/leveled.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 179 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (69 lines × 2) mini-lsm-mvcc/src/compact/leveled.rs:179— mini-lsm-mvcc/src/compact/leveled.rs:179-247 | mini-lsm/src/compact/leveled.rs:178-246 — before extracting anything, compare `mini-lsm-mvcc/src/compact/leveled.rs` and `mini-lsm/src/compact/leveled.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 179 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (51 lines × 2) mini-lsm-mvcc/src/lsm_storage.rs:386— mini-lsm-mvcc/src/lsm_storage.rs:386-436 | mini-lsm/src/lsm_storage.rs:370-420 — before extracting anything, compare `mini-lsm-mvcc/src/lsm_storage.rs` and `mini-lsm/src/lsm_storage.rs` as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (42 lines × 2) mini-lsm-mvcc/src/iterators/merge_iterator.rs:113— mini-lsm-mvcc/src/iterators/merge_iterator.rs:113-154 | mini-lsm/src/iterators/merge_iterator.rs:113-154 — before extracting anything, compare `mini-lsm-mvcc/src/iterators/merge_iterator.rs` and `mini-lsm/src/iterators/merge_iterator.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 90 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (40–42 lines × 2) mini-lsm-mvcc/src/lsm_storage.rs:763— mini-lsm-mvcc/src/lsm_storage.rs:763-802 | mini-lsm/src/lsm_storage.rs:693-734 — before extracting anything, compare `mini-lsm-mvcc/src/lsm_storage.rs` and `mini-lsm/src/lsm_storage.rs` as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (41 lines × 2) mini-lsm-mvcc/src/lsm_storage.rs:237— mini-lsm-mvcc/src/lsm_storage.rs:237-277 | mini-lsm/src/lsm_storage.rs:226-266 — before extracting anything, compare `mini-lsm-mvcc/src/lsm_storage.rs` and `mini-lsm/src/lsm_storage.rs` as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (38 lines × 2) mini-lsm-mvcc/src/block.rs:51— mini-lsm-mvcc/src/block.rs:51-88 | mini-lsm/src/block.rs:51-88 — before extracting anything, compare `mini-lsm-mvcc/src/block.rs` and `mini-lsm/src/block.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (36 lines × 2) mini-lsm-mvcc/src/compact/tiered.rs:78— mini-lsm-mvcc/src/compact/tiered.rs:78-113 | mini-lsm/src/compact/tiered.rs:78-113 — before extracting anything, compare `mini-lsm-mvcc/src/compact/tiered.rs` and `mini-lsm/src/compact/tiered.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 99 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (35 lines × 3) mini-lsm-starter/src/bin/compaction-simulator.rs:361— mini-lsm-starter/src/bin/compaction-simulator.rs:361-395 | mini-lsm-starter/src/bin/compaction-simulator.rs:462-496 | mini-lsm-starter/src/bin/compaction-simulator.rs:663-697 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (35 lines × 2) mini-lsm-mvcc/src/compact/simple_leveled.rs:119— mini-lsm-mvcc/src/compact/simple_leveled.rs:119-153 | mini-lsm/src/compact/simple_leveled.rs:114-148 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (32 lines × 2) mini-lsm-mvcc/src/table.rs:237— mini-lsm-mvcc/src/table.rs:237-268 | mini-lsm/src/table.rs:215-246 — before extracting anything, compare `mini-lsm-mvcc/src/table.rs` and `mini-lsm/src/table.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 172 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (29 lines × 2) mini-lsm-mvcc/src/compact/tiered.rs:49— mini-lsm-mvcc/src/compact/tiered.rs:49-77 | mini-lsm/src/compact/tiered.rs:49-77 — before extracting anything, compare `mini-lsm-mvcc/src/compact/tiered.rs` and `mini-lsm/src/compact/tiered.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 99 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (28 lines × 2) mini-lsm-mvcc/src/table.rs:326— mini-lsm-mvcc/src/table.rs:326-353 | mini-lsm/src/table.rs:304-331 — before extracting anything, compare `mini-lsm-mvcc/src/table.rs` and `mini-lsm/src/table.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 172 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (27 lines × 2) mini-lsm-mvcc/src/lsm_storage.rs:474— mini-lsm-mvcc/src/lsm_storage.rs:474-500 | mini-lsm/src/lsm_storage.rs:450-476 — before extracting anything, compare `mini-lsm-mvcc/src/lsm_storage.rs` and `mini-lsm/src/lsm_storage.rs` as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (22 lines × 2) mini-lsm-mvcc/src/iterators/concat_iterator.rs:67— mini-lsm-mvcc/src/iterators/concat_iterator.rs:67-88 | mini-lsm/src/iterators/concat_iterator.rs:67-88 — before extracting anything, compare `mini-lsm-mvcc/src/iterators/concat_iterator.rs` and `mini-lsm/src/iterators/concat_iterator.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (20 lines × 3) mini-lsm-mvcc/src/compact.rs:441— mini-lsm-mvcc/src/compact.rs:441-460 | mini-lsm-starter/src/compact.rs:142-161 | mini-lsm/src/compact.rs:397-416 — before extracting anything, compare `mini-lsm-mvcc/src/compact.rs` and `mini-lsm-starter/src/compact.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (19 lines × 2) mini-lsm-mvcc/src/table/bloom.rs:103— mini-lsm-mvcc/src/table/bloom.rs:103-121 | mini-lsm/src/table/bloom.rs:103-121 — before extracting anything, compare `mini-lsm-mvcc/src/table/bloom.rs` and `mini-lsm/src/table/bloom.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (17 lines × 3) mini-lsm-mvcc/src/lsm_storage.rs:98— mini-lsm-mvcc/src/lsm_storage.rs:98-114 | mini-lsm-starter/src/lsm_storage.rs:64-80 | mini-lsm/src/lsm_storage.rs:85-101 — before extracting anything, compare `mini-lsm-mvcc/src/lsm_storage.rs` and `mini-lsm-starter/src/lsm_storage.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (16 lines × 3) mini-lsm-starter/src/bin/compaction-simulator.rs:589— mini-lsm-starter/src/bin/compaction-simulator.rs:589-604 | mini-lsm-starter/src/bin/compaction-simulator.rs:609-624 | mini-lsm-starter/src/bin/compaction-simulator.rs:628-643 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (15–16 lines × 2) mini-lsm-mvcc/src/table.rs:120— mini-lsm-mvcc/src/table.rs:120-135 | mini-lsm/src/table.rs:99-113 — before extracting anything, compare `mini-lsm-mvcc/src/table.rs` and `mini-lsm/src/table.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 172 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (13–14 lines × 2) mini-lsm-starter/src/bin/mini-lsm-cli.rs:91— mini-lsm-starter/src/bin/mini-lsm-cli.rs:91-103 | mini-lsm-starter/src/bin/mini-lsm-cli.rs:108-121 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11–12 lines × 2) mini-lsm-mvcc/src/block.rs:112— mini-lsm-mvcc/src/block.rs:112-123 | mini-lsm/src/block.rs:109-119 — before extracting anything, compare `mini-lsm-mvcc/src/block.rs` and `mini-lsm/src/block.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (8–11 lines × 2) mini-lsm-starter/src/bin/compaction-simulator.rs:209— mini-lsm-starter/src/bin/compaction-simulator.rs:209-219 | mini-lsm-starter/src/bin/compaction-simulator.rs:229-236 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9–10 lines × 2) mini-lsm-mvcc/src/lsm_storage.rs:574— mini-lsm-mvcc/src/lsm_storage.rs:574-583 | mini-lsm/src/lsm_storage.rs:552-560 — before extracting anything, compare `mini-lsm-mvcc/src/lsm_storage.rs` and `mini-lsm/src/lsm_storage.rs` as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 3) mini-lsm-mvcc/src/lsm_storage.rs:330— mini-lsm-mvcc/src/lsm_storage.rs:330-338 | mini-lsm-starter/src/lsm_storage.rs:230-238 | mini-lsm/src/lsm_storage.rs:323-331 — before extracting anything, compare `mini-lsm-mvcc/src/lsm_storage.rs` and `mini-lsm-starter/src/lsm_storage.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 6) mini-lsm-mvcc/src/compact.rs:445— mini-lsm-mvcc/src/compact.rs:445-449 | mini-lsm-mvcc/src/compact.rs:478-482 | mini-lsm-starter/src/compact.rs:146-150 | mini-lsm-starter/src/compact.rs:171-175 | mini-lsm/src/compact.rs:401-405 | mini-lsm/src/compact.rs:434-438 — before extracting anything, compare `mini-lsm-mvcc/src/compact.rs` and `mini-lsm-starter/src/compact.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 4) mini-lsm-mvcc/src/lsm_storage.rs:572— mini-lsm-mvcc/src/lsm_storage.rs:572-576 | mini-lsm-mvcc/src/lsm_storage.rs:878-882 | mini-lsm/src/lsm_storage.rs:550-554 | mini-lsm/src/lsm_storage.rs:801-805 — before extracting anything, compare `mini-lsm-mvcc/src/lsm_storage.rs` and `mini-lsm/src/lsm_storage.rs` as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (23 lines × 4) mini-lsm-starter/src/iterators/concat_iterator.rs:37— mini-lsm-starter/src/iterators/concat_iterator.rs:37-67 | mini-lsm-starter/src/iterators/two_merge_iterator.rs:35-61 | mini-lsm-starter/src/table/iterator.rs:34-78 | mini-lsm-starter/src/wal.rs:35-57 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times.
Duplicated block (155 lines × 2) mini-lsm-starter/src/key.rs:28— mini-lsm-starter/src/key.rs:28-182 | mini-lsm/src/key.rs:28-182 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (8 lines × 3) mini-lsm-mvcc/src/compact.rs:52— mini-lsm-mvcc/src/compact.rs:52-59 | mini-lsm-starter/src/compact.rs:48-55 | mini-lsm/src/compact.rs:52-59 — before extracting anything, compare `mini-lsm-mvcc/src/compact.rs` and `mini-lsm-starter/src/compact.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 6) mini-lsm-mvcc/src/lsm_storage.rs:131— mini-lsm-mvcc/src/lsm_storage.rs:131-140 | mini-lsm-mvcc/src/lsm_storage.rs:142-151 | mini-lsm-starter/src/lsm_storage.rs:97-106 | mini-lsm-starter/src/lsm_storage.rs:108-117 | mini-lsm/src/lsm_storage.rs:118-127 | mini-lsm/src/lsm_storage.rs:129-138 — before extracting anything, compare `mini-lsm-mvcc/src/lsm_storage.rs` and `mini-lsm-starter/src/lsm_storage.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
No structured logging — No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page — but when a run fails on a user's machine, neither they nor you have anything to read.
Third-party script without Subresource Integrity mini-lsm-book/theme/head.hbs:1— `https://eu.umami.is/script.js` is executed by this page with no Subresource Integrity. Whoever can answer that request — the CDN, anyone who compromises it, anyone on the network path — runs arbitrary script in this page's origin, with its session. The URL also names no version, so it resolves to whatever that origin serves at fetch time — the executed bytes can change with nobody touching this repository.
Duplicated predicate mini-lsm-mvcc/src/lsm_iterator.rs:160— `!self.has_errored && self.iter.is_valid()` appears character-identically in 2 files — mini-lsm-mvcc/src/lsm_iterator.rs, mini-lsm/src/lsm_iterator.rs. 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 mini-lsm-mvcc/src/block/builder.rs:80— `!self.is_empty() && (block_is_full || offset_is_full || count_is_full)` appears character-identically in 2 files — mini-lsm-mvcc/src/block/builder.rs, mini-lsm/src/block/builder.rs. 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 mini-lsm-mvcc/src/compact/tiered.rs:80— `current_size_ratio > size_ratio_trigger && id + 1 >= self.options.min_merge_width` appears character-identically in 2 files — mini-lsm-mvcc/src/compact/tiered.rs, mini-lsm/src/compact/tiered.rs. 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 mini-lsm-mvcc/src/iterators/two_merge_iterator.rs:43— `self.a.is_valid() && self.b.is_valid() && self.b.key() == self.a.key()` appears character-identically in 2 files — mini-lsm-mvcc/src/iterators/two_merge_iterator.rs, mini-lsm/src/iterators/two_merge_iterator.rs. 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 mini-lsm-mvcc/src/compact/tiered.rs:143— `tier_to_remove.is_empty() && !new_tier_added && !output.is_empty()` appears character-identically in 2 files — mini-lsm-mvcc/src/compact/tiered.rs, mini-lsm/src/compact/tiered.rs. 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.
Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 7 significant file(s) lose their only recent owner: mini-lsm/src/lsm_storage.rs, mini-lsm-mvcc/src/table.rs, mini-lsm/src/table.rs, xtask/src/main.rs, mini-lsm-mvcc/src/wal.rs, mini-lsm-mvcc/src/manifest.rs, mini-lsm-mvcc/src/table/builder.rs. Pair on, review, or document these before any departure.
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/`.
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.
P10 · Library API & versioning· Large public API surface · ×1
Large public API surface — 76/90 types (84%) declared in the published library are public. For a library, every public type is a stability contract — keep implementation types off the surface and expose only the intended API.
No SAST — No static application security testing detected. For this repository's stack, add cargo-audit / cargo-deny (or clippy) (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 1933 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.
No changelog — No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
Outdated: arc-swap — `arc-swap` is locked at 1.9.2 but 1.9.3 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in mini-lsm-mvcc/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p arc-swap` and commit the updated Cargo.lock.
Outdated: clap — `clap` is locked at 4.6.2 but 4.6.7 is the current stable release on crates.io, and it already satisfies the `"4"` requirement declared in mini-lsm-mvcc/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p clap` and commit the updated Cargo.lock.
Outdated: console — `console` is locked at 0.16.4 but 0.16.6 is the current stable release on crates.io, and it already satisfies the `"0.16"` requirement declared in xtask/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p console` and commit the updated Cargo.lock.
Outdated: crc32fast — `crc32fast` is locked at 1.5.0 but 1.5.3 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in mini-lsm-mvcc/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p crc32fast` and commit the updated Cargo.lock.
Outdated: crossbeam-channel — `crossbeam-channel` is locked at 0.5.16 but 0.5.17 is the current stable release on crates.io, and it already satisfies the `"0.5"` requirement declared in mini-lsm-mvcc/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p crossbeam-channel` and commit the updated Cargo.lock.
Outdated: crossbeam-epoch — `crossbeam-epoch` is locked at 0.9.20 but 0.9.21 is the current stable release on crates.io, and it already satisfies the `"0.9"` requirement declared in mini-lsm-mvcc/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p crossbeam-epoch` and commit the updated Cargo.lock.
Outdated: duct — `duct` is locked at 1.1.1 but 1.1.2 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in xtask/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p duct` and commit the updated Cargo.lock.
Outdated: moka — `moka` is locked at 0.12.15 but 0.12.16 is the current stable release on crates.io, and it already satisfies the `"0.12"` requirement declared in mini-lsm-mvcc/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p moka` and commit the updated Cargo.lock.
Outdated: rand — `rand` is locked at 0.10.2 but 0.10.3 is the current stable release on crates.io, and it already satisfies the `"0.10"` requirement declared in mini-lsm-mvcc/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p rand` and commit the updated Cargo.lock.
Outdated: serde_json — `serde_json` is locked at 1.0.150 but 1.0.154 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in mini-lsm-mvcc/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p serde_json` and commit the updated Cargo.lock.
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.
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.
Run 01a18344-ef40-7a81-ae24-3d3783a29fe7 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 10 · Warnings: 162 · Recommendations: 15 · Info: 10 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 28-10-2026 @ 16:08 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.