Public report of CSBiology/ProteomIQon, published 15 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.4). 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, 15 November 2026, 12:39 UTC · Survey ID cd_5910c29cd7d94c7baba5a0b87987950b

CSBiology/ProteomIQon

Measured 15 November 2026, 12:38 UTC, at code version fd245e7

Code coverage is not measured: The suite ran but produced no coverage data.

Test reliability is not measured: No test run produced results.

Supply-chain provenance & signing is not measured: Supply-chain provenance is not scored (this pipeline releases no artifact), but its build steps or GitHub Actions workflows have integrity defects, or nothing watches its dependency set for published advisories.

CAI score 60out of 100 Adequate
CriticalWeakAdequateStrongExemplary
Down 1 since the last survey

The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.

A medium codebase: 24,002 lines of product code in 30 projects, tests not counted · Estimated rebuild effort: about 0.2 person-years · Weakest lens: Code Health, 51

Findings by how serious they are

7 critical 208 serious 24 minor

42 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
15 November 2026, 12:38 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 ▸

39of 39 dimensions measured by tools.
232of 239 findings point to an exact file and line, so you can open each one in the code. The other 7 concern the repository as a whole, such as missing documentation.
39dimensions across 7 lenses, read from 24,002 lines of product code in 30 projects.
Chapters

Executive summary

CSBiology/ProteomIQon falls short of our standard for a preview release, held back most by its Code Health lens, the quality of the code itself. It scores 60 out of 100 and is rated Adequate, and all seven of its critical findings are security problems in the build pipeline.

Code Health, at 51, is the weakest lens and counts most in the score. The best first step is recording design decisions, worth about 4 points. Fixing the part of the code only one person knows comes next, worth about 2 points. Raising Code Health to 67 would lift the score to about 64.

Seven pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Pinning each tool to an exact version would close this risk.

The product code is 24,002 lines, about €35,000 to rebuild. Two of our security checks couldn't finish, among them the one for known security holes in its packages, so those results are missing, not clean passes.

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.
Code Health 51 · counts for 46%Production Readiness 53 · counts for 25%Maturity 63 · counts for 14%Security and Compliance 87 · counts for 8%Architecture 99 · counts for 4%Domain Modelling 100 · counts for 2%Performance 100 · counts for 1%

If Code Health rose from 51 to 67, the lowest score rated Strong, the score would rise from 60 to about 64.

Code composition: what the lines of code are
Product code 85%Tests 15%
New since the last survey: 122 findings

These 122 critical or serious findings weren't in the previous survey, on 31 October 2026. The first 100 are listed here, and the findings file in the download package lists them all.

  • Cyclomatic Complexity · AlignmentBasedQuantification.quantifyPeptides (cyclomatic 174) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Cyclomatic Complexity · AlignmentBasedQuantStatistics.scoreRuns (cyclomatic 57) src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs
  • Cyclomatic Complexity · PepValueCalculation.initCalculatePEPValueIRLS (cyclomatic 49) src/ProteomIQon/pepValueCalculation.fs
  • Cyclomatic Complexity · Wavelet.identifyPeaksBy (cyclomatic 49) src/ProteomIQon/BioFSharp.Mz_Temp.fs
  • Cyclomatic Complexity · PSMBasedQuantificationTIMs.quantifyPeptides (cyclomatic 43) src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs
  • Cyclomatic Complexity · BaselineAls.baselineAls (cyclomatic 42) src/ProteomIQon/BaselineAls.fs
  • Cyclomatic Complexity · PSMQuantification.quantifyLabeled (cyclomatic 31) src/ProteomIQon/PSMQuantification.fs
  • Cyclomatic Complexity · Normal.Solve (cyclomatic 30) src/ProteomIQon/MzCalibration.fs
  • Cyclomatic Complexity · console1.main (cyclomatic 27) src/AlignmentBasedQuantification/Program.fs
  • Cyclomatic Complexity · MsFraggerToPSM.findSpectrum (cyclomatic 23) src/MsFraggerToPSM/MsFraggerToPSM.fs
  • Cyclomatic Complexity · PeptideSpectrumMatchingTIMs.validateParameters (cyclomatic 19) src/PeptideSpectrumMatchingTIMs/PeptideSpectrumMatchingTIMs.fs
  • Cyclomatic Complexity · MzTABSections.peptideSection (cyclomatic 19) src/MzTAB/MzTABSections.fs
  • Cyclomatic Complexity · Wavelet.transformFast (cyclomatic 18) src/ProteomIQon/BioFSharp.Mz_Temp.fs
  • Cyclomatic Complexity · console1.main (cyclomatic 18) src/PeptideSpectrumMatchingTIMs/Program.fs
  • Cyclomatic Complexity · TableSort.filterFrame (cyclomatic 17) src/TableSort/TableSort.fs
  • Cyclomatic Complexity · MzCalibration.crossValidate (cyclomatic 16) src/ProteomIQon/MzCalibration.fs
  • Cyclomatic Complexity · PeptideSpectrumMatchingTIMs.searchSliceWith (cyclomatic 16) src/PeptideSpectrumMatchingTIMs/PeptideSpectrumMatchingTIMs.fs
  • Cyclomatic Complexity · AlignmentBasedQuantStatistics.readRun (cyclomatic 16) src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs
  • Cyclomatic Complexity · SwathAnalysis.quantifyFragments (cyclomatic 16) src/SWATHAnalysis/SWATHAnalysis.fs
  • Cognitive Complexity · AlignmentBasedQuantification.quantifyPeptides (cognitive 290) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Cognitive Complexity · PSMQuantification.quantifyLabeled (cognitive 145) src/ProteomIQon/PSMQuantification.fs
  • Cognitive Complexity · BaselineAls.baselineAls (cognitive 109) src/ProteomIQon/BaselineAls.fs
  • Cognitive Complexity · Normal.Solve (cognitive 97) src/ProteomIQon/MzCalibration.fs
  • Cognitive Complexity · AlignmentBasedQuantStatistics.scoreRuns (cognitive 90) src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs
  • Cognitive Complexity · PepValueCalculation.initCalculatePEPValueIRLS (cognitive 79) src/ProteomIQon/pepValueCalculation.fs
  • Cognitive Complexity · PSMBasedQuantificationTIMs.quantifyPeptides (cognitive 74) src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs
  • Cognitive Complexity · Wavelet.identifyPeaksBy (cognitive 65) src/ProteomIQon/BioFSharp.Mz_Temp.fs
  • Cognitive Complexity · PSMBasedQuantificationTIMs.tryFitGaussian2D (cognitive 44) src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs
  • Cognitive Complexity · RobustShift.outOfFold (cognitive 41) src/QuantBasedAlignment/QuantBasedAlignment.fs
  • Cognitive Complexity · console1.main (cognitive 37) src/AlignmentBasedQuantification/Program.fs
  • Cognitive Complexity · MsFraggerToPSM.findSpectrum (cognitive 36) src/MsFraggerToPSM/MsFraggerToPSM.fs
  • Cognitive Complexity · PSMBasedQuantificationTIMs.correctBaselineAlongRt (cognitive 36) src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs
  • Cognitive Complexity · Xic.closestPoint (cognitive 34) src/ProteomIQon/Xic.fs
  • Cognitive Complexity · Wavelet.transformFast (cognitive 34) src/ProteomIQon/BioFSharp.Mz_Temp.fs
  • Cognitive Complexity · SpectrumSearch.collect (cognitive 33) src/PeptideSpectrumMatchingTIMs/SpectrumSearch.fs
  • Cognitive Complexity · SwathAnalysis.quantifyFragments (cognitive 33) src/SWATHAnalysis/SWATHAnalysis.fs
  • Cognitive Complexity · PSMQuantification.quantifyLabelFree (cognitive 32) src/ProteomIQon/PSMQuantification.fs
  • Cognitive Complexity · Xic.centrePoints (cognitive 31) src/ProteomIQon/Xic.fs
  • Cognitive Complexity · PeakSelection.fitLogistic (cognitive 31) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Cognitive Complexity · MzCalibration.crossValidate (cognitive 25) src/ProteomIQon/MzCalibration.fs
  • Cognitive Complexity · SpectrumSearch.expectationModelOfHistogram (cognitive 25) src/PeptideSpectrumMatchingTIMs/SpectrumSearch.fs
  • Cognitive Complexity · AlignmentFeatures.xicCompetition (cognitive 24) src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs
  • Cognitive Complexity · PeptideSpectrumMatchingTIMs.searchSliceWith (cognitive 23) src/PeptideSpectrumMatchingTIMs/PeptideSpectrumMatchingTIMs.fs
  • Cognitive Complexity · PeptideSpectrumMatchingTIMs.finishRunWith (cognitive 23) src/PeptideSpectrumMatchingTIMs/PeptideSpectrumMatchingTIMs.fs
  • Cognitive Complexity · PeptideIndex.sliceBoundariesFor (cognitive 23) src/PeptideSpectrumMatchingTIMs/PeptideIndex.fs
  • Cognitive Complexity · PeakSelection.createCandidates (cognitive 23) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Cognitive Complexity · Xic.extractPointWith (cognitive 22) src/ProteomIQon/Xic.fs
  • Cognitive Complexity · PeptideSpectrumMatchingTIMs.scoreRunsWithPeakReader (cognitive 22) src/PeptideSpectrumMatchingTIMs/PeptideSpectrumMatchingTIMs.fs
  • Cognitive Complexity · SpectrumSearch.scatter (cognitive 22) src/PeptideSpectrumMatchingTIMs/SpectrumSearch.fs
  • Cognitive Complexity · PeptideIndex.loadPeptideTable (cognitive 22) src/PeptideSpectrumMatchingTIMs/PeptideIndex.fs
  • Cognitive Complexity · AlignmentFeatures.isotopeFeatures (cognitive 22) src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs
  • Cognitive Complexity · MzTABSections.peptideSection (cognitive 22) src/MzTAB/MzTABSections.fs
  • Cognitive Complexity · TableSort.filterFrame (cognitive 21) src/TableSort/TableSort.fs
  • Cognitive Complexity · MzCalibration.compareObservations (cognitive 20) src/ProteomIQon/MzCalibration.fs
  • Cognitive Complexity · PeptideIndex.buildFragmentIndexWith (cognitive 20) src/PeptideSpectrumMatchingTIMs/PeptideIndex.fs
  • Cognitive Complexity · XicSweep.sweep (cognitive 20) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Cognitive Complexity · PeakShape.emgModeOffset (cognitive 19) src/ProteomIQon/PeakShape.fs
  • Cognitive Complexity · Wavelet.bestSubsetFast (cognitive 19) src/ProteomIQon/BioFSharp.Mz_Temp.fs
  • Cognitive Complexity · console1.main (cognitive 19) src/PSMBasedQuantificationTIMs/Program.fs
  • Cognitive Complexity · AlignmentScoring.fitPlatt (cognitive 19) src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs
  • Cognitive Complexity · IsotopePatterns.store (cognitive 18) src/ProteomIQon/IsotopePatterns.fs
  • Cognitive Complexity · SeqIO'.stringFunction (cognitive 18) src/ProteomIQon/BioFSharp.Mz_Temp.fs
  • Cognitive Complexity · QuantBasedAlignment.alignPair (cognitive 17) src/QuantBasedAlignment/QuantBasedAlignment.fs
  • Cognitive Complexity · PeakSelection.fwhm (cognitive 17) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Cognitive Complexity · AlignmentBasedQuantStatistics.readRun (cognitive 17) src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs
  • Cognitive Complexity · console1.main (cognitive 17) src/SWATHAnalysis/Program.fs
  • Cognitive Complexity · PSMQuantification.qualityFilter (cognitive 16) src/ProteomIQon/PSMQuantification.fs
  • Cognitive Complexity · QuantBasedAlignment.apexOrDropReason (cognitive 16) src/QuantBasedAlignment/QuantBasedAlignment.fs
  • Cognitive Complexity · PSMBasedQuantificationTIMs.tryWeightedMeanOrMean (cognitive 16) src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs
  • Cognitive Complexity · PSMBasedQuantificationTIMs.tryFindHighestGaborPositionNearExpectedPosition (cognitive 16) src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs
  • Cognitive Complexity · console1.main (cognitive 16) src/AlignmentBasedQuantStatistics/Program.fs
  • God Classes · FileTooLong: AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs
  • God Classes · FileTooLong: ProteomIQon/PSMQuantification.fs src/ProteomIQon/PSMQuantification.fs
  • Code Duplication · Members sharing a duplicated core (7 members, 50+ identical tokens) ConsoleTemplate/template/Program.fs
  • Code Duplication · Members sharing a duplicated core (7 members, 50+ identical tokens) src/AlignmentBasedQuantification/CLIArgumentParsing.fs
  • Code Duplication · Members sharing a duplicated core (6 members, 50+ identical tokens) ConsoleTemplate/template/Program.fs
  • Code Duplication · Members sharing a duplicated core (6 members, 50+ identical tokens) src/AlignmentBasedQuantification/Program.fs
  • Code Duplication · Members sharing a duplicated core (5 members, 50+ identical tokens) src/PSMBasedQuantification/Program.fs
  • Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) src/JoinQuantPepIonsWithProteins/Program.fs
  • Code Duplication · Edited copies of one member (3 members, 26+ corresponding lines) src/MsFraggerToPSM/CLIArgumentParsing.fs
  • Code Duplication · Edited copy of a member (23 corresponding lines) src/ConsensusSpectralLibrary/CLIArgumentParsing.fs
  • Code Duplication · Edited copy of a member (20 corresponding lines) src/MzliteToMzML/CLIArgumentParsing.fs
  • Code Duplication · Duplicated block (40 lines × 2) src/ProteomIQon/PSMQuantification.fs
  • Code Duplication · Duplicated block (30–31 lines × 2) src/PSMBasedQuantification/Program.fs
  • Code Duplication · Duplicated block (23–24 lines × 2) src/PSMBasedQuantification/PSMBasedQuantification.fs
  • Code Duplication · Duplicated block (22 lines × 2) src/PSMBasedQuantification/PSMBasedQuantification.fs
  • Code Duplication · Duplicated block (22 lines × 2) src/ProteomIQon/PSMQuantification.fs
  • Code Duplication · Duplicated block (20–21 lines × 3) src/ProteomIQon/PSMQuantification.fs
  • Code Duplication · Duplicated block (21 lines × 2) src/PSMBasedQuantification/PSMBasedQuantification.fs
  • Code Duplication · Duplicated block (16–17 lines × 3) src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs
  • Code Duplication · Duplicated block (17 lines × 2) src/ProteomIQon/PSMQuantification.fs
  • Code Duplication · Duplicated block (15–16 lines × 2) src/PSMBasedQuantification/PSMBasedQuantification.fs
  • Code Duplication · Duplicated block (13–16 lines × 2) src/PeptideSpectrumMatchingTIMs/PeptideIndex.fs
  • Code Duplication · Duplicated block (15 lines × 3) src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs
  • Code Duplication · Duplicated block (15 lines × 2) src/ProteomIQon/PSMQuantification.fs
  • Code Duplication · Duplicated block (13–14 lines × 5) src/ProteomIQon/PSMQuantification.fs
  • Code Duplication · Duplicated block (13 lines × 3) src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs
  • Code Duplication · Duplicated block (14 lines × 3) src/AlignmentBasedQuantStatistics/Program.fs
  • Code Duplication · Duplicated block (12 lines × 2) src/ProteomIQon/PSMQuantification.fs
  • Code Duplication · Duplicated block (9 lines × 2) src/PSMStatistics/PSMStatistics.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: 116 findings

