Public report of fslaborg/Deedle, 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 report Measured 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, 09:34 UTC Β· Survey ID cd_b4a263ff1404425aaac8472049aa9f47

fslaborg/Deedle

Measured 13 November 2026, 09:33 UTC, at code version eaa64bd

Code coverage is not measured: No coverage collector is wired up.

CAI score 58out of 100 Adequate
CriticalWeakAdequateStrongExemplary
Up 11 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: 26,904 lines of product code in 1 project, tests not counted Β· Estimated rebuild effort: about 0.3 person-years Β· Weakest lens: Architecture, 56

Findings by how serious they are

20 critical 142 serious 103 minor

32 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

Assert small markCanine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
13 November 2026, 09:33 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.
189of 265 findings point to an exact file and line, so you can open each one in the code. The other 76 concern the repository as a whole, such as missing documentation.
38dimensions across 6 lenses, read from 26,904 lines of product code in 1 project.
Chapters

Executive summary

fslaborg/Deedle falls short of our standard for production, held back most by its Architecture lens, the way the code is structured into parts. It scores 58 out of 100 and is rated Adequate, and 15 of its 20 critical findings are security problems in the build pipeline and in its code.

Architecture, at 56, is the weakest lens, level with Production Readiness, and counts most in the score. The best first step is replacing each deprecated dependency, worth about 2 points. Fixing the silenced warnings comes next, worth about 1 point.

Ten pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. One secret can leak from the build pipeline, and one weakness in the code could be used by an attacker. Pinning each tool to an exact version, limiting the secret to its own step and fixing the weaknesses the scanner points to would close these risks. Correcting the flagged pipeline settings would fix the three weaknesses in the build pipeline's configuration. The five warnings switched off for a whole file need narrowing to the lines that need them.

The product code is 26,904 lines, about €44,000 to rebuild.

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

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

The weakest lenses score close to each other, so improving any of them moves the score.

Code composition: what the lines of code are
Product code 65%Tests 35%
New since the last survey: 1 finding

This critical or serious finding wasn't in the previous survey, on 23 October 2026.

  • Code Duplication Β· Duplicated block (11 lines × 10) src/Deedle.Parquet/Parquet.fs

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: 59 findings

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

  • Code Duplication Β· Duplicated block (6 lines × 10) src/Deedle.Parquet/Parquet.fs
  • Code Coverage Β· Coverage not measured β€” no coverage collector is wired up
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 23 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 23 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 23 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 23 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Explicit Debt Β· AnalyzerSeverityNone repeated across 21 files packages/Microsoft.CodeAnalysis.Analyzers/editorconfig/PortedFromFxCopRulesEnabled/.editorconfig
  • Knowledge Freshness Β· Orphaned knowledge src/Deedle/FSharp.Data/Net/Http.fs
  • Knowledge Freshness Β· Orphaned knowledge src/Deedle/Vectors/VirtualVector.fs
  • Knowledge Freshness Β· Orphaned knowledge src/Deedle/VirtualFrame.fs
  • Knowledge Freshness Β· Orphaned knowledge src/Deedle/Indices/VirtualIndex.fs
  • Knowledge Freshness Β· Orphaned knowledge src/Deedle/Vectors/ArrayVector.fs
Rebuild cost: about €44,000 Β· Estimate
Cost to rebuild€14,000 to €73,000, for 241 to 764 hours of work, about 0.3 person-years for one engineer
Difficulty of the problemStandard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor×0.8 at a score of 58. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
SizeMedium: 26,904 lines of product code
What it is notNot 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. For this code, every line is priced as straight logic, which keeps the estimate on the low side.

Top priorities

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

1
Resolve the 1 Deprecated finding(s) in Dependency Hygiene.
Raises the score by about 2 points Β· Low effort Β· Dependency Hygiene
2
Resolve the 5 FileScopedPragmaDisable finding(s) in Explicit Debt β€” start with ArrowTests.cs, ExcelReaderTests.cs, Frame.cs.
Raises the score by about 1 point Β· Low effort Β· Explicit Debt
3
Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.
Raises the score by about 1 point Β· Medium effort Β· Deployment & Rollback

Diagnosis: what the measurements show together

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

Where the investment is most exposed Β· Value at risk
This code would cost about €44,000 to build again, about 0.3 person-years of work. Its weakest lens is Architecture, at 56 (Adequate). Architecture is about whether the structure holds up as the product grows, and when the structure is weak, a change in one place ripples into many others. Because the weakest lens counts most in the score, work on Architecture also moves the score most.
Based on: the rebuild estimate · the Architecture grade · how much each lens counts
What to do: Start with the Architecture actions in Top priorities.
If you do one thing first Β· First action
Resolve the 1 Deprecated finding(s) in Dependency Hygiene. Of all the actions in this report, it raises the score most for the work it takes: about 2 points for low effort, because it clears the 1 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.4 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 10,036 lines over the last 90 days, which is about 40,702 lines a year. At that pace, the extra work comes to an estimated 2 to 13.6 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of 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.

arch Deedle Deedle Deedle.Arrow Arrow Deedle.Arrow->Deedle Deedle.ExcelReader ExcelReader Deedle.ExcelReader->Deedle Deedle.ExcelWriter ExcelWriter Deedle.ExcelWriter->Deedle Deedle.MathNetNumerics MathNetNumerics Deedle.MathNetNumerics->Deedle Deedle.MicrosoftML MicrosoftML Deedle.MicrosoftML->Deedle Deedle.Parquet Parquet Deedle.Parquet->Deedle

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.

118 modules, with 137 dependencies between them. One loop runs through 3 of the modules, marked above the diagonal.

The table shows the 40 modules with the most connections; 78 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 β†’1 Deedle.Addressing2 Deedle.Internal3 FSharp.Data4 FSharp.Data.Runtime.StructuralTypes5 Deedle.Vectors6 FSharp.Data.Runtime.StructuralInference7 Deedle.Indices8 FSharp.Data.Runtime.CsvInference9 Deedle10 Deedle.Arrow11 Deedle.Arrow.Frame12 Deedle.Arrow.Implementation13 Deedle.Arrow.Series14 Deedle.Delayed15 Deedle.Indices.Linear16 Deedle.JoinHelpers17 Deedle.MathNetNumerics.LinearRegression.Fit.Summary18 Deedle.MicrosoftML19 Deedle.Ranges20 Deedle.Reflection21 Deedle.VectorHelpers22 Deedle.Vectors.ArrayVector23 Deedle.Vectors.VectorHelperExtensions24 Deedle.MathNetNumerics.LinearRegression.Fit25 Deedle.MicrosoftML.Extraction26 Deedle.Ranges.Ranges27 Deedle.Vectors.Virtual28 Deedle.Indices.Virtual29 Deedle.MathNetNumerics.LinearRegression30 Deedle.Vectors.Virtual.VirtualVectorSource31 Deedle.Virtual32 Deedle.Parquet.Virtual.Sources33 Deedle.Parquet.Virtual.Sources.VirtualParquetExtensions34 Deedle.Virtual.FloatBatchMaterialize35 Deedle.Virtual.LookupRangeExecutor36 Deedle.Virtual.Sources.VirtualCsvSource37 Deedle.Virtual.VirtualCsvExtensions38 Deedle.Virtual.VirtualFrameDiag39 Deedle.Parquet.Virtual.Sources.ParquetColumnSource40 Deedle.Parquet.Virtual.Sources.VirtualParquetSource
1 Deedle.Addressing
2 Deedle.Internal
3 FSharp.Data
4 FSharp.Data.Runtime.StructuralTypes
5 Deedle.Vectors18
6 FSharp.Data.Runtime.StructuralInference3
7 Deedle.Indices228
8 FSharp.Data.Runtime.CsvInference11
9 Deedle24915
10 Deedle.Arrow2
11 Deedle.Arrow.Frame1
12 Deedle.Arrow.Implementation3
13 Deedle.Arrow.Series1
14 Deedle.Delayed44714
15 Deedle.Indices.Linear53610
16 Deedle.JoinHelpers122
17 Deedle.MathNetNumerics.LinearRegression.Fit.Summary2
18 Deedle.MicrosoftML3
19 Deedle.Ranges5
20 Deedle.Reflection115
21 Deedle.VectorHelpers2717
22 Deedle.Vectors.ArrayVector238
23 Deedle.Vectors.VectorHelperExtensions143
24 Deedle.MathNetNumerics.LinearRegression.Fit41
25 Deedle.MicrosoftML.Extraction21
26 Deedle.Ranges.Ranges32
27 Deedle.Vectors.Virtual63121
28 Deedle.Indices.Virtual4261012
29 Deedle.MathNetNumerics.LinearRegression21
30 Deedle.Vectors.Virtual.VirtualVectorSource2355
31 Deedle.Virtual198
32 Deedle.Parquet.Virtual.Sources11
33 Deedle.Parquet.Virtual.Sources.VirtualParquetExtensions11
34 Deedle.Virtual.FloatBatchMaterialize22
35 Deedle.Virtual.LookupRangeExecutor12
36 Deedle.Virtual.Sources.VirtualCsvSource133
37 Deedle.Virtual.VirtualCsvExtensions12
38 Deedle.Virtual.VirtualFrameDiag211
39 Deedle.Parquet.Virtual.Sources.ParquetColumnSource1123
40 Deedle.Parquet.Virtual.Sources.VirtualParquetSource1113
Uses a module listed above itPart of a loopThe module itself
1 Deedle.Addressing2 Deedle.Internal3 FSharp.Data4 FSharp.Data.Runtime.StructuralTypes5 Deedle.Vectors6 FSharp.Data.Runtime.StructuralInference7 Deedle.Indices8 FSharp.Data.Runtime.CsvInference9 Deedle10 Deedle.Arrow11 Deedle.Arrow.Frame12 Deedle.Arrow.Implementation13 Deedle.Arrow.Series14 Deedle.Delayed15 Deedle.Indices.Linear16 Deedle.JoinHelpers17 Deedle.MathNetNumerics.LinearRegression.Fit.Summary18 Deedle.MicrosoftML19 Deedle.Ranges20 Deedle.Reflection21 Deedle.VectorHelpers22 Deedle.Vectors.ArrayVector23 Deedle.Vectors.VectorHelperExtensions24 Deedle.MathNetNumerics.LinearRegression.Fit25 Deedle.MicrosoftML.Extraction26 Deedle.Ranges.Ranges27 Deedle.Vectors.Virtual28 Deedle.Indices.Virtual29 Deedle.MathNetNumerics.LinearRegression30 Deedle.Vectors.Virtual.VirtualVectorSource31 Deedle.Virtual32 Deedle.Parquet.Virtual.Sources33 Deedle.Parquet.Virtual.Sources.VirtualParquetExtensions34 Deedle.Virtual.FloatBatchMaterialize35 Deedle.Virtual.LookupRangeExecutor36 Deedle.Virtual.Sources.VirtualCsvSource37 Deedle.Virtual.VirtualCsvExtensions38 Deedle.Virtual.VirtualFrameDiag39 Deedle.Parquet.Virtual.Sources.ParquetColumnSource40 Deedle.Parquet.Virtual.Sources.VirtualParquetSourceDeedle.Addressing1Deedle.Internal2FSharp.Data3FSharp.Data.Runtime.StructuralTypes4Deedle.Vectors5FSharp.Data.Runtime.StructuralInference6Deedle.Indices7FSharp.Data.Runtime.CsvInference8Deedle9Deedle.Arrow10Deedle.Arrow.Frame11Deedle.Arrow.Implementation12Deedle.Arrow.Series13Deedle.Delayed14Deedle.Indices.Linear15Deedle.JoinHelpers16Deedle.MathNetNumerics.LinearRegression.Fit.Summary17Deedle.MicrosoftML18Deedle.Ranges19Deedle.Reflection20Deedle.VectorHelpers21Deedle.Vectors.ArrayVector22Deedle.Vectors.VectorHelperExtensions23Deedle.MathNetNumerics.LinearRegression.Fit24Deedle.MicrosoftML.Extraction25Deedle.Ranges.Ranges26Deedle.Vectors.Virtual27Deedle.Indices.Virtual28Deedle.MathNetNumerics.LinearRegression29Deedle.Vectors.Virtual.VirtualVectorSource30Deedle.Virtual31Deedle.Parquet.Virtual.Sources32Deedle.Parquet.Virtual.Sources.VirtualParquetExtensions33Deedle.Virtual.FloatBatchMaterialize34Deedle.Virtual.LookupRangeExecutor35Deedle.Virtual.Sources.VirtualCsvSource36Deedle.Virtual.VirtualCsvExtensions37Deedle.Virtual.VirtualFrameDiag38Deedle.Parquet.Virtual.Sources.ParquetColumnSource39Deedle.Parquet.Virtual.Sources.VirtualParquetSource401832281124915213144714536101222351152717238143412132631214261012212355198111122121331221111231113+78 more modules (most-connected shown)

At a glance β€” Code Health Β· 65% Β· Adequate Β·

At a glance β€” Architecture Β· 56% Β· Adequate Β· gated by AX10 Β·

At a glance β€” Maturity Β· 60% Β· Adequate Β· gated by M2 Β·

At a glance β€” Readiness Β· 56% Β· Adequate Β· gated by P3 Β·

At a glance β€” Security Β· 59% Β· Checked 4 of 10 Β· gated by D29, D36 Β·

At a glance β€” Performance Β· 97% Β· Exemplary Β·

Security & Compliance β€” OWASP Top-10 mapping

Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).

OWASP categoryFindingsSeverity
A05:2025 β€” Injection15High / Critical
A03:2025 β€” Software Supply Chain Failures7Medium

Roadmap

Top priorities: Resolve the 1 Deprecated finding(s) in Dependency Hygiene; Resolve the 5 FileScopedPragmaDisable finding(s) in Explicit Debt β€” start with ArrowTests.cs, ExcelReaderTests.cs, Frame.cs; Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.

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

