Public report of fsprojects/FSharp.Data.Adaptive, published 13 November 2026. It has the same score, grades and number of
findings as the full report. The details of security findings (where they are in the code, which known
vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.11.3). 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, 13 November 2026, 10:49 UTC · Survey ID cd_487d459d53134ab487f327c2a704c044
fsprojects/FSharp.Data.Adaptive
Measured 13 November 2026, 10:49 UTC, at code version 27f195e
Code coverage is not measured: No coverage collector is wired up.
CAI scoreAdequate
CriticalWeakAdequateStrongExemplary
Down 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 medium codebase: 23,687 lines of product code in 1 project, tests not counted · Estimated rebuild effort: about 0.2 person-years · Weakest lens: Production Readiness, 44
Findings by how serious they are
11 critical334 serious49 minor
6 dimensions are left out of the score. For each one, we either couldn't measure it in this code, or found no evidence of the safeguard we look for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.
This survey was produced by
Canine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
13 November 2026, 10:49 UTC
A measurement, not a certificate. The Code Assurance Index records a number
together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee
the code. The standard was written by Canine Development, which also builds the Canine Code Analyzer. It is open to any tool that
implements it, and today the Canine Code Analyzer is the only one that does.
The score is deterministic, which means the same code always gets the same score. We work it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸
38of 38 dimensions measured by tools.
346of 394 findings point to an exact file and line, so you can open each one in the code. The other 48 concern the repository as a whole, such as missing documentation.
38dimensions across 5 lenses, read from 23,687 lines of product code in 1 project.
fsprojects/FSharp.Data.Adaptive 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 52 out of 100 and is rated Adequate, and all 11 of its critical findings are security problems in the build pipeline.
Production Readiness, at 44, is the weakest lens and counts most in the score. The best first step is updating the outdated dependencies, worth about 6 points. Adding a diagnostic log would lift Production Readiness itself, also worth about 6. Raising Production Readiness to 70 would lift the score to about 58.
Eleven 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 23,687 lines, about €33,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.
We compare 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: 8 findings
These 8 critical or serious findings were in the previous survey, on 23 October 2026, and are gone from this one.
Code Coverage · Coverage not measured — no coverage collector is wired up
Secrets (history) · High secret: WD-SECRET-0005 package-lock.json
Rebuild cost: about €33,000 · Estimate
Cost to rebuild
€11,000 to €55,000, for 181 to 574 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.7 at a score of 52. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
Size
Medium: 23,687 lines of product code
Comment lines
The estimate prices 23,670 lines. Comment lines count towards the size of 23,687 lines but aren't priced as work.
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: We price the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty.
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 9 Outdated finding(s) in Dependency Hygiene.
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 6 points · Medium effort · Observability
3
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.
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 €33,000 to build again, about 0.2 person-years of work. Its weakest lens is Production Readiness, at 44 (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 9 Outdated finding(s) in Dependency Hygiene. Of all the actions in this report, it raises the score most for the work it takes: about 6 points for low effort, because it clears the 9 Dependency Hygiene findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 7.3 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 2% to 5% on every change. The history of the code shows how much it changes: about 355 lines over the last 90 days, which is about 1,440 lines a year. At that pace, the extra work comes to an estimated 0.1 to 0.5 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of our own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.
Architecture — module dependency graph
Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways, which only happens where the projects form a dependency cycle. A graph without cycles has none.
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.
89 modules, with 81 dependencies between them. One loop runs through 2 of the modules, marked above the diagonal.
The table shows the 40 modules with the most connections; 49 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.
Uses a module listed above itPart of a loopThe module itself
3→4 FSharp.Data.Traceable uses FSharp.Data.Adaptivepart of a loop✕
Connections
35 pairs of types, where a type in FSharp.Data.Traceable uses a type in FSharp.Data.Adaptive. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
FSharp.Data.Traceable uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break FSharp.Data.Traceable, while a change to FSharp.Data.Traceable can't break FSharp.Data.Adaptive.
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.
FSharp.Data.Adaptive uses FSharp.Data.Adaptive.HashImplementation, so a change to FSharp.Data.Adaptive.HashImplementation can break FSharp.Data.Adaptive, while a change to FSharp.Data.Adaptive can't break FSharp.Data.Adaptive.HashImplementation.
Position
Below the diagonal: FSharp.Data.Adaptive uses a module listed above it, which is the healthy direction.
FSharp.Data.Adaptive uses FSharp.Data.Adaptive.MapExtImplementation, so a change to FSharp.Data.Adaptive.MapExtImplementation can break FSharp.Data.Adaptive, while a change to FSharp.Data.Adaptive can't break FSharp.Data.Adaptive.MapExtImplementation.
Position
Below the diagonal: FSharp.Data.Adaptive uses a module listed above it, which is the healthy direction.
FSharp.Data.Adaptive uses FSharp.Data.Traceable, so a change to FSharp.Data.Traceable can break FSharp.Data.Adaptive, while a change to FSharp.Data.Adaptive can't break FSharp.Data.Traceable.
Position
Below the diagonal: FSharp.Data.Adaptive uses a module listed above it, which is the healthy direction.
CSharp.Data.Adaptive uses FSharp.Data.Traceable, so a change to FSharp.Data.Traceable can break CSharp.Data.Adaptive, while a change to CSharp.Data.Adaptive can't break FSharp.Data.Traceable.
Position
Below the diagonal: CSharp.Data.Adaptive uses a module listed above it, which is the healthy direction.
55 pairs of types, where a type in CSharp.Data.Adaptive uses a type in FSharp.Data.Adaptive. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
CSharp.Data.Adaptive uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break CSharp.Data.Adaptive, while a change to CSharp.Data.Adaptive can't break FSharp.Data.Adaptive.
Position
Below the diagonal: CSharp.Data.Adaptive uses a module listed above it, which is the healthy direction.
CSharp.Data.Adaptive.AdaptiveListHelpers uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break CSharp.Data.Adaptive.AdaptiveListHelpers, while a change to CSharp.Data.Adaptive.AdaptiveListHelpers can't break FSharp.Data.Adaptive.
Position
Below the diagonal: CSharp.Data.Adaptive.AdaptiveListHelpers uses a module listed above it, which is the healthy direction.
CSharp.Data.Adaptive.AdaptiveMapHelpers uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break CSharp.Data.Adaptive.AdaptiveMapHelpers, while a change to CSharp.Data.Adaptive.AdaptiveMapHelpers can't break FSharp.Data.Adaptive.
Position
Below the diagonal: CSharp.Data.Adaptive.AdaptiveMapHelpers uses a module listed above it, which is the healthy direction.
CSharp.Data.Adaptive.AdaptiveSetHelpers uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break CSharp.Data.Adaptive.AdaptiveSetHelpers, while a change to CSharp.Data.Adaptive.AdaptiveSetHelpers can't break FSharp.Data.Adaptive.
Position
Below the diagonal: CSharp.Data.Adaptive.AdaptiveSetHelpers uses a module listed above it, which is the healthy direction.
CSharp.Data.Adaptive.AdaptiveValueHelpers uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break CSharp.Data.Adaptive.AdaptiveValueHelpers, while a change to CSharp.Data.Adaptive.AdaptiveValueHelpers can't break FSharp.Data.Adaptive.
Position
Below the diagonal: CSharp.Data.Adaptive.AdaptiveValueHelpers uses a module listed above it, which is the healthy direction.
FSharp.Data.Adaptive.AListModule uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break FSharp.Data.Adaptive.AListModule, while a change to FSharp.Data.Adaptive.AListModule can't break FSharp.Data.Adaptive.
Position
Below the diagonal: FSharp.Data.Adaptive.AListModule uses a module listed above it, which is the healthy direction.
FSharp.Data.Adaptive.AMapModule uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break FSharp.Data.Adaptive.AMapModule, while a change to FSharp.Data.Adaptive.AMapModule can't break FSharp.Data.Adaptive.
Position
Below the diagonal: FSharp.Data.Adaptive.AMapModule uses a module listed above it, which is the healthy direction.
FSharp.Data.Adaptive.ASetModule uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break FSharp.Data.Adaptive.ASetModule, while a change to FSharp.Data.Adaptive.ASetModule can't break FSharp.Data.Adaptive.
Position
Below the diagonal: FSharp.Data.Adaptive.ASetModule uses a module listed above it, which is the healthy direction.
FSharp.Data.Adaptive.AValModule uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break FSharp.Data.Adaptive.AValModule, while a change to FSharp.Data.Adaptive.AValModule can't break FSharp.Data.Adaptive.
Position
Below the diagonal: FSharp.Data.Adaptive.AValModule uses a module listed above it, which is the healthy direction.
FSharp.Data.Adaptive.AdadptiveObjectExtensions uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break FSharp.Data.Adaptive.AdadptiveObjectExtensions, while a change to FSharp.Data.Adaptive.AdadptiveObjectExtensions can't break FSharp.Data.Adaptive.
Position
Below the diagonal: FSharp.Data.Adaptive.AdadptiveObjectExtensions uses a module listed above it, which is the healthy direction.
FSharp.Data.Adaptive.AdaptiveIndexListHelpers uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break FSharp.Data.Adaptive.AdaptiveIndexListHelpers, while a change to FSharp.Data.Adaptive.AdaptiveIndexListHelpers can't break FSharp.Data.Adaptive.
Position
Below the diagonal: FSharp.Data.Adaptive.AdaptiveIndexListHelpers uses a module listed above it, which is the healthy direction.
FSharp.Data.Adaptive.AdaptiveReduction uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break FSharp.Data.Adaptive.AdaptiveReduction, while a change to FSharp.Data.Adaptive.AdaptiveReduction can't break FSharp.Data.Adaptive.
Position
Below the diagonal: FSharp.Data.Adaptive.AdaptiveReduction uses a module listed above it, which is the healthy direction.
FSharp.Data.Adaptive.CallbackExtensions uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break FSharp.Data.Adaptive.CallbackExtensions, while a change to FSharp.Data.Adaptive.CallbackExtensions can't break FSharp.Data.Adaptive.
Position
Below the diagonal: FSharp.Data.Adaptive.CallbackExtensions uses a module listed above it, which is the healthy direction.
FSharp.Data.Adaptive.CollectionExtensions uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break FSharp.Data.Adaptive.CollectionExtensions, while a change to FSharp.Data.Adaptive.CollectionExtensions can't break FSharp.Data.Adaptive.
Position
Below the diagonal: FSharp.Data.Adaptive.CollectionExtensions uses a module listed above it, which is the healthy direction.
FSharp.Data.Adaptive.CollectionExtensions.AListModule uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break FSharp.Data.Adaptive.CollectionExtensions.AListModule, while a change to FSharp.Data.Adaptive.CollectionExtensions.AListModule can't break FSharp.Data.Adaptive.
Position
Below the diagonal: FSharp.Data.Adaptive.CollectionExtensions.AListModule uses a module listed above it, which is the healthy direction.
FSharp.Data.Adaptive.CollectionExtensions.AMapModule uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break FSharp.Data.Adaptive.CollectionExtensions.AMapModule, while a change to FSharp.Data.Adaptive.CollectionExtensions.AMapModule can't break FSharp.Data.Adaptive.
Position
Below the diagonal: FSharp.Data.Adaptive.CollectionExtensions.AMapModule uses a module listed above it, which is the healthy direction.
FSharp.Data.Adaptive.CollectionExtensions.ASetModule uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break FSharp.Data.Adaptive.CollectionExtensions.ASetModule, while a change to FSharp.Data.Adaptive.CollectionExtensions.ASetModule can't break FSharp.Data.Adaptive.
Position
Below the diagonal: FSharp.Data.Adaptive.CollectionExtensions.ASetModule uses a module listed above it, which is the healthy direction.
FSharp.Data.Adaptive.CollectionExtensions.AVal uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break FSharp.Data.Adaptive.CollectionExtensions.AVal, while a change to FSharp.Data.Adaptive.CollectionExtensions.AVal can't break FSharp.Data.Adaptive.
Position
Below the diagonal: FSharp.Data.Adaptive.CollectionExtensions.AVal uses a module listed above it, which is the healthy direction.
FSharp.Data.Adaptive.CollectionExtensions.Array uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break FSharp.Data.Adaptive.CollectionExtensions.Array, while a change to FSharp.Data.Adaptive.CollectionExtensions.Array can't break FSharp.Data.Adaptive.
Position
Below the diagonal: FSharp.Data.Adaptive.CollectionExtensions.Array uses a module listed above it, which is the healthy direction.
FSharp.Data.Adaptive.CollectionExtensions.BooleanOperators uses FSharp.Data.Traceable, so a change to FSharp.Data.Traceable can break FSharp.Data.Adaptive.CollectionExtensions.BooleanOperators, while a change to FSharp.Data.Adaptive.CollectionExtensions.BooleanOperators can't break FSharp.Data.Traceable.
Position
Below the diagonal: FSharp.Data.Adaptive.CollectionExtensions.BooleanOperators uses a module listed above it, which is the healthy direction.
FSharp.Data.Adaptive.CollectionExtensions.BooleanOperators uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break FSharp.Data.Adaptive.CollectionExtensions.BooleanOperators, while a change to FSharp.Data.Adaptive.CollectionExtensions.BooleanOperators can't break FSharp.Data.Adaptive.
Position
Below the diagonal: FSharp.Data.Adaptive.CollectionExtensions.BooleanOperators uses a module listed above it, which is the healthy direction.
FSharp.Data.Adaptive.CollectionExtensions.HashMap uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break FSharp.Data.Adaptive.CollectionExtensions.HashMap, while a change to FSharp.Data.Adaptive.CollectionExtensions.HashMap can't break FSharp.Data.Adaptive.
Position
Below the diagonal: FSharp.Data.Adaptive.CollectionExtensions.HashMap uses a module listed above it, which is the healthy direction.
FSharp.Data.Adaptive.CollectionExtensions.HashSet uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break FSharp.Data.Adaptive.CollectionExtensions.HashSet, while a change to FSharp.Data.Adaptive.CollectionExtensions.HashSet can't break FSharp.Data.Adaptive.
Position
Below the diagonal: FSharp.Data.Adaptive.CollectionExtensions.HashSet uses a module listed above it, which is the healthy direction.
FSharp.Data.Adaptive.CollectionExtensions.IndexList uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break FSharp.Data.Adaptive.CollectionExtensions.IndexList, while a change to FSharp.Data.Adaptive.CollectionExtensions.IndexList can't break FSharp.Data.Adaptive.
Position
Below the diagonal: FSharp.Data.Adaptive.CollectionExtensions.IndexList uses a module listed above it, which is the healthy direction.
FSharp.Data.Adaptive.CollectionExtensions.List uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break FSharp.Data.Adaptive.CollectionExtensions.List, while a change to FSharp.Data.Adaptive.CollectionExtensions.List can't break FSharp.Data.Adaptive.
Position
Below the diagonal: FSharp.Data.Adaptive.CollectionExtensions.List uses a module listed above it, which is the healthy direction.
FSharp.Data.Adaptive.CollectionExtensions.Map uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break FSharp.Data.Adaptive.CollectionExtensions.Map, while a change to FSharp.Data.Adaptive.CollectionExtensions.Map can't break FSharp.Data.Adaptive.
Position
Below the diagonal: FSharp.Data.Adaptive.CollectionExtensions.Map uses a module listed above it, which is the healthy direction.
FSharp.Data.Adaptive.CollectionExtensions.Readers uses FSharp.Data.Traceable, so a change to FSharp.Data.Traceable can break FSharp.Data.Adaptive.CollectionExtensions.Readers, while a change to FSharp.Data.Adaptive.CollectionExtensions.Readers can't break FSharp.Data.Traceable.
Position
Below the diagonal: FSharp.Data.Adaptive.CollectionExtensions.Readers uses a module listed above it, which is the healthy direction.
41 pairs of types, where a type in FSharp.Data.Adaptive.CollectionExtensions.Readers uses a type in FSharp.Data.Adaptive. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
FSharp.Data.Adaptive.CollectionExtensions.Readers uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break FSharp.Data.Adaptive.CollectionExtensions.Readers, while a change to FSharp.Data.Adaptive.CollectionExtensions.Readers can't break FSharp.Data.Adaptive.
Position
Below the diagonal: FSharp.Data.Adaptive.CollectionExtensions.Readers uses a module listed above it, which is the healthy direction.
FSharp.Data.Traceable.CountingHashSetModule uses FSharp.Data.Traceable, so a change to FSharp.Data.Traceable can break FSharp.Data.Traceable.CountingHashSetModule, while a change to FSharp.Data.Traceable.CountingHashSetModule can't break FSharp.Data.Traceable.
Position
Below the diagonal: FSharp.Data.Traceable.CountingHashSetModule uses a module listed above it, which is the healthy direction.
FSharp.Data.Traceable.CountingHashSetModule uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break FSharp.Data.Traceable.CountingHashSetModule, while a change to FSharp.Data.Traceable.CountingHashSetModule can't break FSharp.Data.Adaptive.
Position
Below the diagonal: FSharp.Data.Traceable.CountingHashSetModule uses a module listed above it, which is the healthy direction.
FSharp.Data.Traceable.HashMap uses FSharp.Data.Traceable, so a change to FSharp.Data.Traceable can break FSharp.Data.Traceable.HashMap, while a change to FSharp.Data.Traceable.HashMap can't break FSharp.Data.Traceable.
Position
Below the diagonal: FSharp.Data.Traceable.HashMap uses a module listed above it, which is the healthy direction.
FSharp.Data.Traceable.HashMap uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break FSharp.Data.Traceable.HashMap, while a change to FSharp.Data.Traceable.HashMap can't break FSharp.Data.Adaptive.
Position
Below the diagonal: FSharp.Data.Traceable.HashMap uses a module listed above it, which is the healthy direction.
FSharp.Data.Traceable.HashMapDelta uses FSharp.Data.Traceable, so a change to FSharp.Data.Traceable can break FSharp.Data.Traceable.HashMapDelta, while a change to FSharp.Data.Traceable.HashMapDelta can't break FSharp.Data.Traceable.
Position
Below the diagonal: FSharp.Data.Traceable.HashMapDelta uses a module listed above it, which is the healthy direction.
FSharp.Data.Traceable.HashMapDelta uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break FSharp.Data.Traceable.HashMapDelta, while a change to FSharp.Data.Traceable.HashMapDelta can't break FSharp.Data.Adaptive.
Position
Below the diagonal: FSharp.Data.Traceable.HashMapDelta uses a module listed above it, which is the healthy direction.
FSharp.Data.Traceable.HashSet uses FSharp.Data.Traceable, so a change to FSharp.Data.Traceable can break FSharp.Data.Traceable.HashSet, while a change to FSharp.Data.Traceable.HashSet can't break FSharp.Data.Traceable.
Position
Below the diagonal: FSharp.Data.Traceable.HashSet uses a module listed above it, which is the healthy direction.
FSharp.Data.Traceable.HashSet uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break FSharp.Data.Traceable.HashSet, while a change to FSharp.Data.Traceable.HashSet can't break FSharp.Data.Adaptive.
Position
Below the diagonal: FSharp.Data.Traceable.HashSet uses a module listed above it, which is the healthy direction.
FSharp.Data.Traceable.HashSetDelta uses FSharp.Data.Traceable, so a change to FSharp.Data.Traceable can break FSharp.Data.Traceable.HashSetDelta, while a change to FSharp.Data.Traceable.HashSetDelta can't break FSharp.Data.Traceable.
Position
Below the diagonal: FSharp.Data.Traceable.HashSetDelta uses a module listed above it, which is the healthy direction.
FSharp.Data.Traceable.HashSetDelta uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break FSharp.Data.Traceable.HashSetDelta, while a change to FSharp.Data.Traceable.HashSetDelta can't break FSharp.Data.Adaptive.
Position
Below the diagonal: FSharp.Data.Traceable.HashSetDelta uses a module listed above it, which is the healthy direction.
FSharp.Data.Traceable.History.Readers uses FSharp.Data.Traceable, so a change to FSharp.Data.Traceable can break FSharp.Data.Traceable.History.Readers, while a change to FSharp.Data.Traceable.History.Readers can't break FSharp.Data.Traceable.
Position
Below the diagonal: FSharp.Data.Traceable.History.Readers uses a module listed above it, which is the healthy direction.
FSharp.Data.Traceable.History.Readers uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break FSharp.Data.Traceable.History.Readers, while a change to FSharp.Data.Traceable.History.Readers can't break FSharp.Data.Adaptive.
Position
Below the diagonal: FSharp.Data.Traceable.History.Readers uses a module listed above it, which is the healthy direction.
FSharp.Data.Traceable.IndexList uses FSharp.Data.Traceable, so a change to FSharp.Data.Traceable can break FSharp.Data.Traceable.IndexList, while a change to FSharp.Data.Traceable.IndexList can't break FSharp.Data.Traceable.
Position
Below the diagonal: FSharp.Data.Traceable.IndexList uses a module listed above it, which is the healthy direction.
FSharp.Data.Traceable.IndexList uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break FSharp.Data.Traceable.IndexList, while a change to FSharp.Data.Traceable.IndexList can't break FSharp.Data.Adaptive.
Position
Below the diagonal: FSharp.Data.Traceable.IndexList uses a module listed above it, which is the healthy direction.
FSharp.Data.Traceable.IndexListDelta uses FSharp.Data.Traceable, so a change to FSharp.Data.Traceable can break FSharp.Data.Traceable.IndexListDelta, while a change to FSharp.Data.Traceable.IndexListDelta can't break FSharp.Data.Traceable.
Position
Below the diagonal: FSharp.Data.Traceable.IndexListDelta uses a module listed above it, which is the healthy direction.
FSharp.Data.Traceable.IndexListDelta uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break FSharp.Data.Traceable.IndexListDelta, while a change to FSharp.Data.Traceable.IndexListDelta can't break FSharp.Data.Adaptive.
Position
Below the diagonal: FSharp.Data.Traceable.IndexListDelta uses a module listed above it, which is the healthy direction.
CSharp.Data.Adaptive.AdaptiveObjectExtensionHelpers uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break CSharp.Data.Adaptive.AdaptiveObjectExtensionHelpers, while a change to CSharp.Data.Adaptive.AdaptiveObjectExtensionHelpers can't break FSharp.Data.Adaptive.
Position
Below the diagonal: CSharp.Data.Adaptive.AdaptiveObjectExtensionHelpers uses a module listed above it, which is the healthy direction.
CSharp.Data.Adaptive.AdaptiveObjectExtensionHelpers uses CSharp.Data.Adaptive, so a change to CSharp.Data.Adaptive can break CSharp.Data.Adaptive.AdaptiveObjectExtensionHelpers, while a change to CSharp.Data.Adaptive.AdaptiveObjectExtensionHelpers can't break CSharp.Data.Adaptive.
Position
Below the diagonal: CSharp.Data.Adaptive.AdaptiveObjectExtensionHelpers uses a module listed above it, which is the healthy direction.
FSharp.Data.Adaptive.AdaptiveFileSystemUtilities uses FSharp.Data.Traceable, so a change to FSharp.Data.Traceable can break FSharp.Data.Adaptive.AdaptiveFileSystemUtilities, while a change to FSharp.Data.Adaptive.AdaptiveFileSystemUtilities can't break FSharp.Data.Traceable.
Position
Below the diagonal: FSharp.Data.Adaptive.AdaptiveFileSystemUtilities uses a module listed above it, which is the healthy direction.
FSharp.Data.Adaptive.AdaptiveFileSystemUtilities uses FSharp.Data.Adaptive, so a change to FSharp.Data.Adaptive can break FSharp.Data.Adaptive.AdaptiveFileSystemUtilities, while a change to FSharp.Data.Adaptive.AdaptiveFileSystemUtilities can't break FSharp.Data.Adaptive.
Position
Below the diagonal: FSharp.Data.Adaptive.AdaptiveFileSystemUtilities uses a module listed above it, which is the healthy direction.
FSharp.Data.Adaptive.AdaptiveFileSystemUtilities uses FSharp.Data.Adaptive.AValModule, so a change to FSharp.Data.Adaptive.AValModule can break FSharp.Data.Adaptive.AdaptiveFileSystemUtilities, while a change to FSharp.Data.Adaptive.AdaptiveFileSystemUtilities can't break FSharp.Data.Adaptive.AValModule.
Position
Below the diagonal: FSharp.Data.Adaptive.AdaptiveFileSystemUtilities uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 55% · Adequate · gated by X5 ·
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A05:2025 — Injection
11
High / Critical
A01:2025 — Broken Access Control
9
Medium
A03:2025 — Software Supply Chain Failures
8
Medium
Roadmap
Top priorities: Resolve the 9 Outdated finding(s) in Dependency Hygiene; 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; 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.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Resolve the 9 Outdated finding(s) in Dependency Hygiene.
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.
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.
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 — 11
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 — 334
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 — 49
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 6
Something this survey could not settle
from the outside, and which could be critical or serious. Either a control was required and no
positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves
nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean
result. These are excluded from the score rather than awarded a pass, so the number on the cover neither
rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each
one is named under Limitations.
Methodology & how to trust this report
This survey is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. All 38 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.9, the weighted average across measured dimensions.
Every figure here is one of two kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10.
What we checked — 38 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, 346 of 394 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 or a scanner, 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 — 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. Coverage NOT MEASURED: `--collect:"XPlat Code Coverage"` names a data collector that ships in the `coverlet.collector` package, and this repository wires up none — no test project references it and no runsettings declares one. The absence of coverage here is therefore not evidence about the suite or about our analyzer environment: without a collector, `--collect` produces nothing even from a suite that builds and passes. Add a `coverlet.collector` PackageReference to the test project(s) (or commit the Cobertura/OpenCover/lcov report your CI produces) and real coverage will be measured. It is excluded from the score rather than counted as a near-zero defect. You can widen what we reach: add the `coverlet.collector` package to the test projects to enable coverage (or commit the Cobertura/OpenCover/lcov report your CI produces).
D12 Dependency Hygiene — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares npm dependencies as well as NuGet ones — manifest: src/Demo/Fable/package.json — and the counts on this row cover the NuGet side ONLY. This dimension reads dependency currency from `<PackageReference>` elements via `dotnet list package`; it does not read it, so the npm packages declared there were not checked for newer, deprecated or unmaintained releases. Their absence from the counts above is a gap in this analyzer's ecosystem coverage — not a finding that those dependencies are current.
D17 Explicit Debt — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The C# workspace loaded this repository's projects but reported a load failure, and the dead-code reference search is unreliable over a graph that did not load cleanly, so it was skipped. The other debt markers on this row were read; dead symbols were not, and their absence from the score is not a finding that the code has none. First load diagnostic: Failure: Cannot open project 'src/FSharp.Data.Adaptive/FSharp.Data.Adaptive.fsproj' because the file extension '.fsproj' is not associated with a language.
D17 Explicit Debt — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 0 deducted marker(s) and the 0.0/KLoC density on this row were taken over this repository's .NET projects ALONE: .fs (23,495 lines, 99% of production source) went unread, because every marker collector on this path is reached through a C# workspace. D17's marker collectors need a compiler we do not have for that language, so none of its nine marker kinds were read there. The debt in that source is UNMEASURED — its absence from the score above is a gap in this analyzer's language coverage, not a finding that the code carries none.
D21 Naming Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 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 — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. The loaded project set declares no packable project and no `.Contracts` project, so there is no intentionally-exposed surface for API consistency to be judged over.
D24 Comment Value — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Each source language's comment syntax, and the code a comment annotates in it, needs its own proof before D24 judges it. Until then those comments are left unread, not counted as clean.
D30 Dependency Vulnerabilities — measured, with a gap in what it reached — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. `dotnet list package --vulnerable` could not read this solution's dependency graph — it reported an error for at least one project and returned no package data at all (typically a packages.config / non-PackageReference project, which the command cannot read). An unreadable dependency graph is not a clean one; migrate the project(s) to PackageReference to enable this scan. 2 of 3 declared ecosystem(s) (npm,osv) WERE scanned and every vulnerability they reported is included in this result; nuget was not, so this dimension's score covers less than the dependency surface this repository declares, and nothing here is evidence that nuget is free of known-vulnerable dependencies.
AXB2 Runtime readiness — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `npm run` found no package.json in the folder where our sandbox ran it. This is a limit of our sandbox, not of your repository. (rule: no-root-manifest). The renderer reported: the dev server (`npm run start`) exited before it served a page. Likely cause (our sandbox): `npm run` found no package.json in the folder where our sandbox ran it. This is a limit of our sandbox, not of your repository. Last output: "npm error code ENOENT / npm error syscall open / npm error path <repo>/package.json / npm error errno -2 / npm error enoent Could not read package.json: Error: ENOENT: no such file or directory, open '<repo>/package.json' / npm error enoent This is related to npm not being able to find a file. / npm error enoent / npm error A complete log of this run can be found in: <path>" No runtime evidence was gathered.
AXR1 Runtime accessibility — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Render strategy: boot via DevServer (start). the dev server (`npm run start`) exited before it served a page. Likely cause (our sandbox): `npm run` found no package.json in the folder where our sandbox ran it. This is a limit of our sandbox, not of your repository. Last output: "npm error code ENOENT / npm error syscall open / npm error path <repo>/package.json / npm error errno -2 / npm error enoent Could not read package.json: Error: ENOENT: no such file or directory, open '<repo>/package.json' / npm error enoent This is related to npm not being able to find a file. / npm error enoent / npm error A complete log of this run can be found in: <path>" No runtime evidence was gathered.
IC1 Incompleteness & stubs — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, 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.
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.
X27 Collection changed while being enumerated — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.
Limitations & what we did not check
We assess the repository exactly as committed, and only the repository. By design we do not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D11 Test Reliability: Flakiness is inferred from history/markers — we run 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.
D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
D32 Data Compliance (PII/GDPR): PII/GDPR signals are heuristic pattern matches in code — they flag likely handling concerns, not legal compliance, and cannot trace where data actually flows at runtime.
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.
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.
+ 28 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 33 bodies over 15 down to 15 or less in Cyclomatic Complexity — start with ApplyDelta.applyDeltaSingletonStateEff (cyclomatic 31), MapExtImplementation.replaceRange (cyclomatic 30), MapExtImplementation.choose2Helper (cyclomatic 29). — 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 33 together lifts Cyclomatic Complexity from 7.2 to about 10.0/10, projected with the scoring formula itself and assuming each lands exactly at 15.
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.
+ 57 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 3 bodies over 60 down to 60 or less in Cognitive Complexity — start with ChangeableModelListGeneric`4.Update (cognitive 72), IndexList.computeDeltaToArray (cognitive 67), IndexList.computeDeltaToArrayAndGetResult (cognitive 67). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 3 together lifts Cognitive Complexity from 6.2 to about 6.4/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes7.7 / 10Strong✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
Resolve the 9 TooManyMethods finding(s) in God Classes — start with HashCollections.fs (2), MapExt.fs, ASet.fs. — One of this dimension's main actionable groups (9 warning-level).
Resolve the 7 FileTooLong finding(s) in God Classes — start with HashCollections.fs, MapExt.fs, AdaptiveIndexList.fs. — One of this dimension's main actionable groups (7 warning-level).
Resolve the 7 TooManyFunctions finding(s) in God Classes — start with HashCollections.fs (4), MapExt.fs (2), CountingHashSet.fs. — One of this dimension's main actionable groups (7 warning-level).
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.
197 duplicated block group(s) detected. One further row reports members as variants of one another; it aggregates block groups already counted above and is not itself counted. 13 of the 198 are in trees this repository does not ship — vendored, example/demo, project-template, fixture and benchmark code — and are ranked below the shipped groups rather than excluded from them: the duplication there is real and is still counted in this dimension's score. The dimensions that publish a production-file census leave those trees out of theirs, so this count is deliberately drawn over the wider population.
+ 74 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 20 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with HashCollections.fs (6), AList.fs (5), MapExt.fs (4). — One of this dimension's main actionable groups (20 warning-level).
Resolve the 14 Duplicated block (6 lines × 2) finding(s) in Code Duplication — start with MapExt.fs (8), HashCollections.fs (2), AdaptiveHashMap.fs. — One of this dimension's main actionable groups (14 warning-level).
Resolve the 13 Duplicated block (11 lines × 2) finding(s) in Code Duplication — start with HashCollections.fs (4), AdaptiveHashMap.fs (3), MapExt.fs (3). — One of this dimension's main actionable groups (13 warning-level).
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D5 · Coupling10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.
Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.
Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.
What it measures: Whether a class's methods are focused on a single responsibility.
Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.
Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.
Resolve the 1 Low cohesion finding(s) in Cohesion (LCOM4) — start with History.fs. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d6_recommendation.md · top locations in Appendix A, every location in findings.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, not deprecated, and not bloated. Known vulnerabilities are D30's.
Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (capped-linear for deprecation, prerelease and outdated) per KLoC. Known-vulnerable packages are D30's and are not charged here (rubric-2026.11.2). Exhaustive.
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 62 packages use a banned license. ★ DEPTH: this repository's MSBuild projects declare 1 direct `PackageReference`(s), and 61 further package(s) were reached beyond them by closing the graph over nuget.org's own nuspec dependency graph — so a banned licence pulled in only by a dependency's OWN dependencies is inside this verdict. A package whose licence nuget.org could not be asked for is not graded, and version ranges are taken at their lower bound, so this is the closure as that graph states it rather than a restored consumer's exact resolution.
What it measures: Files that change often and are also complex — the riskiest hotspots.
Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.
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.
4 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is src/FSharp.Data.Adaptive/Datastructures/IndexList.fs. Counted over 35 of the 49 production source files in this repository: 7 are under the ~2,400-byte size floor this dimension measures over, and the remaining 7 have no attributable history left to measure.
Off-boarding risk: anonymized user #1
Further sole-owners (lower concentration)
What to do
Resolve the 1 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).
Resolve the 1 Further sole-owners (lower concentration) finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d16_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.
Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.
0 deducted debt markers + unmeasured dead symbols across 192 LoC in the .NET projects (0.0/KLoC) → score 10.0. Dead code not measured: the solution did not load cleanly, so the reference search was skipped. Measured on the .NET source only: .fs (99% of production source) was not read, and carries at least 0 uncounted task marker(s) in 0 file(s).
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. 1 document(s) read across 3 unit(s).
✓ On the Gold path — maintain.
Detailed fixes: d19_recommendation.md.
Do you agree with this assessment?
D27 · Navigability7.8 / 10Strong✓ Tool-verified
What it measures: How far you must trace to follow a call — low indirection and co-located slices read easier.
Method: Call indirection (interface hops, cross-namespace calls, slice-locality scaled) over a sampled set of method invocations, size-aware baseline. Sampled; confidence discounted by symbol-resolution gaps. C# also names each pass-through layer (a class whose every public method only forwards its own parameters to one collaborator) as a located finding; the score is not affected.
Coverage: Slice locality from the first namespace segments, SAMPLED (≤400 methods) — not exhaustive.
96 % of calls cross a namespace and 2 % go through an interface, but 57 % of collaborators are co-located — so following a call takes several hops. Baseline: small — navigation cost is tolerated.
Scattered collaborators
What to do
Resolve the 1 Scattered collaborators finding(s) in Navigability. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d27_recommendation.md · top locations in Appendix A, every location in findings.md.
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, 11 high, 0 medium, 0 low. 11 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
What to do
No action in Static Analysis (SAST) — all 11 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 (11 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. Advisory since rubric-2026.11.2 (CAI decision 0006): every row is a match against a vulnerability database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.
No known-vulnerable dependencies in the 2 ecosystem(s) that were scanned (npm,osv). Partial dependency scan: 2 of 3 declared ecosystem(s) were scanned (npm,osv), and the findings above are real and complete for them. nuget was not scanned (nuget: `dotnet list package --vulnerable` could not read this solution's dependency graph — it reported an error for at least one project and returned no package data at all (typically a packages.config / non-PackageReference project, which the command cannot read). An unreadable dependency graph is not a clean one; migrate the project(s) to PackageReference to enable this scan), so this is not the whole dependency surface and the result is reported at reduced confidence.
✓ On the Gold path — maintain.
Detailed fixes: d30_recommendation.md.
Do you agree with this assessment?
D32 · Data Compliance (PII/GDPR)3.9 / 10Weak✓ Tool-verified
What it measures: Likely personal-data (PII / GDPR) handling concerns — logging or storing data without safeguards.
Method: Heuristic PII/GDPR LEAK scan via semgrep across the repo, using our own ruleset: personal data crossing a boundary it should not — reaching a log/console sink, a URL or query string, or unprotected browser storage. Matches map to severity and a 0-10 wide normalizer. A clean sweep is unscored rather than an unearned 10, and is a statement about the leak paths checked only — this dimension does not inventory the personal data a repository holds (the personal-data map and the C1-C5 compliance cards do that), so it never reports that a repository has no personal-data surface. Reported LOUDLY as a measurement gap if the ruleset is missing from the analyzer image. Exhaustive over the leak paths, advisory-leaning; degrades on parse failure.
Resolve the 9 REDACTED finding(s) in Data Compliance (PII/GDPR) — start with REDACTED (9). — One of this dimension's main actionable groups (9 warning-level).
Detailed fixes: d32_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.
Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.
Every significant source file has living knowledge — recently and meaningfully worked. Counted over 42 of the 49 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.
+ 1 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 3 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED, REDACTED. — One of this dimension's main actionable groups (3 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d36_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Reported apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.
Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. Advisory since rubric-2026.11.2 (CAI decision 0006): the malicious-package feed is a database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.
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 10 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.
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.
Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).
Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.
Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.
Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.
Other · Architecture — Whether the codebase has a recognisable, scale-appropriate structure (a named architectural style, or modular enough for its size) rather than being an ad-hoc ball of mud.
Method: Roslyn plus csproj analysis: architecture style detection (DDD, clean, vertical-slice, CQRS) and structure fitness for repo size. Deterministic.
Other · Code Health — Unreviewed-generation residue: shipped members still throwing NotImplementedException, and placeholder string literals left in non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.
Method: Roslyn syntax scan: NotImplementedException throws and placeholder string literals in non-test, non-generated shipped code. Deterministic, code-shape signature.
Maturity · Maturity — Whether the repository and its projects have a README, and whether it is substantive.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
What to do
Add a build/run (quick start) section to the root README — the first thing a newcomer needs.
Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape — no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document — not evidence that nobody wrote the shape down.
What to do
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Add a C4 context/container diagram (Structurizr, PlantUML or Mermaid) or an architecture.md overview.
Maturity · Maturity — Whether the repository is organised deliberately: production code and tests are set apart in a way its ecosystem or the repository itself declares.
Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.
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 `semgrep --config=auto` plus gitleaks for committed secrets (F# is not a CodeQL language and has no language-specific SAST engine) as a CI step. What was searched, so you can tell an absence from a miss: the 3 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner. — REDACTED:2
`src/FSharp.Data.Adaptive/FSharp.Data.Adaptive.fsproj` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`. — src/FSharp.Data.Adaptive/FSharp.Data.Adaptive.fsproj:90
What to do
Add a SAST step to CI running what this repository's stack ships: `semgrep --config=auto` plus gitleaks for committed secrets (F# is not a CodeQL language and has no language-specific SAST engine) — 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.
Other · Code Health — Whether nullable reference types are enabled and not undermined by heavy `!` suppression.
Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.
0/1 NRT-eligible project(s) enable <Nullable>enable</Nullable> (projects targeting a pre-C#-8 framework are excluded — NRTs aren't available there). NRTs catch a whole class of null-deref bugs at compile time.
What to do
Enable <Nullable>enable</Nullable> across all projects and resolve warnings rather than suppressing with `!`.
Do you agree with this assessment?
Reference — by lens
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Unscored — 2 check(s) recorded observations but carry no score
These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.
SC1 Supply-chain hygiene — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X10 Duplicated predicate — 3 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 — 76 check(s) not relevant to this codebase
These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.
AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
AX1 Captive dependencies — no DI registrations detected
AX2 Stateful singletons — no singleton implementations detected
AX6 Interface segregation — no public interfaces
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX8 Test isolation — no test/production split to check
AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXR1 Runtime accessibility — the dev server (`npm run start`) exited before it served a page. Likely cause (our sandbox): `npm run` found no package.json in the folder where our sandbox ran it. This is a limit of our sandbox, not of your repository. Last output: "npm error code ENOENT / npm error syscall open / npm error path <repo>/package.json / npm error errno -2 / npm error enoent Could not read package.json: Error: ENOENT: no such file or directory, open '<repo>/package.json' / npm error enoent This is related to npm not being able to find a file. / npm error enoent / npm error A complete log of this run can be found in: <path>" No runtime evidence was gathered. This is a statement about this run, not a statement about your application: nothing here says the surface is inaccessible, only that it was never rendered.
C1 Data Protection — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
C2 Access Controls — No access-control surface detected in the analyzed source — no web/app surface to authorize (no HTTP API or web-UI project) and no authorization code at all (no [Authorize]/policies, no imperative guard methods). Access control is therefore N/A here — this is a library/CLI, which is authorized by its CALLER, not by itself. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
C3 Audit Trail — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
C4 Data Retention — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
C5 Data-Subject Rights — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
D10 Test Quality — ~10504 lines of test source are present (.fs) 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 C#/VB .NET solution, but this repository's production source is mostly .fs, which the C#/VB workspace does not load — the projects that loaded are an immaterial minority, so solution shape was not assessed for this repository. Not scored — this is a gap in the analyzer's reach, not a verdict about this repository.
D20 ADR Quality — N/A — ADRs are expected on deployable products with a user-facing host, not consumed libraries; no ADR log is required here.
D21 Naming Consistency — Naming consistency is measured on C# and TypeScript only; F# not measured.
D22 Internal API Consistency — No intentionally-exposed public API to evaluate for consistency.
D23 Boundary Type-Coupling — single shared-core project — no cross-context coupling to assess
D24 Comment Value — D24 reads C#, Visual Basic, TypeScript and JavaScript comments only; comments in this repository's .fs source were not judged.
D25 ADR Conformance — no ADRs to check
D26 Project Cohesion — This repository is one project, `CSharpInterop` (192 LoC, 2 public types across 1 namespaces), within the size bounds. Not scored: a single unit of this size gives project cohesion nothing to grade.
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.
D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D7 Architectural Integrity — no checkable ADRs and no dependency cycles — architectural integrity not assessed
D8 Code Coverage — Coverage not measured — no coverage collector is wired up
DM1 Domain Modelling — not scored — this repository shows only 1 of the 3 signals this lens looks for (3 value object(s))
ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
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
M4 Documentation accuracy — Not applicable: the 1 current-state document(s) make no claim of a kind M4 checks.
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 — this isn't a service/API/worker
P8 Schema migrations — no EF Core usage detected
P9 Domain vs controller coverage — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
PF1 Benchmark discipline — Performance is assessed only for perf-relevant repos — a packaged library, one that ships benchmarks, or one already using allocation-aware APIs. This repo isn't one, so the Performance lens is not applicable and is excluded from the score.
PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
PF3 Async & latency hygiene — Performance is assessed only for perf-relevant repos — a packaged library, one that ships benchmarks, or one already using allocation-aware APIs. This repo isn't one, so the Performance lens is not applicable and is excluded from the score.
S1 Web-Security Posture — No web surface detected in the analyzed source — no HTTP API or web-UI project (no controllers/minimal-API endpoints, no Razor/Blazor views) and no web middleware (HTTPS redirection, HSTS, security headers, cookies). Transport security, security headers, secure cookies, CSRF/input-validation and middleware-order controls are therefore N/A here — this is a library/CLI/worker, not a web app. Crypto hygiene was still checked and found nothing to flag. If this codebase becomes web-facing, the dimension reactivates automatically.
X1 Async correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X12 Unreachable branch — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X13 Undrained process stream — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X14 Bypassable address classification — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X16 Unfloored truncation loop — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X17 Uncapped recursion over a caller-supplied document — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X18 Disposal-pattern correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X19 Unrestored process-global state — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X2 Cancellation propagation — no async method does work a token could cancel
X20 Mistyped argument guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X21 Side-effecting pattern guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X22 Contradicted release guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X23 Unguarded diagnostic materialisation — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X24 Document value interpolated into markup unescaped — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X25 Inert configuration knob — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X26 Unsynchronised callback handoff — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X27 Collection changed while being enumerated — X27 reached only 1% of this repository's production lines — fsharp (23,495 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X28 Index access outside its own emptiness guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X29 Per-element action decided by a fixed element — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X3 Exception handling — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X30 Support guard that admits what it rejects — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X32 Type resolved by simple name across every loaded assembly — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X4 Structured logging — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
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 (7 lines × 2) src/CSharp.Data.Adaptive/AList.fs:79— src/CSharp.Data.Adaptive/AList.fs:79-85 | src/CSharp.Data.Adaptive/ASet.fs:94-100 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `src/CSharp.Data.Adaptive/AList.fs:79` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) src/CSharp.Data.Adaptive/AList.fs:87— src/CSharp.Data.Adaptive/AList.fs:87-93 | src/CSharp.Data.Adaptive/ASet.fs:102-108 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `src/CSharp.Data.Adaptive/AList.fs:87` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) src/CSharp.Data.Adaptive/AList.fs:144— src/CSharp.Data.Adaptive/AList.fs:144-150 | src/CSharp.Data.Adaptive/ASet.fs:165-171 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `src/CSharp.Data.Adaptive/AList.fs:144` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) src/CSharp.Data.Adaptive/AList.fs:153— src/CSharp.Data.Adaptive/AList.fs:153-159 | src/CSharp.Data.Adaptive/ASet.fs:174-180 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `src/CSharp.Data.Adaptive/AList.fs:153` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) src/CSharp.Data.Adaptive/AList.fs:266— src/CSharp.Data.Adaptive/AList.fs:266-272 | src/CSharp.Data.Adaptive/AList.fs:274-280 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:186— src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:186-192 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:195-201 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:204— src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:204-210 | src/FSharp.Data.Adaptive/Traceable/CountingHashSet.fs:276-282 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:697— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:697-703 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:722-728 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1317— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1317-1323 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2756-2762 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2404— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2404-2410 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2427-2433 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2934— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2934-2940 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2945-2951 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3586— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3586-3592 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3594-3600 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3965— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3965-3971 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3973-3979 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:448— src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:448-454 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:466-472 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:346— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:346-352 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:405-411 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:821— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:821-827 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:903-909 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:48— src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:48-54 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:34-40 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:494— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:494-500 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:506-512 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1426— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1426-1432 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1484-1490 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi:218— src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi:218-224 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fsi:309-315 — 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 (6 lines × 2) src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:43— src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:43-49 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:43-48 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:43` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1470— src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1470-1475 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:1563-1568 — 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 (6 lines × 2) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1287— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1287-1292 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1396-1401 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1287` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1446— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1446-1451 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2582-2587 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1446` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:543— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:543-548 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:566-571 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:543` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:767— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:767-772 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2187-2192 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:868— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:868-873 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:952-957 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:876— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:876-881 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:960-965 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:884— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:884-889 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:968-973 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:892— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:892-897 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:976-981 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1081— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1081-1086 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1110-1115 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2299— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2299-2304 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2308-2314 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) src/FSharp.Data.Adaptive/ShallowEquality.fs:219— src/FSharp.Data.Adaptive/ShallowEquality.fs:219-224 | src/FSharp.Data.Adaptive/ShallowEquality.fs:360-365 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi:58— src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi:58-63 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fsi:67-72 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi:58` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) src/FSharp.Data.Adaptive/AdaptifyHelpers.fs:99— src/FSharp.Data.Adaptive/AdaptifyHelpers.fs:99-109 | src/FSharp.Data.Adaptive/AdaptifyHelpers.fs:256-266 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:196— src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:196-206 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:186-196 — 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 (11 lines × 2) src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:287— src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:287-297 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:286-296 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:287` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:951— src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:951-961 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1006-1016 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1237— src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1237-1247 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1251-1261 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1623— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1623-1633 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1663-1673 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1641— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1641-1651 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1679-1689 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2844— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2844-2854 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2883-2893 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2863— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2863-2873 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2898-2908 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1577— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1577-1587 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1609-1619 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2028— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2028-2038 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2053-2063 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:118— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:118-128 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:359-369 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) src/Demo/Scratch/ABag.fs:290— src/Demo/Scratch/ABag.fs:290-300 | src/Demo/Scratch/ABag.fs:335-345 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Demo/Scratch/ABag.fs:290` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) src/CSharp.Data.Adaptive/HashSet.fs:9— src/CSharp.Data.Adaptive/HashSet.fs:9-18 | src/CSharp.Data.Adaptive/IndexList.fs:8-17 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/CSharp.Data.Adaptive/HashSet.fs:7` calls `CompiledName` and `src/CSharp.Data.Adaptive/IndexList.fs:5` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (10 lines × 2) src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:845— src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:845-854 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:758-767 — 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) src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1096— src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1096-1105 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1140-1149 — 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) src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:985— src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:985-994 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1050-1059 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:985` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) src/FSharp.Data.Adaptive/CollectionExtensions.fs:113— src/FSharp.Data.Adaptive/CollectionExtensions.fs:113-122 | src/FSharp.Data.Adaptive/CollectionExtensions.fs:177-186 — 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) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1703— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1703-1713 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2921-2930 — 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) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:4247— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:4247-4256 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:4257-4266 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:4247` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (10 lines × 2) src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:509— src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:509-518 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:533-542 — 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) src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:987— src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:987-996 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:997-1006 — 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) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1091— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1091-1100 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1120-1129 — 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) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1440— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1440-1449 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1498-1507 — 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) src/FSharp.Data.Adaptive/Traceable/CountingHashSet.fs:304— src/FSharp.Data.Adaptive/Traceable/CountingHashSet.fs:304-313 | src/FSharp.Data.Adaptive/Traceable/CountingHashSet.fs:328-337 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/Traceable/CountingHashSet.fs:304` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) REDACTED:98— REDACTED:98-107 | REDACTED:115-124 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) src/CSharp.Data.Adaptive/AList.fs:9— src/CSharp.Data.Adaptive/AList.fs:9-17 | src/CSharp.Data.Adaptive/ASet.fs:9-17 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (9 lines × 2) src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1659— src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1659-1667 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:1806-1814 — 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) src/FSharp.Data.Adaptive/CollectionExtensions.fs:678— src/FSharp.Data.Adaptive/CollectionExtensions.fs:678-686 | src/FSharp.Data.Adaptive/CollectionExtensions.fs:720-728 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) src/FSharp.Data.Adaptive/Core/AdaptiveObject.fs:231— src/FSharp.Data.Adaptive/Core/AdaptiveObject.fs:231-239 | src/FSharp.Data.Adaptive/Core/Transaction.fs:58-67 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (9 lines × 2) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:59— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:59-67 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:103-111 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1235— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1235-1243 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1279-1287 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1235` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:557— src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:557-565 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:580-588 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2143— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2143-2151 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2567-2575 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2153— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2153-2162 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2577-2585 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) src/FSharp.Data.Adaptive/AdaptifyHelpers.fs:61— src/FSharp.Data.Adaptive/AdaptifyHelpers.fs:61-69 | src/FSharp.Data.Adaptive/AdaptifyHelpers.fs:147-155 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) src/Demo/Fable/Program.fs:10— src/Demo/Fable/Program.fs:10-18 | src/Demo/Fable/Program.fs:22-30 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Demo/Fable/Program.fs:10` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) src/FSharp.Data.Adaptive/AdaptiveIndexList/ChangeableIndexList.fs:147— src/FSharp.Data.Adaptive/AdaptiveIndexList/ChangeableIndexList.fs:147-154 | src/FSharp.Data.Adaptive/AdaptiveIndexList/ChangeableIndexList.fs:162-169 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1055— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1055-1062 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2362-2369 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1673— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1673-1681 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2893-2900 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2418— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2418-2425 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2441-2448 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:220— src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:220-227 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:233-240 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:769— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:769-776 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:805-812 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:769` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:844— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:844-851 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:926-933 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:856— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:856-863 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:938-945 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1297— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1297-1304 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1325-1332 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1297` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2347— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2347-2355 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2486-2493 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:832— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:832-839 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:914-921 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:517— src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:517-521 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:525-529 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:517` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 2) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1395— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1395-1399 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2581-2585 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1445— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1445-1449 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1557-1562 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2456— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2456-2460 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2563-2567 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2456` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 2) src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1102— src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1102-1106 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1117-1121 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1313— src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1313-1317 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1346-1350 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1091— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1091-1095 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1105-1110 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1542— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1542-1546 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1559-1563 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:305— src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:305-309 | src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:387-391 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) src/Demo/Scratch/ABag.fs:246— src/Demo/Scratch/ABag.fs:246-250 | src/Demo/Scratch/ABag.fs:371-375 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) src/Demo/Fable/Program.fs:79— src/Demo/Fable/Program.fs:79-83 | src/Demo/Fable/Program.fs:84-88 — 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.
TooManyMethods: MapExt`2 src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2867— TooManyMethods — 132 methods. The bar is 30 methods; this is 102 over it, 4.40× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: FSharpHashSet`1 src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3255— TooManyMethods — 73 methods. The bar is 30 methods; this is 43 over it, 2.43× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: AdaptiveHashSet src/CSharp.Data.Adaptive/ASet.fs:29— TooManyMethods — 68 methods. The bar is 30 methods; this is 38 over it, 2.27× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: FSharpHashMap`2 src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3682— TooManyMethods — 66 methods. The bar is 30 methods; this is 36 over it, 2.20× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: IndexList`1 src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:40— TooManyMethods — 65 methods. The bar is 30 methods; this is 35 over it, 2.17× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: AdaptiveIndexList src/CSharp.Data.Adaptive/AList.fs:29— TooManyMethods — 64 methods. The bar is 30 methods; this is 34 over it, 2.13× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: AdaptiveHashMap src/CSharp.Data.Adaptive/AMap.fs:29— TooManyMethods — 50 methods. The bar is 30 methods; this is 20 over it, 1.67× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: CountingHashSet`1 src/FSharp.Data.Adaptive/Traceable/CountingHashSet.fs:30— TooManyMethods — 40 methods. The bar is 30 methods; this is 10 over it, 1.33× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: ChangeableIndexList`1 src/FSharp.Data.Adaptive/AdaptiveIndexList/ChangeableIndexList.fs:8— TooManyMethods — 31 methods. The bar is 30 methods; this is 1 over it, 1.03× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
FileTooLong: Datastructures/HashCollections.fs src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs— FileTooLong — 3649 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3149 over it, 7.30× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: Datastructures/MapExt.fs src/FSharp.Data.Adaptive/Datastructures/MapExt.fs— FileTooLong — 3206 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2706 over it, 6.41× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: AdaptiveIndexList/AdaptiveIndexList.fs src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs— FileTooLong — 1373 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 78 functions. The bar is 500 significant lines; this is 873 over it, 2.75× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: AdaptiveHashSet/AdaptiveHashSet.fs src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs— FileTooLong — 1215 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 54 functions. The bar is 500 significant lines; this is 715 over it, 2.43× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: AdaptiveHashMap/AdaptiveHashMap.fs src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs— FileTooLong — 1201 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 57 functions. The bar is 500 significant lines; this is 701 over it, 2.40× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: Datastructures/IndexList.fs src/FSharp.Data.Adaptive/Datastructures/IndexList.fs— FileTooLong — 1026 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 106 functions. The bar is 500 significant lines; this is 526 over it, 2.05× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: FSharp.Data.Adaptive/CollectionExtensions.fs src/FSharp.Data.Adaptive/CollectionExtensions.fs— FileTooLong — 639 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 139 over it, 1.28× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
TooManyFunctions: MapExt src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:3757— TooManyFunctions — 97 functions. The bar is 30 functions; this is 67 over it, 3.23× the bar. The counted members are a module's functions — a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility.
TooManyFunctions: MapExtImplementation src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:7— TooManyFunctions — 86 functions. The bar is 30 functions; this is 56 over it, 2.87× the bar. The counted members are a module's functions — a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility.
TooManyFunctions: HashMapModule src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:4285— TooManyFunctions — 55 functions. The bar is 30 functions; this is 25 over it, 1.83× the bar. The counted members are a module's functions — a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility.
TooManyFunctions: MapNode src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1882— TooManyFunctions — 40 functions. The bar is 30 functions; this is 10 over it, 1.33× the bar. The counted members are a module's functions — a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility.
TooManyFunctions: HashSetModule src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:4115— TooManyFunctions — 40 functions. The bar is 30 functions; this is 10 over it, 1.33× the bar. The counted members are a module's functions — a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility.
TooManyFunctions: CountingHashSetModule src/FSharp.Data.Adaptive/Traceable/CountingHashSet.fs:398— TooManyFunctions — 37 functions. The bar is 30 functions; this is 7 over it, 1.23× the bar. The counted members are a module's functions — a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility.
TooManyFunctions: MapLinked src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:414— TooManyFunctions — 35 functions. The bar is 30 functions; this is 5 over it, 1.17× the bar. The counted members are a module's functions — a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility.
Duplicated block (12 lines × 2) src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:542— src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:542-553 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:557-568 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:542` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:227— src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:227-238 | src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:256-267 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:391— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:391-402 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:801-812 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) src/FSharp.Data.Adaptive/ShallowEquality.fs:155— src/FSharp.Data.Adaptive/ShallowEquality.fs:155-167 | src/FSharp.Data.Adaptive/ShallowEquality.fs:203-214 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) src/FSharp.Data.Adaptive/Traceable/History.fs:448— src/FSharp.Data.Adaptive/Traceable/History.fs:448-459 | src/FSharp.Data.Adaptive/Traceable/History.fs:481-492 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/Traceable/History.fs:448` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/FSharp.Data.Adaptive/Traceable/History.fs:493` calls `Invoke` and `src/FSharp.Data.Adaptive/Traceable/History.fs:460` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (15 lines × 2) src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:569— src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:569-583 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:587-601 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:569` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15 lines × 2) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1280— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1280-1294 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1308-1322 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 2) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2752— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2752-2766 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2834-2848 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2752` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15 lines × 2) src/Demo/Scratch/Observable.fs:63— src/Demo/Scratch/Observable.fs:63-77 | src/Demo/Scratch/Observable.fs:151-165 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Demo/Scratch/Observable.fs:63` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (17 lines × 2) src/FSharp.Data.Adaptive/AdaptifyHelpers.fs:227— src/FSharp.Data.Adaptive/AdaptifyHelpers.fs:227-243 | src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:430-446 — 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 (17 lines × 2) src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1617— src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1617-1633 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:1852-1868 — 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 (17 lines × 2) src/FSharp.Data.Adaptive/Traceable/History.fs:212— src/FSharp.Data.Adaptive/Traceable/History.fs:212-229 | src/FSharp.Data.Adaptive/Traceable/History.fs:244-260 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16 lines × 2) src/FSharp.Data.Adaptive/AdaptifyHelpers.fs:26— src/FSharp.Data.Adaptive/AdaptifyHelpers.fs:26-41 | src/FSharp.Data.Adaptive/AdaptifyHelpers.fs:78-93 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16 lines × 2) src/FSharp.Data.Adaptive/AdaptiveHashMap/ChangeableHashMap.fs:50— src/FSharp.Data.Adaptive/AdaptiveHashMap/ChangeableHashMap.fs:50-65 | src/FSharp.Data.Adaptive/AdaptiveIndexList/ChangeableIndexList.fs:38-53 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/AdaptiveHashMap/ChangeableHashMap.fs:50` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (16 lines × 2) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1745— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1745-1760 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2969-2984 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:560— src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:560-573 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:579-592 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:605— src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:605-618 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:861-874 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:605` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14 lines × 2) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1913— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1913-1926 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1954-1967 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1913` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13–14 lines × 2) src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:525— src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:525-538 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:543-555 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:525` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (13–14 lines × 2) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2271— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2271-2283 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2360-2373 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (13–14 lines × 2) src/FSharp.Data.Adaptive/ShallowEquality.fs:276— src/FSharp.Data.Adaptive/ShallowEquality.fs:276-288 | src/FSharp.Data.Adaptive/ShallowEquality.fs:324-337 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (13 lines × 2) src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:830— src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:830-842 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:743-755 — 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 (13 lines × 2) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2473— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2473-2485 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2514-2526 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (13 lines × 2) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2492— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2492-2504 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2531-2543 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 3) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2649— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2649-2655 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2715-2721 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2771-2777 — 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 (7 lines × 3) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3229— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3229-3235 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2756-2762 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2838-2844 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (7 lines × 3) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3916— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3916-3922 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3924-3930 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3932-3938 — 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.
IndexList`1.GetSlice (cognitive 17) src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:93— IndexList`1.GetSlice has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (5 pts) (nesting depth added 8). 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. This shape REPEATS in the file: one other method here (IndexList`1.GetSlice) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
IndexList`1.GetSlice (cognitive 17) src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:113— IndexList`1.GetSlice has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (5 pts) (nesting depth added 8). 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. This shape REPEATS in the file: one other method here (IndexList`1.GetSlice) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Duplicated block (22 lines × 3) src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:173— src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:173-194 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:163-184 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:172-193 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:173` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (22 lines × 3) src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:210— src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:210-231 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:200-221 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:209-230 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:210` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (18 lines × 2) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1771— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1771-1788 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2995-3012 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (18 lines × 2) src/Demo/Scratch/ABag.fs:305— src/Demo/Scratch/ABag.fs:305-322 | src/Demo/Scratch/ABag.fs:350-367 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Demo/Scratch/ABag.fs:305` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14 lines × 3) src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:253— src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:253-266 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:243-256 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:252-265 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:253` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14 lines × 3) src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:655— src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:655-668 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:703-716 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:751-764 — 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 (12 lines × 4) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:897— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:897-908 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1915-1926 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1956-1967 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1987-1998 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (12 lines × 4) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1782— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1782-1793 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1830-1841 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3006-3017 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3055-3066 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (12 lines × 3) src/FSharp.Data.Adaptive/AdaptifyHelpers.fs:235— src/FSharp.Data.Adaptive/AdaptifyHelpers.fs:235-246 | src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:354-365 | src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:438-449 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (12 lines × 3) src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:510— src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:510-521 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:475-486 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:476-487 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:510` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10–12 lines × 2) src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:464— src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:464-475 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:481-490 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:481` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (10–12 lines × 2) src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:12— src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:12-21 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi:12-23 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi:29` calls `CompilationRepresentation` and `src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:27` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (10–11 lines × 2) src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1107— src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1107-1116 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1152-1162 — 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–11 lines × 2) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2122— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2122-2132 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2547-2556 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2122` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 3) src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:268— src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:268-277 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:258-268 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:267-276 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:268` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 3) src/FSharp.Data.Adaptive/Datastructures/IndexListDelta.fs:150— src/FSharp.Data.Adaptive/Datastructures/IndexListDelta.fs:150-159 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2743-2752 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:3726-3735 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (9 lines × 3) src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:719— src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:719-727 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2707-2715 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:3690-3698 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (9 lines × 3) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2269— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2269-2277 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2345-2353 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2358-2366 — 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 (7–9 lines × 2) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:280— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:280-288 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:291-297 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7–9 lines × 2) src/FSharp.Data.Adaptive/Utilities/PriorityQueue.fs:178— src/FSharp.Data.Adaptive/Utilities/PriorityQueue.fs:178-186 | src/FSharp.Data.Adaptive/Utilities/PriorityQueue.fs:239-245 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 3) src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1492— src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1492-1499 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1477-1482 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:1570-1577 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (6 lines × 3) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2060— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2060-2065 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2080-2085 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2100-2105 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2060` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 3) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:566— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:566-570 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1296-1300 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1324-1328 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:566` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 3) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2658— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2658-2662 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2724-2728 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2780-2784 — 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 (11–12 lines × 2) src/Demo/Scratch/ABag.fs:188— src/Demo/Scratch/ABag.fs:188-199 | src/Demo/Scratch/ABag.fs:207-217 — 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) src/Demo/Scratch/ABag.fs:557— src/Demo/Scratch/ABag.fs:557-567 | src/Demo/Scratch/ABag.fs:604-615 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Demo/Scratch/ABag.fs:557` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9–10 lines × 2) src/Demo/Scratch/ABag.fs:151— src/Demo/Scratch/ABag.fs:151-160 | src/Demo/Scratch/ABag.fs:168-176 — 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) src/Demo/Scratch/ABag.fs:276— src/Demo/Scratch/ABag.fs:276-285 | src/Demo/Scratch/ABag.fs:322-330 — 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.
ApplyDelta.applyDeltaSingletonStateEff (cyclomatic 31) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2281— ApplyDelta.applyDeltaSingletonStateEff has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
MapExtImplementation.replaceRange (cyclomatic 30) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1888— MapExtImplementation.replaceRange has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
MapExtImplementation.choose2Helper (cyclomatic 29) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2502— MapExtImplementation.choose2Helper has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
ApplyDelta.applyDeltaSingleEff (cyclomatic 27) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2371— ApplyDelta.applyDeltaSingleEff has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
MapExtImplementation.computeDelta (cyclomatic 26) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1984— MapExtImplementation.computeDelta has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
MapExtImplementation.sliceEx (cyclomatic 20) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1670— MapExtImplementation.sliceEx has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
SetNode.union (cyclomatic 20) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1316— SetNode.union has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 7 other methods here (SetNode.xor, SetNode.difference, SetNode.computeDelta, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
SetNode.intersect (cyclomatic 20) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1371— SetNode.intersect has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
SetNode.xor (cyclomatic 20) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1477— SetNode.xor has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 7 other methods here (SetNode.union, SetNode.difference, SetNode.computeDelta, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
SetNode.difference (cyclomatic 20) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1532— SetNode.difference has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 7 other methods here (SetNode.union, SetNode.xor, SetNode.computeDelta, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
SetNode.computeDelta (cyclomatic 20) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1589— SetNode.computeDelta has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 7 other methods here (SetNode.union, SetNode.xor, SetNode.difference, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
SetNode.applyDelta (cyclomatic 20) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1742— SetNode.applyDelta has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (MapNode.applyDelta) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
MapNode.unionWithV (cyclomatic 20) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2632— MapNode.unionWithV has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 7 other methods here (SetNode.union, SetNode.xor, SetNode.difference, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
MapNode.unionWith (cyclomatic 20) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2698— MapNode.unionWith has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 7 other methods here (SetNode.union, SetNode.xor, SetNode.difference, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
MapNode.union (cyclomatic 20) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2755— MapNode.union has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 7 other methods here (SetNode.union, SetNode.xor, SetNode.difference, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
MapNode.computeDelta (cyclomatic 20) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2810— MapNode.computeDelta has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 7 other methods here (SetNode.union, SetNode.xor, SetNode.difference, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
MapNode.applyDelta (cyclomatic 20) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2966— MapNode.applyDelta has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (SetNode.applyDelta) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
IndexListModule.alterAt (cyclomatic 19) src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:944— IndexListModule.alterAt has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
MapExtImplementation.changeWithNeighbours (cyclomatic 19) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1821— MapExtImplementation.changeWithNeighbours has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ApplyDelta.applyDeltaSingletonState (cyclomatic 19) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2099— ApplyDelta.applyDeltaSingletonState has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
SetNode.overlaps (cyclomatic 19) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1266— SetNode.overlaps has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
SetNode.intersectionCount (cyclomatic 19) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1425— SetNode.intersectionCount has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
MapNode.choose2V (cyclomatic 19) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2450— MapNode.choose2V has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
MapNode.intersect (cyclomatic 19) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2557— MapNode.intersect has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
DeltaOperationList.ofArrayMyers (cyclomatic 17) src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:73— DeltaOperationList.ofArrayMyers 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.
MapExtImplementation.changeV (cyclomatic 17) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:747— MapExtImplementation.changeV has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This shape REPEATS in the file: 2 other methods here (MapExtImplementation.change, ApplyDelta.applyDeltaSingle) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
MapExtImplementation.change (cyclomatic 17) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:783— MapExtImplementation.change has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This shape REPEATS in the file: 2 other methods here (MapExtImplementation.changeV, ApplyDelta.applyDeltaSingle) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
ApplyDelta.applyDeltaSingle (cyclomatic 17) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2161— ApplyDelta.applyDeltaSingle has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This shape REPEATS in the file: 2 other methods here (MapExtImplementation.changeV, MapExtImplementation.change) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
ChangeableModelListGeneric`4.Update (cyclomatic 16) src/FSharp.Data.Adaptive/AdaptifyHelpers.fs:157— ChangeableModelListGeneric`4.Update 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.
MapExtImplementation.choose2 (cyclomatic 16) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2584— MapExtImplementation.choose2 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.
SetNode.subset (cyclomatic 16) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1217— SetNode.subset has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
MapNode.alterV (cyclomatic 16) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1890— MapNode.alterV 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. This shape REPEATS in the file: one other method here (MapNode.alter) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
MapNode.alter (cyclomatic 16) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1931— MapNode.alter 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. This shape REPEATS in the file: one other method here (MapNode.alterV) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
ChangeableModelListGeneric`4.Update (cognitive 72) src/FSharp.Data.Adaptive/AdaptifyHelpers.fs:157— ChangeableModelListGeneric`4.Update has cognitive complexity 72 (threshold 15). Drivers by points: if/else 14 (44 pts), loops 5 (24 pts), match/switch 1 (4 pts) (nesting depth added 52). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
IndexList.computeDeltaToArray (cognitive 67) src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:295— IndexList.computeDeltaToArray has cognitive complexity 67 (threshold 15). Drivers by points: if/else 13 (39 pts), loops 5 (24 pts), match/switch 1 (4 pts) (nesting depth added 48). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (IndexList.computeDeltaToArrayAndGetResult) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
IndexList.computeDeltaToArrayAndGetResult (cognitive 67) src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:375— IndexList.computeDeltaToArrayAndGetResult has cognitive complexity 67 (threshold 15). Drivers by points: if/else 13 (39 pts), loops 5 (24 pts), match/switch 1 (4 pts) (nesting depth added 48). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (IndexList.computeDeltaToArray) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
MapExtImplementation.replaceRange (cognitive 60) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1888— MapExtImplementation.replaceRange has cognitive complexity 60 (threshold 15). Drivers by points: match/switch 9 (33 pts), if/else 15 (25 pts), boolean chains 2 (nesting depth added 34). 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.
WeakOutputSet.Remove (cognitive 47) src/FSharp.Data.Adaptive/Core/Core.fs:335— WeakOutputSet.Remove has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (42 pts), loops 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
MapExtImplementation.computeDelta (cognitive 47) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1984— MapExtImplementation.computeDelta has cognitive complexity 47 (threshold 15). Drivers by points: if/else 22 (30 pts), match/switch 5 (17 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MapExtImplementation.choose2Helper (cognitive 47) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2502— MapExtImplementation.choose2Helper has cognitive complexity 47 (threshold 15). Drivers by points: match/switch 11 (36 pts), if/else 9 (11 pts) (nesting depth added 27). 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.
ApplyDelta.applyDeltaSingletonStateEff (cognitive 47) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2281— ApplyDelta.applyDeltaSingletonStateEff has cognitive complexity 47 (threshold 15). Drivers by points: match/switch 12 (36 pts), if/else 9 (11 pts) (nesting depth added 26). 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.
MapExtImplementation.sliceEx (cognitive 45) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1670— MapExtImplementation.sliceEx has cognitive complexity 45 (threshold 15). Drivers by points: if/else 28 (44 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ApplyDelta.applyDeltaSingleEff (cognitive 39) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2371— ApplyDelta.applyDeltaSingleEff has cognitive complexity 39 (threshold 15). Drivers by points: match/switch 10 (28 pts), if/else 9 (11 pts) (nesting depth added 20). 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.
IndexListEnumerator`1.Collect (cognitive 38) src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:682— IndexListEnumerator`1.Collect has cognitive complexity 38 (threshold 15). Drivers by points: if/else 19 (37 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SetNode.applyDelta (cognitive 38) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1742— SetNode.applyDelta has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (27 pts), match/switch 4 (11 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. This shape REPEATS in the file: one other method here (MapNode.applyDelta) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
MapNode.applyDelta (cognitive 38) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2966— MapNode.applyDelta has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (27 pts), match/switch 4 (11 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. This shape REPEATS in the file: one other method here (SetNode.applyDelta) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Transaction.Commit (cognitive 36) src/FSharp.Data.Adaptive/Core/Transaction.fs:164— Transaction.Commit has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 2 (9 pts), error handling 1 (5 pts), loops 2 (4 pts) (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
SetNode.alter (cognitive 34) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:872— SetNode.alter has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17 (32 pts), match/switch 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SetNode.union (cognitive 34) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1316— SetNode.union has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (23 pts), match/switch 4 (11 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (SetNode.xor, SetNode.difference, SetNode.computeDelta, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
SetNode.intersect (cognitive 34) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1371— SetNode.intersect has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (22 pts), match/switch 4 (11 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SetNode.xor (cognitive 34) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1477— SetNode.xor has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (23 pts), match/switch 4 (11 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (SetNode.union, SetNode.difference, SetNode.computeDelta, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
SetNode.difference (cognitive 34) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1532— SetNode.difference has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (23 pts), match/switch 4 (11 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (SetNode.union, SetNode.xor, SetNode.computeDelta, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
SetNode.computeDelta (cognitive 34) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1589— SetNode.computeDelta has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (23 pts), match/switch 4 (11 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (SetNode.union, SetNode.xor, SetNode.difference, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
MapNode.unionWithV (cognitive 34) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2632— MapNode.unionWithV has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (23 pts), match/switch 4 (11 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (SetNode.union, SetNode.xor, SetNode.difference, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
MapNode.unionWith (cognitive 34) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2698— MapNode.unionWith has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (23 pts), match/switch 4 (11 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (SetNode.union, SetNode.xor, SetNode.difference, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
MapNode.union (cognitive 34) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2755— MapNode.union has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (23 pts), match/switch 4 (11 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (SetNode.union, SetNode.xor, SetNode.difference, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
MapNode.computeDelta (cognitive 34) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2810— MapNode.computeDelta has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (23 pts), match/switch 4 (11 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (SetNode.union, SetNode.xor, SetNode.difference, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
IndexListModule.alterAt (cognitive 33) src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:944— IndexListModule.alterAt has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 6 (20 pts), if/else 6 (12 pts), boolean chains 1 (nesting depth added 20). 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.
MapExtImplementation.changeWithNeighbours (cognitive 33) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1821— MapExtImplementation.changeWithNeighbours has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 5 (14 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MapNode.choose2V (cognitive 33) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2450— MapNode.choose2V has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (22 pts), match/switch 4 (11 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MapNode.intersect (cognitive 33) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2557— MapNode.intersect has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (21 pts), match/switch 4 (11 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MapExtImplementation.choose2 (cognitive 32) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2584— MapExtImplementation.choose2 has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 4 (16 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.
DeltaOperationList.ofArrayMyers (cognitive 31) src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:73— DeltaOperationList.ofArrayMyers has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 6, loops 3 (6 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
WeakOutputSet.Consume (cognitive 30) src/FSharp.Data.Adaptive/Core/Core.fs:397— WeakOutputSet.Consume has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 3 (8 pts), loops 2 (4 pts) (nesting depth added 19). 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.
IndexListDeltaEnumerator`1.MoveNext (cognitive 30) src/FSharp.Data.Adaptive/Datastructures/IndexListDelta.fs:107— IndexListDeltaEnumerator`1.MoveNext has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
MapExtMappingEnumerator`3.MoveNext (cognitive 30) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2700— MapExtMappingEnumerator`3.MoveNext has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (MapExtEnumerator`2.MoveNext) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
MapExtEnumerator`2.MoveNext (cognitive 30) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:3683— MapExtEnumerator`2.MoveNext has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (MapExtMappingEnumerator`3.MoveNext) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
SetNode.tryRemove (cognitive 30) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:964— SetNode.tryRemove has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (28 pts), match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MapNode.alterV (cognitive 30) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1890— MapNode.alterV has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 5 (14 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (MapNode.alter) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
MapNode.alter (cognitive 30) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1931— MapNode.alter has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 5 (14 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (MapNode.alterV) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
ApplyDelta.applyDeltaSingletonState (cognitive 29) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2099— ApplyDelta.applyDeltaSingletonState has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 6 (18 pts), if/else 9 (11 pts) (nesting depth added 14). 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.
SetNode.overlaps (cognitive 29) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1266— SetNode.overlaps has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 4 (11 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
SetNode.intersectionCount (cognitive 29) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1425— SetNode.intersectionCount has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 4 (11 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
MapNode.tryRemove (cognitive 27) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2001— MapNode.tryRemove has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 4 (12 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MapExtImplementation.changeV (cognitive 25) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:747— MapExtImplementation.changeV has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 9 (11 pts) (nesting depth added 11). 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. This shape REPEATS in the file: 2 other methods here (MapExtImplementation.change, ApplyDelta.applyDeltaSingle) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
MapExtImplementation.change (cognitive 25) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:783— MapExtImplementation.change has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 9 (11 pts) (nesting depth added 11). 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. This shape REPEATS in the file: 2 other methods here (MapExtImplementation.changeV, ApplyDelta.applyDeltaSingle) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
ApplyDelta.applyDeltaSingle (cognitive 25) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2161— ApplyDelta.applyDeltaSingle has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 9 (11 pts) (nesting depth added 11). 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. This shape REPEATS in the file: 2 other methods here (MapExtImplementation.changeV, MapExtImplementation.change) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
SetNode.subset (cognitive 25) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1217— SetNode.subset has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (18 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
MapNode.applyDeltaNoState (cognitive 25) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2919— MapNode.applyDeltaNoState has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 3 (8 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.
ListSetMapReader`2.Compute (cognitive 22) src/FSharp.Data.Adaptive/CollectionExtensions.fs:143— ListSetMapReader`2.Compute has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (17 pts), if/else 1 (4 pts), loops 1 (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
SetNode.addInPlace (cognitive 20) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:915— SetNode.addInPlace has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (MapNode.addInPlace) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
MapNode.addInPlace (cognitive 20) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2108— MapNode.addInPlace has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (SetNode.addInPlace) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
MapExtImplementation.sliceAt (cognitive 19) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1761— MapExtImplementation.sliceAt has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 pts), 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.
SetNode.applyDeltaNoState (cognitive 19) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1701— SetNode.applyDeltaNoState has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MapExtImplementation.tryRemove' (cognitive 18) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:641— MapExtImplementation.tryRemove' has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (18 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (MapExtImplementation.tryRemove) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
MapExtImplementation.tryRemove (cognitive 18) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:675— MapExtImplementation.tryRemove has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (18 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (MapExtImplementation.tryRemove') has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
MapExtImplementation.equals (cognitive 18) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2658— MapExtImplementation.equals has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SetNode.equals (cognitive 18) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1024— SetNode.equals has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (MapNode.equals) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
MapNode.equals (cognitive 18) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2374— MapNode.equals has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (SetNode.equals) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
MapExtImplementation.getNeighbours (cognitive 17) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1424— MapExtImplementation.getNeighbours has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (17 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (MapExtImplementation.getNeighboursAt) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
MapExtImplementation.getNeighboursAt (cognitive 17) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1482— MapExtImplementation.getNeighboursAt has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (17 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (MapExtImplementation.getNeighbours) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
MapExtBackwardMappingEnumerator`3.MoveNext (cognitive 17) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2792— MapExtBackwardMappingEnumerator`3.MoveNext has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 1 (nesting depth added 9). 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.
ListTreeReader`1.Compute (cognitive 16) src/FSharp.Data.Adaptive/CollectionExtensions.fs:349— ListTreeReader`1.Compute has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 2 (7 pts), loops 3 (6 pts), if/else 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MapExtImplementation.unionWith (cognitive 16) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1339— MapExtImplementation.unionWith has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (16 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D4 · Code Duplication· Edited copy of a member (298 corresponding lines) · ×1
Edited copy of a member (298 corresponding lines) src/CSharp.Data.Adaptive/AList.fs:1— src/CSharp.Data.Adaptive/AList.fs:1-298 | src/CSharp.Data.Adaptive/ASet.fs:1-314 — These two members are one piece of code written twice and then edited apart: 298 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (45–46 lines × 2) src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:240— src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:240-284 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:230-275 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:240` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (36 lines × 2) src/FSharp.Data.Adaptive/AdaptiveValue/AdaptiveValue.fs:70— src/FSharp.Data.Adaptive/AdaptiveValue/AdaptiveValue.fs:70-105 | src/FSharp.Data.Adaptive/Traceable/AbstractVal.fs:8-43 — before extracting anything, compare `src/FSharp.Data.Adaptive/AdaptiveValue/AdaptiveValue.fs` and `src/FSharp.Data.Adaptive/Traceable/AbstractVal.fs` as WHOLE FILES: 91% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (32 lines × 2) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3130— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3130-3161 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3200-3231 — 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 (26–27 lines × 3) src/FSharp.Data.Adaptive/AdaptifyHelpers.fs:199— src/FSharp.Data.Adaptive/AdaptifyHelpers.fs:199-224 | src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:319-345 | src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:400-426 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (27 lines × 2) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2724— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2724-2750 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:3707-3733 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2724` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (24 lines × 3) src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:335— src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:335-358 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:327-350 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:335-358 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:335` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (23–24 lines × 2) src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:727— src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:727-750 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:812-834 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:727` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (21–24 lines × 2) src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:1— src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:1-24 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fsi:1-21 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (67–68 lines × 2) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1814— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1814-1880 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3038-3105 — 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 (23 lines × 2) src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:640— src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:640-662 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:725-747 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:640` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (21 lines × 3) src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:84— src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:84-104 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:79-99 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:83-103 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:84` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (20–21 lines × 2) src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:608— src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:608-628 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:634-653 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:634` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (19–20 lines × 2) src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:955— src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:955-974 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:981-999 — 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 (17–20 lines × 2) src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1010— src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1010-1029 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1035-1051 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (18–19 lines × 3) src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1505— src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1505-1522 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1517-1535 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:1583-1600 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1505` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (19 lines × 3) src/FSharp.Data.Adaptive/Datastructures/IndexListDelta.fs:118— src/FSharp.Data.Adaptive/Datastructures/IndexListDelta.fs:118-136 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2711-2729 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:3694-3712 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (18–19 lines × 2) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:247— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:247-264 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:320-338 — 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 (19 lines × 2) src/FSharp.Data.Adaptive/Traceable/CountingHashSet.fs:318— src/FSharp.Data.Adaptive/Traceable/CountingHashSet.fs:318-336 | src/FSharp.Data.Adaptive/Traceable/CountingHashSet.fs:341-359 — 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 (17–18 lines × 3) src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:673— src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:673-689 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:721-737 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:769-786 — 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 (16–17 lines × 3) src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:114— src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:114-129 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:109-125 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:113-128 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:114` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14–16 lines × 9) src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:86— src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:86-101 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:177-191 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:341-354 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:81-96 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:167-181 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:333-346 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:85-100 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:176-190 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:341-354 — there are 9 copies across 3 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 9 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:86` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (16 lines × 4) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1803— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1803-1818 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1848-1863 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3027-3042 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3073-3088 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (14–16 lines × 2) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1728— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1728-1743 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2954-2967 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2954` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13–15 lines × 2) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1651— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1651-1665 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2873-2885 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12–13 lines × 3) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1914— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1914-1925 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1955-1966 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1985-1997 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1985` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12–13 lines × 2) src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:974— src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:974-986 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1029-1040 — 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 (4–13 lines × 3) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1351— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1351-1363 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1512-1524 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1577-1580 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1577` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11–13 lines × 2) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1466— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1466-1478 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1526-1536 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (11–12 lines × 4) src/FSharp.Data.Adaptive/AdaptiveValue/AdaptiveValue.fs:47— src/FSharp.Data.Adaptive/AdaptiveValue/AdaptiveValue.fs:47-58 | src/FSharp.Data.Adaptive/AdaptiveValue/AdaptiveValue.fs:95-106 | src/FSharp.Data.Adaptive/AdaptiveValue/AdaptiveValue.fs:198-209 | src/FSharp.Data.Adaptive/Traceable/AbstractVal.fs:33-43 — before extracting anything, compare `src/FSharp.Data.Adaptive/AdaptiveValue/AdaptiveValue.fs` and `src/FSharp.Data.Adaptive/Traceable/AbstractVal.fs` as WHOLE FILES: 91% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (9–12 lines × 2) src/FSharp.Data.Adaptive/AdaptiveValue/AdaptiveReduction.fs:116— src/FSharp.Data.Adaptive/AdaptiveValue/AdaptiveReduction.fs:116-124 | src/FSharp.Data.Adaptive/AdaptiveValue/AdaptiveReduction.fs:134-145 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/AdaptiveValue/AdaptiveReduction.fs:134` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (9–11 lines × 2) src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1016— src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1016-1024 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1082-1092 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6–9 lines × 14) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1246— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1246-1252 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1295-1300 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1350-1356 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1404-1410 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1454-1460 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1511-1517 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1567-1573 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1656-1664 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2507-2515 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2590-2596 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2667-2673 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2733-2739 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2789-2795 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2876-2884 — all 14 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1246` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (8–9 lines × 3) src/FSharp.Data.Adaptive/CollectionExtensions.fs:115— src/FSharp.Data.Adaptive/CollectionExtensions.fs:115-122 | src/FSharp.Data.Adaptive/CollectionExtensions.fs:143-151 | src/FSharp.Data.Adaptive/CollectionExtensions.fs:179-186 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (3–9 lines × 3) src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:643— src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:643-651 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:698-700 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:739-747 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (7–8 lines × 7) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1227— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1227-1233 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1271-1277 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1323-1330 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1377-1384 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1484-1491 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1539-1546 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1604-1611 — all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1227` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7–8 lines × 5) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:532— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:532-539 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:555-562 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:607-614 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1285-1291 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1313-1319 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (8 lines × 4) src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1322— src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1322-1329 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1338-1345 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1355-1362 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1371-1378 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (8 lines × 3) src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1394— src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1394-1401 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1410-1417 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1426-1433 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (42 lines × 2) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1332— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1332-1373 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1493-1534 — 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 (20 lines × 2) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2649— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2649-2668 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2715-2734 — 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 (2–6 lines × 5) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:859— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:859-869 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2663-2664 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2675-2680 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2729-2730 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2741-2746 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2680` calls `Mask` and `src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2664` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (4–6 lines × 3) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:778— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:778-781 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1883-1888 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2198-2204 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (5 lines × 7) src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1320— src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1320-1324 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1336-1340 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1353-1357 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1369-1373 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1392-1396 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1408-1412 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1424-1428 — all 7 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 (4–5 lines × 6) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2381— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2381-2385 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2640-2644 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2706-2710 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2762-2766 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2826-2830 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2986-2989 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2381` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (7 lines × 4) src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:545— src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:545-551 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:568-574 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:770-776 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:806-812 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (2–5 lines × 8) src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi:203— src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi:203-204 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi:211-215 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi:228-229 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi:234-236 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fsi:294-295 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fsi:302-306 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fsi:319-320 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fsi:325-327 — there are 8 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 8 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi:203` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi:234` calls `when`, `member` and `src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi:211` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (2–5 lines × 3) src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3250— src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3250-3251 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2778-2782 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2859-2863 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (13 lines × 3) src/Demo/Scratch/Observable.fs:67— src/Demo/Scratch/Observable.fs:67-79 | src/Demo/Scratch/Observable.fs:111-123 | src/Demo/Scratch/Observable.fs:155-167 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Demo/Scratch/Observable.fs:67` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 3) src/Demo/Scratch/Observable.fs:48— src/Demo/Scratch/Observable.fs:48-58 | src/Demo/Scratch/Observable.fs:92-102 | src/Demo/Scratch/Observable.fs:136-146 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Demo/Scratch/Observable.fs:48` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Low cohesion: History`2 (LCOM4 5) src/FSharp.Data.Adaptive/Traceable/History.fs:128— History`2's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
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.
SC1 · Supply-chain hygiene· NuGet dependencies are not locked · ×1
NuGet dependencies are not locked — No packages.lock.json and no central package management — restores aren't reproducible or pinned (SSDF PW.4.4). Enable <RestorePackagesWithLockFile>true</RestorePackagesWithLockFile> (commit the lockfile) or adopt Directory.Packages.props. Advisory — never scored.
Duplicated predicate src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1649— `lowerBound.IsConstant && upperBound.IsConstant` appears character-identically in 2 files — src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs, src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs. 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 src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:48— `reader.State.Count <= 2 || reader.State.Count <= ops.Count` appears character-identically in 3 files — src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs, src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs, src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs. 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 src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:277— `state.Count <= 2 || state.Count <= ops.Count` appears character-identically in 3 files — src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs, src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs, src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs. 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, 2 significant file(s) lose their only recent owner: src/FSharp.Data.Adaptive/Datastructures/IndexList.fs, src/FSharp.Data.Adaptive/Datastructures/Index.fs. Pair on, review, or document these before any departure.
D16 · Bus Factor· Further sole-owners (lower concentration) · ×1
Further sole-owners (lower concentration) — 1 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold — folded into the bus-factor score and metrics (4 single-owned of 35 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 35 of the 49 production source files in this repository met that bar). They are anonymized user #2 (2 file(s)) — spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: src/FSharp.Data.Adaptive/Traceable/History.fs, src/FSharp.Data.Adaptive/Core/Callbacks.fs.
Scattered collaborators — 96 % of calls cross a namespace and only 57 % of collaborators are co-located — group each feature's code into a vertical slice so a call's collaborators sit together.
No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
M2 · Architecture documentation· No architecture diagram/doc · ×1
No architecture diagram/doc — No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape — no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document — not evidence that nobody wrote the shape down.
No SAST REDACTED:2— No static application security testing detected. For this repository's stack, add `semgrep --config=auto` plus gitleaks for committed secrets (F# is not a CodeQL language and has no language-specific SAST engine) as a CI step. What was searched, so you can tell an absence from a miss: the 3 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 dependency-update automation src/FSharp.Data.Adaptive/FSharp.Data.Adaptive.fsproj:90— `src/FSharp.Data.Adaptive/FSharp.Data.Adaptive.fsproj` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`.
Nullable reference types not enabled everywhere — 0/1 NRT-eligible project(s) enable <Nullable>enable</Nullable> (projects targeting a pre-C#-8 framework are excluded — NRTs aren't available there). NRTs catch a whole class of null-deref bugs at compile time.
Outdated: Aardvark.Build — Aardvark.Build 2.0.3 → 2.0.7 available (referenced by FSharp.Data.Adaptive).
Outdated: Fable.Core — Fable.Core 3.0.0 → 5.6.1 available (referenced by FSharp.Data.Adaptive).
Outdated: BenchmarkDotNet — BenchmarkDotNet 0.14.0 → 0.15.8 available (referenced by FSharp.Data.Adaptive.Tests).
Outdated: BenchmarkDotNet.Annotations — BenchmarkDotNet.Annotations 0.14.0 → 0.15.8 available (referenced by FSharp.Data.Adaptive.Tests).
Outdated: FsCheck — FsCheck 2.14.6 → 3.6.0 available (referenced by FSharp.Data.Adaptive.Tests).
Outdated: FsCheck.NUnit — FsCheck.NUnit 2.14.6 → 3.6.0 available (referenced by FSharp.Data.Adaptive.Tests).
Outdated: Iced — Iced 1.21.0 → 1.22.0 available (referenced by FSharp.Data.Adaptive.Tests).
Outdated: Microsoft.CodeAnalysis.Analyzers — Microsoft.CodeAnalysis.Analyzers 3.11.0 → 5.9.0 available (referenced by FSharp.Data.Adaptive.Tests).
Outdated: Microsoft.CodeAnalysis.Common — Microsoft.CodeAnalysis.Common 4.11.0 → 5.9.0 available (referenced by FSharp.Data.Adaptive.Tests).
Outdated: Microsoft.CodeAnalysis.CSharp — Microsoft.CodeAnalysis.CSharp 4.11.0 → 5.9.0 available (referenced by FSharp.Data.Adaptive.Tests).
Outdated: Microsoft.CodeCoverage — Microsoft.CodeCoverage 17.11.1 → 18.12.0 available (referenced by FSharp.Data.Adaptive.Tests).
Outdated: Microsoft.Diagnostics.NETCore.Client — Microsoft.Diagnostics.NETCore.Client 0.2.547301 → 0.2.750501 available (referenced by FSharp.Data.Adaptive.Tests).
Outdated: Microsoft.Diagnostics.Runtime — Microsoft.Diagnostics.Runtime 3.1.512801 → 4.2.751201 available (referenced by FSharp.Data.Adaptive.Tests).
Outdated: Microsoft.Diagnostics.Tracing.TraceEvent — Microsoft.Diagnostics.Tracing.TraceEvent 3.1.15 → 4.0.0 available (referenced by FSharp.Data.Adaptive.Tests).
Outdated: Microsoft.NET.Test.Sdk — Microsoft.NET.Test.Sdk 16.4.0 → 18.12.0 available (referenced by FSharp.Data.Adaptive.Tests).
Outdated: Microsoft.TestPlatform.ObjectModel — Microsoft.TestPlatform.ObjectModel 17.11.1 → 18.12.0 available (referenced by FSharp.Data.Adaptive.Tests).
Outdated: Microsoft.TestPlatform.TestHost — Microsoft.TestPlatform.TestHost 17.11.1 → 18.12.0 available (referenced by FSharp.Data.Adaptive.Tests).
Outdated: Newtonsoft.Json — Newtonsoft.Json 13.0.3 → 13.0.4 available (referenced by FSharp.Data.Adaptive.Tests).
Outdated: NUnit — NUnit 3.12.0 → 5.0.0 available (referenced by FSharp.Data.Adaptive.Tests).
Outdated: Perfolizer — Perfolizer 0.3.17 → 0.7.5 available (referenced by FSharp.Data.Adaptive.Tests).
Outdated: System.Runtime.CompilerServices.Unsafe — System.Runtime.CompilerServices.Unsafe 6.0.0 → 6.1.2 available (referenced by FSharp.Data.Adaptive.Tests).
Outdated: System.Threading.Tasks.Extensions — System.Threading.Tasks.Extensions 4.5.4 → 4.6.3 available (referenced by FSharp.Data.Adaptive.Tests).
Outdated: System.Xml.XPath.XmlDocument — System.Xml.XPath.XmlDocument 4.3.0 → 4.7.0 available (referenced by FSharp.Data.Adaptive.Tests).
Outdated: Fable.Browser.Dom — Fable.Browser.Dom 1.1.0 → 2.20.0 available (referenced by Fable).
Outdated: Fable.Browser.Event — Fable.Browser.Event 1.6.0 → 1.7.0 available (referenced by Fable).
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.
nuget: not applicable — nuget: `dotnet list package --vulnerable` could not read this solution's dependency graph — it reported an error for at least one project and returned no package data at all (typically a packages.config / non-PackageReference project, which the command cannot read). An unreadable dependency graph is not a clean one; migrate the project(s) to PackageReference to enable this scan
trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
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 01a1d486-d107-7514-8192-fdd1deb7dc97 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 11 · Warnings: 334 · Recommendations: 24 · Info: 25 — Appendix A · all findings · full markdown report.
Generated by the Canine Code Analyzer: deterministic code-health analysis. 13-11-2026 @ 10:49 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.