These 116 critical or serious findings were in the previous survey, on 31 October 2026, and are gone from this one. The first 100 are listed here.

  • God Classes · FileTooLong: PSMBasedQuantification/PSMBasedQuantification.fs src/PSMBasedQuantification/PSMBasedQuantification.fs
  • God Classes · FileTooLong: QuantBasedAlignment/QuantBasedAlignment.fs src/QuantBasedAlignment/QuantBasedAlignment.fs
  • Code Duplication · Near-duplicate member pair (268 shared lines) src/ProteomIQon/pepValue/pepValueCalculation.fs
  • Code Duplication · Members sharing a duplicated core (8 members, 50+ identical tokens) ConsoleTemplate/template/Program.fs
  • Code Duplication · Members sharing a duplicated core (8 members, 50+ identical tokens) src/AlignmentBasedQuantification/CLIArgumentParsing.fs
  • Code Duplication · Members sharing a duplicated core (6 members, 50+ identical tokens) ConsoleTemplate/template/Program.fs
  • Code Duplication · Members sharing a duplicated core (6 members, 50+ identical tokens) src/AlignmentBasedQuantification/Program.fs
  • Code Duplication · Members sharing a duplicated core (6 members, 50+ identical tokens) src/AlignmentBasedQuantification/Program.fs
  • Code Duplication · Members sharing a duplicated core (5 members, 50+ identical tokens) src/AlignmentBasedQuantification/Program.fs
  • Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (97–102 lines × 2) src/ProteomIQon/pepValue/pepValueCalculation.fs
  • Code Duplication · Duplicated block (75–76 lines × 3) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (66–67 lines × 2) src/PSMBasedQuantification/PSMBasedQuantification.fs
  • Code Duplication · Duplicated block (61–62 lines × 2) src/ProteomIQon/pepValue/pepValueCalculation.fs
  • Code Duplication · Duplicated block (56 lines × 2) src/ConsensusSpectralLibrary/ConsensusSpectralLibrary.fs
  • Code Duplication · Duplicated block (53 lines × 2) src/PSMBasedQuantification/Program.fs
  • Code Duplication · Duplicated block (46 lines × 2) src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs
  • Code Duplication · Duplicated block (46 lines × 2) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (40–41 lines × 2) src/PSMBasedQuantification/PSMBasedQuantification.fs
  • Code Duplication · Duplicated block (40 lines × 2) src/PSMBasedQuantification/PSMBasedQuantification.fs
  • Code Duplication · Duplicated block (38 lines × 3) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (38 lines × 2) src/PSMBasedQuantification/PSMBasedQuantification.fs
  • Code Duplication · Duplicated block (36 lines × 2) src/PSMBasedQuantification/PSMBasedQuantification.fs
  • Code Duplication · Duplicated block (35–36 lines × 2) src/PeptideSpectrumMatching/PeptideSpectrumMatching.fs
  • Code Duplication · Duplicated block (35 lines × 3) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (34 lines × 3) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (34 lines × 2) src/ProteomIQon/pepValue/pepValueCalculation.fs
  • Code Duplication · Duplicated block (31–32 lines × 3) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (31 lines × 2) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (3–31 lines × 3) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (28 lines × 2) src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs
  • Code Duplication · Duplicated block (27 lines × 4) src/PSMBasedQuantification/PSMBasedQuantification.fs
  • Code Duplication · Duplicated block (25–26 lines × 2) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (25 lines × 6) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (24 lines × 2) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (22–23 lines × 3) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (22 lines × 4) src/PSMBasedQuantification/PSMBasedQuantification.fs
  • Code Duplication · Duplicated block (22 lines × 2) src/ProteomIQon/pepValue/pepValueCalculation.fs
  • Code Duplication · Duplicated block (20–21 lines × 6) src/PSMBasedQuantification/PSMBasedQuantification.fs
  • Code Duplication · Duplicated block (20–21 lines × 3) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (19–20 lines × 3) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (20 lines × 3) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (9–19 lines × 2) src/ProteomIQon/pepValue/pepValueCalculation.fs
  • Code Duplication · Duplicated block (19 lines × 2) src/ProteomIQon/pepValue/pepValueCalculation.fs
  • Code Duplication · Duplicated block (18 lines × 2) src/AlignmentBasedQuantStatistics/Program.fs
  • Code Duplication · Duplicated block (17–18 lines × 2) src/AlignmentBasedQuantStatistics/Program.fs
  • Code Duplication · Duplicated block (18 lines × 2) src/ProteomIQon/pepValue/pepValueCalculation.fs
  • Code Duplication · Duplicated block (16–17 lines × 3) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (16 lines × 6) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (15–16 lines × 5) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (16 lines × 3) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (16 lines × 3) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (15–16 lines × 2) src/PSMBasedQuantification/PSMBasedQuantification.fs
  • Code Duplication · Duplicated block (16 lines × 2) src/QuantBasedAlignment/QuantBasedAlignment.fs
  • Code Duplication · Duplicated block (15 lines × 5) src/PSMBasedQuantification/PSMBasedQuantification.fs
  • Code Duplication · Duplicated block (15 lines × 3) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (15 lines × 3) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (15 lines × 2) src/PSMBasedQuantification/PSMBasedQuantification.fs
  • Code Duplication · Duplicated block (5–15 lines × 2) src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs
  • Code Duplication · Duplicated block (13–14 lines × 10) src/PSMBasedQuantification/PSMBasedQuantification.fs
  • Code Duplication · Duplicated block (13–14 lines × 6) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (13–14 lines × 3) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (13–14 lines × 2) src/PSMStatistics/PSMStatistics.fs
  • Code Duplication · Duplicated block (4–13 lines × 5) src/AlignmentBasedQuantStatistics/Program.fs
  • Code Duplication · Duplicated block (13 lines × 2) src/PSMBasedQuantification/PSMBasedQuantification.fs
  • Code Duplication · Duplicated block (13 lines × 2) src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs
  • Code Duplication · Duplicated block (11–12 lines × 2) src/AlignmentBasedQuantification/Program.fs
  • Code Duplication · Duplicated block (11 lines × 3) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (11 lines × 2) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (4–11 lines × 4) src/PSMBasedQuantification/PSMBasedQuantification.fs
  • Code Duplication · Duplicated block (10 lines × 4) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (9–10 lines × 3) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (9 lines × 4) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (9 lines × 4) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (9 lines × 3) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (9 lines × 3) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (9 lines × 2) src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs
  • Code Duplication · Duplicated block (9 lines × 2) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (9 lines × 2) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (9 lines × 2) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (9 lines × 2) src/AlignmentBasedQuantification/Program.fs
  • Code Duplication · Duplicated block (9 lines × 2) src/PSMBasedQuantification/PSMBasedQuantification.fs
  • Code Duplication · Duplicated block (9 lines × 2) src/PSMBasedQuantification/PSMBasedQuantification.fs
  • Code Duplication · Duplicated block (9 lines × 2) src/PSMBasedQuantification/PSMBasedQuantification.fs
  • Code Duplication · Duplicated block (9 lines × 2) src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs
  • Code Duplication · Duplicated block (9 lines × 2) src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs
  • Code Duplication · Duplicated block (9 lines × 2) src/PSMStatistics/PSMStatistics.fs
  • Code Duplication · Duplicated block (7–8 lines × 6) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (8 lines × 6) src/AlignmentBasedQuantification/Program.fs
  • Code Duplication · Duplicated block (8 lines × 2) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (7 lines × 3) src/PSMBasedQuantification/PSMBasedQuantification.fs
  • Code Duplication · Duplicated block (7 lines × 2) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (7 lines × 2) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (7 lines × 2) src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs
  • Code Duplication · Duplicated block (7 lines × 2) src/ProteomIQon/pepValue/pepValueCalculation.fs
  • Code Duplication · Duplicated block (6 lines × 4) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (6 lines × 2) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs
  • Code Duplication · Duplicated block (6 lines × 2) src/AlignmentBasedQuantification/Program.fs
  • Code Duplication · Duplicated block (6 lines × 2) src/MzMLToMzLiteIonMobility/MzMLToMzLiteIonMobility.fs
Rebuild cost: about €35,000 · Estimate
Cost to rebuild€12,000 to €58,000, for 193 to 614 hours of work, about 0.2 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 60. 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: 24,002 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 No ADRs found finding(s) in ADR Quality — start with ProteomIQonConsole.fsproj.
Raises the score by about 4 points · Low effort · ADR Quality
2
Resolve the 1 Off-boarding risk finding(s) in Bus Factor.
Raises the score by about 2 points · Low effort · Bus Factor
3
Record your significant design decisions.
Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Raises the score by about 3 points · Medium effort · Architecture documentation

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 €35,000 to build again, about 0.2 person-years of work. Its weakest lens is Code Health, at 51 (checked 4 of 11). Code Health is about how easy the code is to read and change safely, and code that is hard to read is slow and risky to change, so every future change costs more than it should. Because the weakest lens counts most in the score, work on Code Health also moves the score most.
Based on: the rebuild estimate · the Code Health grade · how much each lens counts
What to do: Start with the Code Health actions in Top priorities.
If you do one thing first · First action
Resolve the 1 No ADRs found finding(s) in ADR Quality. Of all the actions in this report, it raises the score most for the work it takes: about 4 points for low effort, because it clears the 1 ADR Quality findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
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 5.6 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 6% to 14% on every change. The history of the code shows how much it changes: about 75,950 lines over the last 90 days, which is about 308,019 lines a year. At that pace, the extra work comes to an estimated 46.7 to 280 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 AddDeducedPeptides AddDeducedPeptides ProteomIQon ProteomIQon AddDeducedPeptides->ProteomIQon AlignmentBasedQuantStatistics AlignmentBasedQuantStatistics AlignmentBasedQuantStatistics->ProteomIQon AlignmentBasedQuantification AlignmentBasedQuantification AlignmentBasedQuantification->ProteomIQon ConsensusSpectralLibrary ConsensusSpectralLibrary ConsensusSpectralLibrary->ProteomIQon JoinQuantPepIonsWithProteins JoinQuantPepIonsWithProteins JoinQuantPepIonsWithProteins->ProteomIQon LabelEfficiencyCalculator LabelEfficiencyCalculator LabelEfficiencyCalculator->ProteomIQon LabelFreeProteinQuantification LabelFreeProteinQuantification LabelFreeProteinQuantification->ProteomIQon LabeledProteinQuantification LabeledProteinQuantification LabeledProteinQuantification->ProteomIQon MsFraggerToPSM MsFraggerToPSM MsFraggerToPSM->ProteomIQon MzMLToMzLite MzMLToMzLite MzMLToMzLite->ProteomIQon MzMLToMzLiteIonMobility MzMLToMzLiteIonMobility MzMLToMzLiteIonMobility->ProteomIQon MzTAB MzTAB MzTAB->ProteomIQon MzliteToMzML MzliteToMzML MzliteToMzML->ProteomIQon PSMBasedQuantification PSMBasedQuantification PSMBasedQuantification->ProteomIQon PSMBasedQuantificationTIMs PSMBasedQuantificationTIMs PSMBasedQuantificationTIMs->ProteomIQon PSMStatistics PSMStatistics PSMStatistics->ProteomIQon PeptideDB PeptideDB PeptideDB->ProteomIQon PeptideSpectrumMatching PeptideSpectrumMatching PeptideSpectrumMatching->ProteomIQon PeptideSpectrumMatchingTIMs PeptideSpectrumMatchingTIMs PeptideSpectrumMatchingTIMs->ProteomIQon __more__ +9 more projects

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.

119 modules, with 119 dependencies between them. Every module uses only modules listed above it, so there are no loops.

The table shows the 40 modules with the most connections; 79 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 Common2 Domain.LabelFreeQuantification3 Domain.LabeledProteinQuantification4 Drafo.Core5 Common.LabelFreeQuantification6 Common.LabeledProteinQuantification7 Domain8 Common.LabelFreeQuantification.AggregationParamsModule9 Common.LabeledProteinQuantification.AggregationParamsModule10 Dto11 LabelFreeProteinQuantification12 LabeledProteinQuantification13 MzCalibration14 PeakQuantification15 Xic16 AlignmentBasedQuantStatistics17 Dto.AlignmentBasedQuantStatisticsParamsModule18 Dto.AlignmentBasedQuantificationParamsModule19 Dto.ConsensusSpectralLibraryParamsModule20 Dto.LabelEfficiencyCalculationParamsModule21 Dto.LabelFreeQuantificationParamsModule22 Dto.LabeledQuantificationParamsModule23 Dto.MzMLtoMzLiteParamsModule24 Dto.MzTABParamsModule25 Dto.MzliteToMzMLParamsModule26 Dto.PSMStatisticsParamsModule27 Dto.PeptideDBParamsModule28 Dto.PeptideSpectrumMatchingParamsModule29 Dto.PeptideSpectrumMatchingTIMsParamsModule30 Dto.PreprocessingParamsModule31 Dto.ProteinInferenceParamsModule32 Dto.QuantificationParamsModule33 Dto.SWATHAnalysisParamsModule34 Dto.SpectralLibraryParamsModule35 MzTABAux36 PSMQuantification37 PeptideSpectrumMatchingTIMs38 XicSweep39 PeakSelection40 AlignmentBasedQuantification
1 Common
2 Domain.LabelFreeQuantification
3 Domain.LabeledProteinQuantification
4 Drafo.Core
5 Common.LabelFreeQuantification4
6 Common.LabeledProteinQuantification4
7 Domain11
8 Common.LabelFreeQuantification.AggregationParamsModule11
9 Common.LabeledProteinQuantification.AggregationParamsModule11
10 Dto111117
11 LabelFreeProteinQuantification411
12 LabeledProteinQuantification411
13 MzCalibration1
14 PeakQuantification2
15 Xic1
16 AlignmentBasedQuantStatistics15
17 Dto.AlignmentBasedQuantStatisticsParamsModule21
18 Dto.AlignmentBasedQuantificationParamsModule11
19 Dto.ConsensusSpectralLibraryParamsModule11
20 Dto.LabelEfficiencyCalculationParamsModule11
21 Dto.LabelFreeQuantificationParamsModule11
22 Dto.LabeledQuantificationParamsModule11
23 Dto.MzMLtoMzLiteParamsModule11
24 Dto.MzTABParamsModule11
25 Dto.MzliteToMzMLParamsModule11
26 Dto.PSMStatisticsParamsModule11
27 Dto.PeptideDBParamsModule11
28 Dto.PeptideSpectrumMatchingParamsModule11
29 Dto.PeptideSpectrumMatchingTIMsParamsModule11
30 Dto.PreprocessingParamsModule11
31 Dto.ProteinInferenceParamsModule11
32 Dto.QuantificationParamsModule11
33 Dto.SWATHAnalysisParamsModule11
34 Dto.SpectralLibraryParamsModule11
35 MzTABAux12
36 PSMQuantification1212
37 PeptideSpectrumMatchingTIMs11
38 XicSweep2
39 PeakSelection11
40 AlignmentBasedQuantification142215
Uses a module listed above itPart of a loopThe module itself
1 Common2 Domain.LabelFreeQuantification3 Domain.LabeledProteinQuantification4 Drafo.Core5 Common.LabelFreeQuantification6 Common.LabeledProteinQuantification7 Domain8 Common.LabelFreeQuantification.AggregationParamsModule9 Common.LabeledProteinQuantification.AggregationParamsModule10 Dto11 LabelFreeProteinQuantification12 LabeledProteinQuantification13 MzCalibration14 PeakQuantification15 Xic16 AlignmentBasedQuantStatistics17 Dto.AlignmentBasedQuantStatisticsParamsModule18 Dto.AlignmentBasedQuantificationParamsModule19 Dto.ConsensusSpectralLibraryParamsModule20 Dto.LabelEfficiencyCalculationParamsModule21 Dto.LabelFreeQuantificationParamsModule22 Dto.LabeledQuantificationParamsModule23 Dto.MzMLtoMzLiteParamsModule24 Dto.MzTABParamsModule25 Dto.MzliteToMzMLParamsModule26 Dto.PSMStatisticsParamsModule27 Dto.PeptideDBParamsModule28 Dto.PeptideSpectrumMatchingParamsModule29 Dto.PeptideSpectrumMatchingTIMsParamsModule30 Dto.PreprocessingParamsModule31 Dto.ProteinInferenceParamsModule32 Dto.QuantificationParamsModule33 Dto.SWATHAnalysisParamsModule34 Dto.SpectralLibraryParamsModule35 MzTABAux36 PSMQuantification37 PeptideSpectrumMatchingTIMs38 XicSweep39 PeakSelection40 AlignmentBasedQuantificationCommon1Domain.LabelFreeQuantification2Domain.LabeledProteinQuantification3Drafo.Core4Common.LabelFreeQuantification5Common.LabeledProteinQuantification6Domain7Common.LabelFreeQuantification.AggregationParamsModule8Common.LabeledProteinQuantification.AggregationParamsModule9Dto10LabelFreeProteinQuantification11LabeledProteinQuantification12MzCalibration13PeakQuantification14Xic15AlignmentBasedQuantStatistics16Dto.AlignmentBasedQuantStatisticsParamsModule17Dto.AlignmentBasedQuantificationParamsModule18Dto.ConsensusSpectralLibraryParamsModule19Dto.LabelEfficiencyCalculationParamsModule20Dto.LabelFreeQuantificationParamsModule21Dto.LabeledQuantificationParamsModule22Dto.MzMLtoMzLiteParamsModule23Dto.MzTABParamsModule24Dto.MzliteToMzMLParamsModule25Dto.PSMStatisticsParamsModule26Dto.PeptideDBParamsModule27Dto.PeptideSpectrumMatchingParamsModule28Dto.PeptideSpectrumMatchingTIMsParamsModule29Dto.PreprocessingParamsModule30Dto.ProteinInferenceParamsModule31Dto.QuantificationParamsModule32Dto.SWATHAnalysisParamsModule33Dto.SpectralLibraryParamsModule34MzTABAux35PSMQuantification36PeptideSpectrumMatchingTIMs37XicSweep38PeakSelection39AlignmentBasedQuantification40441111111111174114111211521111111111111111111111111111111111112121211211142215+79 more modules (most-connected shown)

At a glance — Code Health · 51% · Checked 4 of 11 · gated by D2 ·

At a glance — Architecture · 99% · Exemplary ·

At a glance — Maturity · 63% · Adequate · gated by M2 ·

At a glance — Readiness · 53% · Adequate · gated by P3 ·

At a glance — Security · 87% · Checked 4 of 10 ·

At a glance — Domain Modelling · 100% · Exemplary ·

At a glance — Performance · 100% · 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 — Injection7High / Critical

Roadmap

Top priorities: Resolve the 1 No ADRs found finding(s) in ADR Quality — start with ProteomIQonConsole.fsproj; 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; 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 No ADRs found finding(s) in ADR Quality — start with ProteomIQonConsole.fsproj.+4.2 ptsLowADR Quality
Resolve the 1 Off-boarding risk finding(s) in Bus Factor.+1.9 ptsLowBus Factor
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.+3.1 ptsMediumArchitecture documentation
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.+2.4 ptsMediumDeployment & Rollback
Bring the 1 body over 60 down to 60 or less in Cyclomatic Complexity — start with AlignmentBasedQuantification.quantifyPeptides (cyclomatic 174).+1.1 ptsMediumCyclomatic Complexity
Resolve the 1 End-of-life runtime finding(s) in Platform End-of-Life — start with ProteomIQonConsole.fsproj.+0.8 ptsLowPlatform End-of-Life
Resolve the 9 FileTooLong finding(s) in God Classes — start with PSMBasedQuantificationTIMs.fs, DTO.fs, AlignmentBasedQuantification.fs.+1.4 ptsHighGod Classes
Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.+1.3 ptsMediumObservability

File quality

Per-file score 0–10 — a quality signature. Of 59 files carrying findings, judged against the Preview bar: 2% slop · 1% mixed · 97% near-clean.