Do thisHelpsEffortDimension
Resolve the 1 Deprecated finding(s) in Dependency Hygiene.+1.8 ptsLowDependency Hygiene
Resolve the 5 FileScopedPragmaDisable finding(s) in Explicit Debt β€” start with ArrowTests.cs, ExcelReaderTests.cs, Frame.cs.+1.4 ptsLowExplicit Debt
Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.+1.2 ptsMediumDeployment & Rollback
Resolve the 3 REDACTED finding(s) in Static Analysis (SAST) β€” start with REDACTED (3).+0.6 ptsLowStatic Analysis (SAST)
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.+1.1 ptsMediumArchitecture documentation
Resolve the 25 Orphaned file finding(s) in Knowledge Freshness β€” start with VirtualIndex.fs, ArrayVector.fs, CsvRuntime.fs.+0.8 ptsMediumKnowledge Freshness
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) β€” start with REDACTED.+0.4 ptsLowStatic Analysis (SAST)
Resolve the 1 CommentedOutCode finding(s) in Explicit Debt β€” start with Series.cs.+0.3 ptsLowExplicit Debt

File quality

Per-file score 0–10 β€” a quality signature. Of 37 files carrying findings, judged against the Production bar: 3% slop Β· 75% mixed Β· 22% near-clean.

FileScoreBandWorst signal
REDACTED2.4SlopStatic Analysis (SAST): High: REDACTED
REDACTED4.6MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.8MixedStatic Analysis (SAST): High: REDACTED
tests/Deedle.CSharp.Tests/Series.cs5.8MixedExplicit Debt: FileScopedPragmaDisable
src/Deedle/Indices/LinearIndex.fs5.9MixedCyclomatic Complexity: LinearIndexBuilder.Deedle.Indices.IIndexBuilder.Resample (cyclomatic 16)
src/Deedle.Arrow/Arrow.fs7.0MixedCyclomatic Complexity: Implementation.batchesToFrame (cyclomatic 66)
src/Deedle.Parquet/Parquet.fs7.0MixedCyclomatic Complexity: Implementation.columnToDataColumn (cyclomatic 42)
src/Deedle/FrameUtils.fs7.0MixedCyclomatic Complexity: FrameUtilsModule.readCsv (cyclomatic 40)
src/Deedle/VirtualLookupRange.fs7.0MixedCyclomatic Complexity: LookupRangeExecutor.remapLookupRangeAfterStep (cyclomatic 33)
src/Deedle/Stats.fs7.0MixedCyclomatic Complexity: Stats.interpolateLinearWith (cyclomatic 17)
src/Deedle/FrameModule.fs7.0MixedCognitive Complexity: FrameModule.MeltBy (cognitive 33)
src/Deedle/FSharp.Data/Net/Http.fs7.0MixedCyclomatic Complexity: CookieHandling.getAllCookiesFromHeader (cyclomatic 23)
src/Deedle/Frame.fs7.1MixedCyclomatic Complexity: Frame`2.FormatStrings (cyclomatic 26)
src/Deedle/Common/Common.fs7.1MixedCyclomatic Complexity: Seq.alignOrdered (cyclomatic 25)
src/Deedle/VirtualFrame.fs7.1MixedCyclomatic Complexity: IndexUtilsModule.binarySearch (cyclomatic 16)
src/Deedle/Vectors/VirtualVector.fs7.2MixedCyclomatic Complexity: VirtualVectorBuilder.Deedle.Vectors.IVectorBuilder.Build (cyclomatic 28)
src/Deedle/Common/Ranges.fs7.2MixedCyclomatic Complexity: Ranges.lookup (cyclomatic 27)
src/Deedle/VirtualCsvSource.fs7.2MixedCyclomatic Complexity: VirtualCsvSource.isOrderedUniqueIndex (cyclomatic 22)
src/Deedle/Series.fs7.2MixedCognitive Complexity: Series`2.FormatStrings (cognitive 27)
src/Deedle/FrameExtensions.fs7.2MixedGod Classes: TooManyMethods: FrameExtensions

How the grades work

Every finding carries one of four grades. Three say how serious it is. The fourth says this survey could not settle it β€” and it is a grade, not a gap.

Critical β€” 20

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

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

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

Could not be resolved β€” 32

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
D1D2D3D4D5D6D10D11D12D13D15D16D17D19D27D28D29D30D34D35D36D44AX10AX3AX4GD1M1M2M3M4P1P3P4P6PF1PF3X27X28

Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality β€” in one coherent pass. A surface report typically covers a handful.

How to trust any code-health report β€” three questions
  1. Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line β€” never an absolute scratch path. Here, 189 of 265 do; the remainder are repo-wide signals β€” a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
  2. Is there a tool behind the number? Every score below names the method that produced it: Roslyn, git or a scanner, not a narrative.
  3. Does re-running give the same result? Run it again on the same commit and the score β€” and this report, byte for byte β€” is identical. A report whose numbers move between runs is describing the run, not the code.

This report answers yes to all three. That's the bar to hold any assessment to.

Tools & methods

The actual versions used this run (captured at analysis time) β€” re-run on the same commit for the identical score.

MethodBacksVersionEvaluator
Roslyn static analysisComplexity, cohesion, coupling, dead code, API surface, layering5.3.0βœ“ deterministic
Native secret scannerHardcoded secrets / credentials1.0.0βœ“ deterministic
Canine Code Analyzer duplication detector (in-process)Code duplication1.0.0βœ“ deterministic
Coverage (coverlet / dotnet-coverage)Line & branch coverage10.0.400βœ“ deterministic
NuGet / dotnetOutdated, vulnerable & deprecated dependencies10.0.400βœ“ deterministic
git / LibGit2SharpChurn hotspots, knowledge concentration, history2.43.0 Β· 0.31.0βœ“ deterministic
gitleaks · semgrep · trivySecrets in history, SAST, CVEs, IaC & container, PII / GDPR1.86.0 Β· 0.69.3βœ“ deterministic

Every finding is locatable in findings.md. Run 01a1d441-67f6-797a-8004-8feef6a723ad.

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

Run transparency β€” what happened this run

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

  • 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).
  • D10 Test Quality β€” 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 54 test(s) behind this row are the ones the C# collector could read, and this repository also carries at least 39 test source file(s) (.fs) that it cannot: it parses C# syntax and matches C# test attributes, so a vitest/jest/JUnit/pytest-style suite is invisible to it. Skipped tests, zero-assertion tests and the other quality signals on this row are UNMEASURED in that suite β€” their absence from the counts above is a gap in this analyzer's language coverage, not a finding that those tests are sound.
  • D14 License Compliance β€” 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. Not scored β€” this repository's projects are MSBuild/NuGet projects, whose package licenses are exactly what this dimension reads, but no license could be resolved for them (the .NET license collector did not run, or restore failed). A gap in the analysis run, NOT a finding that the repository's licenses are compliant.
  • D15 Churn × Complexity Hotspots β€” 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. A hotspot's complexity is meant to be the worst body its churn actually touched. For src/Deedle/Frame.fs that could not be established β€” the complexity reader for the file reports no body extents, or the history carries no per-line attribution β€” so the row quotes the file's worst body, which the counted changes may never have touched. The churn count is unaffected.
  • 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/Deedle/Deedle.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 6 deducted marker(s) and the 2.0/KLoC density on this row were taken over this repository's .NET projects ALONE: .fs (26,904 lines, 100% 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.
  • AX6 Interface segregation β€” 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 computed over the public interfaces this run's compilations declare, and none was loaded, so it had nothing to read. That is a gap in this analyzer's language reach β€” not a finding that the repository is free of what this check looks for.
  • C1 Data Protection β€” 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. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach β€” not a finding that the repository lacks personal data controls.
  • C2 Access Controls β€” 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. These authorization controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach β€” not a finding that the repository lacks authorization controls.
  • C3 Audit Trail β€” 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. These audit controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach β€” not a finding that the repository lacks audit controls.
  • C4 Data Retention β€” 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. These retention controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach β€” not a finding that the repository lacks retention controls.
  • C5 Data-Subject Rights β€” 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. These data-subject rights controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach β€” not a finding that the repository lacks data-subject rights controls.
  • M4 Documentation accuracy β€” 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. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
  • 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.
  • S1 Web-Security Posture β€” 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. These web-security controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach β€” not a finding that the repository lacks web-security controls.
  • X1 Async correctness β€” 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.
  • X12 Unreachable branch β€” 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.
  • X13 Undrained process stream β€” 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.
  • X14 Bypassable address classification β€” 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.
  • X15 Unvalidated length from an untrusted reader β€” 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.
  • X16 Unfloored truncation loop β€” 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.
  • X17 Uncapped recursion over a caller-supplied document β€” 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.
  • X18 Disposal-pattern correctness β€” 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.
  • X19 Unrestored process-global state β€” 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.
  • X2 Cancellation propagation β€” 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.
  • X21 Side-effecting pattern guard β€” 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.
  • X22 Contradicted release guard β€” 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.
  • X24 Document value interpolated into markup unescaped β€” 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.
  • X25 Inert configuration knob β€” 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.
  • X26 Unsynchronised callback handoff β€” 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.
  • X29 Per-element action decided by a fixed element β€” 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.
  • X3 Exception handling β€” 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.
  • X30 Support guard that admits what it rejects β€” 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.
  • X32 Type resolved by simple name across every loaded assembly β€” 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.
  • X4 Structured logging β€” 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.
  • X5 Nullable reference types β€” 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.

