{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"DM12","name":"Ambient inputs in the domain","shortDescription":{"text":"Ambient inputs in the domain"},"helpUri":"https://codehealth.canine.dev/dimensions/DM12"},{"id":"DM6","name":"Domain \u2194 infrastructure boundary","shortDescription":{"text":"Domain \u2194 infrastructure boundary"},"helpUri":"https://codehealth.canine.dev/dimensions/DM6"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"AlignmentBasedQuantification.quantifyPeptides (cyclomatic 174): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6583914a4b4f14d0b3a1e97ac444e77b2e3eb86e2ac6232ec9a04361156f7e4"}},{"ruleId":"D1","level":"warning","message":{"text":"AlignmentBasedQuantStatistics.scoreRuns (cyclomatic 57): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fd134028bfdcccf5fbfb3cf63415e45d9568f41d4d4282fbf97fb82ed1808b"}},{"ruleId":"D1","level":"warning","message":{"text":"PepValueCalculation.initCalculatePEPValueIRLS (cyclomatic 49): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/pepValueCalculation.fs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca47da780bae4bd795dead803484d5e4af5d638bd84af854bd5c81d95cfbb8a1"}},{"ruleId":"D1","level":"warning","message":{"text":"Wavelet.identifyPeaksBy (cyclomatic 49): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/BioFSharp.Mz_Temp.fs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"18dde991385c56ff1ebdfa884814d9af8a9d6f3258864946bc8d6da690710550"}},{"ruleId":"D1","level":"warning","message":{"text":"PSMBasedQuantificationTIMs.quantifyPeptides (cyclomatic 43): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea995eba2f06fe9897aa1e32cdc465e845cc83e6100160ed3d9e7eb8ed378f3"}},{"ruleId":"D1","level":"warning","message":{"text":"BaselineAls.baselineAls (cyclomatic 42): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/BaselineAls.fs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd0cd24ac33bc56e12b38cf4e075b5bf0dd0cac930225d4fb743f1e3139ae2e"}},{"ruleId":"D1","level":"warning","message":{"text":"PSMQuantification.quantifyLabeled (cyclomatic 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/PSMQuantification.fs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb15b9bc81f0c9b09d989a5d43a1a57a7e6a12a5375bc73ecdb89a1f899e78dc"}},{"ruleId":"D1","level":"warning","message":{"text":"Normal.Solve (cyclomatic 30): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/MzCalibration.fs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2c5fecc255723c134c349e5c37d954f4490bf974723e048c3625164e6e8006"}},{"ruleId":"D1","level":"warning","message":{"text":"console1.main (cyclomatic 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AlignmentBasedQuantification/Program.fs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1744d85c5387cb0ea0586557b2946402116fd6888d36c22f191c49b48c8212e"}},{"ruleId":"D1","level":"warning","message":{"text":"MsFraggerToPSM.findSpectrum (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/MsFraggerToPSM/MsFraggerToPSM.fs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"5195174ba9d37c691feed600ef07fd979897a08cee6df11d825f5a853329aa4f"}},{"ruleId":"D1","level":"warning","message":{"text":"PeptideSpectrumMatchingTIMs.validateParameters (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PeptideSpectrumMatchingTIMs/PeptideSpectrumMatchingTIMs.fs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d7b731e7bd1f613c239df6d0cbde1a867f0ba68fa8b7f32ccf3dfd96be0535"}},{"ruleId":"D1","level":"warning","message":{"text":"MzTABSections.peptideSection (cyclomatic 19): 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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/MzTAB/MzTABSections.fs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"434f3b0d167f2f3029dc1b1d4423edd47c8b652b676c176d0d7ab10f75f89cfe"}},{"ruleId":"D1","level":"warning","message":{"text":"Wavelet.transformFast (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/BioFSharp.Mz_Temp.fs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b9be166f5aa812855787cfb4a843ad2b82cd2b7c608a7f8e81d82297bb04fb"}},{"ruleId":"D1","level":"warning","message":{"text":"console1.main (cyclomatic 18): 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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PeptideSpectrumMatchingTIMs/Program.fs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"08556a8210f86ecb2f17b5f20676d625d99bed156586e4089c217199c0ab4f3e"}},{"ruleId":"D1","level":"warning","message":{"text":"TableSort.filterFrame (cyclomatic 17): 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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/TableSort/TableSort.fs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"427e0142028b571dfefa8991f0116f842de45424ae1996ea9674ba4f2b84a470"}},{"ruleId":"D1","level":"warning","message":{"text":"MzCalibration.crossValidate (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/MzCalibration.fs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac11d2d7a6267b81a8dd7916d58a44743104a8f24ca943c832cb28906da81ea4"}},{"ruleId":"D1","level":"warning","message":{"text":"PeptideSpectrumMatchingTIMs.searchSliceWith (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PeptideSpectrumMatchingTIMs/PeptideSpectrumMatchingTIMs.fs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98f44a53da2638c1dd3fb9f1b9e916b175c7a5961b43ab9b9715479d2ca315c"}},{"ruleId":"D1","level":"warning","message":{"text":"AlignmentBasedQuantStatistics.readRun (cyclomatic 16): 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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b385465d7491fb7342d1fc3d2a92cf181000f2e13e5f24fc7ec2fc7a6f6bf4"}},{"ruleId":"D1","level":"warning","message":{"text":"SwathAnalysis.quantifyFragments (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/SWATHAnalysis/SWATHAnalysis.fs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"6317145cd8f2f4a00bf7f30b4d0699199ed46be62330d5b6dbf623c6a590a775"}},{"ruleId":"D2","level":"warning","message":{"text":"AlignmentBasedQuantification.quantifyPeptides (cognitive 290): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4adb2abbeddd19a83e49f3ea5a6a685ba4dae999ef2e74221f346f5b5a5d4e"}},{"ruleId":"D2","level":"warning","message":{"text":"PSMQuantification.quantifyLabeled (cognitive 145): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/PSMQuantification.fs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"121b41cd5cac9c4d68e33e4164bcff3ef08e87e59b39289fae9a3bf9e0892d5e"}},{"ruleId":"D2","level":"warning","message":{"text":"BaselineAls.baselineAls (cognitive 109): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/BaselineAls.fs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"100e33ad4942b38193e887fc0ba5c83d0e526d3a4d1297addef9017666c5c3de"}},{"ruleId":"D2","level":"warning","message":{"text":"Normal.Solve (cognitive 97): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/MzCalibration.fs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cbafa921dfb4e473e9489e68cc61796850b18da456128437f4dcc66dbc1f21"}},{"ruleId":"D2","level":"warning","message":{"text":"AlignmentBasedQuantStatistics.scoreRuns (cognitive 90): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00773a57a4fb9e299fb4d73d67df71fc76b42d68590ae274f26094dbdf45510"}},{"ruleId":"D2","level":"warning","message":{"text":"PepValueCalculation.initCalculatePEPValueIRLS (cognitive 79): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/pepValueCalculation.fs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"209426d3e79004abd799d378f16de8b3d986f4f12e59e3168b3b2ee8815a38c5"}},{"ruleId":"D2","level":"warning","message":{"text":"PSMBasedQuantificationTIMs.quantifyPeptides (cognitive 74): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"28dc1eb1a676ef419b228f3dfe3fb10b1aa1b519340ebe42c58187b2e28d75d8"}},{"ruleId":"D2","level":"warning","message":{"text":"Wavelet.identifyPeaksBy (cognitive 65): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/BioFSharp.Mz_Temp.fs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"0558725e1eca32a0f4f0ab05919140fff260107730b670efe3f80c28fced4a15"}},{"ruleId":"D2","level":"warning","message":{"text":"PSMBasedQuantificationTIMs.tryFitGaussian2D (cognitive 44): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05b1048571e3e7819d83527eab4d2b7e61e16f64e99824fe5654e8f132ca1e9"}},{"ruleId":"D2","level":"warning","message":{"text":"RobustShift.outOfFold (cognitive 41): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/QuantBasedAlignment/QuantBasedAlignment.fs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88f730dbd6e7f762ed75e3d64a5e0935d1e71321a25b8b668e882a9e81d7768"}},{"ruleId":"D2","level":"warning","message":{"text":"console1.main (cognitive 37): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AlignmentBasedQuantification/Program.fs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7842043679b48d4115eb9b73a4e4ac2491dbe0aef0e06ae969cf48910611d47"}},{"ruleId":"D2","level":"warning","message":{"text":"MsFraggerToPSM.findSpectrum (cognitive 36): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/MsFraggerToPSM/MsFraggerToPSM.fs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"90346550ec413a65dffed96fa4e52350cf0558b18925ace42675a619318946a4"}},{"ruleId":"D2","level":"warning","message":{"text":"PSMBasedQuantificationTIMs.correctBaselineAlongRt (cognitive 36): 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 \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e32d004859000f9493916d14483176f30990e56668afc366970a10c304d20d"}},{"ruleId":"D2","level":"warning","message":{"text":"Xic.closestPoint (cognitive 34): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/Xic.fs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9fc8364c7a434964b22d078fe55674951abd43f55173788a35c6c198fcda7c7"}},{"ruleId":"D2","level":"warning","message":{"text":"Wavelet.transformFast (cognitive 34): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/BioFSharp.Mz_Temp.fs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f71ecb687288767f1363463709fb4406d7d5ae384e972bbb1c889cd8b88275"}},{"ruleId":"D2","level":"warning","message":{"text":"SpectrumSearch.collect (cognitive 33): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PeptideSpectrumMatchingTIMs/SpectrumSearch.fs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0474a38990c8e4d173a66ad3797a4bb1530223e3f13e54a8ebeadb50ab75c8"}},{"ruleId":"D2","level":"warning","message":{"text":"SwathAnalysis.quantifyFragments (cognitive 33): 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 \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/SWATHAnalysis/SWATHAnalysis.fs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cef85a0eea93e0f3cef06d7e69c272982a3eeab3473e3b4b5d7dd5960897e17"}},{"ruleId":"D2","level":"warning","message":{"text":"PSMQuantification.quantifyLabelFree (cognitive 32): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/PSMQuantification.fs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"040e253f063c11bae15424cfd34b168505b3e4900f77473e445337a087d9c709"}},{"ruleId":"D2","level":"warning","message":{"text":"Xic.centrePoints (cognitive 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/Xic.fs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a758febaa5f9a49c59a187ecc811b52039423f5fc9b70553af5e414745d6a46"}},{"ruleId":"D2","level":"warning","message":{"text":"PeakSelection.fitLogistic (cognitive 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e40e49e48e0f971f47d26327ed8e5a8344ee31e462c794879bfdb040d2a9af"}},{"ruleId":"D2","level":"warning","message":{"text":"MzCalibration.crossValidate (cognitive 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/MzCalibration.fs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"51dfeea064ca7df4eed6978520a1c1a946902e8d0e4e2fdf599d58fd18964a0b"}},{"ruleId":"D2","level":"warning","message":{"text":"SpectrumSearch.expectationModelOfHistogram (cognitive 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PeptideSpectrumMatchingTIMs/SpectrumSearch.fs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"9378f8282388ea1a0475e6ccba09a024eac4cabce6ac0e71ee5642bc4776f1d7"}},{"ruleId":"D2","level":"warning","message":{"text":"AlignmentFeatures.xicCompetition (cognitive 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"5859aa29f2cf348b1471c8ca4f1c053cad5915e893b746a727e3ed2eea4ae31b"}},{"ruleId":"D2","level":"warning","message":{"text":"PeptideSpectrumMatchingTIMs.searchSliceWith (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PeptideSpectrumMatchingTIMs/PeptideSpectrumMatchingTIMs.fs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b3b071e59ac31682df73eaab685f09f560c05c5afdbad9bf72071f951de448"}},{"ruleId":"D2","level":"warning","message":{"text":"PeptideSpectrumMatchingTIMs.finishRunWith (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PeptideSpectrumMatchingTIMs/PeptideSpectrumMatchingTIMs.fs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0036d21838f013eeba46364a603bc234fe320898d604fbdc07485dd59f5c52"}},{"ruleId":"D2","level":"warning","message":{"text":"PeptideIndex.sliceBoundariesFor (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PeptideSpectrumMatchingTIMs/PeptideIndex.fs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7755c68247f14e412abf999cef6c73257a91c9ece09eddcfeebf3d57341d02"}},{"ruleId":"D2","level":"warning","message":{"text":"PeakSelection.createCandidates (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6dfc44d7c1fa1b6b4314c96d9c37c4a7d89d767528b0b7f6a3bd902c4440140"}},{"ruleId":"D2","level":"warning","message":{"text":"Xic.extractPointWith (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/Xic.fs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb20fe58dfd62bee093e604c780ea813abc2ed38e3fc40327aef17a844004ed1"}},{"ruleId":"D2","level":"warning","message":{"text":"PeptideSpectrumMatchingTIMs.scoreRunsWithPeakReader (cognitive 22): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PeptideSpectrumMatchingTIMs/PeptideSpectrumMatchingTIMs.fs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c66014c57d600f9b1a2af944792b0b24b569dfad02a14cd3df8843d19f6656"}},{"ruleId":"D2","level":"warning","message":{"text":"SpectrumSearch.scatter (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PeptideSpectrumMatchingTIMs/SpectrumSearch.fs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf8876a17605e632c0d8fc727d515d66bb950b5fbd1e0bc3987450fb082f26f"}},{"ruleId":"D2","level":"warning","message":{"text":"PeptideIndex.loadPeptideTable (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PeptideSpectrumMatchingTIMs/PeptideIndex.fs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b99a902a1e6411b12c387f27f840e518d62fac25489853b35c418558c54faa"}},{"ruleId":"D2","level":"warning","message":{"text":"AlignmentFeatures.isotopeFeatures (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"69de18836114d53e5f8da3f2b4e7233dfd2c8fdca17e0e40d2321cc58aeb2297"}},{"ruleId":"D2","level":"warning","message":{"text":"MzTABSections.peptideSection (cognitive 22): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/MzTAB/MzTABSections.fs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"965298931812e7be8053aae0af8e72d84411aea3e10bc9e17853b5b59b8f7a28"}},{"ruleId":"D2","level":"warning","message":{"text":"TableSort.filterFrame (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/TableSort/TableSort.fs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba81edb47074bbf2dadbc90a493394748f2ec22b1aaffc750c88bfe6e8eb5506"}},{"ruleId":"D2","level":"warning","message":{"text":"MzCalibration.compareObservations (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/MzCalibration.fs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a92f7e6562aac5fa9023b3c91423519aed9980d376ffac82c55b37581b04259"}},{"ruleId":"D2","level":"warning","message":{"text":"PeptideIndex.buildFragmentIndexWith (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PeptideSpectrumMatchingTIMs/PeptideIndex.fs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"73459f5d2a5238a48ea365dfa73b11d8ce4c363072a895fa9fba1072df052a55"}},{"ruleId":"D2","level":"warning","message":{"text":"XicSweep.sweep (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"99febfcdf81ee11818443854001aeb20f2a67f19b79a4d41c0bcc26709aea8ed"}},{"ruleId":"D2","level":"warning","message":{"text":"PeakShape.emgModeOffset (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/PeakShape.fs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2098f2f3d415e8722dd65bbf09a6ce5e6a91134c2c2de43b2a6ef99baa0d20"}},{"ruleId":"D2","level":"warning","message":{"text":"Wavelet.bestSubsetFast (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/BioFSharp.Mz_Temp.fs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b735a59325e241ce46bb27dcd897f511204d7dfd21e4bb20da089b3f0bf4afb"}},{"ruleId":"D2","level":"warning","message":{"text":"console1.main (cognitive 19): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMBasedQuantificationTIMs/Program.fs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b76a464a86d02a6616324df277682bad48f9a8080539f819307d4bc62f241a"}},{"ruleId":"D2","level":"warning","message":{"text":"AlignmentScoring.fitPlatt (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29f2ef310b379860e84b41f2ddcf019207693a70d2593ee2ba72ee63b1e5d5f"}},{"ruleId":"D2","level":"warning","message":{"text":"IsotopePatterns.store (cognitive 18): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/IsotopePatterns.fs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd72d444e291cb86076c0af97e155c40e522d964c30c6cab0503601e125f617"}},{"ruleId":"D2","level":"warning","message":{"text":"SeqIO\u0027.stringFunction (cognitive 18): SeqIO\u0027.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 \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/BioFSharp.Mz_Temp.fs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3340182def7a69d286eb788b9de6311d2a2f79098f1ef1bcfe4fbda32f841572"}},{"ruleId":"D2","level":"warning","message":{"text":"QuantBasedAlignment.alignPair (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/QuantBasedAlignment/QuantBasedAlignment.fs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebdd504ef5c68b526681f080cae2012ce8db614a52f3d99d8ab9b3c614f05536"}},{"ruleId":"D2","level":"warning","message":{"text":"PeakSelection.fwhm (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5335fdbfc4b9475ccc6c7536d18e00eacdfb5a6e74563a179c41941b209c46"}},{"ruleId":"D2","level":"warning","message":{"text":"AlignmentBasedQuantStatistics.readRun (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf03a0a010f27a338fed795cba8d0f162b593219b5887d6c15ad44c5a35c483"}},{"ruleId":"D2","level":"warning","message":{"text":"console1.main (cognitive 17): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/SWATHAnalysis/Program.fs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85f8f8a34965c46dceacf57bcc61171d9d50c753b3e600ebf1085d9ca7c011e"}},{"ruleId":"D2","level":"warning","message":{"text":"PSMQuantification.qualityFilter (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/PSMQuantification.fs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"755910a311b7fd3c8a52221865fa465dd75c8d0700bbcad1b0668ff40d674d98"}},{"ruleId":"D2","level":"warning","message":{"text":"QuantBasedAlignment.apexOrDropReason (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/QuantBasedAlignment/QuantBasedAlignment.fs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"3debc0b63f660e543a2d4563fbbd48dbed738addc95292c194db9f3a234e6914"}},{"ruleId":"D2","level":"warning","message":{"text":"PSMBasedQuantificationTIMs.tryWeightedMeanOrMean (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"19575d3f52f74c3380d8497414abe08685f27fe8c796726922ce373df8dc1e6c"}},{"ruleId":"D2","level":"warning","message":{"text":"PSMBasedQuantificationTIMs.tryFindHighestGaborPositionNearExpectedPosition (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d36574ec838ee95b53cdf26c5abbcbeb90fa911f62f9dc1432980bd7d3da77e"}},{"ruleId":"D2","level":"warning","message":{"text":"console1.main (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AlignmentBasedQuantStatistics/Program.fs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b7e811ac69690644443672cce66e0c919c5d42c33735ae7f745ed1232904fb4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs: FileTooLong \u2014 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\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd567b194c35f7509081fa52ca6830c38609450255878fe25ca390410fb83e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ProteomIQon/DTO.fs: FileTooLong \u2014 1371 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 871 over it, 2.74\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/DTO.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf099e1ad38b6b0408ebfc6a3a43ea60e06e5e8847773d5790e699250b713bb0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: AlignmentBasedQuantification/AlignmentBasedQuantification.fs: FileTooLong \u2014 1214 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 714 over it, 2.43\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e462c0c587e32298c5a98a8ac0e74ef612bb50e59e9d68f2c590ca1a36246b22"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: MzTAB/MzTABSections.fs: FileTooLong \u2014 1046 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 546 over it, 2.09\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/MzTAB/MzTABSections.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db00176469ec941e85f7926f11a6d8e1227d2fb7ee9dfeea732f30f15afbd153"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs: FileTooLong \u2014 939 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 439 over it, 1.88\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dbc3c1c502842fc55c8e01f13217cf326ea8c5a2ed356c20b515f49a7faf600"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: PSMStatistics/PSMStatistics.fs: FileTooLong \u2014 783 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 283 over it, 1.57\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMStatistics/PSMStatistics.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d74f29a254915cea063c6115fb8269856cc2e3f58a2a5f2324c42bdb9fa510ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ProteomIQon/PSMQuantification.fs: FileTooLong \u2014 640 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 140 over it, 1.28\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/PSMQuantification.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3384d973fea29d92b99cb5a4f20c389d6982045f8957da1e04db00ac55a84d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: PeptideSpectrumMatchingTIMs/PeptideSpectrumMatchingTIMs.fs: FileTooLong \u2014 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\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PeptideSpectrumMatchingTIMs/PeptideSpectrumMatchingTIMs.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e756f13a213d91d6d82492481fa8de1e1946ac06b0898017e029212bde778078"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ProteomIQon/BioFSharp.Mz_Temp.fs: FileTooLong \u2014 612 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 112 over it, 1.22\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/BioFSharp.Mz_Temp.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc7df300b5d4b0f8dfb879e88230a3fb43819cf4f0be8e0cd55f2b9c6d4a5a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (115 shared lines): src/MzMLToMzLite/MzMLToMzLite.fs:1-230 | src/Preprocessing/Preprocessing.fs:1-245 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/MzMLToMzLite/MzMLToMzLite.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"486478668efe8fdbdaf8a387f2fde238c74da101502a0db88f8852a71e2fd72d"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (48 shared lines): src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs:1-187 | src/LabeledProteinQuantification/LabeledProteinQuantification.fs:1-295 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08830397ef10bededbe3e3262ecd62284816ff6b01913482db634edea3d5dd12"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): 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 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ConsoleTemplate/template/Program.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"848c2b24b21f37f07e09d85dc779fcb0973fb6f0f29d8e6baaca6469504575f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): 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 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AlignmentBasedQuantification/CLIArgumentParsing.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d35ed6f024e247f9d06aa8c89f116139ecfa520dbe3757bad0312c84a89da48"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): 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 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ConsoleTemplate/template/Program.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f706b52ba4fbb1a4cb6d19af59dbc018ea917965f9f01f5efc070eef2171cbf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): 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 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AlignmentBasedQuantification/Program.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65633794f176a9ff65dafdf313c185c3cc7c4094e95d4b88c61c41a5750733f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): 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 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ConsensusSpectralLibrary/Program.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40b199d0d58380df46da2f819974fd63a9c238346b90dc7be1b5f3fb9234d1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): 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 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMBasedQuantification/Program.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4047a8442f8a7d42466be33df42c03dc787248a41a5ca36b4ed8fd3ad0cd972"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/JoinQuantPepIonsWithProteins/Program.fs:1-56 | src/PSMBasedQuantification/Program.fs:1-95 | src/PSMBasedQuantificationTIMs/Program.fs:1-99 | src/SWATHAnalysis/Program.fs:1-87 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/JoinQuantPepIonsWithProteins/Program.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa64a9a61c2ba008929aa27bf69b5644454926c68f38d30108170903e15d1cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/MzMLToMzLite/Program.fs:1-62 | src/MzMLToMzLiteIonMobility/Program.fs:1-63 | src/MzliteToMzML/Program.fs:1-61 | src/Preprocessing/Program.fs:1-61 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/MzMLToMzLite/Program.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5fd63d8cf30dd6d7957dc2fe214763ef95e721a64a08d27cf910ffae03bdf5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 26\u002B corresponding lines): src/MsFraggerToPSM/CLIArgumentParsing.fs:1-26 | src/MzTAB/CLIArgumentParsing.fs:1-29 | src/QuantBasedAlignment/CLIArgumentParsing.fs:1-28 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/MsFraggerToPSM/CLIArgumentParsing.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76480ecf963aebfc6cb46d199de729a14ac0df6fbb0039f6022b4f304f6c4dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/ConsensusSpectralLibrary/CLIArgumentParsing.fs:1-23 | src/ProteinInference/CLIArgumentParsing.fs:1-25 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ConsensusSpectralLibrary/CLIArgumentParsing.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e91dc501116ef2706cec95ae74ef92f8cf6532384a74e6b3d2dde53d67929b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/MzliteToMzML/CLIArgumentParsing.fs:1-20 | src/Preprocessing/CLIArgumentParsing.fs:1-20 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/MzliteToMzML/CLIArgumentParsing.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3adbc32a19c72c14ab5228624890e01a80eb06ac0d1439b4ac89808166ed73b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (81\u201382 lines \u00D7 2): src/ProteomIQon/DTO.fs:845-925 | src/ProteomIQon/DTO.fs:1323-1404 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/ProteomIQon/DTO.fs:925\u0060 calls \u0060FieldAttribute\u0060 and \u0060src/ProteomIQon/DTO.fs:1404\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/DTO.fs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"af832005a82687efad97251de2081ff931fb610bdd3db228c71c2ad13c3c5f38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (63\u201365 lines \u00D7 2): src/ConsensusSpectralLibrary/ConsensusSpectralLibrary.fs:181-243 | src/SWATHAnalysis/SWATHAnalysis.fs:109-173 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060src/ConsensusSpectralLibrary/ConsensusSpectralLibrary.fs:181\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ConsensusSpectralLibrary/ConsensusSpectralLibrary.fs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a7add53fc5ab3f6726284428af0bcc8bacce0a3d20a54f18d8ada9b41cbd99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48\u201349 lines \u00D7 2): src/ProteinInference/ProteinInference.fs:320-368 | src/ProteinInference/ProteinInference.fs:442-489 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteinInference/ProteinInference.fs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c0864d7f6161cc9c82a8765dbf56e6aae12441a8772cdd92d1f5aac136b92e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46\u201348 lines \u00D7 2): src/ProteomIQon/DTO.fs:596-643 | src/ProteomIQon/DTO.fs:727-772 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060src/ProteomIQon/DTO.fs:596\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/DTO.fs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d4995d544b3ac2f671a92386d650e36b29c2fd0e319b077871ca142ee532fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1829-1868 | src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1902-1941 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1829\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 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\u0027 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 \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs"},"region":{"startLine":1829}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fdf6d5bb1d748abb6e9ef22477648a7ec296e6fb5b9514e90bd8a5625c6a49e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): src/ProteomIQon/PSMQuantification.fs:357-396 | src/ProteomIQon/PSMQuantification.fs:511-550 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060src/ProteomIQon/PSMQuantification.fs:357\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/PSMQuantification.fs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba5f2c6813d775fb12bb26a4173b625b2d935b1334dfbf758d7f20bac4d4e21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201331 lines \u00D7 2): src/PSMBasedQuantification/Program.fs:46-76 | src/PSMBasedQuantificationTIMs/Program.fs:51-80 \u2014 \u0060src/PSMBasedQuantification/Program.fs\u0060 and \u0060src/PSMBasedQuantificationTIMs/Program.fs\u0060 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 \u2014 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 \u0060src/PSMBasedQuantification/Program.fs:46\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMBasedQuantification/Program.fs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad598cd54335ac320f804539605c448b3b5fd91a349650cda60985ace02d9cbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201330 lines \u00D7 2): src/MzMLToMzLite/MzMLToMzLite.fs:101-129 | src/Preprocessing/Preprocessing.fs:134-163 \u2014 \u0060src/MzMLToMzLite/MzMLToMzLite.fs\u0060 and \u0060src/Preprocessing/Preprocessing.fs\u0060 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/MzMLToMzLite/MzMLToMzLite.fs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3c00b7ed32230ccf54e05f1316ba0b23392dd785d07495acba6c94ea06de05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 3): src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1816-1844 | src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1889-1917 | src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1991-2019 \u2014 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 \u2014 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 \u0060src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1816\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1887\u0060 calls \u0060quantMzHeavy\u0060 and \u0060src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1814\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs"},"region":{"startLine":1816}}}],"partialFingerprints":{"codehealthFindingId/v1":"690b93689a9da94ecaff20f9e5bfbdf299db804334f31739a195117bdc20df2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): src/PSMBasedQuantification/Program.fs:8-45 | src/PSMBasedQuantificationTIMs/Program.fs:8-45 \u2014 \u0060src/PSMBasedQuantification/Program.fs\u0060 and \u0060src/PSMBasedQuantificationTIMs/Program.fs\u0060 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMBasedQuantification/Program.fs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb14521fc75d1f038303d3a990d76bf6ec5776350fe8b6a6f0ebd5ad7c0569a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): src/MzMLToMzLite/CLIArgumentParsing.fs:1-26 | src/MzMLToMzLiteIonMobility/CLIArgumentParsing.fs:1-26 \u2014 \u0060src/MzMLToMzLite/CLIArgumentParsing.fs\u0060 and \u0060src/MzMLToMzLiteIonMobility/CLIArgumentParsing.fs\u0060 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/MzMLToMzLite/CLIArgumentParsing.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d7e7a7b0595068f6b17082ac67683a0afaa915f9abb406903748191d9a2600"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/MzMLToMzLite/Program.fs:18-41 | src/MzMLToMzLiteIonMobility/Program.fs:19-42 \u2014 \u0060src/MzMLToMzLite/Program.fs\u0060 and \u0060src/MzMLToMzLiteIonMobility/Program.fs\u0060 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/MzMLToMzLite/Program.fs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"abee0e6cecba9028af386b1096dd9aa7e727444270db5f7e66844932e0c0dd6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): src/PSMBasedQuantification/PSMBasedQuantification.fs:88-110 | src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1563-1586 \u2014 \u0060src/PSMBasedQuantification/PSMBasedQuantification.fs\u0060 and \u0060src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs\u0060 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 \u2014 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 \u0060src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1563\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMBasedQuantification/PSMBasedQuantification.fs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb14430529c32ee59d9d109f3a70ba3f99c7f7fac7c94a041cd64b3df5730f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3): src/MzMLToMzLite/MzMLToMzLite.fs:31-53 | src/MzMLToMzLiteIonMobility/MzMLToMzLiteIonMobility.fs:29-51 | src/Preprocessing/Preprocessing.fs:35-57 \u2014 \u0060src/MzMLToMzLite/MzMLToMzLite.fs\u0060 and \u0060src/MzMLToMzLiteIonMobility/MzMLToMzLiteIonMobility.fs\u0060 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/MzMLToMzLite/MzMLToMzLite.fs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d90e3985f37c835dfacfd47666161b743349fba0452a4cc3648c38057b872b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): src/MzMLToMzLite/MzMLToMzLite.fs:66-88 | src/Preprocessing/Preprocessing.fs:70-92 \u2014 \u0060src/MzMLToMzLite/MzMLToMzLite.fs\u0060 and \u0060src/Preprocessing/Preprocessing.fs\u0060 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/MzMLToMzLite/MzMLToMzLite.fs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6462a4c8d76ea53a51d2b0aec5e9529689dd1a34d63d6ac9aa3d237cdfcc737"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 3): src/MzMLToMzLite/MzMLToMzLite.fs:183-203 | src/MzliteToMzML/MzliteToMzML.fs:49-70 | src/Preprocessing/Preprocessing.fs:203-223 \u2014 \u0060src/MzMLToMzLite/MzMLToMzLite.fs\u0060 and \u0060src/Preprocessing/Preprocessing.fs\u0060 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/MzMLToMzLite/MzMLToMzLite.fs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"932b4a39a30d5e57ee4382b8cc739e93c5fa63894fe996e2b7866f0f52789e37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/PSMBasedQuantification/PSMBasedQuantification.fs:165-186 | src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:2071-2092 \u2014 \u0060src/PSMBasedQuantification/PSMBasedQuantification.fs\u0060 and \u0060src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs\u0060 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMBasedQuantification/PSMBasedQuantification.fs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd8e5a7358ea2a0cd28c1a11db75c24b770ec67c8278b47c813854e58b1744b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/ProteomIQon/PSMQuantification.fs:451-472 | src/ProteomIQon/PSMQuantification.fs:696-717 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/PSMQuantification.fs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"83182b602cbd540425ee3ce66f9ec0f5ad3c6edae988cccd64ab76c8c709e6af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 3): src/ProteomIQon/PSMQuantification.fs:390-409 | src/ProteomIQon/PSMQuantification.fs:444-464 | src/ProteomIQon/PSMQuantification.fs:689-709 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/PSMQuantification.fs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bbc3cfc8d4006b2292be58d83b3556c13435317a4902244918b51a76a255f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/PSMBasedQuantification/PSMBasedQuantification.fs:194-214 | src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:2106-2126 \u2014 \u0060src/PSMBasedQuantification/PSMBasedQuantification.fs\u0060 and \u0060src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs\u0060 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 \u2014 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/PSMBasedQuantification/PSMBasedQuantification.fs:215\u0060 calls \u0060Trace\u0060 and \u0060src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:2127\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMBasedQuantification/PSMBasedQuantification.fs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86638e6d848219c266e0adcb5e09c75164aae2f9a37722ebb7b8a074534144e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): src/PSMBasedQuantification/Program.fs:70-89 | src/PSMBasedQuantificationTIMs/Program.fs:74-93 | src/SWATHAnalysis/Program.fs:59-78 \u2014 \u0060src/PSMBasedQuantification/Program.fs\u0060 and \u0060src/PSMBasedQuantificationTIMs/Program.fs\u0060 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMBasedQuantification/Program.fs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"078a5899a4dad18eb10be0409cc25cfca0e1a2c2f47f316e19ac0b54b2fb2797"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): src/ProteinInference/ProteinInference.fs:299-318 | src/ProteinInference/ProteinInference.fs:422-440 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteinInference/ProteinInference.fs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcaba35e7226a1777c5db8f02086dfde60e5d6c249b15fe3eb5a990701f128e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): src/PSMBasedQuantification/CLIArgumentParsing.fs:8-34 | src/PSMBasedQuantificationTIMs/CLIArgumentParsing.fs:8-34 \u2014 \u0060src/PSMBasedQuantification/CLIArgumentParsing.fs\u0060 and \u0060src/PSMBasedQuantificationTIMs/CLIArgumentParsing.fs\u0060 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMBasedQuantification/CLIArgumentParsing.fs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df3f9aeed1edd8a91d0ec13f1f6d768f04fe7471f4509694738efea0519a1b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): ConsoleTemplate/template/CLIArgumentParsing.fs:1-18 | src/LabelEfficiencyCalculator/CLIArgumentParsing.fs:1-18 \u2014 before extracting anything, compare \u0060ConsoleTemplate/template/CLIArgumentParsing.fs\u0060 and \u0060src/LabelEfficiencyCalculator/CLIArgumentParsing.fs\u0060 as WHOLE FILES: 100% of the shorter file\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ConsoleTemplate/template/CLIArgumentParsing.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58776bfc15f728f14f245cac9f16d1e6cc9b9e0d08b1d7ac3e5ecea0312e8a9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/LabelFreeProteinQuantification/CLIArgumentParsing.fs:1-18 | src/LabeledProteinQuantification/CLIArgumentParsing.fs:1-18 \u2014 \u0060src/LabelFreeProteinQuantification/CLIArgumentParsing.fs\u0060 and \u0060src/LabeledProteinQuantification/CLIArgumentParsing.fs\u0060 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/LabelFreeProteinQuantification/CLIArgumentParsing.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d85fac3678c7e025220f8a57110ba60d1867bffaa6af2acbbad4807c3d05db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 3): src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs:519-535 | src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs:469-484 | src/QuantBasedAlignment/QuantBasedAlignment.fs:339-355 \u2014 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 \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"98069111e966daa0daeb0c1610ff6778c3a662e512dfde3e9614f2339a09c4c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/ConsensusSpectralLibrary/ConsensusSpectralLibrary.fs:9-25 | src/SWATHAnalysis/SWATHAnalysis.fs:11-27 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ConsensusSpectralLibrary/ConsensusSpectralLibrary.fs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed7f399bcbcdc5b6c3179cfe4a1aec6b80bbfacd544324cee99ba60462bf1a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/ProteomIQon/PSMQuantification.fs:474-490 | src/ProteomIQon/PSMQuantification.fs:719-735 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060src/ProteomIQon/PSMQuantification.fs:474\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 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\u0027 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 \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/PSMQuantification.fs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"480e6506e40387b9476dba4d7762d5ddb096492b6dba9c8f6796bb423190c81c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs:87-102 | src/LabeledProteinQuantification/LabeledProteinQuantification.fs:189-204 \u2014 \u0060src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs\u0060 and \u0060src/LabeledProteinQuantification/LabeledProteinQuantification.fs\u0060 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 \u2014 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 \u0060src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs:87\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs:103\u0060 calls \u0060filter\u0060 and \u0060src/LabeledProteinQuantification/LabeledProteinQuantification.fs:205\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"209cc017d67a46dc89b2b4e08ab2b9d36cc5254c3ed40eb47695ce455e69e168"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/MzMLToMzLiteIonMobility/Program.fs:1-16 | src/RatioLFQ/Program.fs:1-16 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/MzMLToMzLiteIonMobility/Program.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5c19995c4d1aeb004cb544050b1ff181747c4ba3d4a8ad6321e90f3e91b1a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): src/PSMBasedQuantification/PSMBasedQuantification.fs:59-74 | src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1519-1533 \u2014 \u0060src/PSMBasedQuantification/PSMBasedQuantification.fs\u0060 and \u0060src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs\u0060 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 \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMBasedQuantification/PSMBasedQuantification.fs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a5556f36aa0265e25e0bf91753ce6d1c476b811f765706e00f435a26f8b87e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): src/PeptideSpectrumMatchingTIMs/PeptideIndex.fs:241-256 | src/PeptideSpectrumMatchingTIMs/PeptideIndex.fs:273-285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PeptideSpectrumMatchingTIMs/PeptideIndex.fs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"037fb01777606366302bb5e91c1da53dfebc43eca642b008b762ae9fff2c951d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/ProteomIQon/DTO.fs:1059-1074 | src/ProteomIQon/DTO.fs:1077-1092 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/DTO.fs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"916ea955d6b1b8fdd2623e73f1158d9d6990f4f44f132555e103b133aaf261e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): src/LabelEfficiencyCalculator/Program.fs:1-15 | src/LabelFreeProteinQuantification/Program.fs:1-15 | src/LabeledProteinQuantification/Program.fs:1-15 | src/MzliteToMzML/Program.fs:1-15 \u2014 \u0060src/LabelFreeProteinQuantification/Program.fs\u0060 and \u0060src/LabeledProteinQuantification/Program.fs\u0060 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/LabelEfficiencyCalculator/Program.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d66b931c79e7cfbf57f5e4cdddd2f2958c8585535341438600d216f96be9963"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:2013-2027 | src/ProteomIQon/PSMQuantification.fs:460-474 | src/ProteomIQon/PSMQuantification.fs:705-719 \u2014 there are 3 copies across 2 file(s) \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs"},"region":{"startLine":2013}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f69afba46315becc3be9a089d220151cfac4b5a47762ebd514c69c659ced6c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/ConsensusSpectralLibrary/ConsensusSpectralLibrary.fs:401-414 | src/SpectralLibrary/SpectralLibrary.fs:245-259 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060src/ConsensusSpectralLibrary/ConsensusSpectralLibrary.fs:401\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ConsensusSpectralLibrary/ConsensusSpectralLibrary.fs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef50337ee3cb95850d6a590bc5a20c6af6af7f2e7295dcfb8375cf3a495c0877"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs:170-184 | src/LabeledProteinQuantification/LabeledProteinQuantification.fs:278-292 \u2014 \u0060src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs\u0060 and \u0060src/LabeledProteinQuantification/LabeledProteinQuantification.fs\u0060 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3fb422a15691522a1805127d31fc2746ef5db99a051818617b795c535d5fe2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/MzTAB/MzTABSections.fs:585-599 | src/MzTAB/MzTABSections.fs:603-617 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/MzTAB/MzTABSections.fs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc06ba5e0217fcf5bd96edf80ca297d21f905a7b82dfaea110aa4dd655a3f80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/ProteomIQon/PSMQuantification.fs:428-442 | src/ProteomIQon/PSMQuantification.fs:582-596 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060src/ProteomIQon/PSMQuantification.fs:428\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 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\u0027 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 \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/PSMQuantification.fs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8822b8ff6aeb12414d52512a1d944a83b12092c7071055b9ec92b5e0124c6f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 5): 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 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/PSMQuantification.fs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"a144e1519d47515670b3bad4991bd61b7e823be5dc8dda68b798c8dfb57a5409"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/MzTAB/Program.fs:1-14 | src/PeptideDB/Program.fs:1-14 | src/Preprocessing/Program.fs:1-14 \u2014 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 \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/MzTAB/Program.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dfd946cb4a83fd3ddd3e93e25c0e41e23d1fc10a5d99fa391b49f296f4e83fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u201314 lines \u00D7 4): src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs:67-78 | src/LabeledProteinQuantification/LabeledProteinQuantification.fs:140-144 | src/LabeledProteinQuantification/LabeledProteinQuantification.fs:147-151 | src/LabeledProteinQuantification/LabeledProteinQuantification.fs:155-168 \u2014 \u0060src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs\u0060 and \u0060src/LabeledProteinQuantification/LabeledProteinQuantification.fs\u0060 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 \u2014 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 \u0060src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs:67\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb8be94eacf9bfe77fe1c766e5a7092c7df6daa8d0a2648324423f2713ff202"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/LabelFreeProteinQuantification/Program.fs:17-30 | src/LabeledProteinQuantification/Program.fs:17-30 \u2014 \u0060src/LabelFreeProteinQuantification/Program.fs\u0060 and \u0060src/LabeledProteinQuantification/Program.fs\u0060 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/LabelFreeProteinQuantification/Program.fs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b088f63f7c5dfeaf4bcead4b243e567fe75369e5aac92cd060e5bae6c2b015"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/LabeledProteinQuantification/LabeledProteinQuantification.fs:57-74 | src/LabeledProteinQuantification/LabeledProteinQuantification.fs:94-111 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/LabeledProteinQuantification/LabeledProteinQuantification.fs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c78ca5b63e1c99135f986ebc67f22f3677389de39253d5c32e8a6905c10ac0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1797-1810 | src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1870-1883 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs"},"region":{"startLine":1797}}}],"partialFingerprints":{"codehealthFindingId/v1":"a369f5ce77f6ab95ce2f0a2e4b719f64508c7353f9ea57e838a18d6f54fd790d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/ProteomIQon/BioFSharp.Mz_Temp.fs:27-40 | src/ProteomIQon/BioFSharp.Mz_Temp.fs:48-60 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/BioFSharp.Mz_Temp.fs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"134784a1ae41d6841df841aef45d742bd981e04b5d0dde3c50c31e007ee64f73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs:22-34 | src/ProteomIQon/Numerics.fs:8-20 | src/QuantBasedAlignment/QuantBasedAlignment.fs:17-29 \u2014 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 \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"92cfdca129136d32b5065078a083bc385faad5f0da7c2058d412dd9d792c85a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/ConsensusSpectralLibrary/ConsensusSpectralLibrary.fs:311-323 | src/SWATHAnalysis/SWATHAnalysis.fs:376-388 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060src/ConsensusSpectralLibrary/ConsensusSpectralLibrary.fs:311\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ConsensusSpectralLibrary/ConsensusSpectralLibrary.fs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22ec714f3b4ee903a747801f27799344238bbb7d79f7920537128a7ae28905f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/MzMLToMzLite/MzMLToMzLite.fs:131-143 | src/MzMLToMzLiteIonMobility/MzMLToMzLiteIonMobility.fs:111-123 \u2014 \u0060src/MzMLToMzLite/MzMLToMzLite.fs\u0060 and \u0060src/MzMLToMzLiteIonMobility/MzMLToMzLiteIonMobility.fs\u0060 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/MzMLToMzLite/MzMLToMzLite.fs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ab0078fdcee73a77a0c4fafcbeed667f97ba43250f9a1e80f9e574bef382db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/PSMStatistics/PSMStatistics.fs:847-858 | src/PSMStatistics/PSMStatistics.fs:911-923 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMStatistics/PSMStatistics.fs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0fb45c51e4580529e33f9940efeda21bd9a04f942603ca66377addf837f94ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/MzMLToMzLite/Program.fs:43-54 | src/MzMLToMzLiteIonMobility/Program.fs:44-55 \u2014 \u0060src/MzMLToMzLite/Program.fs\u0060 and \u0060src/MzMLToMzLiteIonMobility/Program.fs\u0060 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 \u2014 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 \u0060src/MzMLToMzLite/Program.fs:43\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/MzMLToMzLite/Program.fs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d8a09b3bb81a44c39318454a0f2a9accba9f473b2ba4bc1e43fa8520387146"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/MzTAB/MzTABSections.fs:710-721 | src/MzTAB/MzTABSections.fs:723-734 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/MzTAB/MzTABSections.fs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"f857c7362368339a968cd9e4552597e4302e406bd40971d0077d228c57c3b50c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/AlignmentBasedQuantStatistics/Program.fs:7-20 | src/AlignmentBasedQuantification/Program.fs:9-22 | src/QuantBasedAlignment/Program.fs:7-20 \u2014 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 \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AlignmentBasedQuantStatistics/Program.fs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"5885f6b6d366f012ffc1cfb734bf143a438931675bc4b63f1edff3ac5ff43c02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/MzTAB/MzTABSections.fs:200-210 | src/MzTAB/MzTABSections.fs:214-224 | src/MzTAB/MzTABSections.fs:228-238 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/MzTAB/MzTABSections.fs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"f176a393fed92521a958afaecc7234044439ff6dd466011dd8b78ae6a00e5927"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/MzTAB/MzTABSections.fs:710-720 | src/MzTAB/MzTABSections.fs:723-733 | src/MzTAB/MzTABSections.fs:736-746 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/MzTAB/MzTABSections.fs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"28545d67089cf6b6a0e4c3b2154406a54d5bfbe0af4e165e9380ad4612d24211"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/MzMLToMzLite/MzMLToMzLite.fs:153-163 | src/Preprocessing/Preprocessing.fs:179-189 \u2014 \u0060src/MzMLToMzLite/MzMLToMzLite.fs\u0060 and \u0060src/Preprocessing/Preprocessing.fs\u0060 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/MzMLToMzLite/MzMLToMzLite.fs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76923045450320de299ec2e26a7f51aed8c785af74edf26a368bbf689d02d66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201311 lines \u00D7 4): src/AlignmentBasedQuantification/CLIArgumentParsing.fs:12-15 | src/PSMBasedQuantification/CLIArgumentParsing.fs:1-11 | src/PSMBasedQuantificationTIMs/CLIArgumentParsing.fs:1-11 | src/SWATHAnalysis/CLIArgumentParsing.fs:12-15 \u2014 \u0060src/PSMBasedQuantification/CLIArgumentParsing.fs\u0060 and \u0060src/PSMBasedQuantificationTIMs/CLIArgumentParsing.fs\u0060 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 \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/AlignmentBasedQuantification/CLIArgumentParsing.fs:9\u0060 calls \u0060AltCommandLine\u0060 and \u0060src/SWATHAnalysis/CLIArgumentParsing.fs:9\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AlignmentBasedQuantification/CLIArgumentParsing.fs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee451413e46f0375c67b04d2fc88b5d56a916329c575de6907ba47b2260c252a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/ProteomIQon/PSMQuantification.fs:579-590 | src/ProteomIQon/PSMQuantification.fs:633-644 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060src/ProteomIQon/PSMQuantification.fs:579\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 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\u0027 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 \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/PSMQuantification.fs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef3a7c79deb30bb5d2798b363138e133d91235315dfd60b9f8bf447737dacb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ConsoleTemplate/template/Program.fs:27-36 | src/LabelEfficiencyCalculator/Program.fs:26-35 \u2014 before extracting anything, compare \u0060ConsoleTemplate/template/Program.fs\u0060 and \u0060src/LabelEfficiencyCalculator/Program.fs\u0060 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060ConsoleTemplate/template/Program.fs:37\u0060 calls \u0060GetAllResults\u0060 and \u0060src/LabelEfficiencyCalculator/Program.fs:36\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ConsoleTemplate/template/Program.fs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"e607e7ce147457dd015785fb774db8ff1fe844c8a27c7c4cf71f5b6f001a676e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/LabelEfficiencyCalculator/LabelEfficiencyCalculator.fs:134-143 | src/LabelEfficiencyCalculator/LabelEfficiencyCalculator.fs:147-156 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/LabelEfficiencyCalculator/LabelEfficiencyCalculator.fs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76345a76dac08d1e46aefa832920c158b08588b32c08a58b86a009efb3e67cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/ProteinInference/Program.fs:37-46 | src/SpectralLibrary/Program.fs:34-44 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteinInference/Program.fs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7258a2a29dbdb41b894061be43c7af37d00b3be35ff0b1f04f9f4b0e1b485775"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/ProteomIQon/DTO.fs:1634-1642 | src/ProteomIQon/Domain.fs:602-611 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060src/ProteomIQon/DTO.fs:1634\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/DTO.fs"},"region":{"startLine":1634}}}],"partialFingerprints":{"codehealthFindingId/v1":"25827ce81879edc5813188c93abc6438fb2ee84a83afa3c823b91a3f0663f084"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/MzMLToMzLite/Program.fs:46-54 | src/MzMLToMzLiteIonMobility/Program.fs:47-55 | src/MzliteToMzML/Program.fs:43-51 | src/Preprocessing/Program.fs:43-51 \u2014 \u0060src/MzMLToMzLite/Program.fs\u0060 and \u0060src/MzMLToMzLiteIonMobility/Program.fs\u0060 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/MzMLToMzLite/Program.fs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0724d4f0a893efe58c2f1914de7476a2fc43dcbcb247f3551412fdfd341e332c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/PSMBasedQuantification/Program.fs:9-17 | src/PSMBasedQuantificationTIMs/Program.fs:9-17 | src/PeptideSpectrumMatching/Program.fs:8-16 | src/PeptideSpectrumMatchingTIMs/Program.fs:8-16 \u2014 \u0060src/PSMBasedQuantification/Program.fs\u0060 and \u0060src/PSMBasedQuantificationTIMs/Program.fs\u0060 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMBasedQuantification/Program.fs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"12439e42ba771124e9b783f350fb6b174fa9a2f2b96b4211c2cba29a484b507d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/PSMStatistics/PSMStatistics.fs:699-707 | src/PSMStatistics/PSMStatistics.fs:736-744 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMStatistics/PSMStatistics.fs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"70042d010ae249094a0dc129b14ee232e30e6371098c2b22756122d77a605e30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/PeptideSpectrumMatching/PeptideSpectrumMatching.fs:33-42 | src/PeptideSpectrumMatchingTIMs/PeptideSpectrumMatchingTIMs.fs:149-158 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PeptideSpectrumMatching/PeptideSpectrumMatching.fs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9faee1dffa247b2bc16b23cc271415b1c114a4ba5bac377336669c4b105e04b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/ProteomIQon/PSMQuantification.fs:338-355 | src/ProteomIQon/PSMQuantification.fs:492-509 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/PSMQuantification.fs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e18292f32e8a5dbf2bfa970dc6cfe3d780064c9e1ca9072eb901aa4fb357d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): 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 \u2014 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 \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ConsensusSpectralLibrary/Program.fs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd0d20328a254717e7fa3459ccd3d5dca59a2db43cf3bb17f66c4fea14467f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): 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 \u2014 \u0060src/PSMBasedQuantification/Program.fs\u0060 and \u0060src/PSMBasedQuantificationTIMs/Program.fs\u0060 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMBasedQuantification/Program.fs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"6679cb901b0166ce9ddeed2333211dc4702d17cee89490f8b32aad41383238f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/PSMBasedQuantification/PSMBasedQuantification.fs:66-73 | src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1526-1533 | src/PSMStatistics/PSMStatistics.fs:455-462 \u2014 \u0060src/PSMBasedQuantification/PSMBasedQuantification.fs\u0060 and \u0060src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs\u0060 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 \u2014 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/PSMStatistics/PSMStatistics.fs:464\u0060 calls \u0060Trace\u0060 and \u0060src/PSMBasedQuantification/PSMBasedQuantification.fs:75\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMBasedQuantification/PSMBasedQuantification.fs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84b5a1dc187a16b441596e52f186291486e24c3ca753f7cac769f5c4761bd13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/MzMLToMzLite/MzMLToMzLite.fs:57-64 | src/Preprocessing/Preprocessing.fs:61-68 \u2014 \u0060src/MzMLToMzLite/MzMLToMzLite.fs\u0060 and \u0060src/Preprocessing/Preprocessing.fs\u0060 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/MzMLToMzLite/MzMLToMzLite.fs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7b18cbaf2e34678328042b49d88243eb3be63b234f3434c5176e2ff24045c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20138 lines \u00D7 6): 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 \u2014 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 \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AlignmentBasedQuantification/Program.fs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"26467fc9c47484ebd401254f556df3329a5535eedb0c94305a173e3220a597f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1776-1794 | src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1965-1983 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs"},"region":{"startLine":1776}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ab480d93a80fb3e5d79e527a866e90f21f347cc4817d6b00b390c816aa310d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/PeptideSpectrumMatching/Program.fs:19-26 | src/PeptideSpectrumMatchingTIMs/Program.fs:19-26 \u2014 \u0060src/PeptideSpectrumMatching/Program.fs\u0060 and \u0060src/PeptideSpectrumMatchingTIMs/Program.fs\u0060 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PeptideSpectrumMatching/Program.fs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b750c9400230add76f060df13a8f179c60a04ed25ba23454615639f3c6a11ea7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): 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 \u2014 \u0060src/PSMBasedQuantification/CLIArgumentParsing.fs\u0060 and \u0060src/PSMBasedQuantificationTIMs/CLIArgumentParsing.fs\u0060 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 \u2014 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/PSMBasedQuantification/CLIArgumentParsing.fs:14\u0060 calls \u0060AltCommandLine\u0060 and \u0060src/AlignmentBasedQuantification/CLIArgumentParsing.fs:14\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AlignmentBasedQuantification/CLIArgumentParsing.fs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df2923da7937004082b31d0feb7bdf95d7b551a894bcf5fda9c0d692c2908eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): 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 \u2014 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 \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ConsensusSpectralLibrary/Program.fs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"090299cfd95025580d9ec50829f7af06262011dd2fb5d17203360780a939cf6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/MzMLToMzLite/MzMLToMzLite.fs:66-72 | src/MzMLToMzLiteIonMobility/MzMLToMzLiteIonMobility.fs:61-67 | src/Preprocessing/Preprocessing.fs:70-76 \u2014 \u0060src/MzMLToMzLite/MzMLToMzLite.fs\u0060 and \u0060src/MzMLToMzLiteIonMobility/MzMLToMzLiteIonMobility.fs\u0060 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/MzMLToMzLite/MzMLToMzLite.fs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"102a911fc7917a79eb4c6a615372cdf4604deb45e15e6541465c9517edd3bd87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ConsoleTemplate/template/Program.fs:19-25 | src/LabelEfficiencyCalculator/Program.fs:18-24 \u2014 before extracting anything, compare \u0060ConsoleTemplate/template/Program.fs\u0060 and \u0060src/LabelEfficiencyCalculator/Program.fs\u0060 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ConsoleTemplate/template/Program.fs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"65cca7351d876ff5f732f9015debf84d343bf4c68976cd716961d80d4ddeb140"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/PSMBasedQuantification/PSMBasedQuantification.fs:39-45 | src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1500-1507 \u2014 \u0060src/PSMBasedQuantification/PSMBasedQuantification.fs\u0060 and \u0060src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs\u0060 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMBasedQuantification/PSMBasedQuantification.fs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6f919d29170fc77060cafdd270b4f6f90d7133e35eba3adb5cb95cb7815bad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/ProteomIQon/BaselineAls.fs:68-74 | src/ProteomIQon/BaselineAls.fs:85-91 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/BaselineAls.fs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58ab3bc3aa2744b41a508f5d39e279adcea09b70cea55b52a95af27cdfe25de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/ProteomIQon/BaselineAls.fs:76-82 | src/ProteomIQon/BaselineAls.fs:94-100 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/BaselineAls.fs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae1b36b4e86604bcc670bdaf18337ea50c9f9396d681b9b0b064520400aa7fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): src/ProteomIQon/PSMQuantification.fs:310-334 | src/ProteomIQon/PSMQuantification.fs:657-681 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/PSMQuantification.fs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"b911c4c74237c315a479a44b32e2781f1ebc7859542493773540ee17f026af99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 7): 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 \u2014 before extracting anything, compare \u0060ConsoleTemplate/template/Program.fs\u0060 and \u0060src/LabelEfficiencyCalculator/Program.fs\u0060 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ConsoleTemplate/template/Program.fs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"288fada200b4fa01e603c513e03fad373af00b1e47c95ca4e739bf19f6ffed04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): 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 \u2014 before extracting anything, compare \u0060ConsoleTemplate/template/Program.fs\u0060 and \u0060src/LabelEfficiencyCalculator/Program.fs\u0060 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ConsoleTemplate/template/Program.fs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"290a22f8c206f94dba892ee831ef83a995a5f8aaf9ef67dced89f01e517a398f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1851-1856 | src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:1924-1929 | src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs:2026-2031 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs"},"region":{"startLine":1851}}}],"partialFingerprints":{"codehealthFindingId/v1":"5304f98c5027c557768eba26cc6440babba73dc7408f6a0945471c5062a18791"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/LabeledProteinQuantification/LabeledProteinQuantification.fs:32-37 | src/LabeledProteinQuantification/LabeledProteinQuantification.fs:122-127 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/LabeledProteinQuantification/LabeledProteinQuantification.fs:29\u0060 calls \u0060zip\u0060 and \u0060src/LabeledProteinQuantification/LabeledProteinQuantification.fs:118\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/LabeledProteinQuantification/LabeledProteinQuantification.fs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7361fd76dcaf5a2062826515e536544284faf7409cacbee18d78b2c5b824ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/ProteomIQon/DeedleExtensionsTemp.fs:239-244 | src/ProteomIQon/DeedleExtensionsTemp.fs:255-260 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/ProteomIQon/DeedleExtensionsTemp.fs:261\u0060 calls \u0060r\u0060 and \u0060src/ProteomIQon/DeedleExtensionsTemp.fs:244\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/DeedleExtensionsTemp.fs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"77702d6c758cf2b2fe1f61b8228aef7525506e6f7cf4fb13198ecb1f75b7da3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/LabeledProteinQuantification/LabeledProteinQuantification.fs:33-37 | src/LabeledProteinQuantification/LabeledProteinQuantification.fs:83-87 | src/LabeledProteinQuantification/LabeledProteinQuantification.fs:123-127 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/LabeledProteinQuantification/LabeledProteinQuantification.fs:29\u0060 calls \u0060zip\u0060 and \u0060src/LabeledProteinQuantification/LabeledProteinQuantification.fs:78\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/LabeledProteinQuantification/LabeledProteinQuantification.fs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eca29e5e3322dd0723c62bad2858b4bd82e16cc9c612462c6736aa07dc15b46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/ProteomIQon/PSMQuantification.fs:419-424 | src/ProteomIQon/PSMQuantification.fs:473-478 | src/ProteomIQon/PSMQuantification.fs:718-723 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/PSMQuantification.fs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c6a2005751eb201e6058393ccbf2d96d03e6d82980d0bccb986d959d38724e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 4): src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs:60-64 | src/LabeledProteinQuantification/LabeledProteinQuantification.fs:134-138 | src/LabeledProteinQuantification/LabeledProteinQuantification.fs:145-146 | src/LabeledProteinQuantification/LabeledProteinQuantification.fs:152-153 \u2014 \u0060src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs\u0060 and \u0060src/LabeledProteinQuantification/LabeledProteinQuantification.fs\u0060 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 \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs:64\u0060 calls \u0060aggregate\u0060 and \u0060src/LabeledProteinQuantification/LabeledProteinQuantification.fs:146\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38f082aee4e629e3778a333a0d3114b583817a09d7885dac7c5577204f7fbe1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/LabeledProteinQuantification/LabeledProteinQuantification.fs:76-80 | src/LabeledProteinQuantification/LabeledProteinQuantification.fs:116-121 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/LabeledProteinQuantification/LabeledProteinQuantification.fs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"c370c6019bbe6ba38e7235311fe0d11fb69e3176986a57ddf14aca6b12d033f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 3): src/LabeledProteinQuantification/LabeledProteinQuantification.fs:54-57 | src/LabeledProteinQuantification/LabeledProteinQuantification.fs:92-96 | src/LabeledProteinQuantification/LabeledProteinQuantification.fs:132-137 \u2014 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 \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/LabeledProteinQuantification/LabeledProteinQuantification.fs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4198f7fc0506d65d66064a3e314dd1c88a23895ccfe2f8456cdd63a185ef31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/MzTAB/MzTABSections.fs:312-323 | src/MzTAB/MzTABSections.fs:349-360 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/MzTAB/MzTABSections.fs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"18feb3826ba3eea8d3eb7afbdc63b6b5caa7c949abaff7d62470d93179ce8e73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/MzTAB/MzTABSections.fs:288-299 | src/MzTAB/MzTABSections.fs:325-336 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/MzTAB/MzTABSections.fs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f075012e1789deaac3735a26f2201a18d34c65ca9498a959f32a6089c4b1661"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/ConsensusSpectralLibrary/ConsensusSpectralLibrary.fs:602-612 | src/SWATHAnalysis/SWATHAnalysis.fs:450-459 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ConsensusSpectralLibrary/ConsensusSpectralLibrary.fs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b150120367b6be34156d7153a9de5f06b7cd505176ffeffd0f29e332dff6a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/PeptideSpectrumMatching/CLIArgumentParsing.fs:19-26 | src/PeptideSpectrumMatchingTIMs/CLIArgumentParsing.fs:19-26 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PeptideSpectrumMatching/CLIArgumentParsing.fs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"68dd45233d8cb1635f75af19448371f6709c035dbcf12d0b47b5758841392526"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): src/JoinQuantPepIonsWithProteins/Program.fs:43-50 | src/PSMBasedQuantification/Program.fs:73-80 | src/PSMBasedQuantificationTIMs/Program.fs:77-84 | src/SWATHAnalysis/Program.fs:62-69 \u2014 \u0060src/PSMBasedQuantification/Program.fs\u0060 and \u0060src/PSMBasedQuantificationTIMs/Program.fs\u0060 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 \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/JoinQuantPepIonsWithProteins/Program.fs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d3a603a282af73a14e44499af05d341a3c257b39cef46bf0ff1a75df43a99c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/AlignmentBasedQuantStatistics/Program.fs:106-111 | src/QuantBasedAlignment/Program.fs:68-73 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AlignmentBasedQuantStatistics/Program.fs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6566579c2a045025294c5af2a787260b6e4ea4f9f8270d24b4a18601e3bb354"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/AlignmentBasedQuantStatistics/Program.fs:107-112 | src/AlignmentBasedQuantification/Program.fs:120-125 | src/QuantBasedAlignment/Program.fs:69-74 \u2014 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 \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AlignmentBasedQuantStatistics/Program.fs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf35319c63f4e18ce6fef6f5d3d64c579059b7bc17082a25196eb0ea5751f808"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/PeptideSpectrumMatchingTIMs/SpectrumSearch.fs:410-414 | src/PeptideSpectrumMatchingTIMs/SpectrumSearch.fs:422-426 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PeptideSpectrumMatchingTIMs/SpectrumSearch.fs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"112cefb022105e22498c5cf1f14c5ed4dc5b2513d2bf985ac9f818a3921d848f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/ProteomIQon/Core.fs:114-118 | src/ProteomIQon/Core.fs:123-127 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/Core.fs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d64965c0d847757c0ee180ba966927ec4e6f02535d8bf1a0b48b72fcff96a91"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs: 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 \u2014 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 \u2014 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 \u0060git log --since=\u00272026-08-14 14:08:17 \u002B01:00\u0027 --until=\u00272026-11-12 14:08:17 \u002B01:00\u0027 --full-history --no-merges -- src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AlignmentBasedQuantification/AlignmentBasedQuantification.fs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"9345de16de4a317f4768fec0efeee96af92b7dc249e7361100fab5d89139c64d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs: 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 \u2014 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 \u2014 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 \u0060git log --since=\u00272026-08-14 14:08:17 \u002B01:00\u0027 --until=\u00272026-11-12 14:08:17 \u002B01:00\u0027 --full-history --no-merges -- src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMBasedQuantificationTIMs/PSMBasedQuantificationTIMs.fs"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"a332f310f330508346d4ed0200ac571dc1e5390c9fd6c46adc7c193d1bee6ad9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs: 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 \u0060git log --since=\u00272026-08-14 14:08:17 \u002B01:00\u0027 --until=\u00272026-11-12 14:08:17 \u002B01:00\u0027 --full-history --no-merges -- src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AlignmentBasedQuantStatistics/AlignmentBasedQuantStatistics.fs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"708a101ccd6dc78f539faf908a6804ecf2159a3930583550203e2621a1ac4e57"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ProteomIQon/BioFSharp.Mz_Temp.fs: 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 \u0060git log --since=\u00272026-08-14 14:08:17 \u002B01:00\u0027 --until=\u00272026-11-12 14:08:17 \u002B01:00\u0027 --full-history --no-merges -- src/ProteomIQon/BioFSharp.Mz_Temp.fs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/BioFSharp.Mz_Temp.fs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"621a0922312afc1141044c378d9ef5e41be13ce82ab36311f42ed98e89a9c56f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ProteomIQon/pepValueCalculation.fs: 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 \u0060git log --since=\u00272026-08-14 14:08:17 \u002B01:00\u0027 --until=\u00272026-11-12 14:08:17 \u002B01:00\u0027 --full-history --no-merges -- src/ProteomIQon/pepValueCalculation.fs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/pepValueCalculation.fs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72fa6a3176bfacc858455276f3259f7e671f499a0a7a464ca838adcd9c1bf53"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ProteomIQon/PSMQuantification.fs: 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 \u2014 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 \u2014 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 \u0060git log --since=\u00272026-08-14 14:08:17 \u002B01:00\u0027 --until=\u00272026-11-12 14:08:17 \u002B01:00\u0027 --full-history --no-merges -- src/ProteomIQon/PSMQuantification.fs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/PSMQuantification.fs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb40a40d6f61038ecf5d4603d215f19bd30a27f08f460740b18847cdaabb8f87"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/AlignmentBasedQuantification/Program.fs: 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 \u2014 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 \u2014 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 \u0060git log --since=\u00272026-08-14 14:08:17 \u002B01:00\u0027 --until=\u00272026-11-12 14:08:17 \u002B01:00\u0027 --full-history --no-merges -- src/AlignmentBasedQuantification/Program.fs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AlignmentBasedQuantification/Program.fs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c40c57abe555cd24174569b2df5d2ad9992f5cfb17a5ac9ff943204c116f1ba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/PeptideSpectrumMatchingTIMs/PeptideSpectrumMatchingTIMs.fs: 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 \u0060git log --since=\u00272026-08-14 14:08:17 \u002B01:00\u0027 --until=\u00272026-11-12 14:08:17 \u002B01:00\u0027 --full-history --no-merges -- src/PeptideSpectrumMatchingTIMs/PeptideSpectrumMatchingTIMs.fs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PeptideSpectrumMatchingTIMs/PeptideSpectrumMatchingTIMs.fs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e479a178c323d8407ff30f98bf9e999ff0aa9a82a83f5f19fa79951e9a76b04"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ProteomIQon/MzCalibration.fs: 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 \u0060git log --since=\u00272026-08-14 14:08:17 \u002B01:00\u0027 --until=\u00272026-11-12 14:08:17 \u002B01:00\u0027 --full-history --no-merges -- src/ProteomIQon/MzCalibration.fs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/MzCalibration.fs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3dddeba297278e0fd5ed7b433eaad482b56836087100d33fb6fd44df0f0340"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/MsFraggerToPSM/MsFraggerToPSM.fs: 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 \u0060git log --since=\u00272026-08-14 14:08:17 \u002B01:00\u0027 --until=\u00272026-11-12 14:08:17 \u002B01:00\u0027 --full-history --no-merges -- src/MsFraggerToPSM/MsFraggerToPSM.fs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/MsFraggerToPSM/MsFraggerToPSM.fs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee97fb0932a6e2e90bddb72d04b613a3d0c13616c5cb8c4cd88d345c7209c9c7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/SWATHAnalysis/SWATHAnalysis.fs: 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 \u0060git log --since=\u00272026-08-14 14:08:17 \u002B01:00\u0027 --until=\u00272026-11-12 14:08:17 \u002B01:00\u0027 --full-history --no-merges -- src/SWATHAnalysis/SWATHAnalysis.fs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/SWATHAnalysis/SWATHAnalysis.fs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ab1ba63618f961a2fe9cc840fcb3fbb9ef4ef48d33b47a7422331c039a2894"}},{"ruleId":"D16","level":"note","message":{"text":"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 (\u002B21 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4661bec2af7ecb35eb35df7aa77f059b444ff3e3d0f3dca27119f770f505323b"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 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 (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 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 \u0060docs/adr/\u0060. ADRs are expected here because \u0060ConsoleTemplate/template/ProteomIQonConsole.fsproj\u0060 makes this repository a deployable product (line 10)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ConsoleTemplate/template/ProteomIQonConsole.fsproj"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"40da137426711515f0c16f4bfd9daa9af7869aba6a658f3157747e4a8a8720fa"}},{"ruleId":"D26","level":"note","message":{"text":"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 \u0060src/ProteomIQon\u0060 (6718 LoC, 214 module-visible types across 1 directories). Review these for cohesion \u2014 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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d700b5fe5e576e945023dfac37277fff8e8a8ea613c0f87c7be8dfebf0c842ea"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8b32b9d6ded360ac7bb898f9a01320d4367a9b5e3747a9e0fd7db404d4fed591"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"33c0e58acb5e2aa2dc03c6c01a2874c02a67ae8d10a72027c970d6f4691e239a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9cfd84b2f5ba43db24bee0dc3fcac38feb62bb29f878bd03a8f01616a0dc8c5d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"da03799fc3118d150d08138b70314aa440345b1d41b31bf8ec40bdf77dadcc32"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"513030f8b6502b9b0780005143cca1c9b8b3ef8ace6d304eb394f8f0d66294f9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"17cefd4a1745fb6da7ea4f4dae37ada590724fe3b3336c4b022af47a0d52873d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 5 of 71 analysed file(s) have no living knowledge left \u2014 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 \u2014 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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/LabelFreeProteinQuantification/LabelFreeProteinQuantification.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31fca20ba3a9f85af3ff17d23d6f9ddf31114f1e3222f251e5895b1d3eab7f8d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testsOld/ProteomIQon.Testslegacy/Generators.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e885cde2356e9e9a63d9287e2a86286c35d4a845d7091d8866de9504c1fcd6e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/JoinQuantPepIonsWithProteins/JoinQuantPepIonsWithProteins.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5170675df6c111df76da2392814e2019caccc7c63b44684f6446633838bee4be"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMBasedQuantification/CLIArgumentParsing.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9c11b07620ded69c4ce5c8a4a4b053e6db0a29c194265aa25ace51bd4a029b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/JoinQuantPepIonsWithProteins/Program.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ffdd76e18e39ffd052cbf78c27db0bbe2114fe3e0d10fc7bbf4e77d93c72f2"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3f679daa9065492b9a7f90b93da88c7e749d478781b13997bc6bb6da254cc441"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D44","level":"warning","message":{"text":"End-of-life runtime: .NET net5.0: ConsoleTemplate/template/ProteomIQonConsole.fsproj declares .NET net5.0 as this project\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ConsoleTemplate/template/ProteomIQonConsole.fsproj"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d77f7bf37e9005a5117f87a26e30af81791a6fbb753870e88ec73a6eccecd9e"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 27/28 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060src/RatioLFQ\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add \u0060semgrep --config=auto\u0060 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\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/build-test.yml"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060ConsoleTemplate/template/ProteomIQonConsole.fsproj\u0060 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 \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ConsoleTemplate/template/ProteomIQonConsole.fsproj"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea376c940378467881fcbed3e54dd7937aabc1bf049da5b3727928d8674d3d0"}},{"ruleId":"SC1","level":"warning","message":{"text":"NuGet dependencies are not locked: No packages.lock.json and no central package management \u2014 restores aren\u0027t reproducible or pinned (SSDF PW.4.4). Enable \u003CRestorePackagesWithLockFile\u003Etrue\u003C/RestorePackagesWithLockFile\u003E (commit the lockfile) or adopt Directory.Packages.props. Advisory \u2014 never scored."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0a97b4f69ccac509400ece7eedefb06d3ede0522cd4d8bcb5c068bea719545a6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060init || ((step \u003E stepEpsilon || step \u003C 0.) \u0026\u0026 iter \u003C 20)\u0060 appears character-identically in 2 files \u2014 src/ProteomIQon/pepValue/pepValueCalculation.fs, src/ProteomIQon/pepValueCalculation.fs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/pepValue/pepValueCalculation.fs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e193d7cdd9bf3644fb7a41201ecea2d245038e704bafe0093e4eee194f1738b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p1d.Mz \u003E mzRange.HighValue || p1d.Mz \u003C mzRange.LowValue\u0060 appears character-identically in 2 files \u2014 src/ConsensusSpectralLibrary/ConsensusSpectralLibrary.fs, src/SWATHAnalysis/SWATHAnalysis.fs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ConsensusSpectralLibrary/ConsensusSpectralLibrary.fs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"5950f0c828b52d35bace5f7f42eb982ac67926830dc6646bc067cef5ed3ff34a"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060Trace\u0060 at line 99 is called with an argument built by \u0060Array.map (fun x -\u003E string x)\u0060 (line 101), whose cost grows with the collection it walks. F# evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 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 \u0060IsEnabled\u0060 test, no debug flag, no \u0060#if DEBUG\u0060 region, no \u0060fun\u0060 or \u0060lazy\u0060 the logger runs only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/pepValueCalculation.fs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"803701a3fa5d5f31d105645ebfc573677121a02bc6543ef67a4a2869a132ed95"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060Trace\u0060 at line 105 is called with an argument built by \u0060Array.map (fun x -\u003E string x)\u0060 (line 107), whose cost grows with the collection it walks. F# evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 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 \u0060IsEnabled\u0060 test, no debug flag, no \u0060#if DEBUG\u0060 region, no \u0060fun\u0060 or \u0060lazy\u0060 the logger runs only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/pepValueCalculation.fs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13f47941f0b88545f1bf8f8a09ca3b50c981ddb909c5eb9657eb745c2568589"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060Trace\u0060 at line 111 is called with an argument built by \u0060Array.map (fun x -\u003E string x)\u0060 (line 113), whose cost grows with the collection it walks. F# evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 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 \u0060IsEnabled\u0060 test, no debug flag, no \u0060#if DEBUG\u0060 region, no \u0060fun\u0060 or \u0060lazy\u0060 the logger runs only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/pepValueCalculation.fs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5a61449b2d87d6fac1e9e1df2df3bff98896d397b379776ac21391ccacb7bc"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060Trace\u0060 at line 93 is called with an argument built by \u0060Array.map (fun x -\u003E string x)\u0060 (line 95), whose cost grows with the collection it walks. F# evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 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 \u0060IsEnabled\u0060 test, no debug flag, no \u0060#if DEBUG\u0060 region, no \u0060fun\u0060 or \u0060lazy\u0060 the logger runs only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/pepValue/pepValueCalculation.fs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"09dc2aec71f7702720d1951a2ed046f81f0df8dc04cbd38419e146920e258f49"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060Trace\u0060 at line 99 is called with an argument built by \u0060Array.map (fun x -\u003E string x)\u0060 (line 101), whose cost grows with the collection it walks. F# evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 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 \u0060IsEnabled\u0060 test, no debug flag, no \u0060#if DEBUG\u0060 region, no \u0060fun\u0060 or \u0060lazy\u0060 the logger runs only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/pepValue/pepValueCalculation.fs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"23244a4cfddc05d7d132991d2bbbca939b36b9cd76b0a04ee14bf7f827a764d2"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060Trace\u0060 at line 105 is called with an argument built by \u0060Array.map (fun x -\u003E string x)\u0060 (line 107), whose cost grows with the collection it walks. F# evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 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 \u0060IsEnabled\u0060 test, no debug flag, no \u0060#if DEBUG\u0060 region, no \u0060fun\u0060 or \u0060lazy\u0060 the logger runs only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ProteomIQon/pepValue/pepValueCalculation.fs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a4097b4b3bd43b35522474257e9b3df329685a3d493d30b581268347a9ede4"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060Trace\u0060 at line 653 is called with an argument built by \u0060Array.distinctBy (fun x -\u003E x.ScanNr) |\u003E Array.length\u0060 (line 653), whose cost grows with the collection it walks. F# evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 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 \u0060IsEnabled\u0060 test, no debug flag, no \u0060#if DEBUG\u0060 region, no \u0060fun\u0060 or \u0060lazy\u0060 the logger runs only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMStatistics/PSMStatistics.fs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e69b0c763c9f9285ef211fce7d9a1cc4ce044161db3e52ccd043b06ee2d757d"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060Trace\u0060 at line 811 is called with an argument built by \u0060Array.filter (fun x -\u003E x.Label \u0026\u0026 getQ (score x) \u003C= 0.01) |\u003E Array.length\u0060 (line 811), whose cost grows with the collection it walks. F# evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 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 \u0060IsEnabled\u0060 test, no debug flag, no \u0060#if DEBUG\u0060 region, no \u0060fun\u0060 or \u0060lazy\u0060 the logger runs only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/PSMStatistics/PSMStatistics.fs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"8877e85b1910c580ae2791397070318b97601b85899a5b91c0a676f8bcf198f3"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":9,"secretScannerRunsExcluded":0}},"redactionTokens":["A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."]}]}