FileScoreBandWorst signal
REDACTED2.7SlopStatic Analysis (SAST): High: REDACTED
REDACTED5.1MixedStatic Analysis (SAST): High: REDACTED
src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs7.0Near-cleanCyclomatic Complexity: AlignmentBasedQuantStatistics.scoreRuns (cyclomatic 57)
src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs7.0Near-cleanCyclomatic Complexity: PSMBasedQuantificationTIMs.quantifyPeptides (cyclomatic 43)
src/ProteomIQon/PSMQuantification.fs7.0Near-cleanCyclomatic Complexity: PSMQuantification.quantifyLabeled (cyclomatic 31)
src/ProteomIQon/BioFSharp.Mz_Temp.fs7.0Near-cleanCyclomatic Complexity: Wavelet.identifyPeaksBy (cyclomatic 49)
src/MzTAB/MzTABSections.fs7.0Near-cleanCyclomatic Complexity: MzTABSections.peptideSection (cyclomatic 19)
src/MzMLToMzLite/MzMLToMzLite.fs7.0Near-cleanCode Duplication: Near-duplicate member pair (115 shared lines)
src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs7.0Near-cleanCyclomatic Complexity: AlignmentBasedQuantification.quantifyPeptides (cyclomatic 174)
src/PeptideSpectrumMatchingTIMs/PeptideSpectrumMatchingTIMs.fs7.1Near-cleanCyclomatic Complexity: PeptideSpectrumMatchingTIMs.validateParameters (cyclomatic 19)
ConsoleTemplate/template/Program.fs7.1Near-cleanCode Duplication: Members sharing a duplicated core (7 members, 50+ identical tokens)
src/PSMBasedQuantification/Program.fs7.1Near-cleanCode Duplication: Members sharing a duplicated core (5 members, 50+ identical tokens)
src/PSMBasedQuantification/PSMBasedQuantification.fs7.1Near-cleanCode Duplication: Duplicated block (23–24 lines × 2)
src/ProteomIQon/MzCalibration.fs7.1Near-cleanCyclomatic Complexity: Normal.Solve (cyclomatic 30)
src/ProteomIQon/DTO.fs7.1Near-cleanGod Classes: FileTooLong: ProteomIQon/DTO.fs
src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs7.1Near-cleanCode Duplication: Near-duplicate member pair (48 shared lines)
src/ConsensusSpectralLibrary/ConsensusSpectralLibrary.fs7.1Near-cleanCode Duplication: Duplicated block (63–65 lines × 2)
src/LabeledProteinQuantification/LabeledProteinQuantification.fs7.1Near-cleanCode Duplication: Duplicated block (18 lines × 2)
src/ProteomIQon/BaselineAls.fs7.2Near-cleanCyclomatic Complexity: BaselineAls.baselineAls (cyclomatic 42)
src/AlignmentBasedQuantification/Program.fs7.2Near-cleanCyclomatic Complexity: console1.main (cyclomatic 27)

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 — 7

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 — 208

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 — 24

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

Could not be resolved — 42

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 39 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.8, 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 — 39 dimensions across the health lenses
D1D2D3D4D5D6D13D14D15D16D20D26D27D28D29D34D35D43D44AX10AX3AX4AX8DM12DM6GD1M1M2M3M4P1P2P3P4P6PF3X23X27X28

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, 232 of 239 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 01a1df37-99f2-710f-8969-baecc3546dbc.

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: this repository's test suite BUILT and its tests PASSED in this run — so neither the build nor our analyzer environment is in question — but the run produced no coverage data, and it captured no message saying why. The usual cause is that the test projects wire up no coverage collector (`--collect:"XPlat Code Coverage"` needs a `coverlet.collector` PackageReference); on a very large suite the instrumented run can also exceed its per-target budget before writing anything. Add a `coverlet.collector` PackageReference, or commit the Cobertura/OpenCover/lcov report your CI already produces, and real coverage is 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).
  • D11 Test Reliability — 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. Test reliability NOT MEASURED: the test run produced no results for any test tier, so no test ever ran and flakiness could not be exercised. The cause could not be attributed, so it is excluded from the score rather than read as an absence of tests.
  • D12 Dependency Hygiene — 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. The NuGet registry this repository's packages resolve from could not be reached on this run, so no outdated, vulnerable or deprecated package could be read. The tool said: NU1301: Unable to load the service index for source https://nuget.pkg.github.com/CSBiology/index.json. [ProteomIQon.sln] The proxy tunnel request to proxy 'http://egress:3128/' failed with status code '403'." [ProteomIQon.sln]. This is OUR side and an ENVIRONMENT fault — the collector exists and ran — so the remedy is the scan's network path to nuget.pkg.github.com, and a re-run with it reachable measures this repository.
  • 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/AlignmentBasedQuantification/AlignmentBasedQuantification.fs, src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs, src/ProteomIQon/PSMQuantification.fs, src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs, src/AlignmentBasedQuantification/Program.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.
  • D21 Naming Consistency — evaluation did not complete — Naming Consistency not included (check did not complete) — excluded from the score.
  • D22 Internal API 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. D22 identifies the intentionally-exposed surface from `IsPackable` and `.Contracts` project names, MSBuild conventions read off the loaded project set. This target exposed no such projects, so the probe never ran; this says nothing about whether the repository has a public API. This repository commits no C#/VB source at all, so there was never an MSBuild project set to read these conventions off. That is OUR side and it is a COLLECTOR gap, not an environment fault: no published-package marker D22 reads admitted any project here, so this ecosystem's public API has no collector, and the remedy is to write one — no change to the scan image can close it.
  • 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. This check's reader does not cover the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
  • D30 Dependency Vulnerabilities — 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. Nuget: nuget.pkg.github.com could not be reached (NU1301: Unable to load the service index for source https://nuget.pkg.github.com/CSBiology/index.json. The proxy tunnel request to proxy 'http://egress:3128/' failed with status code '403'.). The scanner exists and ran; what failed is the scan's network path to the registry, so nothing was read and nothing here is a statement about the repository. A re-run with the registry reachable measures it.
  • 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.
  • DM10 One transaction, one aggregate — 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. One transaction, one aggregate could not be assessed in this run — the check did not complete, so it is not scored. This is a gap in the analyzer, not a finding about this repository. Engine failure: InvalidOperationException: The entity or value 'System.Int32' does not exist or is in an unresolved assembly. You may need to add a reference to assembly 'netstandard'.
  • DM8 Value-object opportunities — 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 finds primitive parameters that travel together through several signatures of the domain (a missing value object). Its deterministic rule has not yet shown 95 % precision on adjudicated rows, so the clumps it finds are counted here and not published as findings, and the card carries no score. That is a limit of the analyzer, not a finding about your code.
  • DM9 Scattered domain decisions — 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 measured — scattered-decision detection needs expression-level symbol resolution: a comparison operand bound to the member it judges (arm one) and a construction bound to the type it produces (arm two). A Roslyn compilation carries both; arm two alone also runs on any frontend that declares whether a construction is produced or passed, and this target loaded neither.
  • IC1 Incompleteness & stubs — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • P8 Schema migrations — 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 reads EF Core usage in C# and the schema tooling its file scan recognises only, and no .NET project was loaded, and this repository's language is not one the scan models, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • 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.
  • X6 Hand-rolled structured-format parsing — 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 reads C# syntax, and Python, JavaScript/TypeScript, Go, Java/Kotlin/Scala, Ruby, PHP, Rust, Swift, Erlang, Elixir and Dart source only, and no C# was loaded and none of those languages was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X7 Silent fallback defaults — 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 reads C#, Python, TypeScript/JavaScript, Rust, Go, Java, Kotlin, Scala, PHP, Ruby, Swift and Dart syntax only, and no C#, Python, TypeScript/JavaScript, Rust, Go, Java, Kotlin, Scala, PHP, Ruby, Swift or Dart was loaded for this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • Package restore incomplete — third-party types were unresolved in part of the solution — NuGet restore did not complete for src/ProteomIQon/ProteomIQon.fsproj, src/Preprocessing/Preprocessing.fsproj, src/PeptideDB/PeptideDB.fsproj, src/PeptideSpectrumMatching/PeptideSpectrumMatching.fsproj, src/PSMStatistics/PSMStatistics.fsproj and 4 more, so those projects were analysed with framework references only: every check keyed on a third-party type saw an error type there and reported nothing. Findings on those projects are a lower bound; run `dotnet restore` on them and rescan.

Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.

Limitations & what we did not check

We assess the repository exactly as committed, and only the repository. By design we do not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.

Per-dimension blind spots

For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.

  • D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
  • D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
  • D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
  • D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
  • D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
  • D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
  • D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
  • D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
  • D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
  • D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
  • D20 ADR Quality: ADR quality checks the structure of the decision records present: it cannot know about decisions made and never recorded, and it does not judge how well a record argues its case. Records in a language the section lexicon does not cover are not evaluated.
  • D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
  • D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
  • D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
  • D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
  • D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
  • D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
  • D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
  • D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a Dockerfile (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
  • AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
  • DM6 Domain ↔ infrastructure boundary: Infrastructure reached through a hand-rolled wrapper, a domain-named facade, reflection, or a string-keyed service locator resolves to a non-infra type and isn't seen; the body scan is symbol resolution over syntax, not full dataflow. A clean result means "no resolved infra reference in a domain body", not a proof of purity.
  • 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 Complexity5.6 / 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 5.6 / 10 · rule-coverage 100% · ceiling Prevented

19 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was AlignmentBasedQuantification.quantifyPeptides at 174.

AlignmentBasedQuantification.quantifyPeptides (cyclomatic 174)src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs:761
AlignmentBasedQuantStatistics.scoreRuns (cyclomatic 57)src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs:936
PepValueCalculation.initCalculatePEPValueIRLS (cyclomatic 49)src/ProteomIQon/pepValueCalculation.fs:27
Wavelet.identifyPeaksBy (cyclomatic 49)src/ProteomIQon/BioFSharp.Mz_Temp.fs:297
PSMBasedQuantificationTIMs.quantifyPeptides (cyclomatic 43)src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1504

+ 14 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Bring the 1 body over 60 down to 60 or less in Cyclomatic Complexity — start with AlignmentBasedQuantification.quantifyPeptides (cyclomatic 174). — Refactoring it lifts Cyclomatic Complexity from 5.6 to about 6.8/10.

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

D2 · Cognitive Complexity2.0 / 10Critical✓ 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 2.0 / 10 · rule-coverage 100% · ceiling Prevented

52 method(s) exceeded the cognitive complexity threshold of 15; the worst was AlignmentBasedQuantification.quantifyPeptides at 290.

AlignmentBasedQuantification.quantifyPeptides (cognitive 290)src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs:761
PSMQuantification.quantifyLabeled (cognitive 145)src/ProteomIQon/PSMQuantification.fs:297
BaselineAls.baselineAls (cognitive 109)src/ProteomIQon/BaselineAls.fs:11
Normal.Solve (cognitive 97)src/ProteomIQon/MzCalibration.fs:260
AlignmentBasedQuantStatistics.scoreRuns (cognitive 90)src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs:936

+ 47 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Bring the 8 bodies over 60 down to 60 or less in Cognitive Complexity — start with AlignmentBasedQuantification.quantifyPeptides (cognitive 290), PSMQuantification.quantifyLabeled (cognitive 145), BaselineAls.baselineAls (cognitive 109). — 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 8 together lifts Cognitive Complexity from 2.0 to about 3.5/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.

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

D3 · God Classes8.3 / 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 8.3 / 10 · rule-coverage 100% · ceiling Prevented

9 over-large unit(s) detected — types, modules or files that carry too much.

FileTooLong: PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs · ×9src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs

What to do

  1. Resolve the 9 FileTooLong finding(s) in God Classes — start with PSMBasedQuantificationTIMs.fs, DTO.fs, AlignmentBasedQuantification.fs. — One of this dimension's main actionable groups (9 warning-level).

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

D4 · Code Duplication4.7 / 10Weak✓ Tool-verified

What it measures: How much of the production code is copy-pasted: the share of production lines inside a reported copy (every copy of a duplicated block or of an edited member, each line once), 10 at none and 0 at a quarter of the lines.

Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), scored on the share of production lines inside a reported copy (each line once; 10 at none, 0 at a quarter). Deterministic.

Maturity: Documented → Verified → Prevented · effective 4.7 / 10 · rule-coverage 100% · ceiling Verified

101 duplicated block group(s) detected. 13.2 % of the production lines (3,166 of 24,002) are in a reported copy. A further 13 rows report members as variants of one another; the share counts each copied line once, however many rows cite it.

Duplicated block (12 lines × 2) · ×5src/MzMLToMzLite/Program.fs:43
Duplicated block (10 lines × 2) · ×5ConsoleTemplate/template/Program.fs:27
Duplicated block (18 lines × 2) · ×4ConsoleTemplate/template/CLIArgumentParsing.fs:1
Duplicated block (7 lines × 2) · ×4ConsoleTemplate/template/Program.fs:19
Members sharing a duplicated core (6 members, 50+ identical tokens) · ×3ConsoleTemplate/template/Program.fs:1

+ 69 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Resolve the 5 Duplicated block (12 lines × 2) finding(s) in Code Duplication — start with MzTABSections.fs (3), Program.fs, PSMQuantification.fs. — One of this dimension's main actionable groups (5 warning-level).
  2. Resolve the 5 Duplicated block (10 lines × 2) finding(s) in Code Duplication — start with Program.fs (2), LabelEfficiencyCalculator.fs, PeptideSpectrumMatching.fs. — One of this dimension's main actionable groups (5 warning-level).
  3. Resolve the 4 Duplicated block (18 lines × 2) finding(s) in Code Duplication — start with CLIArgumentParsing.fs (2), LabeledProteinQuantification.fs, PSMQuantification.fs. — One of this dimension's main actionable groups (4 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

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

✓ On the Gold path — maintain.

Detailed fixes: d5_recommendation.md.

D6 · Cohesion (LCOM4)10.0 / 10Exemplary✓ 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 10.0 / 10 · rule-coverage 100% · ceiling Verified

0 of 6 classes have LCOM4 above 3.

✓ On the Gold path — maintain.

Detailed fixes: d6_recommendation.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.

D14 · License Compliance10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether the licenses of third-party packages are compatible with your policy.

Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Verified

0 of 317 packages use a banned license. ★ DEPTH: this repository's MSBuild projects declare 37 direct `PackageReference`(s), and 34 further package(s) were reached beyond them by closing the graph over nuget.org's own nuspec dependency graph — so a banned licence pulled in only by a dependency's OWN dependencies is inside this verdict. A package whose licence nuget.org could not be asked for is not graded, and version ranges are taken at their lower bound, so this is the closure as that graph states it rather than a restored consumer's exact resolution.

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

D15 · Churn × Complexity Hotspots8.8 / 10Strong✓ 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 8.8 / 10 · rule-coverage 100% · ceiling Documented

Top hotspots: src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs (36×174=6264); src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs (24×43=1032); src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs (11×57=627)

Hotspot: src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs · ×11src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs:761

What to do

  1. Resolve the 11 Hotspot finding(s) in Churn × Complexity Hotspots — start with AlignmentBasedQuantification.fs, PSMBasedQuantificationTIMs.fs, AlignmentBasedQuantStatistics.fs. — One of this dimension's main actionable groups (11 warning-level).

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

D16 · Bus Factor5.8 / 10Adequate✓ Tool-verified

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

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

Maturity: Documented → Verified → Prevented · effective 5.8 / 10 · rule-coverage 100% · ceiling Documented

29 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs. Counted over 69 of the 107 production source files in this repository: 36 are under the ~2,400-byte size floor this dimension measures over, and the remaining 2 have no attributable history left to measure.

Off-boarding risk: anonymized user #1

What to do

  1. Resolve the 1 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).

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

D20 · ADR Quality0.0 / 10Critical✓ Tool-verified

What it measures: Whether architecture decisions are recorded well (context, decision, consequences).

Method: Every ADR read by its section structure: nine located rules (a missing Decision, Context or Consequences section, a stale status, two records deciding the same question, a dangling supersede link, a number-only title, a single option, no named cost, no status where the log uses one, no enforcement field where the log adopted one), each a fixed deduction from 10; the score is the mean over evaluated records. Deterministic, no model. Advisory.

Maturity: Documented → Verified → Prevented · effective 0.0 / 10 · rule-coverage 100% · ceiling Documented

No architecture decision records were found.

No ADRs foundConsoleTemplate/template/ProteomIQonConsole.fsproj:10

What to do

  1. Resolve the 1 No ADRs found finding(s) in ADR Quality — start with ProteomIQonConsole.fsproj. — One of this dimension's main actionable groups (1 recommendation-level).

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

D26 · Project Cohesion9.4 / 10Exemplary✓ Tool-verified

What it measures: Whether each project is a focused, coherent unit rather than an oversized grab-bag.

Method: Project size overshoot penalties (LoC / public-type count / namespace count, 2-of-3 flag) weighted by log magnitude. Exhaustive across projects, deterministic.

Maturity: Documented → Verified → Prevented · effective 9.4 / 10 · rule-coverage 100% · ceiling Documented

1 of 29 build units (MSBuild) flagged as possibly oversized/incoherent.

Projects may be oversized for their cohesion

✓ On the Gold path — maintain.

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

D27 · Navigability9.9 / 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.9 / 10 · rule-coverage 100% · ceiling Documented

96 % of calls cross a namespace and 2 % 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)10.0 / 10Adequategated by 7 critical findings○ Nothing flagged

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 10.0 / 10 · rule-coverage 100% · ceiling Documented

7 finding(s): 0 critical, 7 high, 0 medium, 0 low. 7 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 1 file(s) — `docs/_template.ipynb` — so no absence of findings in them is evidence of anything, and nothing in them was analysed. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them.

REDACTED

What to do

  1. No action in Static Analysis (SAST) — all 7 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 (7 issue-level, 0 of them charged here).

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

D34 · Knowledge Freshness9.3 / 10Exemplary✓ 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 9.3 / 10 · rule-coverage 100% · ceiling Documented

5 of 71 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs. Counted over 71 of the 107 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Orphaned file · ×5src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs:1
Orphaned files with no living knowledge

✓ On the Gold path — maintain.

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.

D43 · Malicious Dependencies10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Reported apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.

Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. Advisory since rubric-2026.11.2 (CAI decision 0006): the malicious-package feed is a database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

No dependency in any ecosystem this repository declares is published as malicious.

✓ On the Gold path — maintain.

Detailed fixes: d43_recommendation.md.

D44 · Platform End-of-Life6.0 / 10Adequate✓ 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 6.0 / 10 · rule-coverage 100% · ceiling Documented

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