Repo exclusion declarations: 1 pattern(s) declared (.gitattributes linguist-generated/vendored, .editorconfig generated_code) excluded 0 source file(s) from code-quality scoring. Declarations are the repo's own visible statement that a tree is machine-written or vendored β€” auditable in any diff, honored by GitHub the same way.

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.
  • D10 Test Quality: Assertion density is structural β€” it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
  • 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").
  • 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.
  • D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension β€” code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
  • D35 Change Coupling: Change coupling is co-change in COMMITS β€” files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
  • D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen β€” a runtime named only in a Dockerfile (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
  • AX10 Code composition: Role is inferred from namespace/folder convention, not semantics β€” a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
  • M4 Documentation accuracy: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
  • 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.

Dimensions

D1 Β· Cyclomatic Complexity6.3 / 10Adequateβœ“ Tool-verified

What it measures: How tangled the control flow is β€” methods with many branches are hard to test and change.

Method: Cyclomatic complexity per method (1 + decision points), computed exhaustively across production source; test projects separated by convention. Deterministic.

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

28 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was ArrayVectorBuilder.Deedle.Vectors.IVectorBuilder.Build at 73. A further 4 method(s) were over the threshold but excluded as flat dispatchers (a long switch/match over independent cases: many branches, almost no nesting), the largest being HttpHelpers.setHeaders at 43 β€” they are counted neither in the figure above nor in this dimension's score. 2 files carry no cyclomatic complexity row at all for this reason β€” every one of their over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: src/Deedle/FSharp.Data/CommonRuntime/StructuralInference.fs (StructuralInference.inferPrimitiveType at 17), src/Deedle.Parquet/VirtualParquetSource.fs (ParquetColumnSource.columnKind at 16). They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.

ArrayVectorBuilder.Deedle.Vectors.IVectorBuilder.Build (cyclomatic 73)src/Deedle/Vectors/ArrayVector.fs:97
Implementation.batchesToFrame (cyclomatic 66)src/Deedle.Arrow/Arrow.fs:239
Implementation.columnToArrowArray (cyclomatic 52)src/Deedle.Arrow/Arrow.fs:48
Implementation.columnToDataColumn (cyclomatic 42)src/Deedle.Parquet/Parquet.fs:49
Implementation.readColumn (cyclomatic 41)src/Deedle.Parquet/Parquet.fs:138

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

What to do

  1. Bring the 28 bodies over 15 down to 15 or less in Cyclomatic Complexity β€” start with ArrayVectorBuilder.Deedle.Vectors.IVectorBuilder.Build (cyclomatic 73), Implementation.batchesToFrame (cyclomatic 66), Implementation.columnToArrowArray (cyclomatic 52). β€” 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 28 together lifts Cyclomatic Complexity from 6.3 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.

D2 Β· Cognitive Complexity4.9 / 10Weakβœ“ Tool-verified

What it measures: How hard the code is for a person to follow, beyond raw branching.

Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.

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

45 method(s) exceeded the cognitive complexity threshold of 15; the worst was Implementation.batchesToFrame at 284.

Implementation.batchesToFrame (cognitive 284)src/Deedle.Arrow/Arrow.fs:239
ArrayVectorBuilder.Deedle.Vectors.IVectorBuilder.Build (cognitive 157)src/Deedle/Vectors/ArrayVector.fs:97
Implementation.readColumn (cognitive 104)src/Deedle.Parquet/Parquet.fs:138
Implementation.columnToArrowArray (cognitive 78)src/Deedle.Arrow/Arrow.fs:48
LookupRangeExecutor.remapLookupRangeAfterStep (cognitive 74)src/Deedle/VirtualLookupRange.fs:383

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

What to do

  1. Bring the 2 bodies over 120 down to 120 or less in Cognitive Complexity β€” start with Implementation.batchesToFrame (cognitive 284), ArrayVectorBuilder.Deedle.Vectors.IVectorBuilder.Build (cognitive 157). β€” 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 2 together lifts Cognitive Complexity from 4.9 to about 5.8/10, projected with the scoring formula itself and assuming each lands exactly at 120; a cleaner split scores higher.

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

D3 Β· God Classes7.8 / 10Strongβœ“ Tool-verified

What it measures: Over-large classes that try to do too much ("god classes").

Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.

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

17 god class(es) detected.

FileTooLong: Deedle/Frame.fs Β· Γ—12src/Deedle/Frame.fs
TooManyMethods: Frame`2 Β· Γ—5src/Deedle/Frame.fs:83

What to do

  1. Resolve the 12 FileTooLong finding(s) in God Classes β€” start with Frame.fs, Common.fs, FrameModule.fs. β€” One of this dimension's main actionable groups (12 warning-level).
  2. Resolve the 5 TooManyMethods finding(s) in God Classes β€” start with Frame.fs, Series.fs, FrameExtensions.fs. β€” One of this dimension's main actionable groups (5 warning-level).

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

D4 Β· Code Duplication9.2 / 10Stronggated by 45 serious findingsβœ“ Tool-verified

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

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

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

45 duplicated block group(s) detected.

Duplicated block (7 lines × 2) Β· Γ—5src/Deedle.Arrow/Arrow.fs:219
Duplicated block (5 lines × 2) Β· Γ—5src/Deedle.MathNetNumerics/LinearAlgebra.fs:257
Duplicated block (9 lines × 2) Β· Γ—3src/Deedle/FSharp.Data/Net/Http.fs:1720
Duplicated block (8 lines × 2) Β· Γ—3src/Deedle/Common/Common.fs:1185
Duplicated block (6 lines × 2) Β· Γ—3src/Deedle/DelayedSeries.fs:50

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

What to do

  1. Resolve the 5 Duplicated block (7 lines × 2) finding(s) in Code Duplication β€” start with Arrow.fs, Finance.fs, FrameModule.fs. β€” One of this dimension's main actionable groups (5 warning-level).
  2. Resolve the 5 Duplicated block (5 lines × 2) finding(s) in Code Duplication β€” start with LinearAlgebra.fs, Frame.fs, Stats.fs. β€” One of this dimension's main actionable groups (5 warning-level).
  3. Resolve the 3 Duplicated block (9 lines × 2) finding(s) in Code Duplication β€” start with Http.fs, Stats.fs, Series.fs. β€” One of this dimension's main actionable groups (3 warning-level).

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

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

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

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

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

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

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

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

Detailed fixes: d5_recommendation.md.

D6 Β· Cohesion (LCOM4)9.2 / 10Stronggated by 1 serious findingβœ“ Tool-verified

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

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

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

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

1 of 16 classes have LCOM4 above 3.

Low cohesion: LinearIndexBuilder (LCOM4 12)src/Deedle/Indices/LinearIndex.fs:245

What to do

  1. Resolve the 1 Low cohesion finding(s) in Cohesion (LCOM4) β€” start with LinearIndex.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.

D10 Β· Test Quality10.0 / 10Exemplaryβœ“ Tool-verified

What it measures: Whether the tests truly assert behaviour rather than just running the code.

Method: Per-test assertions, skips, and mock references analyzed via Roslyn; structured skip-reason tags (BUG:/ENV:) separate documented deferrals from debt. Deterministic.

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

0 skipped, 0 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 54 tests. Measured on the C# suite only β€” at least 39 test source file(s) (.fs) went unread, so its test quality is unmeasured and is not in these counts.

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

Detailed fixes: d10_recommendation.md.

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.

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

0 flaky across 1 measured tier(s). unit: measured (0 flaky).

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

Detailed fixes: d11_recommendation.md.

D12 Β· Dependency Hygiene7.5 / 10Strongβœ“ Tool-verified

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.

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

66 outdated, 0 vulnerable, 1 deprecated packages.

Deprecated: Microsoft.Testing.Platform.MSBuild
Outdated: FSharp.Core Β· Γ—66

What to do

  1. Resolve the 1 Deprecated finding(s) in Dependency Hygiene. β€” One of this dimension's main actionable groups (1 warning-level).

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

D13 Β· Secret Scanning10.0 / 10Exemplaryβ—‹ Nothing flagged

What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.

Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.

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

Secret scan ran and found no leaked secrets.

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

Detailed fixes: d13_recommendation.md.

D15 Β· Churn × Complexity Hotspots9.9 / 10Stronggated by 1 serious findingβœ“ Tool-verified

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

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

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

Top hotspots: src/Deedle/Frame.fs (3×26=78)

Hotspot: src/Deedle/Frame.fssrc/Deedle/Frame.fs:1345

What to do

  1. Resolve the 1 Hotspot finding(s) in Churn × Complexity Hotspots β€” start with Frame.fs. β€” One of this dimension's main actionable groups (1 warning-level).

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

D16 Β· Bus Factor8.0 / 10Strongβœ“ Tool-verified

What it measures: Whether knowledge is concentrated in too few people (the "bus factor").

Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.

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

9 source file(s) have their living knowledge concentrated in one author (β‰₯90% of recent, decayed contribution). The largest is src/Deedle/FrameModule.fs. Counted over 46 of the 60 production source files in this repository: 8 are under the ~2,400-byte size floor this dimension measures over, and the remaining 6 have no attributable history left to measure.

Detailed fixes: d16_recommendation.md.

D17 Β· Explicit Debt6.0 / 10Adequateβœ“ Tool-verified

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

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

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

6 deducted debt markers + unmeasured dead symbols across 0 LoC in the .NET projects (2.0/KLoC) β†’ score 6.0. Dead code not measured: the solution did not load cleanly, so the reference search was skipped. Measured on the .NET source only: .fs (100% of production source) was not read, and carries at least 0 uncounted task marker(s) in 0 file(s).

FileScopedPragmaDisable Β· Γ—5tests/Deedle.CSharp.Tests/ArrowTests.cs:1
CommentedOutCodetests/Deedle.CSharp.Tests/Series.cs:235

What to do

  1. Resolve the 5 FileScopedPragmaDisable finding(s) in Explicit Debt β€” start with ArrowTests.cs, ExcelReaderTests.cs, Frame.cs. β€” One of this dimension's main actionable groups (5 issue-level).
  2. Resolve the 1 CommentedOutCode finding(s) in Explicit Debt β€” start with Series.cs. β€” One of this dimension's main actionable groups (1 warning-level).

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

D19 Β· Documentation Quality10.0 / 10Exemplaryβ—‹ Nothing flagged

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.

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

1 of 1 documentation facets pass in full. 3 document(s) read across 1 unit(s).

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

Detailed fixes: d19_recommendation.md.

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

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

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

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

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

91 % of calls cross a namespace and 5 % go through an interface, but 100 % of collaborators are co-located β€” so a call's collaborators sit together and tracing stays easy. Baseline: small β€” navigation cost is tolerated.

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

Detailed fixes: d27_recommendation.md.

D28 Β· Secrets (history)10.0 / 10Exemplaryβ—‹ Nothing flagged

What it measures: Whether any secrets were ever committed β€” scanned across the full git history, not just now.

Method: Secret scan via TWO gitleaks detect passes in an isolated checkout β€” the full git history, then a second --no-git pass over the working tree as it stands β€” merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side β€” unscored and excluded from the lens, never a hedged middling score.

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

gitleaks scanned the full history AND the current working tree and found no secrets.

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

Detailed fixes: d28_recommendation.md.

D29 Β· Static Analysis (SAST)3.5 / 10Weakβœ“ Tool-verified

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

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

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

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

16 finding(s): 0 critical, 16 high, 0 medium, 0 low. 10 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` β€” one pinning decision is charged once, not once per lens. Separately, one or more rules could not re-parse an embedded snippet in 1 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.

REDACTED
REDACTED
REDACTED
REDACTED

What to do

  1. Resolve the 3 REDACTED finding(s) in Static Analysis (SAST) β€” start with REDACTED (3). β€” One of this dimension's main actionable groups (3 issue-level).
  2. Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) β€” start with REDACTED. β€” One of this dimension's main actionable groups (1 issue-level).
  3. No action in Static Analysis (SAST) β€” all 10 REDACTED finding(s) are reported here at file:line but scored by D36 (supply-chain provenance), so none is charged to this dimension. β€” One of this dimension's main actionable groups (10 issue-level, 0 of them charged here).

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

D30 Β· Dependency Vulnerabilities10.0 / 10Exemplaryβ—‹ Nothing flagged

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.

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

No known-vulnerable dependencies in any ecosystem this repository declares.

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

Detailed fixes: d30_recommendation.md.

D34 Β· Knowledge Freshness5.0 / 10Weakβœ“ Tool-verified

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.

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

28 of 52 significant source file(s) are orphaned β€” their living knowledge has decayed to nothing, so no one currently understands them. The largest is src/Deedle/FSharp.Data/Net/Http.fs. Counted over 52 of the 60 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Orphaned file Β· Γ—25src/Deedle/Indices/VirtualIndex.fs:1
Most significant orphaned file Β· Γ—3src/Deedle/FSharp.Data/Net/Http.fs:1
Concentrated knowledge decay

What to do

  1. Resolve the 25 Orphaned file finding(s) in Knowledge Freshness β€” start with VirtualIndex.fs, ArrayVector.fs, CsvRuntime.fs. β€” One of this dimension's main actionable groups (25 recommendation-level).
  2. Resolve the 3 Most significant orphaned file finding(s) in Knowledge Freshness β€” start with Http.fs, VirtualVector.fs, VirtualFrame.fs. β€” One of this dimension's main actionable groups (3 recommendation-level).
  3. Resolve the 1 Concentrated knowledge decay finding(s) in Knowledge Freshness. β€” One of this dimension's main actionable groups (1 recommendation-level).

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

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

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

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

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

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

No strong hidden change-coupling between production files.

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

Detailed fixes: d35_recommendation.md.

D36 Β· Supply-chain Provenance & Signing0.0 / 10Criticalβœ“ Tool-verified

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.

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

0/4 supply-chain integrity signals present (provenance, signing, SBOM, pinned actions).

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

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

What to do

  1. Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. β€” One of this dimension's main actionable groups (1 warning-level).
  2. Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing β€” start with REDACTED. β€” One of this dimension's main actionable groups (1 warning-level).
  3. Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. β€” One of this dimension's main actionable groups (1 warning-level).

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

D44 Β· Platform End-of-Life10.0 / 10Exemplaryβœ“ Tool-verified

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.

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

0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 17 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.

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

Detailed fixes: d44_recommendation.md.

Frontend & cross-cutting dimensions

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

AX10 Β· Code composition0.0 / 10Criticalβœ“ Tool-verified

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

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

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

AX3 Β· Project dependency cycles10.0 / 10Exemplaryβœ“ Tool-verified

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

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

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

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

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

GD1 Β· Unfinished & placeholder code10.0 / 10Exemplaryβ—‹ Nothing flagged

Other Β· Code Health β€” Unreviewed-generation residue in this repository's F#: bindings whose whole body still raises a "not implemented" error (NotImplementedException, failwith "not implemented"), and placeholder text (lorem ipsum, changeme/replace_me…) left in string literals of 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.

M1 Β· Documentation (README)6.0 / 10Adequateβœ“ Tool-verified

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.
M2 Β· Architecture documentation2.0 / 10Criticalβœ“ Tool-verified

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

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

  • No Architecture Decision Records found β€” no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.

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.
M3 Β· Folder & project structure10.0 / 10Exemplaryβœ“ Tool-verified

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.

M4 Β· Documentation accuracy10.0 / 10Exemplaryβ—‹ Nothing flagged

Maturity Β· Maturity β€” Whether the project's current-state documentation describes the code that exists.

Method: Every current-state document's checkable claims looked up in the tree (links, versions, and artefact counts an order of magnitude off), plus two README checks: an advertised infrastructure product with no footprint, and a module the CHANGELOG records as removed. Deterministic, no model. Advisory.

P1 Β· CI/CD gates10.0 / 10Exemplaryβ—‹ Nothing flagged

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

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