End-of-life runtime: .NET net5.0ConsoleTemplate/template/ProteomIQonConsole.fsproj:4

What to do

  1. Resolve the 1 End-of-life runtime finding(s) in Platform End-of-Life — start with ProteomIQonConsole.fsproj. — One of this dimension's main actionable groups (1 warning-level).

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

Frontend & cross-cutting dimensions

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

AX10 · Code composition10.0 / 10Exemplary✓ 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. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.

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

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

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.

AX8 · Test isolation10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether production projects stay free of references to test projects — tests may depend on production, never the reverse.

Method: Csproj graph: each production project checked for references to test projects (identified by test-framework presence, not name). Zero violations is clean. Deterministic.

DM12 · Ambient inputs in the domain10.0 / 10Exemplary○ Nothing flagged

Other · Domain Modelling — Whether domain types receive the time and randomness their rules depend on, rather than reading the process clock or a global random source directly — an ambient read makes the rule it feeds untestable at the instant that matters and lets two reads inside one operation disagree.

Method: Roslyn (DDD-gated, C#/VB only): domain-layer types scanned for ambient reads — DateTime/DateTimeOffset.Now/UtcNow/Today, Random.Shared, new Random(), Stopwatch.GetTimestamp — resolved against the semantic model, with a comment/string-stripped token fallback only where resolution fails. Body reads are scored; field/property initialisers are surfaced unscored. Apply/When folds excluded (ES1 owns them). Deterministic, symbol-resolved.

DM6 · Domain ↔ infrastructure boundary10.0 / 10Exemplary✓ Tool-verified

Other · Domain Modelling — Whether the domain layer stays free of infrastructure dependencies (EF/Marten/HTTP/ASP.NET) — the clean-architecture dependency rule.

Method: Roslyn (DDD-gated): domain-layer types scanned for infrastructure usage in member SIGNATURES and inside method/accessor BODIES — resolved calls and object-creations into EF/Marten/HTTP/Mongo/Redis/message-bus types (not just a namespace allowlist). Deterministic, symbol-resolved, exhaustive over domain-layer bodies, DDD-native.

Coverage: Domain layer identified by NAMESPACE heuristic; infrastructure then resolved by symbol in member SIGNATURES and method/accessor BODIES — rename the layer and the check evaporates.

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)7.3 / 10Strong✓ 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

  • 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 / 10Weak✓ 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.

P2 · Observability6.9 / 10Strong✓ Tool-verified

Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.

Method: Filesystem/Roslyn scan: structured-logging frameworks (Serilog, NLog), OpenTelemetry, and health-check endpoint patterns. Exhaustive, deterministic.

  • Only 27/28 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `src/RatioLFQ`.

What to do

  • Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.
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:6
  • `ConsoleTemplate/template/ProteomIQonConsole.fsproj` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`. — ConsoleTemplate/template/ProteomIQonConsole.fsproj:39

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.

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.

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.

X23 · Unguarded diagnostic materialisation7.5 / 10Strong✓ Tool-verified

Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.

Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.

  • `Trace` at line 99 is called with an argument built by `Array.map (fun x -> string x)` (line 101), whose cost grows with the collection it walks. F# evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because Trace is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `IsEnabled` test, no debug flag, no `#if DEBUG` region, no `fun` or `lazy` the logger runs only when the level is on. (×2) — src/ProteomIQon/pepValueCalculation.fs:99, src/ProteomIQon/pepValue/pepValueCalculation.fs:99
  • `Trace` at line 105 is called with an argument built by `Array.map (fun x -> string x)` (line 107), whose cost grows with the collection it walks. F# evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because Trace is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `IsEnabled` test, no debug flag, no `#if DEBUG` region, no `fun` or `lazy` the logger runs only when the level is on. (×2) — src/ProteomIQon/pepValueCalculation.fs:105, src/ProteomIQon/pepValue/pepValueCalculation.fs:105
  • `Trace` at line 111 is called with an argument built by `Array.map (fun x -> string x)` (line 113), whose cost grows with the collection it walks. F# evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because Trace is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `IsEnabled` test, no debug flag, no `#if DEBUG` region, no `fun` or `lazy` the logger runs only when the level is on. — src/ProteomIQon/pepValueCalculation.fs:111
  • `Trace` at line 93 is called with an argument built by `Array.map (fun x -> string x)` (line 95), whose cost grows with the collection it walks. F# evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because Trace is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `IsEnabled` test, no debug flag, no `#if DEBUG` region, no `fun` or `lazy` the logger runs only when the level is on. — src/ProteomIQon/pepValue/pepValueCalculation.fs:93
  • `Trace` at line 653 is called with an argument built by `Array.distinctBy (fun x -> x.ScanNr) |> Array.length` (line 653), whose cost grows with the collection it walks. F# evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because Trace is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `IsEnabled` test, no debug flag, no `#if DEBUG` region, no `fun` or `lazy` the logger runs only when the level is on. — src/PSMStatistics/PSMStatistics.fs:653
  • `Trace` at line 811 is called with an argument built by `Array.filter (fun x -> x.Label && getQ (score x) <= 0.01) |> Array.length` (line 811), whose cost grows with the collection it walks. F# evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because Trace is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `IsEnabled` test, no debug flag, no `#if DEBUG` region, no `fun` or `lazy` the logger runs only when the level is on. — src/PSMStatistics/PSMStatistics.fs:811

What to do

  • In F#, put the construction behind the logger's own check (`if logger.IsEnabled LogLevel.Debug then` for Microsoft.Extensions.Logging, `if Log.IsEnabled LogEventLevel.Debug then` for Serilog), or pass the collection itself as a message-template argument (`logger.LogDebug("Items {Items}", items)`) so the framework renders it only when the line is written. Formatting the message with `sprintf` does not defer it either: the arguments are built before the logger is entered.
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 Health51%Checked 4 of 11Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture99%ExemplarySolid.
Maturity63%Adequate — gated by M2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness53%Adequate — gated by P3Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security87%Checked 4 of 10Solid.
Domain Modelling100%ExemplaryStrongest area.
Performance100%ExemplarySolid.
Unscored — 3 check(s) recorded observations but carry no score

These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.

  • D36 Supply-chain Provenance & Signing — 1 observation(s) recorded · The CI pipeline publishes no artifact — no package publish, container push or release with files to download. Supply-chain provenance, signing and an SBOM describe a PUBLISHED artifact for the people who obtain it, so there is nothing to attest here; a deployment of the service itself publishes nothing for anyone else to verify. Add them to the release pipeline when this repo starts publishing artifacts (a package, a container image, or a release with downloadable files). Build integrity and workflow-token hygiene are reported below: they describe what the CI runs and the token it runs with, neither of which is affected by whether the pipeline ships an artifact.
  • SC1 Supply-chain hygiene — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X10 Duplicated predicate — 2 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
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 — 81 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
  • 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.
  • D10 Test Quality — ~4311 lines of test source are present (.fs) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
  • D11 Test Reliability — Test reliability not measured — no test run produced results
  • D12 Dependency Hygiene — Dependency hygiene not measured — nuget.pkg.github.com could not be reached
  • D17 Explicit Debt — the C# workspace loaded 0 projects, so explicit-debt density could not be measured
  • D18 Solution Shape — D18 scores the shape of a C#/VB .NET solution; this repository's .NET projects are all F# (.fsproj), which the C#/VB workspace does not load, so the dimension does not apply.
  • D19 Documentation Quality — No runnable or published unit to look for an example in, and no multi-project root README to look for a map in; the other documentation kinds are withheld (see the gaps), so documentation quality is not applicable here.
  • D21 Naming Consistency — Naming Consistency not included (check did not complete)
  • D22 Internal API Consistency — The exposed public-API surface could not be collected — no C#/VB projects loaded.
  • D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ sibling projects each declaring an entity of their own or taking another project's integration events. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
  • D24 Comment Value — D24 reads C#, Visual Basic, TypeScript and JavaScript comments only — this repository's production source is .fs, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
  • D25 ADR Conformance — no ADRs to check
  • D30 Dependency Vulnerabilities — Not measured — a package registry could not be reached
  • 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.
  • D7 Architectural Integrity — no checkable ADRs and no dependency cycles — architectural integrity not assessed
  • D8 Code Coverage — Coverage not measured — the suite ran but produced no coverage data
  • DM1 Aggregate boundaries — no aggregates detected — aggregate-boundary check not applicable
  • DM10 One transaction, one aggregate — One transaction, one aggregate could not be assessed in this run — the check did not complete, so it is not scored. This is a gap in the analyzer, not a finding about this repository.
  • DM11 Constructible invalid state — no entities detected — construction-time invariants not assessable
  • DM2 Strongly-typed ids — no id-bearing domain types detected — strongly-typed-id adoption not assessable
  • DM3 Integration-event coupling — no integration events detected — coupling check not applicable
  • DM4 Rich vs anemic model — no data-bearing entities detected — rich-vs-anemic model not assessable
  • DM5 Encapsulated state — no domain entities found — DM5 grades how entities protect their state, and this repository declares none
  • DM7 Repository granularity — no repository abstraction detected (e.g. uses a document session)
  • DM8 Value-object opportunities — not scored — the deterministic rule found 0 candidate clump(s); its rows are withheld until it has a measured precision of 95 % (a sample of fewer than 10 rows cannot show one)
  • DM9 Scattered domain decisions — not measured — scattered-decision detection needs expression-level symbol resolution: a comparison operand bound to the member it judges (arm one) and a construction bound to the type it produces (arm two). A Roslyn compilation carries both; arm two alone also runs on any frontend that declares whether a construction is produced or passed, and this target loaded neither
  • ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
  • ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
  • ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
  • IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
  • P7 Outbound HTTP resilience — not measured — the application kind could not be determined for this repo
  • P8 Schema migrations — 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
  • P9 Domain vs controller coverage — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
  • PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for a BenchmarkDotNet reference in an .fsproj or .vbproj, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
  • PF2 Allocation hygiene — Not 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
  • 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.
  • 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
  • X6 Hand-rolled structured-format parsing — 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
  • X7 Silent fallback defaults — 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 — 7 finding(s)
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
Serious — 208 finding(s)
D15 · Churn × Complexity Hotspots · Hotspot · ×11
  • Hotspot: src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs:761 — src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs changed 36 times in last 90 days, max cyclomatic complexity 174 in AlignmentBasedQuantification.quantifyPeptides at line 761. 1 of those changes was a fix/bug commit, and the other 35 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 14:08:17 +01:00' --until='2026-11-12 14:08:17 +01:00' --full-history --no-merges -- src/AlignmentBasedQuantification/AlignmentBasedQuantification.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.
  • Hotspot: src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1504 — src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs changed 24 times in last 90 days, max cyclomatic complexity 43 in PSMBasedQuantificationTIMs.quantifyPeptides at line 1504. 1 of those changes was a fix/bug commit, and the other 23 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 14:08:17 +01:00' --until='2026-11-12 14:08:17 +01:00' --full-history --no-merges -- src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.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.
  • Hotspot: src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs:936 — src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs changed 11 times in last 90 days, max cyclomatic complexity 57 in AlignmentBasedQuantStatistics.scoreRuns at line 936. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 14:08:17 +01:00' --until='2026-11-12 14:08:17 +01:00' --full-history --no-merges -- src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.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.
  • Hotspot: src/ProteomIQon/BioFSharp.Mz_Temp.fs src/ProteomIQon/BioFSharp.Mz_Temp.fs:297 — src/ProteomIQon/BioFSharp.Mz_Temp.fs changed 7 times in last 90 days, max cyclomatic complexity 49 in Wavelet.identifyPeaksBy at line 297. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 14:08:17 +01:00' --until='2026-11-12 14:08:17 +01:00' --full-history --no-merges -- src/ProteomIQon/BioFSharp.Mz_Temp.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.
  • Hotspot: src/ProteomIQon/pepValueCalculation.fs src/ProteomIQon/pepValueCalculation.fs:27 — src/ProteomIQon/pepValueCalculation.fs changed 6 times in last 90 days, max cyclomatic complexity 49 in PepValueCalculation.initCalculatePEPValueIRLS at line 27. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 14:08:17 +01:00' --until='2026-11-12 14:08:17 +01:00' --full-history --no-merges -- src/ProteomIQon/pepValueCalculation.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.
  • Hotspot: src/ProteomIQon/PSMQuantification.fs src/ProteomIQon/PSMQuantification.fs:297 — src/ProteomIQon/PSMQuantification.fs changed 9 times in last 90 days, max cyclomatic complexity 31 in PSMQuantification.quantifyLabeled at line 297. 1 of those changes was a fix/bug commit, and the other 8 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 14:08:17 +01:00' --until='2026-11-12 14:08:17 +01:00' --full-history --no-merges -- src/ProteomIQon/PSMQuantification.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.
  • Hotspot: src/AlignmentBasedQuantification/Program.fs src/AlignmentBasedQuantification/Program.fs:25 — src/AlignmentBasedQuantification/Program.fs changed 5 times in last 90 days, max cyclomatic complexity 27 in console1.main at line 25. 1 of those changes was a fix/bug commit, and the other 4 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 14:08:17 +01:00' --until='2026-11-12 14:08:17 +01:00' --full-history --no-merges -- src/AlignmentBasedQuantification/Program.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.
  • Hotspot: src/PeptideSpectrumMatchingTIMs/PeptideSpectrumMatchingTIMs.fs src/PeptideSpectrumMatchingTIMs/PeptideSpectrumMatchingTIMs.fs:688 — src/PeptideSpectrumMatchingTIMs/PeptideSpectrumMatchingTIMs.fs changed 6 times in last 90 days, max cyclomatic complexity 19 in PeptideSpectrumMatchingTIMs.validateParameters at line 688. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 14:08:17 +01:00' --until='2026-11-12 14:08:17 +01:00' --full-history --no-merges -- src/PeptideSpectrumMatchingTIMs/PeptideSpectrumMatchingTIMs.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.
  • Hotspot: src/ProteomIQon/MzCalibration.fs src/ProteomIQon/MzCalibration.fs:260 — src/ProteomIQon/MzCalibration.fs changed 2 times in last 90 days, max cyclomatic complexity 30 in Normal.Solve at line 260. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 14:08:17 +01:00' --until='2026-11-12 14:08:17 +01:00' --full-history --no-merges -- src/ProteomIQon/MzCalibration.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.
  • Hotspot: src/MsFraggerToPSM/MsFraggerToPSM.fs src/MsFraggerToPSM/MsFraggerToPSM.fs:170 — src/MsFraggerToPSM/MsFraggerToPSM.fs changed 2 times in last 90 days, max cyclomatic complexity 23 in MsFraggerToPSM.findSpectrum at line 170. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 14:08:17 +01:00' --until='2026-11-12 14:08:17 +01:00' --full-history --no-merges -- src/MsFraggerToPSM/MsFraggerToPSM.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.
  • Hotspot: src/SWATHAnalysis/SWATHAnalysis.fs src/SWATHAnalysis/SWATHAnalysis.fs:272 — src/SWATHAnalysis/SWATHAnalysis.fs changed 2 times in last 90 days, max cyclomatic complexity 16 in SwathAnalysis.quantifyFragments at line 272. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 14:08:17 +01:00' --until='2026-11-12 14:08:17 +01:00' --full-history --no-merges -- src/SWATHAnalysis/SWATHAnalysis.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.
D3 · God Classes · FileTooLong · ×9
  • FileTooLong: PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs — FileTooLong — 1659 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 51 functions. The bar is 500 significant lines; this is 1159 over it, 3.32× 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: ProteomIQon/DTO.fs src/ProteomIQon/DTO.fs — FileTooLong — 1371 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 871 over it, 2.74× 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: AlignmentBasedQuantification/AlignmentBasedQuantification.fs src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs — FileTooLong — 1214 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 714 over it, 2.43× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: MzTAB/MzTABSections.fs src/MzTAB/MzTABSections.fs — FileTooLong — 1046 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 546 over it, 2.09× 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: AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs — FileTooLong — 939 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 439 over it, 1.88× 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: PSMStatistics/PSMStatistics.fs src/PSMStatistics/PSMStatistics.fs — FileTooLong — 783 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 283 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: ProteomIQon/PSMQuantification.fs src/ProteomIQon/PSMQuantification.fs — FileTooLong — 640 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 140 over it, 1.28× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: PeptideSpectrumMatchingTIMs/PeptideSpectrumMatchingTIMs.fs src/PeptideSpectrumMatchingTIMs/PeptideSpectrumMatchingTIMs.fs — FileTooLong — 630 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 35 functions. The bar is 500 significant lines; this is 130 over it, 1.26× 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: ProteomIQon/BioFSharp.Mz_Temp.fs src/ProteomIQon/BioFSharp.Mz_Temp.fs — FileTooLong — 612 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 112 over it, 1.22× 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.
D4 · Code Duplication · Duplicated block (12 lines × 2) · ×5
  • Duplicated block (12 lines × 2) src/MzMLToMzLite/Program.fs:43 — src/MzMLToMzLite/Program.fs:43-54 | src/MzMLToMzLiteIonMobility/Program.fs:44-55 — `src/MzMLToMzLite/Program.fs` and `src/MzMLToMzLiteIonMobility/Program.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 51 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `src/MzMLToMzLite/Program.fs:43` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (12 lines × 2) src/MzTAB/MzTABSections.fs:710 — src/MzTAB/MzTABSections.fs:710-721 | src/MzTAB/MzTABSections.fs:723-734 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (12 lines × 2) src/ProteomIQon/PSMQuantification.fs:579 — src/ProteomIQon/PSMQuantification.fs:579-590 | src/ProteomIQon/PSMQuantification.fs:633-644 — 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/ProteomIQon/PSMQuantification.fs:579` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
  • Duplicated block (12 lines × 2) src/MzTAB/MzTABSections.fs:312 — src/MzTAB/MzTABSections.fs:312-323 | src/MzTAB/MzTABSections.fs:349-360 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (12 lines × 2) src/MzTAB/MzTABSections.fs:288 — src/MzTAB/MzTABSections.fs:288-299 | src/MzTAB/MzTABSections.fs:325-336 — 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 (10 lines × 2) · ×5
  • Duplicated block (10 lines × 2) ConsoleTemplate/template/Program.fs:27 — ConsoleTemplate/template/Program.fs:27-36 | src/LabelEfficiencyCalculator/Program.fs:26-35 — before extracting anything, compare `ConsoleTemplate/template/Program.fs` and `src/LabelEfficiencyCalculator/Program.fs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `ConsoleTemplate/template/Program.fs:37` calls `GetAllResults` and `src/LabelEfficiencyCalculator/Program.fs:36` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (10 lines × 2) src/LabelEfficiencyCalculator/LabelEfficiencyCalculator.fs:134 — src/LabelEfficiencyCalculator/LabelEfficiencyCalculator.fs:134-143 | src/LabelEfficiencyCalculator/LabelEfficiencyCalculator.fs:147-156 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (10 lines × 2) src/ProteinInference/Program.fs:37 — src/ProteinInference/Program.fs:37-46 | src/SpectralLibrary/Program.fs:34-44 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
  • Duplicated block (10 lines × 2) src/PeptideSpectrumMatching/PeptideSpectrumMatching.fs:33 — src/PeptideSpectrumMatching/PeptideSpectrumMatching.fs:33-42 | src/PeptideSpectrumMatchingTIMs/PeptideSpectrumMatchingTIMs.fs:149-158 — 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (10 lines × 2) src/ConsensusSpectralLibrary/ConsensusSpectralLibrary.fs:602 — src/ConsensusSpectralLibrary/ConsensusSpectralLibrary.fs:602-612 | src/SWATHAnalysis/SWATHAnalysis.fs:450-459 — 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. 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 (18 lines × 2) · ×4
  • Duplicated block (18 lines × 2) ConsoleTemplate/template/CLIArgumentParsing.fs:1 — ConsoleTemplate/template/CLIArgumentParsing.fs:1-18 | src/LabelEfficiencyCalculator/CLIArgumentParsing.fs:1-18 — before extracting anything, compare `ConsoleTemplate/template/CLIArgumentParsing.fs` and `src/LabelEfficiencyCalculator/CLIArgumentParsing.fs` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (18 lines × 2) src/LabelFreeProteinQuantification/CLIArgumentParsing.fs:1 — src/LabelFreeProteinQuantification/CLIArgumentParsing.fs:1-18 | src/LabeledProteinQuantification/CLIArgumentParsing.fs:1-18 — `src/LabelFreeProteinQuantification/CLIArgumentParsing.fs` and `src/LabeledProteinQuantification/CLIArgumentParsing.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 1 separate duplicated blocks between them, totalling at least 18 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
  • Duplicated block (18 lines × 2) src/LabeledProteinQuantification/LabeledProteinQuantification.fs:57 — src/LabeledProteinQuantification/LabeledProteinQuantification.fs:57-74 | src/LabeledProteinQuantification/LabeledProteinQuantification.fs:94-111 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (18 lines × 2) src/ProteomIQon/PSMQuantification.fs:338 — src/ProteomIQon/PSMQuantification.fs:338-355 | src/ProteomIQon/PSMQuantification.fs:492-509 — 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 (7 lines × 2) · ×4
  • Duplicated block (7 lines × 2) ConsoleTemplate/template/Program.fs:19 — ConsoleTemplate/template/Program.fs:19-25 | src/LabelEfficiencyCalculator/Program.fs:18-24 — before extracting anything, compare `ConsoleTemplate/template/Program.fs` and `src/LabelEfficiencyCalculator/Program.fs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (7 lines × 2) src/PSMBasedQuantification/PSMBasedQuantification.fs:39 — src/PSMBasedQuantification/PSMBasedQuantification.fs:39-45 | src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1500-1507 — `src/PSMBasedQuantification/PSMBasedQuantification.fs` and `src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 6 separate duplicated blocks between them, totalling at least 99 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
  • Duplicated block (7 lines × 2) src/ProteomIQon/BaselineAls.fs:68 — src/ProteomIQon/BaselineAls.fs:68-74 | src/ProteomIQon/BaselineAls.fs:85-91 — 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/ProteomIQon/BaselineAls.fs:76 — src/ProteomIQon/BaselineAls.fs:76-82 | src/ProteomIQon/BaselineAls.fs:94-100 — 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 · Members sharing a duplicated core (6 members, 50+ identical tokens) · ×3
  • Members sharing a duplicated core (6 members, 50+ identical tokens) ConsoleTemplate/template/Program.fs:1 — ConsoleTemplate/template/Program.fs:1-40 | src/LabelEfficiencyCalculator/Program.fs:1-37 | src/MzMLToMzLite/Program.fs:1-62 | src/MzMLToMzLiteIonMobility/Program.fs:1-63 | src/PeptideSpectrumMatching/Program.fs:1-67 | src/PeptideSpectrumMatchingTIMs/Program.fs:1-84 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
  • Members sharing a duplicated core (6 members, 50+ identical tokens) src/AlignmentBasedQuantification/Program.fs:1 — src/AlignmentBasedQuantification/Program.fs:1-127 | src/ConsensusSpectralLibrary/Program.fs:1-50 | src/MzliteToMzML/Program.fs:1-61 | src/Preprocessing/Program.fs:1-61 | src/SWATHAnalysis/Program.fs:1-87 | src/SpectralLibrary/Program.fs:1-100 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
  • Members sharing a duplicated core (6 members, 50+ identical tokens) src/ConsensusSpectralLibrary/Program.fs:1 — src/ConsensusSpectralLibrary/Program.fs:1-50 | src/MzTAB/Program.fs:1-41 | src/PeptideDB/Program.fs:1-32 | src/Preprocessing/Program.fs:1-61 | src/ProteinInference/Program.fs:1-55 | src/SpectralLibrary/Program.fs:1-100 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
D4 · Code Duplication · Duplicated block (16 lines × 2) · ×3
  • Duplicated block (16 lines × 2) src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs:87 — src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs:87-102 | src/LabeledProteinQuantification/LabeledProteinQuantification.fs:189-204 — `src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs` and `src/LabeledProteinQuantification/LabeledProteinQuantification.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 50 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs:87` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs:103` calls `filter` and `src/LabeledProteinQuantification/LabeledProteinQuantification.fs:205` 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 (16 lines × 2) src/MzMLToMzLiteIonMobility/Program.fs:1 — src/MzMLToMzLiteIonMobility/Program.fs:1-16 | src/RatioLFQ/Program.fs:1-16 — 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 (16 lines × 2) src/ProteomIQon/DTO.fs:1059 — src/ProteomIQon/DTO.fs:1059-1074 | src/ProteomIQon/DTO.fs:1077-1092 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (15 lines × 2) · ×3
  • Duplicated block (15 lines × 2) src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs:170 — src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs:170-184 | src/LabeledProteinQuantification/LabeledProteinQuantification.fs:278-292 — `src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs` and `src/LabeledProteinQuantification/LabeledProteinQuantification.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 50 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
  • Duplicated block (15 lines × 2) src/MzTAB/MzTABSections.fs:585 — src/MzTAB/MzTABSections.fs:585-599 | src/MzTAB/MzTABSections.fs:603-617 — 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/ProteomIQon/PSMQuantification.fs:428 — src/ProteomIQon/PSMQuantification.fs:428-442 | src/ProteomIQon/PSMQuantification.fs:582-596 — 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/ProteomIQon/PSMQuantification.fs:428` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
D4 · Code Duplication · Duplicated block (8 lines × 2) · ×3
  • Duplicated block (8 lines × 2) src/MzMLToMzLite/MzMLToMzLite.fs:57 — src/MzMLToMzLite/MzMLToMzLite.fs:57-64 | src/Preprocessing/Preprocessing.fs:61-68 — `src/MzMLToMzLite/MzMLToMzLite.fs` and `src/Preprocessing/Preprocessing.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 7 separate duplicated blocks between them, totalling at least 124 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
  • Duplicated block (8 lines × 2) src/PeptideSpectrumMatching/Program.fs:19 — src/PeptideSpectrumMatching/Program.fs:19-26 | src/PeptideSpectrumMatchingTIMs/Program.fs:19-26 — `src/PeptideSpectrumMatching/Program.fs` and `src/PeptideSpectrumMatchingTIMs/Program.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 31 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
  • Duplicated block (8 lines × 2) src/PeptideSpectrumMatching/CLIArgumentParsing.fs:19 — src/PeptideSpectrumMatching/CLIArgumentParsing.fs:19-26 | src/PeptideSpectrumMatchingTIMs/CLIArgumentParsing.fs:19-26 — 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.
D4 · Code Duplication · Duplicated block (6 lines × 3) · ×3
  • Duplicated block (6 lines × 3) src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1851 — src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1851-1856 | src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1924-1929 | src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:2026-2031 — 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 (6 lines × 3) src/ProteomIQon/PSMQuantification.fs:419 — src/ProteomIQon/PSMQuantification.fs:419-424 | src/ProteomIQon/PSMQuantification.fs:473-478 | src/ProteomIQon/PSMQuantification.fs:718-723 — 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 (6 lines × 3) src/AlignmentBasedQuantStatistics/Program.fs:107 — src/AlignmentBasedQuantStatistics/Program.fs:107-112 | src/AlignmentBasedQuantification/Program.fs:120-125 | src/QuantBasedAlignment/Program.fs:69-74 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×3
  • Duplicated block (6 lines × 2) src/LabeledProteinQuantification/LabeledProteinQuantification.fs:32 — src/LabeledProteinQuantification/LabeledProteinQuantification.fs:32-37 | src/LabeledProteinQuantification/LabeledProteinQuantification.fs:122-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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/LabeledProteinQuantification/LabeledProteinQuantification.fs:29` calls `zip` and `src/LabeledProteinQuantification/LabeledProteinQuantification.fs:118` 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 (6 lines × 2) src/ProteomIQon/DeedleExtensionsTemp.fs:239 — src/ProteomIQon/DeedleExtensionsTemp.fs:239-244 | src/ProteomIQon/DeedleExtensionsTemp.fs:255-260 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. 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/ProteomIQon/DeedleExtensionsTemp.fs:261` calls `r` and `src/ProteomIQon/DeedleExtensionsTemp.fs:244` 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.
  • Duplicated block (6 lines × 2) src/AlignmentBasedQuantStatistics/Program.fs:106 — src/AlignmentBasedQuantStatistics/Program.fs:106-111 | src/QuantBasedAlignment/Program.fs:68-73 — 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.
D4 · Code Duplication · Duplicated block (5 lines × 2) · ×3
  • Duplicated block (5 lines × 2) src/LabeledProteinQuantification/LabeledProteinQuantification.fs:76 — src/LabeledProteinQuantification/LabeledProteinQuantification.fs:76-80 | src/LabeledProteinQuantification/LabeledProteinQuantification.fs:116-121 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (5 lines × 2) src/PeptideSpectrumMatchingTIMs/SpectrumSearch.fs:410 — src/PeptideSpectrumMatchingTIMs/SpectrumSearch.fs:410-414 | src/PeptideSpectrumMatchingTIMs/SpectrumSearch.fs:422-426 — 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/ProteomIQon/Core.fs:114 — src/ProteomIQon/Core.fs:114-118 | src/ProteomIQon/Core.fs:123-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 · Members sharing a duplicated core (7 members, 50+ identical tokens) · ×2
  • Members sharing a duplicated core (7 members, 50+ identical tokens) ConsoleTemplate/template/Program.fs:1 — ConsoleTemplate/template/Program.fs:1-40 | src/AddDeducedPeptides/Program.fs:1-40 | src/JoinQuantPepIonsWithProteins/Program.fs:1-56 | src/LabelEfficiencyCalculator/Program.fs:1-37 | src/LabelFreeProteinQuantification/Program.fs:1-38 | src/LabeledProteinQuantification/Program.fs:1-38 | src/MzliteToMzML/Program.fs:1-61 — These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times.
  • Members sharing a duplicated core (7 members, 50+ identical tokens) src/AlignmentBasedQuantification/CLIArgumentParsing.fs:1 — src/AlignmentBasedQuantification/CLIArgumentParsing.fs:1-34 | src/PSMBasedQuantification/CLIArgumentParsing.fs:1-34 | src/PSMBasedQuantificationTIMs/CLIArgumentParsing.fs:1-34 | src/PSMStatistics/CLIArgumentParsing.fs:1-32 | src/PeptideSpectrumMatching/CLIArgumentParsing.fs:1-30 | src/PeptideSpectrumMatchingTIMs/CLIArgumentParsing.fs:1-34 | src/SWATHAnalysis/CLIArgumentParsing.fs:1-33 — These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times.
D4 · Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) · ×2
  • Members sharing a duplicated core (4 members, 50+ identical tokens) src/JoinQuantPepIonsWithProteins/Program.fs:1 — src/JoinQuantPepIonsWithProteins/Program.fs:1-56 | src/PSMBasedQuantification/Program.fs:1-95 | src/PSMBasedQuantificationTIMs/Program.fs:1-99 | src/SWATHAnalysis/Program.fs:1-87 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
  • Members sharing a duplicated core (4 members, 50+ identical tokens) src/MzMLToMzLite/Program.fs:1 — src/MzMLToMzLite/Program.fs:1-62 | src/MzMLToMzLiteIonMobility/Program.fs:1-63 | src/MzliteToMzML/Program.fs:1-61 | src/Preprocessing/Program.fs:1-61 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
D4 · Code Duplication · Duplicated block (40 lines × 2) · ×2
  • Duplicated block (40 lines × 2) src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1829 — src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1829-1868 | src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1902-1941 — 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/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1829` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
  • Duplicated block (40 lines × 2) src/ProteomIQon/PSMQuantification.fs:357 — src/ProteomIQon/PSMQuantification.fs:357-396 | src/ProteomIQon/PSMQuantification.fs:511-550 — 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/ProteomIQon/PSMQuantification.fs:357` 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 (22 lines × 2) · ×2
  • Duplicated block (22 lines × 2) src/PSMBasedQuantification/PSMBasedQuantification.fs:165 — src/PSMBasedQuantification/PSMBasedQuantification.fs:165-186 | src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:2071-2092 — `src/PSMBasedQuantification/PSMBasedQuantification.fs` and `src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 6 separate duplicated blocks between them, totalling at least 99 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
  • Duplicated block (22 lines × 2) src/ProteomIQon/PSMQuantification.fs:451 — src/ProteomIQon/PSMQuantification.fs:451-472 | src/ProteomIQon/PSMQuantification.fs:696-717 — 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 (17 lines × 2) · ×2
  • Duplicated block (17 lines × 2) src/ConsensusSpectralLibrary/ConsensusSpectralLibrary.fs:9 — src/ConsensusSpectralLibrary/ConsensusSpectralLibrary.fs:9-25 | src/SWATHAnalysis/SWATHAnalysis.fs:11-27 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
  • Duplicated block (17 lines × 2) src/ProteomIQon/PSMQuantification.fs:474 — src/ProteomIQon/PSMQuantification.fs:474-490 | src/ProteomIQon/PSMQuantification.fs:719-735 — 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/ProteomIQon/PSMQuantification.fs:474` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
D4 · Code Duplication · Duplicated block (14 lines × 3) · ×2
  • Duplicated block (14 lines × 3) src/MzTAB/Program.fs:1 — src/MzTAB/Program.fs:1-14 | src/PeptideDB/Program.fs:1-14 | src/Preprocessing/Program.fs:1-14 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
  • Duplicated block (14 lines × 3) src/AlignmentBasedQuantStatistics/Program.fs:7 — src/AlignmentBasedQuantStatistics/Program.fs:7-20 | src/AlignmentBasedQuantification/Program.fs:9-22 | src/QuantBasedAlignment/Program.fs:7-20 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
D4 · Code Duplication · Duplicated block (14 lines × 2) · ×2
  • Duplicated block (14 lines × 2) src/LabelFreeProteinQuantification/Program.fs:17 — src/LabelFreeProteinQuantification/Program.fs:17-30 | src/LabeledProteinQuantification/Program.fs:17-30 — `src/LabelFreeProteinQuantification/Program.fs` and `src/LabeledProteinQuantification/Program.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 3 separate duplicated blocks between them, totalling at least 36 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
  • Duplicated block (14 lines × 2) src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1797 — src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1797-1810 | src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1870-1883 — 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 (13 lines × 2) · ×2
  • Duplicated block (13 lines × 2) src/ConsensusSpectralLibrary/ConsensusSpectralLibrary.fs:311 — src/ConsensusSpectralLibrary/ConsensusSpectralLibrary.fs:311-323 | src/SWATHAnalysis/SWATHAnalysis.fs:376-388 — 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/ConsensusSpectralLibrary/ConsensusSpectralLibrary.fs:311` 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 (13 lines × 2) src/MzMLToMzLite/MzMLToMzLite.fs:131 — src/MzMLToMzLite/MzMLToMzLite.fs:131-143 | src/MzMLToMzLiteIonMobility/MzMLToMzLiteIonMobility.fs:111-123 — `src/MzMLToMzLite/MzMLToMzLite.fs` and `src/MzMLToMzLiteIonMobility/MzMLToMzLiteIonMobility.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 3 separate duplicated blocks between them, totalling at least 43 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