P3 Β· Security & performance tooling0.0 / 10Criticalβœ“ Tool-verified

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

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

  • No static application security testing detected. For this repository's stack, add `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:4
  • `paket.dependencies` 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`. β€” paket.dependencies:3

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.
P4 Β· Deployment & Rollback5.0 / 10Adequateβœ“ Tool-verified

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.

  • The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY'S PIPELINE FILES. What was read: every file under `.github/workflows/`, `.forgejo/workflows/`, `.gitea/workflows/`, `.azuredevops/` and `.azure-pipelines/`, plus `.gitlab-ci*` and `azure-pipelines*` β€” with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab's `when: manual`, CircleCI's `type: approval`, an Azure `ManualValidation@` task or an `approvals:` block, a Jenkins `input` step, a `uses:` step naming an approval action, an `environment:` paired with `reviewers` / `required_reviewers` / `protection` / `wait-timer` / `deployment_branch_policy`, a draft-release step, a `workflow_dispatch` promotion, or a release-event gate. β˜… What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy β€” all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release.

What to do

  • Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.
P6 Β· Release Hygiene10.0 / 10Exemplaryβœ“ Tool-verified

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

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

PF1 Β· Benchmark discipline9.5 / 10Exemplaryβœ“ Tool-verified

Readiness Β· Performance β€” Whether the code protects its performance with benchmarks β€” a benchmark suite, allocation/memory measurement, and (ideally) a CI gate. Presence is credited as a bonus, never a deduction.

Method: Repo + source scan: BenchmarkDotNet referenced (csproj/source), [Benchmark]/[MemoryDiagnoser] attribute counts, and a benchmark step in CI; off .NET, the same ladder over Go testing.B, Rust criterion/#[bench]/divan, JMH/kotlinx-benchmark, pytest-benchmark/asv/pyperf, tinybench/mitata/vitest bench/benchmark.js and Swift package-benchmark β€” scored as a bonus ladder (absence is neutral, never a deduction). Deterministic, presence detection.

PF3 Β· Async & latency hygiene10.0 / 10Exemplaryβœ“ Tool-verified

Readiness Β· Performance β€” Whether asynchronous code stays responsive β€” it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.

Method: Production-source scan: sync-over-async blocking counted everywhere β€” .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from each language's code model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect β€” and, for a .NET library with β‰₯5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.

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

Other Β· Code Health β€” Whether a `for … in` loop leaves the mutable .NET collection it is walking alone β€” F#'s own lists, arrays, maps and sets cannot be changed by a loop body, but a `ResizeArray`, `Dictionary`, `Queue` or other BCL collection walked by `for x in c do` is walked through its enumerator, so a body that adds to or removes from `c` makes the next `MoveNext` throw `InvalidOperationException` and the remaining items are never seen.

Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A β€” the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B β€” the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.

X28 Β· Index access outside its own emptiness guard10.0 / 10Exemplaryβ—‹ Nothing flagged

Other Β· Code Health β€” Whether a condition that tests a value for emptiness indexes that same value only where the test holds β€” an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.

Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty β€” a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.

Reference β€” by lens

The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.

LensScoreRatingImpact
Code Health65%AdequateAcceptable, with room to improve.
Architecture56%Adequate β€” gated by AX10Capped at Fair by a Critical contributor β€” resolve it before relying on this lens.
Maturity60%Adequate β€” gated by M2Capped at Fair by a Critical contributor β€” resolve it before relying on this lens.
Readiness56%Adequate β€” gated by P3Capped at Fair by a Critical contributor β€” resolve it before relying on this lens.
Security59%Checked 4 of 10Capped at Fair by a Critical contributor β€” resolve it before relying on this lens.
Performance97%ExemplaryStrongest area.
Not evidenced β€” 4 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.

  • C3 Audit Trail β€” Not assessed: these audit controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) 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. Absence of an idiom this check recognises is NOT evidence that this repository lacks audit controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • C4 Data Retention β€” Not assessed: these retention controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) 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. Absence of an idiom this check recognises is NOT evidence that this repository lacks retention controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • C5 Data-Subject Rights β€” Not assessed: these data-subject rights controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) 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. Absence of an idiom this check recognises is NOT evidence that this repository lacks data-subject rights controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • P5 DR & Backup β€” not evidenced β€” repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included β€” 71 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 β€” Not applicable: this repository's F# imports no dependency-injection container and defines no container of its own β€” nothing that both registers and resolves bindings, and nothing that names two lifetimes β€” so nothing holds one lifetime's instance while handing out another's.
  • AX2 Stateful singletons β€” No container singleton was found, so there is no shared instance for concurrent requests to race on. No F# function in this code takes an ASP.NET Core or Suave HttpContext (a Giraffe, Saturn, Falco, Oxpecker or Suave handler) and no F# class is an ASP.NET Core controller, so no request handler shares module state between request threads.
  • AX5 Architecture & structure β€” not assessed β€” architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX6 Interface segregation β€” not assessed β€” interface segregation is computed over a type surface that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX7 Slice cohesion β€” not applicable β€” not a vertical-slice architecture
  • AX8 Test isolation β€” no test/production split to check
  • AX9 CQS / query purity β€” no CQRS query handlers detected β€” query purity is not applicable to this codebase
  • AXB1 Runtime evidence locked β€” no reproducible boot β€” This repository has nothing the runtime tiers could boot or serve β€” no markup, no UI framework or web-server dependency, no UI component source, no native UI project and no API definition β€” nothing here is a surface to boot β€” so runtime a11y/egress/header evidence has no subject here. Not applicable: this is neither a gap in the scan nor a finding about your code.
  • C1 Data Protection β€” Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) 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. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • C2 Access Controls β€” Not assessed: these authorization controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) 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. Absence of an idiom this check recognises is NOT evidence that this repository lacks authorization controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • D14 License Compliance β€” Package licences not resolved for an MSBuild/NuGet 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#, html 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, `Deedle.CSharp.Tests` (0 LoC, 13 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.
  • D32 Data Compliance (PII/GDPR) β€” No personal data was found crossing a boundary the PII/GDPR ruleset checks β€” nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
  • D37 Vulnerability-disclosure Policy β€” No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
  • D40 Network Egress Confinement β€” No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
  • D41 Kernel & Syscall Confinement β€” No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
  • D42 Runtime Threat Enforcement β€” No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
  • D43 Malicious Dependencies β€” Not scored β€” no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Python pyproject.toml/requirements.txt (pip/uv/Poetry), a Swift Package.swift/Package.resolved, a Cargo manifest, a Go module (go.mod/go.sum), a Gradle version catalogue, a Maven POM, an sbt build (build.sbt), composer.json, package.json, a Dart pubspec.yaml, an Elixir mix.exs/mix.lock (Hex), a rebar.config / erlang.mk DEPS (Hex), a Ruby Gemfile/Gemfile.lock or .gemspec (Bundler/RubyGems) β€” not scanned yet).
  • D7 Architectural Integrity β€” no checkable ADRs and no dependency cycles β€” architectural integrity not assessed
  • D8 Code Coverage β€” Coverage not measured β€” no coverage collector is wired up
  • DM1 Domain Modelling β€” applicable but not scored (2 of 3 signals for this style β€” below the bar we score at): 41 value object(s); 2 domain event(s); its domain events are published by services or handlers β€” no domain entity raises one
  • 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 β€” reported, not scored β€” this repository's C# declares no analysable method bodies (a constants, record or DTO assembly), and this score is a density of unfinished work per method, which has no denominator here. The file-level signals below were still collected and are shown in full
  • 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'.
  • P2 Observability β€” This repository's F# source (7 module(s), 60 file(s) read) declares no entry point and bootstraps no server, and nothing here deploys a service β€” it is a library, run inside whatever hosts it, so production observability (structured logging, tracing/metrics, health checks) is N/A. If it grows a binary or a service, the dimension reactivates.
  • P7 Outbound HTTP resilience β€” not measured β€” the application kind could not be determined for this repo
  • 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
  • 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.
  • S1 Web-Security Posture β€” Not assessed: these web-security controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) 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. Absence of an idiom this check recognises is NOT evidence that this repository lacks web-security controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • X1 Async correctness β€” not analysed β€” these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X10 Duplicated predicate β€” Advisory β€” this card reports evidence and never carries a score, so there is nothing missing here.
  • X12 Unreachable branch β€” This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X13 Undrained process stream β€” This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X14 Bypassable address classification β€” This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X15 Unvalidated length from an untrusted reader β€” This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X16 Unfloored truncation loop β€” This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X17 Uncapped recursion over a caller-supplied document β€” This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X18 Disposal-pattern correctness β€” This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X19 Unrestored process-global state β€” This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X2 Cancellation propagation β€” 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
  • 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 β€” This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X22 Contradicted release guard β€” This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • 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 β€” This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X25 Inert configuration knob β€” This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X26 Unsynchronised callback handoff β€” This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X29 Per-element action decided by a fixed element β€” This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X3 Exception handling β€” not analysed β€” these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X30 Support guard that admits what it rejects β€” This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X32 Type resolved by simple name across every loaded assembly β€” This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
  • X4 Structured logging β€” 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
  • X5 Nullable reference types β€” not analysed β€” these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X9 Subsumed condition operand β€” Advisory β€” this card reports evidence and never carries a score, so there is nothing missing here.

Appendix A β€” Findings (grouped)

The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.

Critical β€” 20 finding(s)
D29 Β· Static Analysis (SAST) Β· REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D17 Β· Explicit Debt Β· FileScopedPragmaDisable Β· Γ—5
  • FileScopedPragmaDisable tests/Deedle.CSharp.Tests/ArrowTests.cs:1 β€” #pragma warning disable 1591 β€” the disable has no matching restore anywhere in this file, so it does not end with the construct that needed it: it runs to the end of the file and silences the rule for everything written below, including code added years later that nobody weighed against it. Close it with the matching restore directive immediately after the construct it covers β€” that alone turns a standing exemption into a scoped one β€” or fix the cause and drop the directive entirely.
  • FileScopedPragmaDisable tests/Deedle.CSharp.Tests/ExcelReaderTests.cs:1 β€” #pragma warning disable 1591 β€” the disable has no matching restore anywhere in this file, so it does not end with the construct that needed it: it runs to the end of the file and silences the rule for everything written below, including code added years later that nobody weighed against it. Close it with the matching restore directive immediately after the construct it covers β€” that alone turns a standing exemption into a scoped one β€” or fix the cause and drop the directive entirely.
  • FileScopedPragmaDisable tests/Deedle.CSharp.Tests/Frame.cs:1 β€” #pragma warning disable 1591 β€” the disable has no matching restore anywhere in this file, so it does not end with the construct that needed it: it runs to the end of the file and silences the rule for everything written below, including code added years later that nobody weighed against it. Close it with the matching restore directive immediately after the construct it covers β€” that alone turns a standing exemption into a scoped one β€” or fix the cause and drop the directive entirely.
  • FileScopedPragmaDisable tests/Deedle.CSharp.Tests/ParquetTests.cs:1 β€” #pragma warning disable 1591 β€” the disable has no matching restore anywhere in this file, so it does not end with the construct that needed it: it runs to the end of the file and silences the rule for everything written below, including code added years later that nobody weighed against it. Close it with the matching restore directive immediately after the construct it covers β€” that alone turns a standing exemption into a scoped one β€” or fix the cause and drop the directive entirely.
  • FileScopedPragmaDisable tests/Deedle.CSharp.Tests/Series.cs:1 β€” #pragma warning disable 1591 β€” the disable has no matching restore anywhere in this file, so it does not end with the construct that needed it: it runs to the end of the file and silences the rule for everything written below, including code added years later that nobody weighed against it. Close it with the matching restore directive immediately after the construct it covers β€” that alone turns a standing exemption into a scoped one β€” or fix the cause and drop the directive entirely.
D29 Β· Static Analysis (SAST) Β· REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 Β· Static Analysis (SAST) Β· REDACTED Β· Γ—1
  • REDACTED
D29 Β· Static Analysis (SAST) Β· REDACTED Β· Γ—1
  • REDACTED
Serious β€” 142 finding(s)
D3 Β· God Classes Β· FileTooLong Β· Γ—12
  • FileTooLong: Deedle/Frame.fs src/Deedle/Frame.fs β€” FileTooLong β€” 947 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 447 over it, 1.89× 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: Common/Common.fs src/Deedle/Common/Common.fs β€” FileTooLong β€” 858 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 34 functions. The bar is 500 significant lines; this is 358 over it, 1.72× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: Deedle/FrameModule.fs src/Deedle/FrameModule.fs β€” FileTooLong β€” 787 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 152 functions. The bar is 500 significant lines; this is 287 over it, 1.57× 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: Net/Http.fs src/Deedle/FSharp.Data/Net/Http.fs β€” FileTooLong β€” 779 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 46 functions. The bar is 500 significant lines; this is 279 over it, 1.56× 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: Deedle/Series.fs src/Deedle/Series.fs β€” FileTooLong β€” 726 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 226 over it, 1.45× 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: Deedle/SeriesModule.fs src/Deedle/SeriesModule.fs β€” FileTooLong β€” 615 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 147 functions. The bar is 500 significant lines; this is 115 over it, 1.23× 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: Deedle/FrameUtils.fs src/Deedle/FrameUtils.fs β€” FileTooLong β€” 574 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 74 over it, 1.15× 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: Deedle/FrameExtensions.fs src/Deedle/FrameExtensions.fs β€” FileTooLong β€” 531 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 31 over it, 1.06× 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: Deedle/Stats.fs src/Deedle/Stats.fs β€” FileTooLong β€” 529 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 29 over it, 1.06× 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: Deedle.Arrow/Arrow.fs src/Deedle.Arrow/Arrow.fs β€” FileTooLong β€” 526 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 26 over it, 1.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: Vectors/VectorHelpers.fs src/Deedle/Vectors/VectorHelpers.fs β€” FileTooLong β€” 521 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 21 over it, 1.04× 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: Deedle/VirtualLookupRange.fs src/Deedle/VirtualLookupRange.fs β€” FileTooLong β€” 501 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1 over it, 1.00× 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.
D3 Β· God Classes Β· TooManyMethods Β· Γ—5
  • TooManyMethods: Frame`2 src/Deedle/Frame.fs:83 β€” TooManyMethods β€” 159 methods. The bar is 30 methods; this is 129 over it, 5.30× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: Series`2 src/Deedle/Series.fs:58 β€” TooManyMethods β€” 150 methods. The bar is 30 methods; this is 120 over it, 5.00× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: FrameExtensions src/Deedle/FrameExtensions.fs:849 β€” TooManyMethods β€” 81 methods. The bar is 30 methods; this is 51 over it, 2.70× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: Stats src/Deedle/Stats.fs:417 β€” TooManyMethods β€” 67 methods. The bar is 30 methods; this is 37 over it, 2.23× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: SeriesExtensions src/Deedle/SeriesExtensions.fs:213 β€” TooManyMethods β€” 55 methods. The bar is 30 methods; this is 25 over it, 1.83× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
D4 Β· Code Duplication Β· Duplicated block (7 lines × 2) Β· Γ—5
  • Duplicated block (7 lines × 2) src/Deedle.Arrow/Arrow.fs:219 β€” src/Deedle.Arrow/Arrow.fs:219-225 | src/Deedle.Arrow/Arrow.fs:391-397 β€” 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/Deedle.MathNetNumerics/Finance.fs:18 β€” src/Deedle.MathNetNumerics/Finance.fs:18-24 | src/Deedle.MathNetNumerics/Finance.fs:87-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 (7 lines × 2) src/Deedle/FrameModule.fs:2025 β€” src/Deedle/FrameModule.fs:2025-2031 | src/Deedle/FrameModule.fs:2066-2072 β€” 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/Deedle/FrameUtils.fs:534 β€” src/Deedle/FrameUtils.fs:534-540 | src/Deedle/FrameUtils.fs:548-554 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited. β˜… These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/Deedle/FrameUtils.fs:532` calls `Write` and `src/Deedle/FrameUtils.fs:546` 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 (7 lines × 2) src/Deedle/Vectors/ArrayVector.fs:337 β€” src/Deedle/Vectors/ArrayVector.fs:337-343 | src/Deedle/Vectors/VectorHelpers.fs:324-330 β€” 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.