D4 · Code Duplication · Duplicated block (11 lines × 3) · ×2
  • Duplicated block (11 lines × 3) src/MzTAB/MzTABSections.fs:200 — src/MzTAB/MzTABSections.fs:200-210 | src/MzTAB/MzTABSections.fs:214-224 | src/MzTAB/MzTABSections.fs:228-238 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
  • Duplicated block (11 lines × 3) src/MzTAB/MzTABSections.fs:710 — src/MzTAB/MzTABSections.fs:710-720 | src/MzTAB/MzTABSections.fs:723-733 | src/MzTAB/MzTABSections.fs:736-746 — 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 (9 lines × 4) · ×2
  • Duplicated block (9 lines × 4) src/MzMLToMzLite/Program.fs:46 — src/MzMLToMzLite/Program.fs:46-54 | src/MzMLToMzLiteIonMobility/Program.fs:47-55 | src/MzliteToMzML/Program.fs:43-51 | src/Preprocessing/Program.fs:43-51 — `src/MzMLToMzLite/Program.fs` and `src/MzMLToMzLiteIonMobility/Program.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 51 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
  • Duplicated block (9 lines × 4) src/PSMBasedQuantification/Program.fs:9 — src/PSMBasedQuantification/Program.fs:9-17 | src/PSMBasedQuantificationTIMs/Program.fs:9-17 | src/PeptideSpectrumMatching/Program.fs:8-16 | src/PeptideSpectrumMatchingTIMs/Program.fs:8-16 — `src/PSMBasedQuantification/Program.fs` and `src/PSMBasedQuantificationTIMs/Program.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 6 separate duplicated blocks between them, totalling at least 114 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
D4 · Code Duplication · Duplicated block (8 lines × 5) · ×2
  • Duplicated block (8 lines × 5) src/ConsensusSpectralLibrary/Program.fs:8 — src/ConsensusSpectralLibrary/Program.fs:8-15 | src/MzTAB/Program.fs:7-14 | src/PeptideDB/Program.fs:7-14 | src/Preprocessing/Program.fs:7-14 | src/SpectralLibrary/Program.fs:9-16 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 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 5 times.
  • Duplicated block (8 lines × 5) src/PSMBasedQuantification/Program.fs:10 — src/PSMBasedQuantification/Program.fs:10-17 | src/PSMBasedQuantificationTIMs/Program.fs:10-17 | src/PeptideSpectrumMatching/Program.fs:9-16 | src/PeptideSpectrumMatchingTIMs/Program.fs:9-16 | src/SWATHAnalysis/Program.fs:9-16 — `src/PSMBasedQuantification/Program.fs` and `src/PSMBasedQuantificationTIMs/Program.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 6 separate duplicated blocks between them, totalling at least 114 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
D4 · Code Duplication · Duplicated block (7 lines × 6) · ×2
  • Duplicated block (7 lines × 6) src/AlignmentBasedQuantification/CLIArgumentParsing.fs:17 — src/AlignmentBasedQuantification/CLIArgumentParsing.fs:17-23 | src/PSMBasedQuantification/CLIArgumentParsing.fs:17-23 | src/PSMBasedQuantificationTIMs/CLIArgumentParsing.fs:17-23 | src/PSMStatistics/CLIArgumentParsing.fs:18-24 | src/PeptideSpectrumMatching/CLIArgumentParsing.fs:17-23 | src/SWATHAnalysis/CLIArgumentParsing.fs:17-23 — `src/PSMBasedQuantification/CLIArgumentParsing.fs` and `src/PSMBasedQuantificationTIMs/CLIArgumentParsing.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 3 separate duplicated blocks between them, totalling at least 45 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/PSMBasedQuantification/CLIArgumentParsing.fs:14` calls `AltCommandLine` and `src/AlignmentBasedQuantification/CLIArgumentParsing.fs:14` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (7 lines × 6) src/ConsensusSpectralLibrary/Program.fs:9 — src/ConsensusSpectralLibrary/Program.fs:9-15 | src/MzTAB/Program.fs:8-14 | src/PeptideDB/Program.fs:8-14 | src/Preprocessing/Program.fs:8-14 | src/ProteinInference/Program.fs:10-16 | src/SpectralLibrary/Program.fs:10-16 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 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 6 times.
D1 · Cyclomatic Complexity · AlignmentBasedQuantification.quantifyPeptides (cyclomatic 174) · ×1
  • AlignmentBasedQuantification.quantifyPeptides (cyclomatic 174) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs:761 — AlignmentBasedQuantification.quantifyPeptides has cyclomatic complexity 174 (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 · AlignmentBasedQuantStatistics.scoreRuns (cyclomatic 57) · ×1
  • AlignmentBasedQuantStatistics.scoreRuns (cyclomatic 57) src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs:936 — AlignmentBasedQuantStatistics.scoreRuns has cyclomatic complexity 57 (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 · PepValueCalculation.initCalculatePEPValueIRLS (cyclomatic 49) · ×1
  • PepValueCalculation.initCalculatePEPValueIRLS (cyclomatic 49) src/ProteomIQon/pepValueCalculation.fs:27 — PepValueCalculation.initCalculatePEPValueIRLS has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Wavelet.identifyPeaksBy (cyclomatic 49) · ×1
  • Wavelet.identifyPeaksBy (cyclomatic 49) src/ProteomIQon/BioFSharp.Mz_Temp.fs:297 — Wavelet.identifyPeaksBy has cyclomatic complexity 49 (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 · PSMBasedQuantificationTIMs.quantifyPeptides (cyclomatic 43) · ×1
  • PSMBasedQuantificationTIMs.quantifyPeptides (cyclomatic 43) src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1504 — PSMBasedQuantificationTIMs.quantifyPeptides has cyclomatic complexity 43 (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 · BaselineAls.baselineAls (cyclomatic 42) · ×1
  • BaselineAls.baselineAls (cyclomatic 42) src/ProteomIQon/BaselineAls.fs:11 — BaselineAls.baselineAls has cyclomatic complexity 42 (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 · PSMQuantification.quantifyLabeled (cyclomatic 31) · ×1
  • PSMQuantification.quantifyLabeled (cyclomatic 31) src/ProteomIQon/PSMQuantification.fs:297 — PSMQuantification.quantifyLabeled has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Normal.Solve (cyclomatic 30) · ×1
  • Normal.Solve (cyclomatic 30) src/ProteomIQon/MzCalibration.fs:260 — Normal.Solve has cyclomatic complexity 30 (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 · console1.main (cyclomatic 27) · ×1
  • console1.main (cyclomatic 27) src/AlignmentBasedQuantification/Program.fs:25 — console1.main has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · MsFraggerToPSM.findSpectrum (cyclomatic 23) · ×1
  • MsFraggerToPSM.findSpectrum (cyclomatic 23) src/MsFraggerToPSM/MsFraggerToPSM.fs:170 — MsFraggerToPSM.findSpectrum 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 · PeptideSpectrumMatchingTIMs.validateParameters (cyclomatic 19) · ×1
  • PeptideSpectrumMatchingTIMs.validateParameters (cyclomatic 19) src/PeptideSpectrumMatchingTIMs/PeptideSpectrumMatchingTIMs.fs:688 — PeptideSpectrumMatchingTIMs.validateParameters has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · MzTABSections.peptideSection (cyclomatic 19) · ×1
  • MzTABSections.peptideSection (cyclomatic 19) src/MzTAB/MzTABSections.fs:882 — MzTABSections.peptideSection has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · Wavelet.transformFast (cyclomatic 18) · ×1
  • Wavelet.transformFast (cyclomatic 18) src/ProteomIQon/BioFSharp.Mz_Temp.fs:164 — Wavelet.transformFast has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · console1.main (cyclomatic 18) · ×1
  • console1.main (cyclomatic 18) src/PeptideSpectrumMatchingTIMs/Program.fs:15 — console1.main 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 · TableSort.filterFrame (cyclomatic 17) · ×1
  • TableSort.filterFrame (cyclomatic 17) src/TableSort/TableSort.fs:133 — TableSort.filterFrame 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 · MzCalibration.crossValidate (cyclomatic 16) · ×1
  • MzCalibration.crossValidate (cyclomatic 16) src/ProteomIQon/MzCalibration.fs:335 — MzCalibration.crossValidate has cyclomatic complexity 16 (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 · PeptideSpectrumMatchingTIMs.searchSliceWith (cyclomatic 16) · ×1
  • PeptideSpectrumMatchingTIMs.searchSliceWith (cyclomatic 16) src/PeptideSpectrumMatchingTIMs/PeptideSpectrumMatchingTIMs.fs:586 — PeptideSpectrumMatchingTIMs.searchSliceWith has cyclomatic complexity 16 (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 · AlignmentBasedQuantStatistics.readRun (cyclomatic 16) · ×1
  • AlignmentBasedQuantStatistics.readRun (cyclomatic 16) src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs:739 — AlignmentBasedQuantStatistics.readRun 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 · SwathAnalysis.quantifyFragments (cyclomatic 16) · ×1
  • SwathAnalysis.quantifyFragments (cyclomatic 16) src/SWATHAnalysis/SWATHAnalysis.fs:272 — SwathAnalysis.quantifyFragments 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.
D2 · Cognitive Complexity · AlignmentBasedQuantification.quantifyPeptides (cognitive 290) · ×1
  • AlignmentBasedQuantification.quantifyPeptides (cognitive 290) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs:761 — AlignmentBasedQuantification.quantifyPeptides has cognitive complexity 290 (threshold 15). Drivers by points: if/else 122 (174 pts), match/switch 32 (65 pts), boolean chains 23, error handling 6 (15 pts), loops 8 (13 pts) (nesting depth added 99). 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 · PSMQuantification.quantifyLabeled (cognitive 145) · ×1
  • PSMQuantification.quantifyLabeled (cognitive 145) src/ProteomIQon/PSMQuantification.fs:297 — PSMQuantification.quantifyLabeled has cognitive complexity 145 (threshold 15). Drivers by points: if/else 35 (133 pts), match/switch 2 (10 pts), error handling 2 (nesting depth added 106). 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 · BaselineAls.baselineAls (cognitive 109) · ×1
  • BaselineAls.baselineAls (cognitive 109) src/ProteomIQon/BaselineAls.fs:11 — BaselineAls.baselineAls has cognitive complexity 109 (threshold 15). Drivers by points: if/else 35 (74 pts), loops 11 (28 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 59). 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 · Normal.Solve (cognitive 97) · ×1
  • Normal.Solve (cognitive 97) src/ProteomIQon/MzCalibration.fs:260 — Normal.Solve has cognitive complexity 97 (threshold 15). Drivers by points: loops 23 (76 pts), if/else 10 (21 pts) (nesting depth added 64). 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 · AlignmentBasedQuantStatistics.scoreRuns (cognitive 90) · ×1
  • AlignmentBasedQuantStatistics.scoreRuns (cognitive 90) src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs:936 — AlignmentBasedQuantStatistics.scoreRuns has cognitive complexity 90 (threshold 15). Drivers by points: if/else 47 (62 pts), boolean chains 11, match/switch 9 (10 pts), loops 5 (7 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 · PepValueCalculation.initCalculatePEPValueIRLS (cognitive 79) · ×1
  • PepValueCalculation.initCalculatePEPValueIRLS (cognitive 79) src/ProteomIQon/pepValueCalculation.fs:27 — PepValueCalculation.initCalculatePEPValueIRLS has cognitive complexity 79 (threshold 15). Drivers by points: if/else 39 (55 pts), loops 13 (14 pts), boolean chains 8, match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · PSMBasedQuantificationTIMs.quantifyPeptides (cognitive 74) · ×1
  • PSMBasedQuantificationTIMs.quantifyPeptides (cognitive 74) src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1504 — PSMBasedQuantificationTIMs.quantifyPeptides has cognitive complexity 74 (threshold 15). Drivers by points: if/else 21 (36 pts), match/switch 11 (29 pts), error handling 3 (6 pts), boolean chains 3 (nesting depth added 36). 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 · Wavelet.identifyPeaksBy (cognitive 65) · ×1
  • Wavelet.identifyPeaksBy (cognitive 65) src/ProteomIQon/BioFSharp.Mz_Temp.fs:297 — Wavelet.identifyPeaksBy has cognitive complexity 65 (threshold 15). Drivers by points: if/else 20 (37 pts), match/switch 9 (12 pts), boolean chains 10, loops 3 (6 pts) (nesting depth added 23). 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 · PSMBasedQuantificationTIMs.tryFitGaussian2D (cognitive 44) · ×1
  • PSMBasedQuantificationTIMs.tryFitGaussian2D (cognitive 44) src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1184 — PSMBasedQuantificationTIMs.tryFitGaussian2D has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (32 pts), loops 2 (9 pts), boolean chains 3 (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · RobustShift.outOfFold (cognitive 41) · ×1
  • RobustShift.outOfFold (cognitive 41) src/QuantBasedAlignment/QuantBasedAlignment.fs:105 — RobustShift.outOfFold has cognitive complexity 41 (threshold 15). Drivers by points: if/else 7 (25 pts), loops 5 (14 pts), boolean chains 2 (nesting depth added 27). 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 · console1.main (cognitive 37) · ×1
  • console1.main (cognitive 37) src/AlignmentBasedQuantification/Program.fs:25 — console1.main has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (21 pts), match/switch 5 (8 pts), boolean chains 5, error handling 2, loops 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 · MsFraggerToPSM.findSpectrum (cognitive 36) · ×1
  • MsFraggerToPSM.findSpectrum (cognitive 36) src/MsFraggerToPSM/MsFraggerToPSM.fs:170 — MsFraggerToPSM.findSpectrum has cognitive complexity 36 (threshold 15). Drivers by points: if/else 20 (28 pts), boolean chains 6, loops 2 (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 · PSMBasedQuantificationTIMs.correctBaselineAlongRt (cognitive 36) · ×1
  • PSMBasedQuantificationTIMs.correctBaselineAlongRt (cognitive 36) src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:513 — PSMBasedQuantificationTIMs.correctBaselineAlongRt has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (10 pts), error handling 1 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 21). 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 · Xic.closestPoint (cognitive 34) · ×1
  • Xic.closestPoint (cognitive 34) src/ProteomIQon/Xic.fs:43 — Xic.closestPoint has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 3 (7 pts), boolean chains 5 (nesting depth added 18). 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 · Wavelet.transformFast (cognitive 34) · ×1
  • Wavelet.transformFast (cognitive 34) src/ProteomIQon/BioFSharp.Mz_Temp.fs:164 — Wavelet.transformFast has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 6, loops 5 (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 · SpectrumSearch.collect (cognitive 33) · ×1
  • SpectrumSearch.collect (cognitive 33) src/PeptideSpectrumMatchingTIMs/SpectrumSearch.fs:403 — SpectrumSearch.collect has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 6 (12 pts), boolean chains 1 (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 · SwathAnalysis.quantifyFragments (cognitive 33) · ×1
  • SwathAnalysis.quantifyFragments (cognitive 33) src/SWATHAnalysis/SWATHAnalysis.fs:272 — SwathAnalysis.quantifyFragments has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 4 (10 pts), error handling 2 (6 pts), boolean chains 2 (nesting depth added 17). 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 · PSMQuantification.quantifyLabelFree (cognitive 32) · ×1
  • PSMQuantification.quantifyLabelFree (cognitive 32) src/ProteomIQon/PSMQuantification.fs:651 — PSMQuantification.quantifyLabelFree has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (31 pts), error handling 1 (nesting depth added 19). 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 · Xic.centrePoints (cognitive 31) · ×1
  • Xic.centrePoints (cognitive 31) src/ProteomIQon/Xic.fs:190 — Xic.centrePoints has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 4 (10 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · PeakSelection.fitLogistic (cognitive 31) · ×1
  • PeakSelection.fitLogistic (cognitive 31) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs:378 — PeakSelection.fitLogistic has cognitive complexity 31 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 8, boolean chains 1 (nesting depth added 13). 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 · MzCalibration.crossValidate (cognitive 25) · ×1
  • MzCalibration.crossValidate (cognitive 25) src/ProteomIQon/MzCalibration.fs:335 — MzCalibration.crossValidate has cognitive complexity 25 (threshold 15). Drivers by points: loops 7 (11 pts), if/else 6 (9 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SpectrumSearch.expectationModelOfHistogram (cognitive 25) · ×1
  • SpectrumSearch.expectationModelOfHistogram (cognitive 25) src/PeptideSpectrumMatchingTIMs/SpectrumSearch.fs:449 — SpectrumSearch.expectationModelOfHistogram has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 3 (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 · AlignmentFeatures.xicCompetition (cognitive 24) · ×1
  • AlignmentFeatures.xicCompetition (cognitive 24) src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs:112 — AlignmentFeatures.xicCompetition has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · PeptideSpectrumMatchingTIMs.searchSliceWith (cognitive 23) · ×1
  • PeptideSpectrumMatchingTIMs.searchSliceWith (cognitive 23) src/PeptideSpectrumMatchingTIMs/PeptideSpectrumMatchingTIMs.fs:586 — PeptideSpectrumMatchingTIMs.searchSliceWith has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), error handling 2 (5 pts), boolean chains 3, match/switch 2 (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 · PeptideSpectrumMatchingTIMs.finishRunWith (cognitive 23) · ×1
  • PeptideSpectrumMatchingTIMs.finishRunWith (cognitive 23) src/PeptideSpectrumMatchingTIMs/PeptideSpectrumMatchingTIMs.fs:638 — PeptideSpectrumMatchingTIMs.finishRunWith has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7, match/switch 3 (6 pts), loops 2 (5 pts), error handling 1 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · PeptideIndex.sliceBoundariesFor (cognitive 23) · ×1
  • PeptideIndex.sliceBoundariesFor (cognitive 23) src/PeptideSpectrumMatchingTIMs/PeptideIndex.fs:295 — PeptideIndex.sliceBoundariesFor has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (10 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · PeakSelection.createCandidates (cognitive 23) · ×1
  • PeakSelection.createCandidates (cognitive 23) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs:266 — PeakSelection.createCandidates has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (5 pts), boolean chains 2 (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 · Xic.extractPointWith (cognitive 22) · ×1
  • Xic.extractPointWith (cognitive 22) src/ProteomIQon/Xic.fs:112 — Xic.extractPointWith has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 4, loops 1 (2 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 · PeptideSpectrumMatchingTIMs.scoreRunsWithPeakReader (cognitive 22) · ×1
  • PeptideSpectrumMatchingTIMs.scoreRunsWithPeakReader (cognitive 22) src/PeptideSpectrumMatchingTIMs/PeptideSpectrumMatchingTIMs.fs:721 — PeptideSpectrumMatchingTIMs.scoreRunsWithPeakReader has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 5 (8 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 7). 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 · SpectrumSearch.scatter (cognitive 22) · ×1
  • SpectrumSearch.scatter (cognitive 22) src/PeptideSpectrumMatchingTIMs/SpectrumSearch.fs:346 — SpectrumSearch.scatter has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (9 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 · PeptideIndex.loadPeptideTable (cognitive 22) · ×1
  • PeptideIndex.loadPeptideTable (cognitive 22) src/PeptideSpectrumMatchingTIMs/PeptideIndex.fs:125 — PeptideIndex.loadPeptideTable has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 2 (4 pts), loops 2 (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 · AlignmentFeatures.isotopeFeatures (cognitive 22) · ×1
  • AlignmentFeatures.isotopeFeatures (cognitive 22) src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs:137 — AlignmentFeatures.isotopeFeatures has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · MzTABSections.peptideSection (cognitive 22) · ×1
  • MzTABSections.peptideSection (cognitive 22) src/MzTAB/MzTABSections.fs:882 — MzTABSections.peptideSection has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (15 pts), match/switch 6 (7 pts) (nesting depth added 2). 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 · TableSort.filterFrame (cognitive 21) · ×1
  • TableSort.filterFrame (cognitive 21) src/TableSort/TableSort.fs:133 — TableSort.filterFrame has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 4 (14 pts), if/else 4 (5 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 · MzCalibration.compareObservations (cognitive 20) · ×1
  • MzCalibration.compareObservations (cognitive 20) src/ProteomIQon/MzCalibration.fs:451 — MzCalibration.compareObservations has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (20 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 · PeptideIndex.buildFragmentIndexWith (cognitive 20) · ×1
  • PeptideIndex.buildFragmentIndexWith (cognitive 20) src/PeptideSpectrumMatchingTIMs/PeptideIndex.fs:330 — PeptideIndex.buildFragmentIndexWith has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 5 (6 pts), boolean chains 1 (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 · XicSweep.sweep (cognitive 20) · ×1
  • XicSweep.sweep (cognitive 20) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs:78 — XicSweep.sweep has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (11 pts), match/switch 1 (5 pts), boolean chains 2, if/else 1 (2 pts) (nesting depth added 11). 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 · PeakShape.emgModeOffset (cognitive 19) · ×1
  • PeakShape.emgModeOffset (cognitive 19) src/ProteomIQon/PeakShape.fs:42 — PeakShape.emgModeOffset has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Wavelet.bestSubsetFast (cognitive 19) · ×1
  • Wavelet.bestSubsetFast (cognitive 19) src/ProteomIQon/BioFSharp.Mz_Temp.fs:240 — Wavelet.bestSubsetFast has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (6 pts), boolean chains 4 (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.
D2 · Cognitive Complexity · console1.main (cognitive 19) · ×1
  • console1.main (cognitive 19) src/PSMBasedQuantificationTIMs/Program.fs:16 — console1.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 4 (7 pts), boolean chains 1 (nesting depth added 5). 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 · AlignmentScoring.fitPlatt (cognitive 19) · ×1
  • AlignmentScoring.fitPlatt (cognitive 19) src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs:321 — AlignmentScoring.fitPlatt has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · IsotopePatterns.store (cognitive 18) · ×1
  • IsotopePatterns.store (cognitive 18) src/ProteomIQon/IsotopePatterns.fs:130 — IsotopePatterns.store has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), error handling 4, loops 1 (nesting depth added 2). 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 · SeqIO'.stringFunction (cognitive 18) · ×1
  • SeqIO'.stringFunction (cognitive 18) src/ProteomIQon/BioFSharp.Mz_Temp.fs:13 — SeqIO'.stringFunction has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (6 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · QuantBasedAlignment.alignPair (cognitive 17) · ×1
  • QuantBasedAlignment.alignPair (cognitive 17) src/QuantBasedAlignment/QuantBasedAlignment.fs:391 — QuantBasedAlignment.alignPair has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 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 · PeakSelection.fwhm (cognitive 17) · ×1
  • PeakSelection.fwhm (cognitive 17) src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs:214 — PeakSelection.fwhm has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 2 (6 pts), boolean chains 2 (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 · AlignmentBasedQuantStatistics.readRun (cognitive 17) · ×1
  • AlignmentBasedQuantStatistics.readRun (cognitive 17) src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs:739 — AlignmentBasedQuantStatistics.readRun has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (8 pts), if/else 4 (5 pts), loops 3, boolean chains 1 (nesting depth added 4). 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 · console1.main (cognitive 17) · ×1
  • console1.main (cognitive 17) src/SWATHAnalysis/Program.fs:15 — console1.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 5). 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 · PSMQuantification.qualityFilter (cognitive 16) · ×1
  • PSMQuantification.qualityFilter (cognitive 16) src/ProteomIQon/PSMQuantification.fs:142 — PSMQuantification.qualityFilter has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · QuantBasedAlignment.apexOrDropReason (cognitive 16) · ×1
  • QuantBasedAlignment.apexOrDropReason (cognitive 16) src/QuantBasedAlignment/QuantBasedAlignment.fs:280 — QuantBasedAlignment.apexOrDropReason has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · PSMBasedQuantificationTIMs.tryWeightedMeanOrMean (cognitive 16) · ×1
  • PSMBasedQuantificationTIMs.tryWeightedMeanOrMean (cognitive 16) src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:275 — PSMBasedQuantificationTIMs.tryWeightedMeanOrMean has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · PSMBasedQuantificationTIMs.tryFindHighestGaborPositionNearExpectedPosition (cognitive 16) · ×1
  • PSMBasedQuantificationTIMs.tryFindHighestGaborPositionNearExpectedPosition (cognitive 16) src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:787 — PSMBasedQuantificationTIMs.tryFindHighestGaborPositionNearExpectedPosition has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (3 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.
D2 · Cognitive Complexity · console1.main (cognitive 16) · ×1
  • console1.main (cognitive 16) src/AlignmentBasedQuantStatistics/Program.fs:44 — console1.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 2 (3 pts), boolean chains 2, loops 2, error handling 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.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D4 · Code Duplication · Near-duplicate member pair (115 shared lines) · ×1
  • Near-duplicate member pair (115 shared lines) src/MzMLToMzLite/MzMLToMzLite.fs:1 — src/MzMLToMzLite/MzMLToMzLite.fs:1-230 | src/Preprocessing/Preprocessing.fs:1-245 — These two members are variants of one another: 115 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication · Near-duplicate member pair (48 shared lines) · ×1
  • Near-duplicate member pair (48 shared lines) src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs:1 — src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs:1-187 | src/LabeledProteinQuantification/LabeledProteinQuantification.fs:1-295 — These two members are variants of one another: 48 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication · Members sharing a duplicated core (5 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (5 members, 50+ identical tokens) src/PSMBasedQuantification/Program.fs:1 — src/PSMBasedQuantification/Program.fs:1-95 | src/PSMBasedQuantificationTIMs/Program.fs:1-99 | src/PeptideSpectrumMatching/Program.fs:1-67 | src/PeptideSpectrumMatchingTIMs/Program.fs:1-84 | src/SWATHAnalysis/Program.fs:1-87 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
D4 · Code Duplication · Edited copies of one member (3 members, 26+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 26+ corresponding lines) src/MsFraggerToPSM/CLIArgumentParsing.fs:1 — src/MsFraggerToPSM/CLIArgumentParsing.fs:1-26 | src/MzTAB/CLIArgumentParsing.fs:1-29 | src/QuantBasedAlignment/CLIArgumentParsing.fs:1-28 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 26 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (23 corresponding lines) · ×1
  • Edited copy of a member (23 corresponding lines) src/ConsensusSpectralLibrary/CLIArgumentParsing.fs:1 — src/ConsensusSpectralLibrary/CLIArgumentParsing.fs:1-23 | src/ProteinInference/CLIArgumentParsing.fs:1-25 — These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (20 corresponding lines) · ×1
  • Edited copy of a member (20 corresponding lines) src/MzliteToMzML/CLIArgumentParsing.fs:1 — src/MzliteToMzML/CLIArgumentParsing.fs:1-20 | src/Preprocessing/CLIArgumentParsing.fs:1-20 — These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (81–82 lines × 2) · ×1
  • Duplicated block (81–82 lines × 2) src/ProteomIQon/DTO.fs:845 — src/ProteomIQon/DTO.fs:845-925 | src/ProteomIQon/DTO.fs:1323-1404 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/ProteomIQon/DTO.fs:925` calls `FieldAttribute` and `src/ProteomIQon/DTO.fs:1404` 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.
D4 · Code Duplication · Duplicated block (63–65 lines × 2) · ×1
  • Duplicated block (63–65 lines × 2) src/ConsensusSpectralLibrary/ConsensusSpectralLibrary.fs:181 — src/ConsensusSpectralLibrary/ConsensusSpectralLibrary.fs:181-243 | src/SWATHAnalysis/SWATHAnalysis.fs:109-173 — 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/ConsensusSpectralLibrary/ConsensusSpectralLibrary.fs:181` 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 (48–49 lines × 2) · ×1
  • Duplicated block (48–49 lines × 2) src/ProteinInference/ProteinInference.fs:320 — src/ProteinInference/ProteinInference.fs:320-368 | src/ProteinInference/ProteinInference.fs:442-489 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. 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 (46–48 lines × 2) · ×1
  • Duplicated block (46–48 lines × 2) src/ProteomIQon/DTO.fs:596 — src/ProteomIQon/DTO.fs:596-643 | src/ProteomIQon/DTO.fs:727-772 — 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/ProteomIQon/DTO.fs:596` 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 (30–31 lines × 2) · ×1
  • Duplicated block (30–31 lines × 2) src/PSMBasedQuantification/Program.fs:46 — src/PSMBasedQuantification/Program.fs:46-76 | src/PSMBasedQuantificationTIMs/Program.fs:51-80 — `src/PSMBasedQuantification/Program.fs` and `src/PSMBasedQuantificationTIMs/Program.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 6 separate duplicated blocks between them, totalling at least 114 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `src/PSMBasedQuantification/Program.fs:46` 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 (29–30 lines × 2) · ×1
  • Duplicated block (29–30 lines × 2) src/MzMLToMzLite/MzMLToMzLite.fs:101 — src/MzMLToMzLite/MzMLToMzLite.fs:101-129 | src/Preprocessing/Preprocessing.fs:134-163 — `src/MzMLToMzLite/MzMLToMzLite.fs` and `src/Preprocessing/Preprocessing.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 7 separate duplicated blocks between them, totalling at least 124 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
D4 · Code Duplication · Duplicated block (29 lines × 3) · ×1
  • Duplicated block (29 lines × 3) src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1816 — src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1816-1844 | src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1889-1917 | src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1991-2019 — 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/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1816` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1887` calls `quantMzHeavy` and `src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1814` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (38 lines × 2) · ×1
  • Duplicated block (38 lines × 2) src/PSMBasedQuantification/Program.fs:8 — src/PSMBasedQuantification/Program.fs:8-45 | src/PSMBasedQuantificationTIMs/Program.fs:8-45 — `src/PSMBasedQuantification/Program.fs` and `src/PSMBasedQuantificationTIMs/Program.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 6 separate duplicated blocks between them, totalling at least 114 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
D4 · Code Duplication · Duplicated block (26 lines × 2) · ×1
  • Duplicated block (26 lines × 2) src/MzMLToMzLite/CLIArgumentParsing.fs:1 — src/MzMLToMzLite/CLIArgumentParsing.fs:1-26 | src/MzMLToMzLiteIonMobility/CLIArgumentParsing.fs:1-26 — `src/MzMLToMzLite/CLIArgumentParsing.fs` and `src/MzMLToMzLiteIonMobility/CLIArgumentParsing.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 1 separate duplicated blocks between them, totalling at least 26 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
D4 · Code Duplication · Duplicated block (24 lines × 2) · ×1
  • Duplicated block (24 lines × 2) src/MzMLToMzLite/Program.fs:18 — src/MzMLToMzLite/Program.fs:18-41 | src/MzMLToMzLiteIonMobility/Program.fs:19-42 — `src/MzMLToMzLite/Program.fs` and `src/MzMLToMzLiteIonMobility/Program.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 51 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
D4 · Code Duplication · Duplicated block (23–24 lines × 2) · ×1
  • Duplicated block (23–24 lines × 2) src/PSMBasedQuantification/PSMBasedQuantification.fs:88 — src/PSMBasedQuantification/PSMBasedQuantification.fs:88-110 | src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1563-1586 — `src/PSMBasedQuantification/PSMBasedQuantification.fs` and `src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 6 separate duplicated blocks between them, totalling at least 99 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1563` 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 (23 lines × 3) · ×1
  • Duplicated block (23 lines × 3) src/MzMLToMzLite/MzMLToMzLite.fs:31 — src/MzMLToMzLite/MzMLToMzLite.fs:31-53 | src/MzMLToMzLiteIonMobility/MzMLToMzLiteIonMobility.fs:29-51 | src/Preprocessing/Preprocessing.fs:35-57 — `src/MzMLToMzLite/MzMLToMzLite.fs` and `src/MzMLToMzLiteIonMobility/MzMLToMzLiteIonMobility.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 3 separate duplicated blocks between them, totalling at least 43 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
D4 · Code Duplication · Duplicated block (23 lines × 2) · ×1
  • Duplicated block (23 lines × 2) src/MzMLToMzLite/MzMLToMzLite.fs:66 — src/MzMLToMzLite/MzMLToMzLite.fs:66-88 | src/Preprocessing/Preprocessing.fs:70-92 — `src/MzMLToMzLite/MzMLToMzLite.fs` and `src/Preprocessing/Preprocessing.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 7 separate duplicated blocks between them, totalling at least 124 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
D4 · Code Duplication · Duplicated block (21–22 lines × 3) · ×1
  • Duplicated block (21–22 lines × 3) src/MzMLToMzLite/MzMLToMzLite.fs:183 — src/MzMLToMzLite/MzMLToMzLite.fs:183-203 | src/MzliteToMzML/MzliteToMzML.fs:49-70 | src/Preprocessing/Preprocessing.fs:203-223 — `src/MzMLToMzLite/MzMLToMzLite.fs` and `src/Preprocessing/Preprocessing.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 7 separate duplicated blocks between them, totalling at least 124 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
D4 · Code Duplication · Duplicated block (20–21 lines × 3) · ×1
  • Duplicated block (20–21 lines × 3) src/ProteomIQon/PSMQuantification.fs:390 — src/ProteomIQon/PSMQuantification.fs:390-409 | src/ProteomIQon/PSMQuantification.fs:444-464 | src/ProteomIQon/PSMQuantification.fs:689-709 — 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 (21 lines × 2) · ×1
  • Duplicated block (21 lines × 2) src/PSMBasedQuantification/PSMBasedQuantification.fs:194 — src/PSMBasedQuantification/PSMBasedQuantification.fs:194-214 | src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:2106-2126 — `src/PSMBasedQuantification/PSMBasedQuantification.fs` and `src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 6 separate duplicated blocks between them, totalling at least 99 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/PSMBasedQuantification/PSMBasedQuantification.fs:215` calls `Trace` and `src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:2127` 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.
D4 · Code Duplication · Duplicated block (20 lines × 3) · ×1
  • Duplicated block (20 lines × 3) src/PSMBasedQuantification/Program.fs:70 — src/PSMBasedQuantification/Program.fs:70-89 | src/PSMBasedQuantificationTIMs/Program.fs:74-93 | src/SWATHAnalysis/Program.fs:59-78 — `src/PSMBasedQuantification/Program.fs` and `src/PSMBasedQuantificationTIMs/Program.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 6 separate duplicated blocks between them, totalling at least 114 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
D4 · Code Duplication · Duplicated block (19–20 lines × 2) · ×1
  • Duplicated block (19–20 lines × 2) src/ProteinInference/ProteinInference.fs:299 — src/ProteinInference/ProteinInference.fs:299-318 | src/ProteinInference/ProteinInference.fs:422-440 — 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 (27 lines × 2) · ×1
  • Duplicated block (27 lines × 2) src/PSMBasedQuantification/CLIArgumentParsing.fs:8 — src/PSMBasedQuantification/CLIArgumentParsing.fs:8-34 | src/PSMBasedQuantificationTIMs/CLIArgumentParsing.fs:8-34 — `src/PSMBasedQuantification/CLIArgumentParsing.fs` and `src/PSMBasedQuantificationTIMs/CLIArgumentParsing.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 3 separate duplicated blocks between them, totalling at least 45 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
D4 · Code Duplication · Duplicated block (16–17 lines × 3) · ×1
  • Duplicated block (16–17 lines × 3) src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs:519 — src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs:519-535 | src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs:469-484 | src/QuantBasedAlignment/QuantBasedAlignment.fs:339-355 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
D4 · Code Duplication · Duplicated block (15–16 lines × 2) · ×1
  • Duplicated block (15–16 lines × 2) src/PSMBasedQuantification/PSMBasedQuantification.fs:59 — src/PSMBasedQuantification/PSMBasedQuantification.fs:59-74 | src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1519-1533 — `src/PSMBasedQuantification/PSMBasedQuantification.fs` and `src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 6 separate duplicated blocks between them, totalling at least 99 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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–16 lines × 2) · ×1
  • Duplicated block (13–16 lines × 2) src/PeptideSpectrumMatchingTIMs/PeptideIndex.fs:241 — src/PeptideSpectrumMatchingTIMs/PeptideIndex.fs:241-256 | src/PeptideSpectrumMatchingTIMs/PeptideIndex.fs:273-285 — 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 (15 lines × 4) · ×1
  • Duplicated block (15 lines × 4) src/LabelEfficiencyCalculator/Program.fs:1 — src/LabelEfficiencyCalculator/Program.fs:1-15 | src/LabelFreeProteinQuantification/Program.fs:1-15 | src/LabeledProteinQuantification/Program.fs:1-15 | src/MzliteToMzML/Program.fs:1-15 — `src/LabelFreeProteinQuantification/Program.fs` and `src/LabeledProteinQuantification/Program.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 3 separate duplicated blocks between them, totalling at least 36 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