D4 Β· Code Duplication Β· Duplicated block (5 lines × 2) Β· Γ—5
  • Duplicated block (5 lines × 2) src/Deedle.MathNetNumerics/LinearAlgebra.fs:257 β€” src/Deedle.MathNetNumerics/LinearAlgebra.fs:257-261 | src/Deedle.MathNetNumerics/LinearAlgebra.fs:272-276 β€” 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/Deedle/Frame.fs:1377 β€” src/Deedle/Frame.fs:1377-1381 | src/Deedle/Series.fs:1270-1274 β€” the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach β€” a file they already depend on, or a new one alongside them β€” and call it from both call sites, so a change lands once.
  • Duplicated block (5 lines × 2) src/Deedle/Stats.fs:948 β€” src/Deedle/Stats.fs:948-952 | src/Deedle/Stats.fs:994-998 β€” 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/Deedle.Arrow/Arrow.fs:580 β€” src/Deedle.Arrow/Arrow.fs:580-584 | src/Deedle.Parquet/Parquet.fs:477-481 β€” the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach β€” a location they all depend on today, or a new shared one if there is none β€” and call it from each site; until then, every change has to be made twice.
  • Duplicated block (5 lines × 2) src/Deedle/VirtualLookupRange.fs:316 β€” src/Deedle/VirtualLookupRange.fs:316-320 | src/Deedle/VirtualLookupRange.fs:345-349 β€” 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/Deedle/VirtualLookupRange.fs:316` it runs out through the closing brace of the declaration holding it β€” the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand β€” widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 Β· Code Duplication Β· Duplicated block (9 lines × 2) Β· Γ—3
  • Duplicated block (9 lines × 2) src/Deedle/FSharp.Data/Net/Http.fs:1720 β€” src/Deedle/FSharp.Data/Net/Http.fs:1720-1728 | src/Deedle/FSharp.Data/Net/Http.fs:1744-1752 β€” 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/Deedle/FSharp.Data/Net/Http.fs:1720` 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/Deedle/Stats.fs:882 β€” src/Deedle/Stats.fs:882-890 | src/Deedle/Stats.fs:905-913 β€” 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/Deedle/Series.fs:846 β€” src/Deedle/Series.fs:846-854 | src/Deedle/Series.fs:869-877 β€” 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/Deedle/Series.fs:846` 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.
D4 Β· Code Duplication Β· Duplicated block (8 lines × 2) Β· Γ—3
  • Duplicated block (8 lines × 2) src/Deedle/Common/Common.fs:1185 β€” src/Deedle/Common/Common.fs:1185-1192 | src/Deedle/Common/Common.fs:1241-1251 β€” 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/Deedle/Common/Common.fs:1241` 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 (8 lines × 2) src/Deedle/FrameModule.fs:1201 β€” src/Deedle/FrameModule.fs:1201-1208 | src/Deedle/FrameModule.fs:1211-1218 β€” 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/Deedle/FrameModule.fs:1191 β€” src/Deedle/FrameModule.fs:1191-1198 | src/Deedle/FrameModule.fs:1211-1218 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
D4 Β· Code Duplication Β· Duplicated block (6 lines × 2) Β· Γ—3
  • Duplicated block (6 lines × 2) src/Deedle/DelayedSeries.fs:50 β€” src/Deedle/DelayedSeries.fs:50-55 | src/Deedle/DelayedSeries.fs:135-141 β€” 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/Deedle/DelayedSeries.fs:135` it does not close everything it opens, so those exact lines cannot be lifted as they stand β€” widen the region to the smallest complete statement or declaration that contains it, and extract that. 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 × 2) src/Deedle/Indices/LinearIndex.fs:150 β€” src/Deedle/Indices/LinearIndex.fs:150-155 | src/Deedle/Indices/LinearIndex.fs:162-167 β€” 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/Deedle/FrameExtensions.fs:114 β€” src/Deedle/FrameExtensions.fs:114-119 | src/Deedle/FrameExtensions.fs:148-153 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
D4 Β· Code Duplication Β· Duplicated block (5 lines × 3) Β· Γ—3
  • Duplicated block (5 lines × 3) src/Deedle.MathNetNumerics/Finance.fs:18 β€” src/Deedle.MathNetNumerics/Finance.fs:18-22 | src/Deedle.MathNetNumerics/Finance.fs:54-58 | src/Deedle.MathNetNumerics/Finance.fs:87-91 β€” 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 (5 lines × 3) src/Deedle.MathNetNumerics/Stats.fs:218 β€” src/Deedle.MathNetNumerics/Stats.fs:218-222 | src/Deedle.MathNetNumerics/Stats.fs:231-235 | src/Deedle.MathNetNumerics/Stats.fs:244-248 β€” 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/Deedle.MathNetNumerics/Stats.fs:218` 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 (5 lines × 3) src/Deedle/FrameExtensions.fs:1573 β€” src/Deedle/FrameExtensions.fs:1573-1577 | src/Deedle/FrameExtensions.fs:1589-1593 | src/Deedle/FrameExtensions.fs:1595-1599 β€” all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites β€” resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 Β· Code Duplication Β· Duplicated block (16 lines × 2) Β· Γ—2
  • Duplicated block (16 lines × 2) src/Deedle.Arrow/Arrow.fs:413 β€” src/Deedle.Arrow/Arrow.fs:413-428 | src/Deedle.Parquet/Parquet.fs:341-357 β€” 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/Deedle.Parquet/Parquet.fs:341` 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 (16 lines × 2) src/Deedle/FrameModule.fs:1881 β€” src/Deedle/FrameModule.fs:1881-1899 | src/Deedle/FrameModule.fs:1905-1920 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
D4 Β· Code Duplication Β· Duplicated block (15 lines × 2) Β· Γ—2
  • Duplicated block (15 lines × 2) src/Deedle/VirtualFrame.fs:265 β€” src/Deedle/VirtualFrame.fs:265-279 | src/Deedle/VirtualFrame.fs:327-341 β€” 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/Deedle/VirtualLookupRange.fs:213 β€” src/Deedle/VirtualLookupRange.fs:213-227 | src/Deedle/VirtualLookupRange.fs:232-246 β€” 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/Deedle/VirtualLookupRange.fs:213` 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.
D4 Β· Code Duplication Β· Duplicated block (5 lines × 10) Β· Γ—2
  • Duplicated block (5 lines × 10) src/Deedle.Arrow/Arrow.fs:52 β€” src/Deedle.Arrow/Arrow.fs:52-56 | src/Deedle.Arrow/Arrow.fs:59-63 | src/Deedle.Arrow/Arrow.fs:66-70 | src/Deedle.Arrow/Arrow.fs:73-77 | src/Deedle.Arrow/Arrow.fs:80-84 | src/Deedle.Arrow/Arrow.fs:87-91 | src/Deedle.Arrow/Arrow.fs:94-98 | src/Deedle.Arrow/Arrow.fs:101-105 | src/Deedle.Arrow/Arrow.fs:108-112 | src/Deedle.Arrow/Arrow.fs:115-119 β€” all 10 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 (5 lines × 10) src/Deedle.Parquet/Parquet.fs:52 β€” src/Deedle.Parquet/Parquet.fs:52-56 | src/Deedle.Parquet/Parquet.fs:58-62 | src/Deedle.Parquet/Parquet.fs:64-68 | src/Deedle.Parquet/Parquet.fs:70-74 | src/Deedle.Parquet/Parquet.fs:76-80 | src/Deedle.Parquet/Parquet.fs:82-86 | src/Deedle.Parquet/Parquet.fs:88-92 | src/Deedle.Parquet/Parquet.fs:94-98 | src/Deedle.Parquet/Parquet.fs:100-104 | src/Deedle.Parquet/Parquet.fs:106-110 β€” all 10 copies are in the same file, so extract the block into one function there and call it from every one of those sites β€” resolving only two of them leaves the rest to drift apart the first time one is edited.