D4 · Code Duplication · Duplicated block (15 lines × 3) · ×1
  • Duplicated block (15 lines × 3) src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:2013 — src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:2013-2027 | src/ProteomIQon/PSMQuantification.fs:460-474 | src/ProteomIQon/PSMQuantification.fs:705-719 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
D4 · Code Duplication · Duplicated block (14–15 lines × 2) · ×1
  • Duplicated block (14–15 lines × 2) src/ConsensusSpectralLibrary/ConsensusSpectralLibrary.fs:401 — src/ConsensusSpectralLibrary/ConsensusSpectralLibrary.fs:401-414 | src/SpectralLibrary/SpectralLibrary.fs:245-259 — 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/ConsensusSpectralLibrary/ConsensusSpectralLibrary.fs:401` 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 × 5) · ×1
  • Duplicated block (13–14 lines × 5) src/ProteomIQon/PSMQuantification.fs:388 — src/ProteomIQon/PSMQuantification.fs:388-400 | src/ProteomIQon/PSMQuantification.fs:442-454 | src/ProteomIQon/PSMQuantification.fs:542-555 | src/ProteomIQon/PSMQuantification.fs:596-609 | src/ProteomIQon/PSMQuantification.fs:687-699 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (5–14 lines × 4) · ×1
  • Duplicated block (5–14 lines × 4) src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs:67 — src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs:67-78 | src/LabeledProteinQuantification/LabeledProteinQuantification.fs:140-144 | src/LabeledProteinQuantification/LabeledProteinQuantification.fs:147-151 | src/LabeledProteinQuantification/LabeledProteinQuantification.fs:155-168 — `src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs` and `src/LabeledProteinQuantification/LabeledProteinQuantification.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 50 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs:67` 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 × 2) · ×1
  • Duplicated block (13–14 lines × 2) src/ProteomIQon/BioFSharp.Mz_Temp.fs:27 — src/ProteomIQon/BioFSharp.Mz_Temp.fs:27-40 | src/ProteomIQon/BioFSharp.Mz_Temp.fs:48-60 — 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 (13 lines × 3) · ×1
  • Duplicated block (13 lines × 3) src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs:22 — src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs:22-34 | src/ProteomIQon/Numerics.fs:8-20 | src/QuantBasedAlignment/QuantBasedAlignment.fs:17-29 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (12–13 lines × 2) · ×1
  • Duplicated block (12–13 lines × 2) src/PSMStatistics/PSMStatistics.fs:847 — src/PSMStatistics/PSMStatistics.fs:847-858 | src/PSMStatistics/PSMStatistics.fs:911-923 — 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 (11 lines × 2) · ×1
  • Duplicated block (11 lines × 2) src/MzMLToMzLite/MzMLToMzLite.fs:153 — src/MzMLToMzLite/MzMLToMzLite.fs:153-163 | src/Preprocessing/Preprocessing.fs:179-189 — `src/MzMLToMzLite/MzMLToMzLite.fs` and `src/Preprocessing/Preprocessing.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 7 separate duplicated blocks between them, totalling at least 124 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
D4 · Code Duplication · Duplicated block (4–11 lines × 4) · ×1
  • Duplicated block (4–11 lines × 4) src/AlignmentBasedQuantification/CLIArgumentParsing.fs:12 — src/AlignmentBasedQuantification/CLIArgumentParsing.fs:12-15 | src/PSMBasedQuantification/CLIArgumentParsing.fs:1-11 | src/PSMBasedQuantificationTIMs/CLIArgumentParsing.fs:1-11 | src/SWATHAnalysis/CLIArgumentParsing.fs:12-15 — `src/PSMBasedQuantification/CLIArgumentParsing.fs` and `src/PSMBasedQuantificationTIMs/CLIArgumentParsing.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 3 separate duplicated blocks between them, totalling at least 45 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/AlignmentBasedQuantification/CLIArgumentParsing.fs:9` calls `AltCommandLine` and `src/SWATHAnalysis/CLIArgumentParsing.fs:9` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (9–10 lines × 2) · ×1
  • Duplicated block (9–10 lines × 2) src/ProteomIQon/DTO.fs:1634 — src/ProteomIQon/DTO.fs:1634-1642 | src/ProteomIQon/Domain.fs:602-611 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `src/ProteomIQon/DTO.fs:1634` 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 (9 lines × 2) · ×1
  • Duplicated block (9 lines × 2) src/PSMStatistics/PSMStatistics.fs:699 — src/PSMStatistics/PSMStatistics.fs:699-707 | src/PSMStatistics/PSMStatistics.fs:736-744 — 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 lines × 3) · ×1
  • Duplicated block (8 lines × 3) src/PSMBasedQuantification/PSMBasedQuantification.fs:66 — src/PSMBasedQuantification/PSMBasedQuantification.fs:66-73 | src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1526-1533 | src/PSMStatistics/PSMStatistics.fs:455-462 — `src/PSMBasedQuantification/PSMBasedQuantification.fs` and `src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 6 separate duplicated blocks between them, totalling at least 99 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/PSMStatistics/PSMStatistics.fs:464` calls `Trace` and `src/PSMBasedQuantification/PSMBasedQuantification.fs:75` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (4–8 lines × 6) · ×1
  • Duplicated block (4–8 lines × 6) src/AlignmentBasedQuantification/Program.fs:28 — src/AlignmentBasedQuantification/Program.fs:28-31 | src/ConsensusSpectralLibrary/Program.fs:17-20 | src/MzliteToMzML/Program.fs:17-24 | src/Preprocessing/Program.fs:16-23 | src/SWATHAnalysis/Program.fs:18-21 | src/SpectralLibrary/Program.fs:18-21 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 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 6 times. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (19 lines × 2) · ×1
  • Duplicated block (19 lines × 2) src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1776 — src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1776-1794 | src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1965-1983 — 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 (7 lines × 3) · ×1
  • Duplicated block (7 lines × 3) src/MzMLToMzLite/MzMLToMzLite.fs:66 — src/MzMLToMzLite/MzMLToMzLite.fs:66-72 | src/MzMLToMzLiteIonMobility/MzMLToMzLiteIonMobility.fs:61-67 | src/Preprocessing/Preprocessing.fs:70-76 — `src/MzMLToMzLite/MzMLToMzLite.fs` and `src/MzMLToMzLiteIonMobility/MzMLToMzLiteIonMobility.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 3 separate duplicated blocks between them, totalling at least 43 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
D4 · Code Duplication · Duplicated block (25 lines × 2) · ×1
  • Duplicated block (25 lines × 2) src/ProteomIQon/PSMQuantification.fs:310 — src/ProteomIQon/PSMQuantification.fs:310-334 | src/ProteomIQon/PSMQuantification.fs:657-681 — 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 × 7) · ×1
  • Duplicated block (6 lines × 7) ConsoleTemplate/template/Program.fs:10 — ConsoleTemplate/template/Program.fs:10-16 | src/AddDeducedPeptides/Program.fs:10-16 | src/JoinQuantPepIonsWithProteins/Program.fs:10-15 | src/LabelEfficiencyCalculator/Program.fs:9-15 | src/LabelFreeProteinQuantification/Program.fs:9-15 | src/LabeledProteinQuantification/Program.fs:9-15 | src/MzliteToMzML/Program.fs:9-15 — before extracting anything, compare `ConsoleTemplate/template/Program.fs` and `src/LabelEfficiencyCalculator/Program.fs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (6 lines × 6) · ×1
  • Duplicated block (6 lines × 6) ConsoleTemplate/template/Program.fs:18 — ConsoleTemplate/template/Program.fs:18-23 | src/LabelEfficiencyCalculator/Program.fs:17-22 | src/MzMLToMzLite/Program.fs:17-22 | src/MzMLToMzLiteIonMobility/Program.fs:18-23 | src/PeptideSpectrumMatching/Program.fs:18-23 | src/PeptideSpectrumMatchingTIMs/Program.fs:18-23 — before extracting anything, compare `ConsoleTemplate/template/Program.fs` and `src/LabelEfficiencyCalculator/Program.fs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (5 lines × 3) · ×1
  • Duplicated block (5 lines × 3) src/LabeledProteinQuantification/LabeledProteinQuantification.fs:33 — src/LabeledProteinQuantification/LabeledProteinQuantification.fs:33-37 | src/LabeledProteinQuantification/LabeledProteinQuantification.fs:83-87 | src/LabeledProteinQuantification/LabeledProteinQuantification.fs:123-127 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/LabeledProteinQuantification/LabeledProteinQuantification.fs:29` calls `zip` and `src/LabeledProteinQuantification/LabeledProteinQuantification.fs:78` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (2–5 lines × 4) · ×1
  • Duplicated block (2–5 lines × 4) src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs:60 — src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs:60-64 | src/LabeledProteinQuantification/LabeledProteinQuantification.fs:134-138 | src/LabeledProteinQuantification/LabeledProteinQuantification.fs:145-146 | src/LabeledProteinQuantification/LabeledProteinQuantification.fs:152-153 — `src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs` and `src/LabeledProteinQuantification/LabeledProteinQuantification.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 50 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs:64` calls `aggregate` and `src/LabeledProteinQuantification/LabeledProteinQuantification.fs:146` 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.
D4 · Code Duplication · Duplicated block (4–5 lines × 3) · ×1
  • Duplicated block (4–5 lines × 3) src/LabeledProteinQuantification/LabeledProteinQuantification.fs:54 — src/LabeledProteinQuantification/LabeledProteinQuantification.fs:54-57 | src/LabeledProteinQuantification/LabeledProteinQuantification.fs:92-96 | src/LabeledProteinQuantification/LabeledProteinQuantification.fs:132-137 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (8 lines × 4) · ×1
  • Duplicated block (8 lines × 4) src/JoinQuantPepIonsWithProteins/Program.fs:43 — src/JoinQuantPepIonsWithProteins/Program.fs:43-50 | src/PSMBasedQuantification/Program.fs:73-80 | src/PSMBasedQuantificationTIMs/Program.fs:77-84 | src/SWATHAnalysis/Program.fs:62-69 — `src/PSMBasedQuantification/Program.fs` and `src/PSMBasedQuantificationTIMs/Program.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 6 separate duplicated blocks between them, totalling at least 114 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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.
D44 · Platform End-of-Life · End-of-life runtime · ×1
  • End-of-life runtime: .NET net5.0 ConsoleTemplate/template/ProteomIQonConsole.fsproj:4 — ConsoleTemplate/template/ProteomIQonConsole.fsproj declares .NET net5.0 as this project's target framework, and .NET 5, support ended 2022-05-10. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2022-05-10 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended.
SC1 · Supply-chain hygiene · NuGet dependencies are not locked · ×1
  • NuGet dependencies are not locked — No packages.lock.json and no central package management — restores aren't reproducible or pinned (SSDF PW.4.4). Enable <RestorePackagesWithLockFile>true</RestorePackagesWithLockFile> (commit the lockfile) or adopt Directory.Packages.props. Advisory — never scored.
Minor — 24 finding(s)
X23 · Unguarded diagnostic materialisation · Diagnostic log message is built whether or not it is wanted · ×8
  • Diagnostic log message is built whether or not it is wanted src/ProteomIQon/pepValueCalculation.fs:99 — `Trace` at line 99 is called with an argument built by `Array.map (fun x -> string x)` (line 101), whose cost grows with the collection it walks. F# evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because Trace is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `IsEnabled` test, no debug flag, no `#if DEBUG` region, no `fun` or `lazy` the logger runs only when the level is on.
  • Diagnostic log message is built whether or not it is wanted src/ProteomIQon/pepValueCalculation.fs:105 — `Trace` at line 105 is called with an argument built by `Array.map (fun x -> string x)` (line 107), whose cost grows with the collection it walks. F# evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because Trace is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `IsEnabled` test, no debug flag, no `#if DEBUG` region, no `fun` or `lazy` the logger runs only when the level is on.
  • Diagnostic log message is built whether or not it is wanted src/ProteomIQon/pepValueCalculation.fs:111 — `Trace` at line 111 is called with an argument built by `Array.map (fun x -> string x)` (line 113), whose cost grows with the collection it walks. F# evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because Trace is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `IsEnabled` test, no debug flag, no `#if DEBUG` region, no `fun` or `lazy` the logger runs only when the level is on.
  • Diagnostic log message is built whether or not it is wanted src/ProteomIQon/pepValue/pepValueCalculation.fs:93 — `Trace` at line 93 is called with an argument built by `Array.map (fun x -> string x)` (line 95), whose cost grows with the collection it walks. F# evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because Trace is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `IsEnabled` test, no debug flag, no `#if DEBUG` region, no `fun` or `lazy` the logger runs only when the level is on.
  • Diagnostic log message is built whether or not it is wanted src/ProteomIQon/pepValue/pepValueCalculation.fs:99 — `Trace` at line 99 is called with an argument built by `Array.map (fun x -> string x)` (line 101), whose cost grows with the collection it walks. F# evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because Trace is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `IsEnabled` test, no debug flag, no `#if DEBUG` region, no `fun` or `lazy` the logger runs only when the level is on.
  • Diagnostic log message is built whether or not it is wanted src/ProteomIQon/pepValue/pepValueCalculation.fs:105 — `Trace` at line 105 is called with an argument built by `Array.map (fun x -> string x)` (line 107), whose cost grows with the collection it walks. F# evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because Trace is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `IsEnabled` test, no debug flag, no `#if DEBUG` region, no `fun` or `lazy` the logger runs only when the level is on.
  • Diagnostic log message is built whether or not it is wanted src/PSMStatistics/PSMStatistics.fs:653 — `Trace` at line 653 is called with an argument built by `Array.distinctBy (fun x -> x.ScanNr) |> Array.length` (line 653), whose cost grows with the collection it walks. F# evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because Trace is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `IsEnabled` test, no debug flag, no `#if DEBUG` region, no `fun` or `lazy` the logger runs only when the level is on.
  • Diagnostic log message is built whether or not it is wanted src/PSMStatistics/PSMStatistics.fs:811 — `Trace` at line 811 is called with an argument built by `Array.filter (fun x -> x.Label && getQ (score x) <= 0.01) |> Array.length` (line 811), whose cost grows with the collection it walks. F# evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because Trace is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `IsEnabled` test, no debug flag, no `#if DEBUG` region, no `fun` or `lazy` the logger runs only when the level is on.
D34 · Knowledge Freshness · Orphaned file · ×5
  • Orphaned file src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.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 testsOld/ProteomIQon.Testslegacy/Generators.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/JoinQuantPepIonsWithProteins/JoinQuantPepIonsWithProteins.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/PSMBasedQuantification/CLIArgumentParsing.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/JoinQuantPepIonsWithProteins/Program.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.
X10 · Duplicated predicate · Duplicated predicate · ×2
  • Duplicated predicate src/ProteomIQon/pepValue/pepValueCalculation.fs:250 — `init || ((step > stepEpsilon || step < 0.) && iter < 20)` appears character-identically in 2 files — src/ProteomIQon/pepValue/pepValueCalculation.fs, src/ProteomIQon/pepValueCalculation.fs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate src/ConsensusSpectralLibrary/ConsensusSpectralLibrary.fs:233 — `p1d.Mz > mzRange.HighValue || p1d.Mz < mzRange.LowValue` appears character-identically in 2 files — src/ConsensusSpectralLibrary/ConsensusSpectralLibrary.fs, src/SWATHAnalysis/SWATHAnalysis.fs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
D16 · Bus Factor · Off-boarding risk · ×1
  • Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 29 significant file(s) lose their only recent owner: src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs, src/ProteomIQon/DTO.fs, src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs, src/PSMStatistics/PSMStatistics.fs, src/PeptideSpectrumMatchingTIMs/PeptideSpectrumMatchingTIMs.fs, src/ProteomIQon/BioFSharp.Mz_Temp.fs, src/QuantBasedAlignment/QuantBasedAlignment.fs, src/PeptideSpectrumMatchingTIMs/SpectrumSearch.fs (+21 more). Pair on, review, or document these before any departure.
D20 · ADR Quality · No ADRs found · ×1
  • No ADRs found ConsoleTemplate/template/ProteomIQonConsole.fsproj:10 — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`. ADRs are expected here because `ConsoleTemplate/template/ProteomIQonConsole.fsproj` makes this repository a deployable product (line 10).
D26 · Project Cohesion · Projects may be oversized for their cohesion · ×1
  • Projects may be oversized for their cohesion — 1 of 29 project(s) overshoot their size bounds, lowering Project Cohesion to 9.4/10. The most over is `src/ProteomIQon` (6718 LoC, 214 module-visible types across 1 directories). Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
D34 · Knowledge Freshness · Orphaned files with no living knowledge · ×1
  • Orphaned files with no living knowledge — 5 of 71 analysed file(s) have no living knowledge left — their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 71 of the 107 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each — most significant first: src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs, testsOld/ProteomIQon.Testslegacy/Generators.fs, src/JoinQuantPepIonsWithProteins/JoinQuantPepIonsWithProteins.fs, src/PSMBasedQuantification/CLIArgumentParsing.fs, src/JoinQuantPepIonsWithProteins/Program.fs. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway.
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.
P2 · Observability · Logging is not universal · ×1
  • Logging is not universal — Only 27/28 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `src/RatioLFQ`.
P3 · Security & performance tooling · No SAST · ×1
  • No SAST REDACTED:6 — 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 ConsoleTemplate/template/ProteomIQonConsole.fsproj:39 — `ConsoleTemplate/template/ProteomIQonConsole.fsproj` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`.

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-82d11f8393c240369d3695dd6ebc0093/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-82d11f8393c240369d3695dd6ebc0093/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 .7artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiesdotnet—dotnet list ProteomIQon.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 Dependenciesosv-scanner—osv-scanner --format json --recursive --experimental-disable-plugins transitivedependency/requirements --experimental-disable-plugins dotnet/csproj --experimental-disable-plugins dotnet/nugetcpm . /tmp/codehealth-osv-sbom-85cd0f690c5541ee90c0881f939108b60artifacts/raw/osv-scanner.json

Run 01a1df37-99f2-710f-8969-baecc3546dbc · 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