D1 Β· Cyclomatic Complexity Β· ArrayVectorBuilder.Deedle.Vectors.IVectorBuilder.Build (cyclomatic 73) Β· Γ—1
  • ArrayVectorBuilder.Deedle.Vectors.IVectorBuilder.Build (cyclomatic 73) src/Deedle/Vectors/ArrayVector.fs:97 β€” ArrayVectorBuilder.Deedle.Vectors.IVectorBuilder.Build has cyclomatic complexity 73 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 Β· Cyclomatic Complexity Β· Implementation.batchesToFrame (cyclomatic 66) Β· Γ—1
  • Implementation.batchesToFrame (cyclomatic 66) src/Deedle.Arrow/Arrow.fs:239 β€” Implementation.batchesToFrame has cyclomatic complexity 66 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 Β· Cyclomatic Complexity Β· Implementation.columnToArrowArray (cyclomatic 52) Β· Γ—1
  • Implementation.columnToArrowArray (cyclomatic 52) src/Deedle.Arrow/Arrow.fs:48 β€” Implementation.columnToArrowArray has cyclomatic complexity 52 (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.
D1 Β· Cyclomatic Complexity Β· Implementation.columnToDataColumn (cyclomatic 42) Β· Γ—1
  • Implementation.columnToDataColumn (cyclomatic 42) src/Deedle.Parquet/Parquet.fs:49 β€” Implementation.columnToDataColumn has cyclomatic complexity 42 (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.
D1 Β· Cyclomatic Complexity Β· Implementation.readColumn (cyclomatic 41) Β· Γ—1
  • Implementation.readColumn (cyclomatic 41) src/Deedle.Parquet/Parquet.fs:138 β€” Implementation.readColumn has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 Β· Cyclomatic Complexity Β· FrameUtilsModule.readCsv (cyclomatic 40) Β· Γ—1
  • FrameUtilsModule.readCsv (cyclomatic 40) src/Deedle/FrameUtils.fs:613 β€” FrameUtilsModule.readCsv has cyclomatic complexity 40 (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.
D1 Β· Cyclomatic Complexity Β· Implementation.arrowArrayToVector (cyclomatic 33) Β· Γ—1
  • Implementation.arrowArrayToVector (cyclomatic 33) src/Deedle.Arrow/Arrow.fs:147 β€” Implementation.arrowArrayToVector has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 Β· Cyclomatic Complexity Β· LookupRangeExecutor.remapLookupRangeAfterStep (cyclomatic 33) Β· Γ—1
  • LookupRangeExecutor.remapLookupRangeAfterStep (cyclomatic 33) src/Deedle/VirtualLookupRange.fs:383 β€” LookupRangeExecutor.remapLookupRangeAfterStep has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 Β· Cyclomatic Complexity Β· VirtualVectorBuilder.Deedle.Vectors.IVectorBuilder.Build (cyclomatic 28) Β· Γ—1
  • VirtualVectorBuilder.Deedle.Vectors.IVectorBuilder.Build (cyclomatic 28) src/Deedle/Vectors/VirtualVector.fs:582 β€” VirtualVectorBuilder.Deedle.Vectors.IVectorBuilder.Build has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform β€” the same kind of value, with no behaviour of its own β€” a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 Β· Cyclomatic Complexity Β· Ranges.lookup (cyclomatic 27) Β· Γ—1
  • Ranges.lookup (cyclomatic 27) src/Deedle/Common/Ranges.fs:248 β€” Ranges.lookup has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 Β· Cyclomatic Complexity Β· Frame`2.FormatStrings (cyclomatic 26) Β· Γ—1
  • Frame`2.FormatStrings (cyclomatic 26) src/Deedle/Frame.fs:1345 β€” Frame`2.FormatStrings has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 Β· Cyclomatic Complexity Β· LookupRangeExecutor.intersect (cyclomatic 25) Β· Γ—1
  • LookupRangeExecutor.intersect (cyclomatic 25) src/Deedle/VirtualLookupRange.fs:525 β€” LookupRangeExecutor.intersect has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 Β· Cyclomatic Complexity Β· Seq.alignOrdered (cyclomatic 25) Β· Γ—1
  • Seq.alignOrdered (cyclomatic 25) src/Deedle/Common/Common.fs:1136 β€” Seq.alignOrdered has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 Β· Cyclomatic Complexity Β· FrameUtilsModule.writeCsv (cyclomatic 23) Β· Γ—1
  • FrameUtilsModule.writeCsv (cyclomatic 23) src/Deedle/FrameUtils.fs:297 β€” FrameUtilsModule.writeCsv has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform β€” the same kind of value, with no behaviour of its own β€” a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 Β· Cyclomatic Complexity Β· Ranges.restrictRanges (cyclomatic 23) Β· Γ—1
  • Ranges.restrictRanges (cyclomatic 23) src/Deedle/Common/Ranges.fs:174 β€” Ranges.restrictRanges has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 Β· Cyclomatic Complexity Β· CookieHandling.getAllCookiesFromHeader (cyclomatic 23) Β· Γ—1
  • CookieHandling.getAllCookiesFromHeader (cyclomatic 23) src/Deedle/FSharp.Data/Net/Http.fs:1387 β€” CookieHandling.getAllCookiesFromHeader has cyclomatic complexity 23 (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 is NOT this file's highest cyclomatic complexity: HttpHelpers.setHeaders (cyclomatic 43) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· Http.InnerRequest (cyclomatic 23) Β· Γ—1
  • Http.InnerRequest (cyclomatic 23) src/Deedle/FSharp.Data/Net/Http.fs:1505 β€” Http.InnerRequest has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform β€” the same kind of value, with no behaviour of its own β€” a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file's highest cyclomatic complexity: HttpHelpers.setHeaders (cyclomatic 43) is higher and carries no row of its own β€” it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 Β· Cyclomatic Complexity Β· VirtualCsvSource.isOrderedUniqueIndex (cyclomatic 22) Β· Γ—1
  • VirtualCsvSource.isOrderedUniqueIndex (cyclomatic 22) src/Deedle/VirtualCsvSource.fs:276 β€” VirtualCsvSource.isOrderedUniqueIndex has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 Β· Cyclomatic Complexity Β· LookupRangeExecutor.remapLookupRangeAfterAddresses (cyclomatic 21) Β· Γ—1
  • LookupRangeExecutor.remapLookupRangeAfterAddresses (cyclomatic 21) src/Deedle/VirtualLookupRange.fs:446 β€” LookupRangeExecutor.remapLookupRangeAfterAddresses has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 Β· Cyclomatic Complexity Β· Reflection.expandVector (cyclomatic 20) Β· Γ—1
  • Reflection.expandVector (cyclomatic 20) src/Deedle/FrameUtils.fs:152 β€” Reflection.expandVector has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 Β· Cyclomatic Complexity Β· Ranges.flattenRanges (cyclomatic 18) Β· Γ—1
  • Ranges.flattenRanges (cyclomatic 18) src/Deedle/DelayedSeries.fs:48 β€” Ranges.flattenRanges has cyclomatic complexity 18 (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.
D1 Β· Cyclomatic Complexity Β· Stats.interpolateLinearWith (cyclomatic 17) Β· Γ—1
  • Stats.interpolateLinearWith (cyclomatic 17) src/Deedle/Stats.fs:974 β€” Stats.interpolateLinearWith 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.
D1 Β· Cyclomatic Complexity Β· JoinHelpers.createJoinTransformation (cyclomatic 17) Β· Γ—1
  • JoinHelpers.createJoinTransformation (cyclomatic 17) src/Deedle/JoinHelpers.fs:68 β€” JoinHelpers.createJoinTransformation 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.
D1 Β· Cyclomatic Complexity Β· VirtualCsvSource.createConcatenatedFrame (cyclomatic 16) Β· Γ—1
  • VirtualCsvSource.createConcatenatedFrame (cyclomatic 16) src/Deedle/VirtualCsvSource.fs:434 β€” VirtualCsvSource.createConcatenatedFrame has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform β€” the same kind of value, with no behaviour of its own β€” a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 Β· Cyclomatic Complexity Β· IndexUtilsModule.binarySearch (cyclomatic 16) Β· Γ—1
  • IndexUtilsModule.binarySearch (cyclomatic 16) src/Deedle/VirtualFrame.fs:21 β€” IndexUtilsModule.binarySearch 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.
D1 Β· Cyclomatic Complexity Β· FrameUtilsModule.jsonFormatValue (cyclomatic 16) Β· Γ—1
  • FrameUtilsModule.jsonFormatValue (cyclomatic 16) src/Deedle/FrameUtils.fs:457 β€” FrameUtilsModule.jsonFormatValue 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.
D1 Β· Cyclomatic Complexity Β· FrameUtilsModule.writeJson (cyclomatic 16) Β· Γ—1
  • FrameUtilsModule.writeJson (cyclomatic 16) src/Deedle/FrameUtils.fs:503 β€” FrameUtilsModule.writeJson 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.
D1 Β· Cyclomatic Complexity Β· LinearIndexBuilder.Deedle.Indices.IIndexBuilder.Resample (cyclomatic 16) Β· Γ—1
  • LinearIndexBuilder.Deedle.Indices.IIndexBuilder.Resample (cyclomatic 16) src/Deedle/Indices/LinearIndex.fs:355 β€” LinearIndexBuilder.Deedle.Indices.IIndexBuilder.Resample 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.
D12 Β· Dependency Hygiene Β· Deprecated Β· Γ—1
  • Deprecated: Microsoft.Testing.Platform.MSBuild β€” Microsoft.Testing.Platform.MSBuild 2.4.1 β€” Legacy
D15 Β· Churn × Complexity Hotspots Β· Hotspot Β· Γ—1
  • Hotspot: src/Deedle/Frame.fs src/Deedle/Frame.fs:1345 β€” src/Deedle/Frame.fs changed 3 times in last 90 days, max cyclomatic complexity 26 in Frame`2.FormatStrings at line 1345. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 20:18:46 +00:00' --until='2026-11-08 20:18:46 +00:00' --full-history --no-merges -- src/Deedle/Frame.fs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each β€” a difference of several commits on a file whose history was re-landed or reverted inside the window.
D17 Β· Explicit Debt Β· CommentedOutCode Β· Γ—1
  • CommentedOutCode tests/Deedle.CSharp.Tests/Series.cs:235 β€” 3 consecutive commented-code lines
D2 Β· Cognitive Complexity Β· Implementation.batchesToFrame (cognitive 284) Β· Γ—1
  • Implementation.batchesToFrame (cognitive 284) src/Deedle.Arrow/Arrow.fs:239 β€” Implementation.batchesToFrame has cognitive complexity 284 (threshold 15). Drivers by points: loops 30 (158 pts), if/else 30 (114 pts), match/switch 3 (12 pts) (nesting depth added 221). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This file is where this pass's cognitive complexity CONCENTRATES: src/Deedle.Arrow/Arrow.fs holds 3 of the 45 methods over the threshold β€” including the worst β€” and 362 of the 1247 points over it (29%), 2.5× the next-largest file (src/Deedle/Vectors/ArrayVector.fs at 142). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 Β· Cognitive Complexity Β· ArrayVectorBuilder.Deedle.Vectors.IVectorBuilder.Build (cognitive 157) Β· Γ—1
  • ArrayVectorBuilder.Deedle.Vectors.IVectorBuilder.Build (cognitive 157) src/Deedle/Vectors/ArrayVector.fs:97 β€” ArrayVectorBuilder.Deedle.Vectors.IVectorBuilder.Build has cognitive complexity 157 (threshold 15). Drivers by points: if/else 31 (82 pts), loops 12 (43 pts), match/switch 10 (23 pts), boolean chains 9 (nesting depth added 95). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 Β· Cognitive Complexity Β· Implementation.readColumn (cognitive 104) Β· Γ—1
  • Implementation.readColumn (cognitive 104) src/Deedle.Parquet/Parquet.fs:138 β€” Implementation.readColumn has cognitive complexity 104 (threshold 15). Drivers by points: if/else 66 (103 pts), boolean chains 1 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 Β· Cognitive Complexity Β· Implementation.columnToArrowArray (cognitive 78) Β· Γ—1
  • Implementation.columnToArrowArray (cognitive 78) src/Deedle.Arrow/Arrow.fs:48 β€” Implementation.columnToArrowArray has cognitive complexity 78 (threshold 15). Drivers by points: match/switch 13 (39 pts), loops 13 (26 pts), if/else 13 (nesting depth added 39). 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 file is where this pass's cognitive complexity CONCENTRATES: src/Deedle.Arrow/Arrow.fs holds 3 of the 45 methods over the threshold β€” including the worst β€” and 362 of the 1247 points over it (29%), 2.5× the next-largest file (src/Deedle/Vectors/ArrayVector.fs at 142). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 Β· Cognitive Complexity Β· LookupRangeExecutor.remapLookupRangeAfterStep (cognitive 74) Β· Γ—1
  • LookupRangeExecutor.remapLookupRangeAfterStep (cognitive 74) src/Deedle/VirtualLookupRange.fs:383 β€” LookupRangeExecutor.remapLookupRangeAfterStep has cognitive complexity 74 (threshold 15). Drivers by points: if/else 31 (63 pts), match/switch 3 (8 pts), boolean chains 3 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 Β· Cognitive Complexity Β· VirtualCsvSource.isOrderedUniqueIndex (cognitive 71) Β· Γ—1
  • VirtualCsvSource.isOrderedUniqueIndex (cognitive 71) src/Deedle/VirtualCsvSource.fs:276 β€” VirtualCsvSource.isOrderedUniqueIndex has cognitive complexity 71 (threshold 15). Drivers by points: if/else 14 (42 pts), match/switch 4 (23 pts), boolean chains 4, loops 1 (2 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.
D2 Β· Cognitive Complexity Β· Ranges.lookup (cognitive 60) Β· Γ—1
  • Ranges.lookup (cognitive 60) src/Deedle/Common/Ranges.fs:248 β€” Ranges.lookup has cognitive complexity 60 (threshold 15). Drivers by points: if/else 24 (41 pts), loops 2 (10 pts), boolean chains 9 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 Β· Cognitive Complexity Β· FrameUtilsModule.readCsv (cognitive 57) Β· Γ—1
  • FrameUtilsModule.readCsv (cognitive 57) src/Deedle/FrameUtils.fs:613 β€” FrameUtilsModule.readCsv has cognitive complexity 57 (threshold 15). Drivers by points: if/else 26 (34 pts), match/switch 8 (13 pts), loops 5 (10 pts) (nesting depth added 18). 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.
D2 Β· Cognitive Complexity Β· Seq.alignOrdered (cognitive 49) Β· Γ—1
  • Seq.alignOrdered (cognitive 49) src/Deedle/Common/Common.fs:1136 β€” Seq.alignOrdered has cognitive complexity 49 (threshold 15). Drivers by points: if/else 20 (36 pts), boolean chains 6, loops 3 (5 pts), error handling 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 Β· Cognitive Complexity Β· Implementation.arrowArrayToVector (cognitive 45) Β· Γ—1
  • Implementation.arrowArrayToVector (cognitive 45) src/Deedle.Arrow/Arrow.fs:147 β€” Implementation.arrowArrayToVector has cognitive complexity 45 (threshold 15). Drivers by points: if/else 28 (42 pts), match/switch 2 (3 pts) (nesting depth added 15). The drivers above price the dispatch low by construction β€” a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full β€” so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass's cognitive complexity CONCENTRATES: src/Deedle.Arrow/Arrow.fs holds 3 of the 45 methods over the threshold β€” including the worst β€” and 362 of the 1247 points over it (29%), 2.5× the next-largest file (src/Deedle/Vectors/ArrayVector.fs at 142). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 Β· Cognitive Complexity Β· Frame`2.FormatStrings (cognitive 44) Β· Γ—1
  • Frame`2.FormatStrings (cognitive 44) src/Deedle/Frame.fs:1345 β€” Frame`2.FormatStrings has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (20 pts), loops 10 (20 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body: this score is breadth rather than depth β€” many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 Β· Cognitive Complexity Β· LinearIndexBuilder.Deedle.Indices.IIndexBuilder.Resample (cognitive 44) Β· Γ—1
  • LinearIndexBuilder.Deedle.Indices.IIndexBuilder.Resample (cognitive 44) src/Deedle/Indices/LinearIndex.fs:355 β€” LinearIndexBuilder.Deedle.Indices.IIndexBuilder.Resample has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (32 pts), match/switch 5 (11 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 Β· Cognitive Complexity Β· LookupRangeExecutor.intersect (cognitive 42) Β· Γ—1
  • LookupRangeExecutor.intersect (cognitive 42) src/Deedle/VirtualLookupRange.fs:525 β€” LookupRangeExecutor.intersect has cognitive complexity 42 (threshold 15). Drivers by points: if/else 20 (33 pts), match/switch 3 (6 pts), boolean chains 3 (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.
D2 Β· Cognitive Complexity Β· Implementation.columnToDataColumn (cognitive 42) Β· Γ—1
  • Implementation.columnToDataColumn (cognitive 42) src/Deedle.Parquet/Parquet.fs:49 β€” Implementation.columnToDataColumn has cognitive complexity 42 (threshold 15). Drivers by points: match/switch 14 (28 pts), if/else 14 (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.
D2 Β· Cognitive Complexity Β· Reflection.expandVector (cognitive 40) Β· Γ—1
  • Reflection.expandVector (cognitive 40) src/Deedle/FrameUtils.fs:152 β€” Reflection.expandVector has cognitive complexity 40 (threshold 15). Drivers by points: loops 5 (18 pts), match/switch 5 (14 pts), if/else 3 (6 pts), boolean chains 2 (nesting depth added 25). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 Β· Cognitive Complexity Β· Ranges.restrictRanges (cognitive 39) Β· Γ—1
  • Ranges.restrictRanges (cognitive 39) src/Deedle/Common/Ranges.fs:174 β€” Ranges.restrictRanges has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (29 pts), match/switch 3 (5 pts), boolean chains 3, loops 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.
D2 Β· Cognitive Complexity Β· FrameUtilsModule.writeJson (cognitive 37) Β· Γ—1
  • FrameUtilsModule.writeJson (cognitive 37) src/Deedle/FrameUtils.fs:503 β€” FrameUtilsModule.writeJson has cognitive complexity 37 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 6 (15 pts), match/switch 1 (nesting depth added 24). 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.
D2 Β· Cognitive Complexity Β· CookieHandling.getAllCookiesFromHeader (cognitive 37) Β· Γ—1
  • CookieHandling.getAllCookiesFromHeader (cognitive 37) src/Deedle/FSharp.Data/Net/Http.fs:1387 β€” CookieHandling.getAllCookiesFromHeader has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 4, loops 3 (4 pts), match/switch 1 (3 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.
D2 Β· Cognitive Complexity Β· Pluralizer.adjustCase (cognitive 35) Β· Γ—1
  • Pluralizer.adjustCase (cognitive 35) src/Deedle/FSharp.Data/CommonRuntime/Pluralizer.fs:190 β€” Pluralizer.adjustCase has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (32 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 19). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes β€” or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
D2 Β· Cognitive Complexity Β· FrameModule.MeltBy (cognitive 33) Β· Γ—1
  • FrameModule.MeltBy (cognitive 33) src/Deedle/FrameModule.fs:806 β€” FrameModule.MeltBy has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 3 (8 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.
D2 Β· Cognitive Complexity Β· LookupRangeExecutor.remapLookupRangeAfterAddresses (cognitive 30) Β· Γ—1
  • LookupRangeExecutor.remapLookupRangeAfterAddresses (cognitive 30) src/Deedle/VirtualLookupRange.fs:446 β€” LookupRangeExecutor.remapLookupRangeAfterAddresses has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 4 (11 pts), if/else 4 (10 pts), loops 3 (6 pts), boolean chains 3 (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.
D2 Β· Cognitive Complexity Β· Seq.alignAllOrderedFew (cognitive 30) Β· Γ—1
  • Seq.alignAllOrderedFew (cognitive 30) src/Deedle/Common/Common.fs:1247 β€” Seq.alignAllOrderedFew has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (19 pts), error handling 1 (4 pts), loops 4, match/switch 1 (2 pts), boolean chains 1 (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.
D2 Β· Cognitive Complexity Β· Implementation.rowGroupsToFrame (cognitive 29) Β· Γ—1
  • Implementation.rowGroupsToFrame (cognitive 29) src/Deedle.Parquet/Parquet.fs:296 β€” Implementation.rowGroupsToFrame has cognitive complexity 29 (threshold 15). Drivers by points: loops 4 (15 pts), if/else 8 (14 pts) (nesting depth added 17). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 Β· Cognitive Complexity Β· VirtualVectorBuilder.Deedle.Vectors.IVectorBuilder.Build (cognitive 28) Β· Γ—1
  • VirtualVectorBuilder.Deedle.Vectors.IVectorBuilder.Build (cognitive 28) src/Deedle/Vectors/VirtualVector.fs:582 β€” VirtualVectorBuilder.Deedle.Vectors.IVectorBuilder.Build has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 10 (17 pts), loops 2 (5 pts), if/else 3 (4 pts), boolean chains 2 (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.
D2 Β· Cognitive Complexity Β· Extraction.extractColData (cognitive 28) Β· Γ—1
  • Extraction.extractColData (cognitive 28) src/Deedle.MicrosoftML/DataView.fs:80 β€” Extraction.extractColData has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 7 (28 pts) (nesting depth added 21). 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.
D2 Β· Cognitive Complexity Β· IndexUtilsModule.binarySearch (cognitive 27) Β· Γ—1
  • IndexUtilsModule.binarySearch (cognitive 27) src/Deedle/VirtualFrame.fs:21 β€” IndexUtilsModule.binarySearch has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 3, 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.
D2 Β· Cognitive Complexity Β· Series`2.FormatStrings (cognitive 27) Β· Γ—1
  • Series`2.FormatStrings (cognitive 27) src/Deedle/Series.fs:1268 β€” Series`2.FormatStrings has cognitive complexity 27 (threshold 15). Drivers by points: loops 3 (11 pts), if/else 8 (9 pts), match/switch 1 (3 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 Β· Cognitive Complexity Β· FrameUtilsModule.jsonFormatValue (cognitive 25) Β· Γ—1
  • FrameUtilsModule.jsonFormatValue (cognitive 25) src/Deedle/FrameUtils.fs:457 β€” FrameUtilsModule.jsonFormatValue has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 2, match/switch 2 (nesting depth added 7). 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.
D2 Β· Cognitive Complexity Β· VirtualVectorSource.fillMissing (cognitive 25) Β· Γ—1
  • VirtualVectorSource.fillMissing (cognitive 25) src/Deedle/Vectors/VirtualVector.fs:449 β€” VirtualVectorSource.fillMissing has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 3 (6 pts), boolean chains 2 (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.
D2 Β· Cognitive Complexity Β· FrameUtilsModule.writeCsv (cognitive 24) Β· Γ—1
  • FrameUtilsModule.writeCsv (cognitive 24) src/Deedle/FrameUtils.fs:297 β€” FrameUtilsModule.writeCsv has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 5 (7 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 Β· Cognitive Complexity Β· VectorHelpers.createTypedRowCreator (cognitive 23) Β· Γ—1
  • VectorHelpers.createTypedRowCreator (cognitive 23) src/Deedle/Vectors/VectorHelpers.fs:575 β€” VectorHelpers.createTypedRowCreator has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (8 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 10). 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.
D2 Β· Cognitive Complexity Β· CsvFile`1..ctor (cognitive 23) Β· Γ—1
  • CsvFile`1..ctor (cognitive 23) src/Deedle/FSharp.Data/Csv/CsvRuntime.fs:245 β€” CsvFile`1..ctor has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 Β· Cognitive Complexity Β· FrameModule.Unstack (cognitive 20) Β· Γ—1
  • FrameModule.Unstack (cognitive 20) src/Deedle/FrameModule.fs:941 β€” FrameModule.Unstack has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 5 (7 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.
D2 Β· Cognitive Complexity Β· Seq.startAndEnd (cognitive 20) Β· Γ—1
  • Seq.startAndEnd (cognitive 20) src/Deedle/Common/Common.fs:808 β€” Seq.startAndEnd has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (11 pts), loops 4 (9 pts) (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth β€” many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 Β· Cognitive Complexity Β· Reflection.expandDictionary (cognitive 19) Β· Γ—1
  • Reflection.expandDictionary (cognitive 19) src/Deedle/FrameUtils.fs:117 β€” Reflection.expandDictionary has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (5 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 Β· Cognitive Complexity Β· Http.InnerRequest (cognitive 19) Β· Γ—1
  • Http.InnerRequest (cognitive 19) src/Deedle/FSharp.Data/Net/Http.fs:1505 β€” Http.InnerRequest has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9, match/switch 7, loops 2 (3 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth β€” many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 Β· Cognitive Complexity Β· Stats.interpolateLinearWith (cognitive 18) Β· Γ—1
  • Stats.interpolateLinearWith (cognitive 18) src/Deedle/Stats.fs:974 β€” Stats.interpolateLinearWith has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 6 (7 pts) (nesting depth added 7). 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.
D2 Β· Cognitive Complexity Β· JoinHelpers.createJoinTransformation (cognitive 18) Β· Γ—1
  • JoinHelpers.createJoinTransformation (cognitive 18) src/Deedle/JoinHelpers.fs:68 β€” JoinHelpers.createJoinTransformation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 7, match/switch 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 Β· Cognitive Complexity Β· CsvParsing.splitCsvLine (cognitive 17) Β· Γ—1
  • CsvParsing.splitCsvLine (cognitive 17) src/Deedle/VirtualCsvSource.fs:14 β€” CsvParsing.splitCsvLine has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 Β· Cognitive Complexity Β· CycleInference.tryDetectOptional (cognitive 17) Β· Γ—1
  • CycleInference.tryDetectOptional (cognitive 17) src/Deedle/VirtualLookupRange.fs:148 β€” CycleInference.tryDetectOptional has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 4 (5 pts), loops 1 (3 pts) (nesting depth added 9). 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.
D2 Β· Cognitive Complexity Β· LookupRangeExecutor.clipLookupRange (cognitive 17) Β· Γ—1
  • LookupRangeExecutor.clipLookupRange (cognitive 17) src/Deedle/VirtualLookupRange.fs:351 β€” LookupRangeExecutor.clipLookupRange has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, match/switch 1 (nesting depth added 6). 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.
D2 Β· Cognitive Complexity Β· FrameUtilsModule.expandVectors (cognitive 17) Β· Γ—1
  • FrameUtilsModule.expandVectors (cognitive 17) src/Deedle/FrameUtils.fs:764 β€” FrameUtilsModule.expandVectors has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (6 pts), match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 Β· Cognitive Complexity Β· Frame`2.Zip (cognitive 17) Β· Γ—1
  • Frame`2.Zip (cognitive 17) src/Deedle/Frame.fs:209 β€” Frame`2.Zip has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 4 (8 pts) (nesting depth added 9). 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.
D2 Β· Cognitive Complexity Β· Virtual.MaterializeFloatBatches (cognitive 16) Β· Γ—1
  • Virtual.MaterializeFloatBatches (cognitive 16) src/Deedle/VirtualFrame.fs:383 β€” Virtual.MaterializeFloatBatches has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 4 (5 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.
D2 Β· Cognitive Complexity Β· Stats.quantile (cognitive 16) Β· Γ—1
  • Stats.quantile (cognitive 16) src/Deedle/Stats.fs:816 β€” Stats.quantile has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2 (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.
D36 Β· Supply-chain Provenance & Signing Β· REDACTED Β· Γ—1
  • REDACTED
D36 Β· Supply-chain Provenance & Signing Β· REDACTED Β· Γ—1
  • REDACTED
D36 Β· Supply-chain Provenance & Signing Β· REDACTED Β· Γ—1
  • REDACTED
D4 Β· Code Duplication Β· Duplicated block (23–24 lines × 2) Β· Γ—1
  • Duplicated block (23–24 lines × 2) src/Deedle.Parquet/Parquet.fs:394 β€” src/Deedle.Parquet/Parquet.fs:394-416 | src/Deedle.Parquet/Parquet.fs:439-462 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
D4 Β· Code Duplication Β· Duplicated block (19 lines × 2) Β· Γ—1
  • Duplicated block (19 lines × 2) src/Deedle/Stats.fs:608 β€” src/Deedle/Stats.fs:608-626 | src/Deedle/Stats.fs:627-645 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
D4 Β· Code Duplication Β· Duplicated block (15–16 lines × 2) Β· Γ—1
  • Duplicated block (15–16 lines × 2) src/Deedle/Vectors/VirtualVector.fs:326 β€” src/Deedle/Vectors/VirtualVector.fs:326-341 | src/Deedle/Vectors/VirtualVector.fs:420-434 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
D4 Β· Code Duplication Β· Duplicated block (14–15 lines × 3) Β· Γ—1
  • Duplicated block (14–15 lines × 3) src/Deedle/FrameModule.fs:2032 β€” src/Deedle/FrameModule.fs:2032-2046 | src/Deedle/FrameModule.fs:2052-2065 | src/Deedle/FrameModule.fs:2073-2087 β€” all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites β€” resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 Β· Code Duplication Β· Duplicated block (12–15 lines × 2) Β· Γ—1
  • Duplicated block (12–15 lines × 2) src/Deedle/FrameUtils.fs:332 β€” src/Deedle/FrameUtils.fs:332-346 | src/Deedle/FrameUtils.fs:446-457 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names β€” the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 Β· Code Duplication Β· Duplicated block (14–15 lines × 2) Β· Γ—1
  • Duplicated block (14–15 lines × 2) src/Deedle/VirtualFrame.fs:281 β€” src/Deedle/VirtualFrame.fs:281-294 | src/Deedle/VirtualFrame.fs:343-357 β€” 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/Deedle/VirtualFrame.fs:281` 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.
D4 Β· Code Duplication Β· Duplicated block (13–14 lines × 6) Β· Γ—1
  • Duplicated block (13–14 lines × 6) src/Deedle/FSharp.Data/Net/Http.fs:1624 β€” src/Deedle/FSharp.Data/Net/Http.fs:1624-1637 | src/Deedle/FSharp.Data/Net/Http.fs:1647-1660 | src/Deedle/FSharp.Data/Net/Http.fs:1676-1688 | src/Deedle/FSharp.Data/Net/Http.fs:1705-1718 | src/Deedle/FSharp.Data/Net/Http.fs:1729-1742 | src/Deedle/FSharp.Data/Net/Http.fs:1753-1765 β€” all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites β€” resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 Β· Code Duplication Β· Duplicated block (13 lines × 2) Β· Γ—1
  • Duplicated block (13 lines × 2) src/Deedle.MathNetNumerics/Finance.fs:89 β€” src/Deedle.MathNetNumerics/Finance.fs:89-101 | src/Deedle.MathNetNumerics/Finance.fs:115-127 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
D4 Β· Code Duplication Β· Duplicated block (11 lines × 2) Β· Γ—1
  • Duplicated block (11 lines × 2) src/Deedle/FrameModule.fs:2094 β€” src/Deedle/FrameModule.fs:2094-2104 | src/Deedle/FrameModule.fs:2111-2122 β€” 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/Deedle/FrameModule.fs:2094` 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.
D4 Β· Code Duplication Β· Duplicated block (4–9 lines × 10) Β· Γ—1
  • Duplicated block (4–9 lines × 10) src/Deedle.Parquet/Parquet.fs:152 β€” src/Deedle.Parquet/Parquet.fs:152-155 | src/Deedle.Parquet/Parquet.fs:157-165 | src/Deedle.Parquet/Parquet.fs:168-176 | src/Deedle.Parquet/Parquet.fs:179-187 | src/Deedle.Parquet/Parquet.fs:190-198 | src/Deedle.Parquet/Parquet.fs:201-209 | src/Deedle.Parquet/Parquet.fs:212-220 | src/Deedle.Parquet/Parquet.fs:223-231 | src/Deedle.Parquet/Parquet.fs:234-242 | src/Deedle.Parquet/Parquet.fs:245-253 β€” all 10 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/Deedle.Parquet/Parquet.fs:157` 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 after the matched lines, `src/Deedle.Parquet/Parquet.fs:165` calls `n` and `src/Deedle.Parquet/Parquet.fs:155` does not β€” after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 Β· Code Duplication Β· Duplicated block (12–13 lines × 2) Β· Γ—1
  • Duplicated block (12–13 lines × 2) src/Deedle.Parquet/Parquet.fs:369 β€” src/Deedle.Parquet/Parquet.fs:369-381 | src/Deedle.Parquet/Parquet.fs:426-437 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited. β˜… These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/Deedle.Parquet/Parquet.fs:368` calls `Create` and `src/Deedle.Parquet/Parquet.fs:425` does not β€” after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 Β· Code Duplication Β· Duplicated block (10 lines × 2) Β· Γ—1
  • Duplicated block (10 lines × 2) src/Deedle/Vectors/VectorHelpers.fs:70 β€” src/Deedle/Vectors/VectorHelpers.fs:70-79 | src/Deedle/Vectors/VectorHelpers.fs:113-122 β€” both copies are in the same file, so extract the block into one function there and call it from each site β€” the copies drift apart the first time only one of them is edited.
D4 Β· Code Duplication Β· Duplicated block (8–9 lines × 2) Β· Γ—1
  • Duplicated block (8–9 lines × 2) src/Deedle/VirtualLookupRange.fs:149 β€” src/Deedle/VirtualLookupRange.fs:149-157 | src/Deedle/VirtualLookupRange.fs:175-182 β€” 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/Deedle/VirtualLookupRange.fs:149` 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.
D4 Β· Code Duplication Β· Duplicated block (7 lines × 3) Β· Γ—1
  • Duplicated block (7 lines × 3) src/Deedle.ExcelReader/ExcelReader.fs:36 β€” src/Deedle.ExcelReader/ExcelReader.fs:36-42 | src/Deedle.ExcelReader/ExcelReader.fs:56-62 | src/Deedle.ExcelReader/ExcelReader.fs:77-83 β€” all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites β€” resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 Β· Code Duplication Β· Duplicated block (11 lines × 10) Β· Γ—1
  • Duplicated block (11 lines × 10) src/Deedle.Parquet/Parquet.fs:152 β€” src/Deedle.Parquet/Parquet.fs:152-162 | src/Deedle.Parquet/Parquet.fs:163-173 | src/Deedle.Parquet/Parquet.fs:174-184 | src/Deedle.Parquet/Parquet.fs:185-195 | src/Deedle.Parquet/Parquet.fs:196-206 | src/Deedle.Parquet/Parquet.fs:207-217 | src/Deedle.Parquet/Parquet.fs:218-228 | src/Deedle.Parquet/Parquet.fs:229-239 | src/Deedle.Parquet/Parquet.fs:240-250 | src/Deedle.Parquet/Parquet.fs:251-261 β€” all 10 copies are in the same file, so extract the block into one function there and call it from every one of those sites β€” resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 Β· Code Duplication Β· Duplicated block (6 lines × 9) Β· Γ—1
  • Duplicated block (6 lines × 9) src/Deedle.Arrow/Arrow.fs:52 β€” src/Deedle.Arrow/Arrow.fs:52-57 | src/Deedle.Arrow/Arrow.fs:59-64 | src/Deedle.Arrow/Arrow.fs:66-71 | src/Deedle.Arrow/Arrow.fs:73-78 | src/Deedle.Arrow/Arrow.fs:80-85 | src/Deedle.Arrow/Arrow.fs:87-92 | src/Deedle.Arrow/Arrow.fs:94-99 | src/Deedle.Arrow/Arrow.fs:101-106 | src/Deedle.Arrow/Arrow.fs:108-113 β€” all 9 copies are in the same file, so extract the block into one function there and call it from every one of those sites β€” resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 Β· Code Duplication Β· Duplicated block (6 lines × 3) Β· Γ—1
  • Duplicated block (6 lines × 3) src/Deedle.MathNetNumerics/Finance.fs:20 β€” src/Deedle.MathNetNumerics/Finance.fs:20-25 | src/Deedle.MathNetNumerics/Finance.fs:89-94 | src/Deedle.MathNetNumerics/Finance.fs:115-120 β€” 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.
D6 Β· Cohesion (LCOM4) Β· Low cohesion Β· Γ—1
  • Low cohesion: LinearIndexBuilder (LCOM4 12) src/Deedle/Indices/LinearIndex.fs:245 β€” LinearIndexBuilder's methods fall into 12 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 12 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.
Minor β€” 37 finding(s)
D34 Β· Knowledge Freshness Β· Orphaned file Β· Γ—25
  • Orphaned file src/Deedle/Indices/VirtualIndex.fs:1 β€” No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Deedle/Vectors/ArrayVector.fs:1 β€” No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Deedle/FSharp.Data/Csv/CsvRuntime.fs:1 β€” No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Deedle/Common/Ranges.fs:1 β€” No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Deedle/FSharp.Data/CommonRuntime/StructuralInference.fs:1 β€” No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Deedle/Vectors/Vector.fs:1 β€” No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Deedle/FSharp.Data/CommonRuntime/Pluralizer.fs:1 β€” No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Deedle.MathNetNumerics/LinearRegression.fs:1 β€” No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Deedle/Indices/MultiKey.fs:1 β€” No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Deedle/FSharp.Data/CommonRuntime/IO.fs:1 β€” No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Deedle/Common/Address.fs:1 β€” No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Deedle.MathNetNumerics/Stats.fs:1 β€” No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Deedle/FSharp.Data/CommonRuntime/StructuralTypes.fs:1 β€” No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Deedle.MathNetNumerics/LinearAlgebra.fs:1 β€” No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Deedle/Vectors/VectorExtensions.fs:1 β€” No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Deedle/FSharp.Data/CommonRuntime/TextRuntime.fs:1 β€” No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Deedle/JoinHelpers.fs:1 β€” No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Deedle/FSharp.Data/Csv/CsvFile.fs:1 β€” No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Deedle/FSharp.Data/CommonRuntime/NameUtils.fs:1 β€” No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Deedle/FSharp.Data/CommonRuntime/Caching.fs:1 β€” No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Deedle/Common/Deque.fs:1 β€” No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Deedle/Common/BinomialHeap.fs:1 β€” No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Deedle.MathNetNumerics/Extensions.fs:1 β€” No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Deedle/FSharp.Data/Csv/CsvExtensions.fs:1 β€” No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Deedle.MathNetNumerics/PCA.fs:1 β€” No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
D34 Β· Knowledge Freshness Β· Most significant orphaned file Β· Γ—3
  • Most significant orphaned file src/Deedle/FSharp.Data/Net/Http.fs:1 β€” One of the orphaned files carrying the most lost knowledge β€” ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
  • Most significant orphaned file src/Deedle/Vectors/VirtualVector.fs:1 β€” One of the orphaned files carrying the most lost knowledge β€” ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
  • Most significant orphaned file src/Deedle/VirtualFrame.fs:1 β€” One of the orphaned files carrying the most lost knowledge β€” ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
D34 Β· Knowledge Freshness Β· Concentrated knowledge decay Β· Γ—1
  • Concentrated knowledge decay β€” 28 of 52 significant files have no living knowledge, while the repository is still being changed at a low rate (25 commit(s) in the last 90 days) β€” so this is one repo-wide knowledge-decay state, not 28 separate risks. Counted over 52 of the 60 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over. The code moved on without the people who understood these files: document them or schedule a read-through before the next change lands in them.
D36 Β· Supply-chain Provenance & Signing Β· REDACTED Β· Γ—1
  • REDACTED
D36 Β· Supply-chain Provenance & Signing Β· REDACTED Β· Γ—1
  • REDACTED
D36 Β· Supply-chain Provenance & Signing Β· REDACTED Β· Γ—1
  • REDACTED
D36 Β· Supply-chain Provenance & Signing Β· REDACTED Β· Γ—1
  • REDACTED
M2 Β· Architecture documentation Β· No ADRs Β· Γ—1
  • No ADRs β€” No Architecture Decision Records found β€” no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
P3 Β· Security & performance tooling Β· No SAST Β· Γ—1
  • No SAST REDACTED:4 β€” 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.
P3 Β· Security & performance tooling Β· No dependency-update automation Β· Γ—1
  • No dependency-update automation paket.dependencies:3 β€” `paket.dependencies` 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`.
P4 Β· Deployment & Rollback Β· No release approval gate Β· Γ—1
  • No release approval gate β€” The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY'S PIPELINE FILES. What was read: every file under `.github/workflows/`, `.forgejo/workflows/`, `.gitea/workflows/`, `.azuredevops/` and `.azure-pipelines/`, plus `.gitlab-ci*` and `azure-pipelines*` β€” with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab's `when: manual`, CircleCI's `type: approval`, an Azure `ManualValidation@` task or an `approvals:` block, a Jenkins `input` step, a `uses:` step naming an approval action, an `environment:` paired with `reviewers` / `required_reviewers` / `protection` / `wait-timer` / `deployment_branch_policy`, a draft-release step, a `workflow_dispatch` promotion, or a release-event gate. β˜… What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy β€” all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release.
Minor β€” 66 finding(s)
D12 Β· Dependency Hygiene Β· Outdated Β· Γ—66
  • Outdated: FSharp.Core β€” FSharp.Core 10.1.401 β†’ 11.0.101 available (referenced by Deedle).
  • Outdated: MathNet.Numerics.FSharp β€” MathNet.Numerics.FSharp 4.15.0 β†’ 5.0.0 available (referenced by Deedle.MathNetNumerics).
  • Outdated: System.Diagnostics.DiagnosticSource β€” System.Diagnostics.DiagnosticSource 10.0.12 β†’ 11.0.0 available (referenced by Deedle.MathNetNumerics).
  • Outdated: Azure.Core β€” Azure.Core 1.63.0 β†’ 1.65.0 available (referenced by Deedle.Tests).
  • Outdated: Azure.Monitor.OpenTelemetry.Exporter β€” Azure.Monitor.OpenTelemetry.Exporter 1.9.0 β†’ 1.10.0 available (referenced by Deedle.Tests).
  • Outdated: FsCheck β€” FsCheck 3.4.0 β†’ 3.6.0 available (referenced by Deedle.Tests).
  • Outdated: FsUnit β€” FsUnit 7.1.1 β†’ 8.0.0 available (referenced by Deedle.Tests).
  • Outdated: Microsoft.ApplicationInsights β€” Microsoft.ApplicationInsights 3.1.2 β†’ 3.2.0 available (referenced by Deedle.Tests).
  • Outdated: Microsoft.Bcl.AsyncInterfaces β€” Microsoft.Bcl.AsyncInterfaces 10.0.12 β†’ 11.0.0 available (referenced by Deedle.Tests).
  • Outdated: Microsoft.CodeCoverage β€” Microsoft.CodeCoverage 18.10.1 β†’ 18.12.0 available (referenced by Deedle.Tests).
  • Outdated: Microsoft.Extensions.Configuration β€” Microsoft.Extensions.Configuration 10.0.12 β†’ 11.0.0 available (referenced by Deedle.Tests).
  • Outdated: Microsoft.Extensions.Configuration.Abstractions β€” Microsoft.Extensions.Configuration.Abstractions 10.0.12 β†’ 11.0.0 available (referenced by Deedle.Tests).
  • Outdated: Microsoft.Extensions.Configuration.Binder β€” Microsoft.Extensions.Configuration.Binder 10.0.12 β†’ 11.0.0 available (referenced by Deedle.Tests).
  • Outdated: Microsoft.Extensions.Configuration.EnvironmentVariables β€” Microsoft.Extensions.Configuration.EnvironmentVariables 10.0.12 β†’ 11.0.0 available (referenced by Deedle.Tests).
  • Outdated: Microsoft.Extensions.DependencyInjection β€” Microsoft.Extensions.DependencyInjection 10.0.12 β†’ 11.0.0 available (referenced by Deedle.Tests).
  • Outdated: Microsoft.Extensions.DependencyInjection.Abstractions β€” Microsoft.Extensions.DependencyInjection.Abstractions 10.0.12 β†’ 11.0.0 available (referenced by Deedle.Tests).
  • Outdated: Microsoft.Extensions.DependencyModel β€” Microsoft.Extensions.DependencyModel 10.0.12 β†’ 11.0.0 available (referenced by Deedle.Tests).
  • Outdated: Microsoft.Extensions.Diagnostics.Abstractions β€” Microsoft.Extensions.Diagnostics.Abstractions 10.0.12 β†’ 11.0.0 available (referenced by Deedle.Tests).
  • Outdated: Microsoft.Extensions.FileProviders.Abstractions β€” Microsoft.Extensions.FileProviders.Abstractions 10.0.12 β†’ 11.0.0 available (referenced by Deedle.Tests).
  • Outdated: Microsoft.Extensions.Hosting.Abstractions β€” Microsoft.Extensions.Hosting.Abstractions 10.0.12 β†’ 11.0.0 available (referenced by Deedle.Tests).
  • Outdated: Microsoft.Extensions.Logging β€” Microsoft.Extensions.Logging 10.0.12 β†’ 11.0.0 available (referenced by Deedle.Tests).
  • Outdated: Microsoft.Extensions.Logging.Abstractions β€” Microsoft.Extensions.Logging.Abstractions 10.0.12 β†’ 11.0.0 available (referenced by Deedle.Tests).
  • Outdated: Microsoft.Extensions.Logging.Configuration β€” Microsoft.Extensions.Logging.Configuration 10.0.12 β†’ 11.0.0 available (referenced by Deedle.Tests).
  • Outdated: Microsoft.Extensions.Options β€” Microsoft.Extensions.Options 10.0.12 β†’ 11.0.0 available (referenced by Deedle.Tests).
  • Outdated: Microsoft.Extensions.Options.ConfigurationExtensions β€” Microsoft.Extensions.Options.ConfigurationExtensions 10.0.12 β†’ 11.0.0 available (referenced by Deedle.Tests).
  • + 41 more in this group β€” see findings.md.

Appendix B β€” Reproduction & audit trail

Every external tool invocation behind a deep-scan dimension β€” the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative β€” never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json β€” kept out of this table so the rendered report stays byte-identical across runs of the same commit.

DimensionToolVersionCommandFindingsRaw output
D28 Β· Secrets (history)gitleaksβ€”gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-aff7c30f4aa4425ab7c112b8b4c413b4/history.json --exit-code 0 --source .0artifacts/raw/gitleaks-history.json
D28 Β· Secrets (history)gitleaksβ€”gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-aff7c30f4aa4425ab7c112b8b4c413b4/tree.json --exit-code 0 --source .0artifacts/raw/gitleaks-tree.json
D29 Β· Static Analysis (SAST)semgrepβ€”semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/canine-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off --exclude *.arrow --exclude *.avro --exclude *.csv --exclude *.dat --exclude *.db --exclude *.feather --exclude *.geojson --exclude *.h5 --exclude *.hdf5 --exclude *.jsonl --exclude *.log --exclude *.ndjson --exclude *.npy --exclude *.npz --exclude *.orc --exclude *.parquet --exclude *.pickle --exclude *.pkl --exclude *.psv --exclude *.sqlite --exclude *.sqlite3 --exclude *.tfrecord --exclude *.tsv --exclude *.txt .16artifacts/raw/semgrep.json
D30 Β· Dependency Vulnerabilitiesdotnetβ€”dotnet list Deedle.sln package --vulnerable --include-transitive --format json0artifacts/raw/dotnet-vulnerable.json
D31 Β· IaC & Container Securitytrivyβ€”trivy: not applicable β€” No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.0β€”
D32 Β· Data Compliance (PII/GDPR)semgrepβ€”semgrep: not applicable β€” No personal data was found crossing a boundary the PII/GDPR ruleset checks β€” nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.0β€”
D37 Β· Vulnerability-disclosure Policydisclosureβ€”disclosure: not applicable β€” No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.0β€”
D40 Β· Network Egress Confinementruntime-hardeningβ€”runtime-hardening: not applicable β€” No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.0β€”
D41 Β· Kernel & Syscall Confinementruntime-hardeningβ€”runtime-hardening: not applicable β€” No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.0β€”
D42 Β· Runtime Threat Enforcementruntime-hardeningβ€”runtime-hardening: not applicable β€” No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.0β€”
D43 Β· Malicious Dependenciesnone (no readable dependency manifest)β€”none (no readable dependency manifest): not applicable β€” Not scored β€” no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Python pyproject.toml/requirements.txt (pip/uv/Poetry), a Swift Package.swift/Package.resolved, a Cargo manifest, a Go module (go.mod/go.sum), a Gradle version catalogue, a Maven POM, an sbt build (build.sbt), composer.json, package.json, a Dart pubspec.yaml, an Elixir mix.exs/mix.lock (Hex), a rebar.config / erlang.mk DEPS (Hex), a Ruby Gemfile/Gemfile.lock or .gemspec (Bundler/RubyGems) β€” not scanned yet).0β€”

Run 01a1d441-67f6-797a-8004-8feef6a723ad Β· every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

Downloadable artifacts

Machine-readable and reproducible from this commit + frozen rubric β€” drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.

⬇ Findings, MITRE CWE-tagged .sarif⬇ Health changelog .md