{"$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":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"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":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"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"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"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"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}},{"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"]}],"properties":{"cwe":["CWE-506"]}},{"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":"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":"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":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"ArrayVectorBuilder.Deedle.Vectors.IVectorBuilder.Build (cyclomatic 73): ArrayVectorBuilder.Deedle.Vectors.IVectorBuilder.Build has cyclomatic complexity 73 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/Vectors/ArrayVector.fs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"906d124797d3556f25d4ee149c0e739c2793be269197c926280d6d61894e71aa"}},{"ruleId":"D1","level":"warning","message":{"text":"Implementation.batchesToFrame (cyclomatic 66): Implementation.batchesToFrame has cyclomatic complexity 66 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle.Arrow/Arrow.fs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"8992ca9de6e35c3364092f5acc00bb9e836cf4c8d3166d733e94d565bf99e288"}},{"ruleId":"D1","level":"warning","message":{"text":"Implementation.columnToArrowArray (cyclomatic 52): Implementation.columnToArrowArray has cyclomatic complexity 52 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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/Deedle.Arrow/Arrow.fs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04d6514cb5604514ea1ed36676aa7f938cbc1515f417e9f1fe6c5164cc84fd8"}},{"ruleId":"D1","level":"warning","message":{"text":"Implementation.columnToDataColumn (cyclomatic 42): Implementation.columnToDataColumn has cyclomatic complexity 42 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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/Deedle.Parquet/Parquet.fs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7d1170463e4de955b9da623e52aaa040b1276723ecad94e6c501d43ace4edf"}},{"ruleId":"D1","level":"warning","message":{"text":"Implementation.readColumn (cyclomatic 41): Implementation.readColumn has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle.Parquet/Parquet.fs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"289b2e6d4ef49dfbb37697231e4af3b1b0ea218c9d02830651e6469a7d6d4f12"}},{"ruleId":"D1","level":"warning","message":{"text":"FrameUtilsModule.readCsv (cyclomatic 40): FrameUtilsModule.readCsv has cyclomatic complexity 40 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/FrameUtils.fs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4797102e60ff2228cf6c70eda05ae13132ea3321b1d40f7831d85c24133864"}},{"ruleId":"D1","level":"warning","message":{"text":"Implementation.arrowArrayToVector (cyclomatic 33): Implementation.arrowArrayToVector has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle.Arrow/Arrow.fs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c70008eb45d0c91e078f733132584e7dd8b4dfb23dcddec92593a131485c00"}},{"ruleId":"D1","level":"warning","message":{"text":"LookupRangeExecutor.remapLookupRangeAfterStep (cyclomatic 33): LookupRangeExecutor.remapLookupRangeAfterStep has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/VirtualLookupRange.fs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"6290bb3cab9fcae4ed60058f9e549ca1d26f1fa6227e4ce960981f91f0f2cef1"}},{"ruleId":"D1","level":"warning","message":{"text":"VirtualVectorBuilder.Deedle.Vectors.IVectorBuilder.Build (cyclomatic 28): VirtualVectorBuilder.Deedle.Vectors.IVectorBuilder.Build has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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/Deedle/Vectors/VirtualVector.fs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c25e37d3a067ed8ef33a34e03b24192baa130fdb6ab8f3df2334abc97086a91"}},{"ruleId":"D1","level":"warning","message":{"text":"Ranges.lookup (cyclomatic 27): Ranges.lookup has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/Common/Ranges.fs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"aecba73a29d40f6e988f23fdf91a093eab68b1b0c36947c9f0802818e8398b60"}},{"ruleId":"D1","level":"warning","message":{"text":"Frame\u00602.FormatStrings (cyclomatic 26): Frame\u00602.FormatStrings has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/Frame.fs"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b06345019889a5def32e1508d15f3d645c331351ad7d233c6b91d21508536d3"}},{"ruleId":"D1","level":"warning","message":{"text":"LookupRangeExecutor.intersect (cyclomatic 25): LookupRangeExecutor.intersect has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/VirtualLookupRange.fs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"464652ddd5c0e3b63c9f083f2e717175ea89bf38ca93922d1847c27f418e6557"}},{"ruleId":"D1","level":"warning","message":{"text":"Seq.alignOrdered (cyclomatic 25): Seq.alignOrdered has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/Common/Common.fs"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2e0d2434de5dea97cbe0370477d2dcf1a79fdac57b9b7197485b69ac665a2d"}},{"ruleId":"D1","level":"warning","message":{"text":"FrameUtilsModule.writeCsv (cyclomatic 23): FrameUtilsModule.writeCsv has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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/Deedle/FrameUtils.fs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"9afe4be079a5f074bf7cc520ad644533a779a5097e36eca2e98e72874f5987e5"}},{"ruleId":"D1","level":"warning","message":{"text":"Ranges.restrictRanges (cyclomatic 23): Ranges.restrictRanges has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/Common/Ranges.fs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae22985ad3665053f257033d22670e148759bfd3333263bc06ea321a8d8847e"}},{"ruleId":"D1","level":"warning","message":{"text":"CookieHandling.getAllCookiesFromHeader (cyclomatic 23): CookieHandling.getAllCookiesFromHeader has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: HttpHelpers.setHeaders (cyclomatic 43) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/FSharp.Data/Net/Http.fs"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f37803e649c483890838af3d7b21fd012834640aae081e0324ede558171e886"}},{"ruleId":"D1","level":"warning","message":{"text":"Http.InnerRequest (cyclomatic 23): Http.InnerRequest has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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. This is NOT this file\u0027s highest cyclomatic complexity: HttpHelpers.setHeaders (cyclomatic 43) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/FSharp.Data/Net/Http.fs"},"region":{"startLine":1505}}}],"partialFingerprints":{"codehealthFindingId/v1":"955f672f8679c1ca942d2730f801a9d166bcc13f262eb28b52f1d2f04a8521fa"}},{"ruleId":"D1","level":"warning","message":{"text":"VirtualCsvSource.isOrderedUniqueIndex (cyclomatic 22): VirtualCsvSource.isOrderedUniqueIndex has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/VirtualCsvSource.fs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3a06990c961535aa5f8c0dd73c6390ddaeeeba242e83b943e5b1492ca3aaf4"}},{"ruleId":"D1","level":"warning","message":{"text":"LookupRangeExecutor.remapLookupRangeAfterAddresses (cyclomatic 21): LookupRangeExecutor.remapLookupRangeAfterAddresses has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/VirtualLookupRange.fs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8cdbce473607e9029454933e5903a9603e26f3ab7654068dcd8a03595ed6a3c"}},{"ruleId":"D1","level":"warning","message":{"text":"Reflection.expandVector (cyclomatic 20): Reflection.expandVector has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/FrameUtils.fs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"551593bc4c3dfdf494cbae887406430a05ff79ca536ddc854c9264396d8a98ab"}},{"ruleId":"D1","level":"warning","message":{"text":"Ranges.flattenRanges (cyclomatic 18): Ranges.flattenRanges has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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/Deedle/DelayedSeries.fs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"5776e36d17b5c1001c52e4561da8258e2fdafa2b61d9a685cdb3ccf75bab1f1d"}},{"ruleId":"D1","level":"warning","message":{"text":"Stats.interpolateLinearWith (cyclomatic 17): Stats.interpolateLinearWith has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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/Deedle/Stats.fs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"a988334a93988b3358582d7f4adc36858cea6211b12544db710a4a45159a4ed7"}},{"ruleId":"D1","level":"warning","message":{"text":"JoinHelpers.createJoinTransformation (cyclomatic 17): JoinHelpers.createJoinTransformation has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/JoinHelpers.fs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"71dcac620d1b323905e68a41ca814ba1c585f9ddf9c311fbded73ee67dfdecb0"}},{"ruleId":"D1","level":"warning","message":{"text":"VirtualCsvSource.createConcatenatedFrame (cyclomatic 16): VirtualCsvSource.createConcatenatedFrame has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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/Deedle/VirtualCsvSource.fs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9cec01a79b35b62ed3a89e30acfc878a006405f7ae2ba9fae21b4b840eee79"}},{"ruleId":"D1","level":"warning","message":{"text":"IndexUtilsModule.binarySearch (cyclomatic 16): IndexUtilsModule.binarySearch has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/VirtualFrame.fs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba2b3de78e0c957f3488471acb2323c5f0a6f87d3977d4b061421c6b557f432"}},{"ruleId":"D1","level":"warning","message":{"text":"FrameUtilsModule.jsonFormatValue (cyclomatic 16): FrameUtilsModule.jsonFormatValue has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/FrameUtils.fs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"1869e07178dc6225528dca841072dd9bdffb11e2951d01ec5dd9c4ae649abe6c"}},{"ruleId":"D1","level":"warning","message":{"text":"FrameUtilsModule.writeJson (cyclomatic 16): FrameUtilsModule.writeJson has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/FrameUtils.fs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"133f4e5770e81d98e32280957ca8bcbdc01a5a1f6ec7805e6328de12ceefea84"}},{"ruleId":"D1","level":"warning","message":{"text":"LinearIndexBuilder.Deedle.Indices.IIndexBuilder.Resample (cyclomatic 16): LinearIndexBuilder.Deedle.Indices.IIndexBuilder.Resample has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/Indices/LinearIndex.fs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"04493ae1fd34ef167445dbd23e835a0b8ef5c639dab97697fb2f8cfa033ead60"}},{"ruleId":"D2","level":"warning","message":{"text":"Implementation.batchesToFrame (cognitive 284): Implementation.batchesToFrame has cognitive complexity 284 (threshold 15). Drivers by points: loops 30 (158 pts), if/else 30 (114 pts), match/switch 3 (12 pts) (nesting depth added 221). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/Deedle.Arrow/Arrow.fs holds 3 of the 45 methods over the threshold \u2014 including the worst \u2014 and 362 of the 1247 points over it (29%), 2.5\u00D7 the next-largest file (src/Deedle/Vectors/ArrayVector.fs at 142). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle.Arrow/Arrow.fs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"177f07d4902a9aec0fca82747724361c735271d823a974274e45b0c9f6e8c7d5"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayVectorBuilder.Deedle.Vectors.IVectorBuilder.Build (cognitive 157): ArrayVectorBuilder.Deedle.Vectors.IVectorBuilder.Build has cognitive complexity 157 (threshold 15). Drivers by points: if/else 31 (82 pts), loops 12 (43 pts), match/switch 10 (23 pts), boolean chains 9 (nesting depth added 95). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/Vectors/ArrayVector.fs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"80408afd78f3518a0b0cc372eae293aea506acd00b80f0acb30378969bf70d32"}},{"ruleId":"D2","level":"warning","message":{"text":"Implementation.readColumn (cognitive 104): Implementation.readColumn has cognitive complexity 104 (threshold 15). Drivers by points: if/else 66 (103 pts), boolean chains 1 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle.Parquet/Parquet.fs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"c060232f5f878757e722c3fc41c31c6ba1c93aa7083f7f07d5e897f688e4df89"}},{"ruleId":"D2","level":"warning","message":{"text":"Implementation.columnToArrowArray (cognitive 78): Implementation.columnToArrowArray has cognitive complexity 78 (threshold 15). Drivers by points: match/switch 13 (39 pts), loops 13 (26 pts), if/else 13 (nesting depth added 39). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/Deedle.Arrow/Arrow.fs holds 3 of the 45 methods over the threshold \u2014 including the worst \u2014 and 362 of the 1247 points over it (29%), 2.5\u00D7 the next-largest file (src/Deedle/Vectors/ArrayVector.fs at 142). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle.Arrow/Arrow.fs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f64ed9899e1f0d3acae3082e24f2cb3544588a7813e985a9d1e6f8fd13dee0"}},{"ruleId":"D2","level":"warning","message":{"text":"LookupRangeExecutor.remapLookupRangeAfterStep (cognitive 74): LookupRangeExecutor.remapLookupRangeAfterStep has cognitive complexity 74 (threshold 15). Drivers by points: if/else 31 (63 pts), match/switch 3 (8 pts), boolean chains 3 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/VirtualLookupRange.fs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"90247fae944043beebe415e26316c82e70e5130baf66ea7b942cf68e84f37944"}},{"ruleId":"D2","level":"warning","message":{"text":"VirtualCsvSource.isOrderedUniqueIndex (cognitive 71): VirtualCsvSource.isOrderedUniqueIndex has cognitive complexity 71 (threshold 15). Drivers by points: if/else 14 (42 pts), match/switch 4 (23 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 48). To reduce it, flatten the nesting: this score is depth rather than breadth \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/Deedle/VirtualCsvSource.fs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9078717296b6fbd008d3ab5489d24400d5f587ba2faea198baabfc931b4e257"}},{"ruleId":"D2","level":"warning","message":{"text":"Ranges.lookup (cognitive 60): Ranges.lookup has cognitive complexity 60 (threshold 15). Drivers by points: if/else 24 (41 pts), loops 2 (10 pts), boolean chains 9 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/Common/Ranges.fs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfff30cb481278c4528b827b0439dc438539e5529e3442974101e34714996be"}},{"ruleId":"D2","level":"warning","message":{"text":"FrameUtilsModule.readCsv (cognitive 57): FrameUtilsModule.readCsv has cognitive complexity 57 (threshold 15). Drivers by points: if/else 26 (34 pts), match/switch 8 (13 pts), loops 5 (10 pts) (nesting depth added 18). To reduce it, split the body: most of this score is breadth rather than depth \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/Deedle/FrameUtils.fs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5abcfc5bdf70e7f2902a5304e99bb802f67661fafd5d1ec6b44a71083c12dbb"}},{"ruleId":"D2","level":"warning","message":{"text":"Seq.alignOrdered (cognitive 49): Seq.alignOrdered has cognitive complexity 49 (threshold 15). Drivers by points: if/else 20 (36 pts), boolean chains 6, loops 3 (5 pts), error handling 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/Common/Common.fs"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8630c83ab4f23840ac400cc4e341fc7fe151121092f2e7ed38be58710d881b"}},{"ruleId":"D2","level":"warning","message":{"text":"Implementation.arrowArrayToVector (cognitive 45): Implementation.arrowArrayToVector has cognitive complexity 45 (threshold 15). Drivers by points: if/else 28 (42 pts), match/switch 2 (3 pts) (nesting depth added 15). The drivers above price the dispatch low by construction \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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/Deedle.Arrow/Arrow.fs holds 3 of the 45 methods over the threshold \u2014 including the worst \u2014 and 362 of the 1247 points over it (29%), 2.5\u00D7 the next-largest file (src/Deedle/Vectors/ArrayVector.fs at 142). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle.Arrow/Arrow.fs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52853baa5edf240d79af7bb859876c57c5f49330915f61e005c2e1d4733169b"}},{"ruleId":"D2","level":"warning","message":{"text":"Frame\u00602.FormatStrings (cognitive 44): Frame\u00602.FormatStrings has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (20 pts), loops 10 (20 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body: this score is breadth rather than depth \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/Deedle/Frame.fs"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba684502c88514a9703b74e4a3da4cb7efe0768555c9157921515fbb68424cd6"}},{"ruleId":"D2","level":"warning","message":{"text":"LinearIndexBuilder.Deedle.Indices.IIndexBuilder.Resample (cognitive 44): LinearIndexBuilder.Deedle.Indices.IIndexBuilder.Resample has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (32 pts), match/switch 5 (11 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/Indices/LinearIndex.fs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4dd1776408fa26e09ac05b6756559ccd55647bde4844593e6f73fca06525c95"}},{"ruleId":"D2","level":"warning","message":{"text":"LookupRangeExecutor.intersect (cognitive 42): LookupRangeExecutor.intersect has cognitive complexity 42 (threshold 15). Drivers by points: if/else 20 (33 pts), match/switch 3 (6 pts), boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/VirtualLookupRange.fs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b13fcfd69b55ee438dbcc9a8ec017742fc3ad5cfa2099392d92b37f9f26267a"}},{"ruleId":"D2","level":"warning","message":{"text":"Implementation.columnToDataColumn (cognitive 42): Implementation.columnToDataColumn has cognitive complexity 42 (threshold 15). Drivers by points: match/switch 14 (28 pts), if/else 14 (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle.Parquet/Parquet.fs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba302e761887ff06e455b327558adc0001739526a62575c48889c7513e5bb10a"}},{"ruleId":"D2","level":"warning","message":{"text":"Reflection.expandVector (cognitive 40): Reflection.expandVector has cognitive complexity 40 (threshold 15). Drivers by points: loops 5 (18 pts), match/switch 5 (14 pts), if/else 3 (6 pts), boolean chains 2 (nesting depth added 25). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/FrameUtils.fs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"0236626853953b761b5365c2536b14280a55d4bc075cb5f675a43a070576d829"}},{"ruleId":"D2","level":"warning","message":{"text":"Ranges.restrictRanges (cognitive 39): Ranges.restrictRanges has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (29 pts), match/switch 3 (5 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/Common/Ranges.fs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d560177572c3a6aa690789e7e84f89f688483c1d82f4c76a005ea90447247b43"}},{"ruleId":"D2","level":"warning","message":{"text":"FrameUtilsModule.writeJson (cognitive 37): FrameUtilsModule.writeJson has cognitive complexity 37 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 6 (15 pts), match/switch 1 (nesting depth added 24). The drivers above price the dispatch low by construction \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/Deedle/FrameUtils.fs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fdd8ac1dc86ef7d7c44df16aa60dfc8abe833fde967e16e3c0b64cb9231222a"}},{"ruleId":"D2","level":"warning","message":{"text":"CookieHandling.getAllCookiesFromHeader (cognitive 37): CookieHandling.getAllCookiesFromHeader has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 4, loops 3 (4 pts), match/switch 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/FSharp.Data/Net/Http.fs"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"c093bbb3042eb9eab3b572bdb55480b0197f1fc51cbb7760b9f0b9ea09bf087b"}},{"ruleId":"D2","level":"warning","message":{"text":"Pluralizer.adjustCase (cognitive 35): Pluralizer.adjustCase has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (32 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 19). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/FSharp.Data/CommonRuntime/Pluralizer.fs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"7750173ed234469143f599281329be432c7e09d1fb117ed13c62bcf02cf1261b"}},{"ruleId":"D2","level":"warning","message":{"text":"FrameModule.MeltBy (cognitive 33): FrameModule.MeltBy has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 3 (8 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/FrameModule.fs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"c373880ef508a155910106f298baceb28fb33467abda77fe6abbdd57efad6e30"}},{"ruleId":"D2","level":"warning","message":{"text":"LookupRangeExecutor.remapLookupRangeAfterAddresses (cognitive 30): LookupRangeExecutor.remapLookupRangeAfterAddresses has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 4 (11 pts), if/else 4 (10 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/VirtualLookupRange.fs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86c45b73d54c6fcfe9bae59379f060fe9ac6b4eaa40e76e9ce83d777a54d286"}},{"ruleId":"D2","level":"warning","message":{"text":"Seq.alignAllOrderedFew (cognitive 30): Seq.alignAllOrderedFew has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (19 pts), error handling 1 (4 pts), loops 4, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/Common/Common.fs"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7b3bc7027e13fe2de27809754bb01abbc7f760d6e9719afd8815cc760e6d9e"}},{"ruleId":"D2","level":"warning","message":{"text":"Implementation.rowGroupsToFrame (cognitive 29): Implementation.rowGroupsToFrame has cognitive complexity 29 (threshold 15). Drivers by points: loops 4 (15 pts), if/else 8 (14 pts) (nesting depth added 17). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle.Parquet/Parquet.fs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6659dd57e13b2833f5de1f6a6a5ce13dc4797e6223cb65fd8083d040ae675b"}},{"ruleId":"D2","level":"warning","message":{"text":"VirtualVectorBuilder.Deedle.Vectors.IVectorBuilder.Build (cognitive 28): VirtualVectorBuilder.Deedle.Vectors.IVectorBuilder.Build has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 10 (17 pts), loops 2 (5 pts), if/else 3 (4 pts), boolean chains 2 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/Vectors/VirtualVector.fs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"462a20738963cbc11edc6205f76da613235f0b4466abaafe3c4b90a319d8ab57"}},{"ruleId":"D2","level":"warning","message":{"text":"Extraction.extractColData (cognitive 28): Extraction.extractColData has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 7 (28 pts) (nesting depth added 21). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle.MicrosoftML/DataView.fs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd97163462242c3a8ef79faa681f6e363566997da67538f52fca7e4565a44de"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexUtilsModule.binarySearch (cognitive 27): IndexUtilsModule.binarySearch has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/VirtualFrame.fs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34d34060e5e4677e2762dd402e73bf8d9be9554fab594cfca0a3e366ec5adb4"}},{"ruleId":"D2","level":"warning","message":{"text":"Series\u00602.FormatStrings (cognitive 27): Series\u00602.FormatStrings has cognitive complexity 27 (threshold 15). Drivers by points: loops 3 (11 pts), if/else 8 (9 pts), match/switch 1 (3 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/Series.fs"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a549d0b3d056b54ddbf8f5de90ac468714750bf88a01255f9681ee932eb3278"}},{"ruleId":"D2","level":"warning","message":{"text":"FrameUtilsModule.jsonFormatValue (cognitive 25): FrameUtilsModule.jsonFormatValue has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 2, match/switch 2 (nesting depth added 7). The drivers above price the dispatch low by construction \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/Deedle/FrameUtils.fs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85584d8781df90579b223c2c514f6b0e2ad019776626afd43769d70c8842554"}},{"ruleId":"D2","level":"warning","message":{"text":"VirtualVectorSource.fillMissing (cognitive 25): VirtualVectorSource.fillMissing has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 9). The drivers above price the dispatch low by construction \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/Deedle/Vectors/VirtualVector.fs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb804b2f3996dc76a1dd892adb95ffa98d25fb9f0a84c0d2d97e40128b713975"}},{"ruleId":"D2","level":"warning","message":{"text":"FrameUtilsModule.writeCsv (cognitive 24): FrameUtilsModule.writeCsv has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 5 (7 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/FrameUtils.fs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b82e567926e67cca0fcee29359f139615a4a7d417c2db4dd1abc441811a9581"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorHelpers.createTypedRowCreator (cognitive 23): VectorHelpers.createTypedRowCreator has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (8 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \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/Deedle/Vectors/VectorHelpers.fs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"b398441e68847f58e9422cd7ca1b818bab7eb6d07345abcac41551159d11db83"}},{"ruleId":"D2","level":"warning","message":{"text":"Excel.GetFsiSeriesAndFrames (cognitive 23): Excel.GetFsiSeriesAndFrames has cognitive complexity 23 (threshold 15). Drivers by points: if/else 3 (11 pts), match/switch 1 (6 pts), loops 2 (4 pts), boolean chains 2 (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/Deedle.Excel/Excel.fs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"9444be4c4e14ff3c16075c0709f9e41e16f7c4ca6f6d9464d499ad1a08049931"}},{"ruleId":"D2","level":"warning","message":{"text":"FrameModule.Unstack (cognitive 20): FrameModule.Unstack has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 5 (7 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/FrameModule.fs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"676825175dc659b3918902d2f6900b7630949b9770e5c12c5d701d90cc02cd6b"}},{"ruleId":"D2","level":"warning","message":{"text":"Seq.startAndEnd (cognitive 20): Seq.startAndEnd has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (11 pts), loops 4 (9 pts) (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth \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/Deedle/Common/Common.fs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb45930984a85241a6b1db6e2e9dfde8285ce53251851d2b29f761746b5cecc"}},{"ruleId":"D2","level":"warning","message":{"text":"Reflection.expandDictionary (cognitive 19): Reflection.expandDictionary has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (5 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/FrameUtils.fs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d00b5461a1fa126b02d283b07fd2849596625d5e1c712df0c093a2f1c438dbf"}},{"ruleId":"D2","level":"warning","message":{"text":"Http.InnerRequest (cognitive 19): Http.InnerRequest has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9, match/switch 7, loops 2 (3 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \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/Deedle/FSharp.Data/Net/Http.fs"},"region":{"startLine":1505}}}],"partialFingerprints":{"codehealthFindingId/v1":"243943a0c6d603b22085c2472086264628ebc76541e3ca3492be39b9b9fb5eb0"}},{"ruleId":"D2","level":"warning","message":{"text":"Stats.interpolateLinearWith (cognitive 18): Stats.interpolateLinearWith has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 6 (7 pts) (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/Stats.fs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a49214055ca430fd84964089ff84ca2f699ba8add2a22047df5079d0b5fa70"}},{"ruleId":"D2","level":"warning","message":{"text":"JoinHelpers.createJoinTransformation (cognitive 18): JoinHelpers.createJoinTransformation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 7, match/switch 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/JoinHelpers.fs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f1738979d25d4ab10f6452e7a621c4a6952ce2c1bc658912de7104d8166346"}},{"ruleId":"D2","level":"warning","message":{"text":"CsvParsing.splitCsvLine (cognitive 17): CsvParsing.splitCsvLine has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/VirtualCsvSource.fs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"835bc5f8b3eeec6e469d70603d8afbbfd6b96951c065e2beb06ba2bb686e0626"}},{"ruleId":"D2","level":"warning","message":{"text":"CycleInference.tryDetectOptional (cognitive 17): CycleInference.tryDetectOptional has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 4 (5 pts), loops 1 (3 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/VirtualLookupRange.fs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaca5d2740c2b6ec353e2d1f5d01751af4a2e48ca87e0076cf9467aea36d9dc9"}},{"ruleId":"D2","level":"warning","message":{"text":"LookupRangeExecutor.clipLookupRange (cognitive 17): LookupRangeExecutor.clipLookupRange has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \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/Deedle/VirtualLookupRange.fs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3409d673f58daaf22ffc5af2edb201b61d1a48be8950cefe55046b0e08c3f3"}},{"ruleId":"D2","level":"warning","message":{"text":"FrameUtilsModule.expandVectors (cognitive 17): FrameUtilsModule.expandVectors has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (6 pts), match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/FrameUtils.fs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5be316432fabc7f21833c84ca2f81e173144b84ca6781a7763750984da1fda"}},{"ruleId":"D2","level":"warning","message":{"text":"Frame\u00602.Zip (cognitive 17): Frame\u00602.Zip has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 4 (8 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/Frame.fs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b502ed020bb708c730f0551cb27bf8f5ec159906b4dcfd8d873ce62cdf0545"}},{"ruleId":"D2","level":"warning","message":{"text":"Virtual.MaterializeFloatBatches (cognitive 16): Virtual.MaterializeFloatBatches has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 4 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/VirtualFrame.fs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"bddd40cd44e2874da2ccb8a9124518a24634b611972013da822878999821fff1"}},{"ruleId":"D2","level":"warning","message":{"text":"Stats.quantile (cognitive 16): Stats.quantile has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/Stats.fs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2660487b011b1ff99356165c2793597be3f39aab9b4b8ac5218bd6909eaeb49"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Frame\u00602: TooManyMethods \u2014 154 methods. The bar is 30 methods; this is 124 over it, 5.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/Frame.fs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d98d55c10e89a5219549b74e64778819301fbd2622bdac45cfd14bdbb64bea"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Series\u00602: TooManyMethods \u2014 150 methods. The bar is 30 methods; this is 120 over it, 5.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/Series.fs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1cbd3ba300e41fc5b3fad5775db1ebd2e86a3131a053e6e30135b72d08f8c0f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FrameExtensions: TooManyMethods \u2014 81 methods. The bar is 30 methods; this is 51 over it, 2.70\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/FrameExtensions.fs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37910a40bbbea9646f500574dc76784acca1abd778d091f67701d68070fa214"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Stats: TooManyMethods \u2014 67 methods. The bar is 30 methods; this is 37 over it, 2.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/Stats.fs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c516d692e7f3ecf08ff6d26b74e0d82cd3f3856ac7207e9dd66c373553872c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Deedle/Frame.fs: FileTooLong \u2014 935 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 435 over it, 1.87\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/Deedle/Frame.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb3ad78e4a61c0b3ab8f6844ee78b6f388c44dc72c01800cb6714e03c696f7b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SeriesExtensions: TooManyMethods \u2014 55 methods. The bar is 30 methods; this is 25 over it, 1.83\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/SeriesExtensions.fs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"80422272c91a99e645fc347744d9c649096a2349551c784ef936d3c1522dea26"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Common/Common.fs: FileTooLong \u2014 858 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 34 functions. The bar is 500 significant lines; this is 358 over it, 1.72\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/Deedle/Common/Common.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce86cb842fdab7b4b4b3850c40f55c6b8f479c746a54e004d67c0e7b3ecb5b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Net/Http.fs: FileTooLong \u2014 779 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 46 functions. The bar is 500 significant lines; this is 279 over it, 1.56\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/Deedle/FSharp.Data/Net/Http.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e672df3620149f3d96387ca9d2ab024ccff60736bd1838564c82ee47236d08"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Deedle/FrameModule.fs: FileTooLong \u2014 776 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 147 functions. The bar is 500 significant lines; this is 276 over it, 1.55\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/Deedle/FrameModule.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0e2a75937647470664783b58b4f0c64f320cbffae21b2478f1f321b4536030"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Deedle/Series.fs: FileTooLong \u2014 726 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 226 over it, 1.45\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/Deedle/Series.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c53ae40056ca077d0560d2da956b3ecdcd5a29393a80a8b24fbefe9abbfd21"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Deedle/SeriesModule.fs: FileTooLong \u2014 615 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 147 functions. The bar is 500 significant lines; this is 115 over it, 1.23\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/Deedle/SeriesModule.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"985740c24014e25eb4b60ab3ce87d22ff834b2ac529c252f56cc6cc0365186c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Deedle/FrameUtils.fs: FileTooLong \u2014 574 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 74 over it, 1.15\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/Deedle/FrameUtils.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64590a934883ecb07e7af8623ce5257d9e5722b166821ed8f7755905d83c4ee8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Deedle.Excel/Excel.fs: FileTooLong \u2014 573 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 45 functions. The bar is 500 significant lines; this is 73 over it, 1.15\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/Deedle.Excel/Excel.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1242f69119554e31b13efdab20499544ce008a5ca999f16e6668634291a6a9d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Deedle/FrameExtensions.fs: FileTooLong \u2014 531 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 31 over it, 1.06\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/Deedle/FrameExtensions.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"080ac3500792ba1001e80625e947eecb546cd6149c91e5915a379fb411641a7d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Deedle/Stats.fs: FileTooLong \u2014 529 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 29 over it, 1.06\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/Deedle/Stats.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0eaf43c9fb6c50215638fe7fae5347635e88a8e9d5b02985bac84b82def28d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Deedle.Arrow/Arrow.fs: FileTooLong \u2014 526 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 26 over it, 1.05\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/Deedle.Arrow/Arrow.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffdc2d41af3e651f8e4ad40c215a3c722a2b3ea0f1923c9306b2c92fc77003f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Vectors/VectorHelpers.fs: FileTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 21 over it, 1.04\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/Deedle/Vectors/VectorHelpers.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d48ada401c99ab28a704ba445730138f36673bf4affdfa959827ec0ed57316"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Deedle/VirtualLookupRange.fs: FileTooLong \u2014 501 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1 over it, 1.00\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/Deedle/VirtualLookupRange.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7736f27b5918f0e298df87a97cbce06e125a0c8f81ac5d7173633ba15c3878b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): src/Deedle.Parquet/Parquet.fs:394-416 | src/Deedle.Parquet/Parquet.fs:439-462 \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/Deedle.Parquet/Parquet.fs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"62546ccdac6d15fd28289c155e7e9479af2161847af28f5fe95159e4898b7bc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/Deedle/Stats.fs:608-626 | src/Deedle/Stats.fs:627-645 \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/Deedle/Stats.fs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04a69fdf9ca6e88d012d1573b0feb5b9bae566029a1cb1b2b3596f883cef215"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/Deedle.Arrow/Arrow.fs:413-428 | src/Deedle.Parquet/Parquet.fs:341-357 \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/Deedle.Parquet/Parquet.fs:341\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. 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/Deedle.Arrow/Arrow.fs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"67aa10f790d22771448f59cf47a7930524b9fe53cf0fd73df5a528a18b0a9b48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): src/Deedle/Vectors/VirtualVector.fs:326-341 | src/Deedle/Vectors/VirtualVector.fs:420-434 \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/Deedle/Vectors/VirtualVector.fs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a998ceeb6b8d1504c4d234b574674ffeddfc1eeb9fffb3ddabf5fc8975115f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/Deedle/FrameModule.fs:1828-1846 | src/Deedle/FrameModule.fs:1852-1867 \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/Deedle/FrameModule.fs"},"region":{"startLine":1828}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2134bd622f31a546e66d0fac0d6c22e796366e6306b36030fce1c0926f787ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 3): src/Deedle/FrameModule.fs:1979-1993 | src/Deedle/FrameModule.fs:1999-2012 | src/Deedle/FrameModule.fs:2020-2034 \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/Deedle/FrameModule.fs"},"region":{"startLine":1979}}}],"partialFingerprints":{"codehealthFindingId/v1":"c701b182020b14fad07e4aaf719c13701a274a48b06bb4894c0535eb4ded915b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/Deedle/VirtualLookupRange.fs:213-227 | src/Deedle/VirtualLookupRange.fs:232-246 \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/Deedle/VirtualLookupRange.fs:213\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/Deedle/VirtualLookupRange.fs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"2540f31e9fcea549a5d70abb5b90e1972cdee382ada78fd0420364ed58f39684"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): src/Deedle/FrameUtils.fs:332-346 | src/Deedle/FrameUtils.fs:446-457 \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/Deedle/FrameUtils.fs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39a2a2c6824f556286815da816bcd6df48bd01b26ade4ae6c61d8267b2cd9df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/Deedle/VirtualFrame.fs:265-279 | src/Deedle/VirtualFrame.fs:327-341 \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/Deedle/VirtualFrame.fs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"db02eb6e57d010496ee808972ab7882581135d89fe3b66e776eb97ecee171f0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/Deedle/VirtualFrame.fs:281-294 | src/Deedle/VirtualFrame.fs:343-357 \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/Deedle/VirtualFrame.fs:281\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/Deedle/VirtualFrame.fs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"699447bfb4e1900ced4193b3affb1848b02f1e555e607a8b533850ed9313807c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 6): src/Deedle/FSharp.Data/Net/Http.fs:1624-1637 | src/Deedle/FSharp.Data/Net/Http.fs:1647-1660 | src/Deedle/FSharp.Data/Net/Http.fs:1676-1688 | src/Deedle/FSharp.Data/Net/Http.fs:1705-1718 | src/Deedle/FSharp.Data/Net/Http.fs:1729-1742 | src/Deedle/FSharp.Data/Net/Http.fs:1753-1765 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/FSharp.Data/Net/Http.fs"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8cdb375a052f090c21b4ff5e5fbc15ef65eb055c3097807486c74b32a5536b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/Deedle.MathNetNumerics/Finance.fs:89-101 | src/Deedle.MathNetNumerics/Finance.fs:115-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/Deedle.MathNetNumerics/Finance.fs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"9437e371f8a35e83877d0ad3fae6dca13c68d40060b98838f3cbd27be73d9314"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Deedle/FrameModule.fs:2041-2051 | src/Deedle/FrameModule.fs:2058-2069 \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/Deedle/FrameModule.fs:2041\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/Deedle/FrameModule.fs"},"region":{"startLine":2041}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04b750b54f1698d3a842edbd98c7fd0a024da568decadfab0cd157b9f560f4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20139 lines \u00D7 10): src/Deedle.Parquet/Parquet.fs:152-155 | src/Deedle.Parquet/Parquet.fs:157-165 | src/Deedle.Parquet/Parquet.fs:168-176 | src/Deedle.Parquet/Parquet.fs:179-187 | src/Deedle.Parquet/Parquet.fs:190-198 | src/Deedle.Parquet/Parquet.fs:201-209 | src/Deedle.Parquet/Parquet.fs:212-220 | src/Deedle.Parquet/Parquet.fs:223-231 | src/Deedle.Parquet/Parquet.fs:234-242 | src/Deedle.Parquet/Parquet.fs:245-253 \u2014 all 10 copies are in the same file, so extract the block into one function there and call it from every one of those sites \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/Deedle.Parquet/Parquet.fs:157\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. 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/Deedle.Parquet/Parquet.fs:165\u0060 calls \u0060n\u0060 and \u0060src/Deedle.Parquet/Parquet.fs:155\u0060 does not \u2014 after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle.Parquet/Parquet.fs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"e700430cef38f2a7a538efb9a0528403648ea07832f87a875b12c82e48517b85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Deedle/FSharp.Data/Net/Http.fs:1720-1728 | src/Deedle/FSharp.Data/Net/Http.fs:1744-1752 \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/Deedle/FSharp.Data/Net/Http.fs:1720\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/Deedle/FSharp.Data/Net/Http.fs"},"region":{"startLine":1720}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33e6060a9257c39da7113873369b1086da2e57609c0d8735da44ca09041a452"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Deedle/Vectors/VectorHelpers.fs:70-78 | src/Deedle/Vectors/VectorHelpers.fs:113-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/Deedle/Vectors/VectorHelpers.fs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"bededcbcc5af8678bf14a3b125bb19a6cb8f1b824f33f4596cad5170f3d4a2e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/Deedle/VirtualLookupRange.fs:149-157 | src/Deedle/VirtualLookupRange.fs:175-182 \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/Deedle/VirtualLookupRange.fs:149\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/Deedle/VirtualLookupRange.fs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d96237b9c4884eeb4c3bd68987392a7d360284aa04897d33a472743c1c2930e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Deedle/Stats.fs:882-890 | src/Deedle/Stats.fs:905-913 \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/Deedle/Stats.fs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64c272fe5df32d64cc8cbe6259c047bde0329d8c8eaeefc7f1e2baac045cbeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Deedle.Parquet/Parquet.fs:372-381 | src/Deedle.Parquet/Parquet.fs:429-437 \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/Deedle.Parquet/Parquet.fs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dec6acf08ffda4dabe5adae3a4c12b26f5077343841cc7d878199262f32d8ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Deedle/Common/Common.fs:1185-1192 | src/Deedle/Common/Common.fs:1241-1251 \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/Deedle/Common/Common.fs:1241\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/Deedle/Common/Common.fs"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"63107e6a319bf05e5e026739291374bcafec843ecb13557dea59bb2c1f85f44e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Deedle/Series.fs:847-854 | src/Deedle/Series.fs:870-877 \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/Deedle/Series.fs:847\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/Deedle/Series.fs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4699cdbcba6af009beb539288a9cae14faf19a2e0e45b4d8c66c7cf37deb8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Deedle/FrameModule.fs:1201-1208 | src/Deedle/FrameModule.fs:1211-1218 \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/Deedle/FrameModule.fs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc4e73d1f6394b57b2b1a15bb58bc253d1af6febcf081ef04bdd60c5384a7ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/Deedle.ExcelReader/ExcelReader.fs:36-42 | src/Deedle.ExcelReader/ExcelReader.fs:56-62 | src/Deedle.ExcelReader/ExcelReader.fs:77-83 \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/Deedle.ExcelReader/ExcelReader.fs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee547cce4912eb4d331426ddcb1c98e3eec3c4470d1a274433fddb70df5ea66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Deedle.Arrow/Arrow.fs:219-225 | src/Deedle.Arrow/Arrow.fs:391-397 \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/Deedle.Arrow/Arrow.fs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6423ba05cb2e5bdf3ca49b8e5e863159d2318d4ff87942f4e60aca293d2af2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Deedle/Vectors/ArrayVector.fs:337-343 | src/Deedle/Vectors/VectorHelpers.fs:324-330 \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. 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/Deedle/Vectors/ArrayVector.fs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"0911788ba63f27abbd22588e79a2a4bcc7d4ffff58b84b69044cfb155858c4e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Deedle/FrameUtils.fs:534-540 | src/Deedle/FrameUtils.fs:548-554 \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/Deedle/FrameUtils.fs:532\u0060 calls \u0060Write\u0060 and \u0060src/Deedle/FrameUtils.fs:546\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/Deedle/FrameUtils.fs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf21f4de48658016e7554c5fb6dbd32988e6e9300207a35ffbeec7890f6ce9f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Deedle/FrameModule.fs:1972-1978 | src/Deedle/FrameModule.fs:2013-2019 \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/Deedle/FrameModule.fs"},"region":{"startLine":1972}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b82843995f3dfd686fd41923bb950c84f350b9f308104d8057a4f28834337ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Deedle.MathNetNumerics/Finance.fs:18-24 | src/Deedle.MathNetNumerics/Finance.fs:87-93 \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/Deedle.MathNetNumerics/Finance.fs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4bea1c553711018af106c2ab459c10f31af7c14c17bc52c952e90b666465c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 10): src/Deedle.Parquet/Parquet.fs:157-162 | src/Deedle.Parquet/Parquet.fs:168-173 | src/Deedle.Parquet/Parquet.fs:179-184 | src/Deedle.Parquet/Parquet.fs:190-195 | src/Deedle.Parquet/Parquet.fs:201-206 | src/Deedle.Parquet/Parquet.fs:212-217 | src/Deedle.Parquet/Parquet.fs:223-228 | src/Deedle.Parquet/Parquet.fs:234-239 | src/Deedle.Parquet/Parquet.fs:245-250 | src/Deedle.Parquet/Parquet.fs:256-261 \u2014 all 10 copies are in the same file, so extract the block into one function there and call it from every one of those sites \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/Deedle.Parquet/Parquet.fs:157\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/Deedle.Parquet/Parquet.fs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"743c64ea1b15a60dc13f0f43aa10e964ba6e2797322af4232fcbf2f2be00fcb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 9): src/Deedle.Arrow/Arrow.fs:52-57 | src/Deedle.Arrow/Arrow.fs:59-64 | src/Deedle.Arrow/Arrow.fs:66-71 | src/Deedle.Arrow/Arrow.fs:73-78 | src/Deedle.Arrow/Arrow.fs:80-85 | src/Deedle.Arrow/Arrow.fs:87-92 | src/Deedle.Arrow/Arrow.fs:94-99 | src/Deedle.Arrow/Arrow.fs:101-106 | src/Deedle.Arrow/Arrow.fs:108-113 \u2014 all 9 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle.Arrow/Arrow.fs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"24729d2c5b20c9c25956fe03d409238ad73fc0d6d7926a9416dcb6d9a1762246"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/Deedle.MathNetNumerics/Finance.fs:20-25 | src/Deedle.MathNetNumerics/Finance.fs:89-94 | src/Deedle.MathNetNumerics/Finance.fs:115-120 \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/Deedle.MathNetNumerics/Finance.fs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"927ac5ecea83937e4d038cb61b36bd661ba0ecaa63ab326836be4effadb9b8f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Deedle/Indices/LinearIndex.fs:150-155 | src/Deedle/Indices/LinearIndex.fs:162-167 \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/Deedle/Indices/LinearIndex.fs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9faeb42f046a38d710c7fc7bbb377611b901d112309b7021fddde49c36df505"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Deedle/DelayedSeries.fs:50-55 | src/Deedle/DelayedSeries.fs:135-141 \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/Deedle/DelayedSeries.fs:135\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/Deedle/DelayedSeries.fs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d5b6321da8d710efcc1145753401dbb688f252f38e4cf6a6bcc5b8e3e5cfd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 10): src/Deedle.Arrow/Arrow.fs:52-56 | src/Deedle.Arrow/Arrow.fs:59-63 | src/Deedle.Arrow/Arrow.fs:66-70 | src/Deedle.Arrow/Arrow.fs:73-77 | src/Deedle.Arrow/Arrow.fs:80-84 | src/Deedle.Arrow/Arrow.fs:87-91 | src/Deedle.Arrow/Arrow.fs:94-98 | src/Deedle.Arrow/Arrow.fs:101-105 | src/Deedle.Arrow/Arrow.fs:108-112 | src/Deedle.Arrow/Arrow.fs:115-119 \u2014 all 10 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle.Arrow/Arrow.fs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae0d5b95ce205225e138490f2f677d8f6d8b9dcccc0e2a586d407a1ff72ea07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 10): src/Deedle.Parquet/Parquet.fs:52-56 | src/Deedle.Parquet/Parquet.fs:58-62 | src/Deedle.Parquet/Parquet.fs:64-68 | src/Deedle.Parquet/Parquet.fs:70-74 | src/Deedle.Parquet/Parquet.fs:76-80 | src/Deedle.Parquet/Parquet.fs:82-86 | src/Deedle.Parquet/Parquet.fs:88-92 | src/Deedle.Parquet/Parquet.fs:94-98 | src/Deedle.Parquet/Parquet.fs:100-104 | src/Deedle.Parquet/Parquet.fs:106-110 \u2014 all 10 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle.Parquet/Parquet.fs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d1f2bb7cd3f93975b780eefe442d7ade2c7989e9d4c68979027f44194e9c9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/Deedle/FrameExtensions.fs:1573-1577 | src/Deedle/FrameExtensions.fs:1589-1593 | src/Deedle/FrameExtensions.fs:1595-1599 \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/Deedle/FrameExtensions.fs"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8083cc025231f12a6999d1ae42d2a9931675cadceb08b45fe0a6d6739a75553"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/Deedle.MathNetNumerics/Stats.fs:218-222 | src/Deedle.MathNetNumerics/Stats.fs:231-235 | src/Deedle.MathNetNumerics/Stats.fs:244-248 \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/Deedle.MathNetNumerics/Stats.fs:218\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/Deedle.MathNetNumerics/Stats.fs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a7396b638dd20ab345a41ce27a964830662c9c8b66622abccf2cc46520be66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/Deedle.MathNetNumerics/Finance.fs:18-22 | src/Deedle.MathNetNumerics/Finance.fs:54-58 | src/Deedle.MathNetNumerics/Finance.fs:87-91 \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/Deedle.MathNetNumerics/Finance.fs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a61fea2cf6d462e66cd8ad8cc04dff8b10d8107b7942fa36b031aba1cd9c327"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Deedle/Frame.fs:1355-1359 | src/Deedle/Series.fs:1270-1274 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/Frame.fs"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dec5ea4c82080887ba5e2fc95ee22431b6bd9ab5d050099e6a2828801007e54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Deedle/Stats.fs:948-952 | src/Deedle/Stats.fs:994-998 \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/Deedle/Stats.fs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"a958297e3dd900e12a3eab9ba1826e495c44ef2c2edb307aa7ec465aa1d0729f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Deedle.Excel/Excel.fs:412-416 | src/Deedle.Excel/Excel.fs:423-427 \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/Deedle.Excel/Excel.fs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f1b8ab084a1928ec9497e445dc8eb093eba05438f974c8a089fca1e1784659"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Deedle.MathNetNumerics/LinearAlgebra.fs:257-261 | src/Deedle.MathNetNumerics/LinearAlgebra.fs:272-276 \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/Deedle.MathNetNumerics/LinearAlgebra.fs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"2adcb46c0e397e82f86c8fc46db93c6a86dc8aa4524f6b178ad0d5b76c77bb11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Deedle/FrameModule.fs:1191-1198 | src/Deedle/FrameModule.fs:1211-1218 \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/Deedle/FrameModule.fs"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb60feed8c212fa95b6cbd18642b1e8150fb9272f06a7028f5a924e11461e7ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Deedle.Arrow/Arrow.fs:580-584 | src/Deedle.Parquet/Parquet.fs:477-481 \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/Deedle.Arrow/Arrow.fs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7a2a1004ee3c8efcfa84b795e08a3b1afc84374bbdc6dc4f444ca5258afba7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Deedle/VirtualLookupRange.fs:316-320 | src/Deedle/VirtualLookupRange.fs:345-349 \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/Deedle/VirtualLookupRange.fs:316\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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/Deedle/VirtualLookupRange.fs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"549db130212b6a9a60bf43ac561f485b79427d8a1ce1f37b0391237de1a87003"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Deedle/FrameExtensions.fs:114-119 | src/Deedle/FrameExtensions.fs:148-153 \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/Deedle/FrameExtensions.fs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76fa017cc839d11774dcba7430f06bded1fdd5f926159937500c7ce3a87c733"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 no coverage collector is wired up: Coverage NOT MEASURED: \u0060--collect:\u0022XPlat Code Coverage\u0022\u0060 names a data collector that ships in the \u0060coverlet.collector\u0060 package, and this repository wires up none \u2014 no test project references it and no runsettings declares one. The absence of coverage here is therefore not evidence about the suite or about our analyzer environment: without a collector, \u0060--collect\u0060 produces nothing even from a suite that builds and passes. Add a \u0060coverlet.collector\u0060 PackageReference to the test project(s) (or commit the Cobertura/OpenCover/lcov report your CI produces) and real coverage will be measured. It is excluded from the score rather than counted as a near-zero defect."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D12","level":"error","message":{"text":"Vulnerable: OpenTelemetry.Api: OpenTelemetry.Api 1.15.1 \u2014 Moderate severity. https://github.com/advisories/[GHSA redacted]"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"957e7394425c022fd913b071ba582e11b6cf3730adf2b692a39ff89ffff37caf"}},{"ruleId":"D12","level":"error","message":{"text":"Vulnerable: Snappier: Snappier 1.3.0 \u2014 High severity. https://github.com/advisories/[GHSA redacted]"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d74c26729709d1d86f5e15917f3121d20e5cf7e6bc08d66a9a1b75e13e8186ed"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 1 significant file(s) lose their only recent owner: src/Deedle/Common/Address.fs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"68b5ae53e6bc9ea535d529287e7d70df7a983cd2da1b54db0c9de4e60f91602e"}},{"ruleId":"D17","level":"error","message":{"text":"FileScopedPragmaDisable: #pragma warning disable 1591 \u2014 the disable has no matching restore anywhere in this file, so it does not end with the construct that needed it: it runs to the end of the file and silences the rule for everything written below, including code added years later that nobody weighed against it. Close it with the matching restore directive immediately after the construct it covers \u2014 that alone turns a standing exemption into a scoped one \u2014 or fix the cause and drop the directive entirely."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/Deedle.CSharp.Tests/ArrowTests.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f23c0ac4d8b9f272c8d2053a9f221b5fd23ed79344d8b39407ec2975779c2f"}},{"ruleId":"D17","level":"error","message":{"text":"FileScopedPragmaDisable: #pragma warning disable 1591 \u2014 the disable has no matching restore anywhere in this file, so it does not end with the construct that needed it: it runs to the end of the file and silences the rule for everything written below, including code added years later that nobody weighed against it. Close it with the matching restore directive immediately after the construct it covers \u2014 that alone turns a standing exemption into a scoped one \u2014 or fix the cause and drop the directive entirely."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/Deedle.CSharp.Tests/ExcelReaderTests.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32feb3e1bfb99b7a971f41e5c811029f61218e01f2f0d82d092a8cf966c4383"}},{"ruleId":"D17","level":"error","message":{"text":"FileScopedPragmaDisable: #pragma warning disable 1591 \u2014 the disable has no matching restore anywhere in this file, so it does not end with the construct that needed it: it runs to the end of the file and silences the rule for everything written below, including code added years later that nobody weighed against it. Close it with the matching restore directive immediately after the construct it covers \u2014 that alone turns a standing exemption into a scoped one \u2014 or fix the cause and drop the directive entirely."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/Deedle.CSharp.Tests/Frame.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8453bdf86d7f6e5714eee830e83f578478dad3bdc3c7963cc2ead9be1188636"}},{"ruleId":"D17","level":"error","message":{"text":"FileScopedPragmaDisable: #pragma warning disable 1591 \u2014 the disable has no matching restore anywhere in this file, so it does not end with the construct that needed it: it runs to the end of the file and silences the rule for everything written below, including code added years later that nobody weighed against it. Close it with the matching restore directive immediately after the construct it covers \u2014 that alone turns a standing exemption into a scoped one \u2014 or fix the cause and drop the directive entirely."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/Deedle.CSharp.Tests/ParquetTests.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e239c81b6479578f9d4768756b6794610aa5c2b2b747136b47140aaac26716f7"}},{"ruleId":"D17","level":"error","message":{"text":"FileScopedPragmaDisable: #pragma warning disable 1591 \u2014 the disable has no matching restore anywhere in this file, so it does not end with the construct that needed it: it runs to the end of the file and silences the rule for everything written below, including code added years later that nobody weighed against it. Close it with the matching restore directive immediately after the construct it covers \u2014 that alone turns a standing exemption into a scoped one \u2014 or fix the cause and drop the directive entirely."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/Deedle.CSharp.Tests/Series.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b756463fc1b55bfe13126b346d23937716e6b8f577234983d81d7353fb9d90"}},{"ruleId":"D17","level":"warning","message":{"text":"CommentedOutCode: 3 consecutive commented-code lines"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/Deedle.CSharp.Tests/Series.cs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed98c7bcaffde87c9e73fcd293c2c139b09b4ae8ebab4b0f621b5fca052cdfa"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no installation or build instructions: The Deedle library\u0027s build steps (restore, paket restore, ./build.sh / .\\build.ps1) and the NuGet badge links appear only inline; no install or setup section. Add an Install/Setup section covering prerequisites (.NET SDK 9.0\u002B), dotnet tool restore, and the exact commands for building on Linux/Mac and Windows."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa6bfcd5c6ae231d1b8ee99bced50b832d1f61cde9da6cbb533467b879a57db"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no architecture or design documentation: The architecture/design docs are present but not shown in this summary; no documentation for the Parquet.Net library\u0027s internal structure or cross-package dependencies. Add an Architecture/Design section covering supported .NET targets, file format handling, and how low-, high-, and untyped APIs interact."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"086460f2da112d94904fac5439f54a7780bc7778ff9375a067e428a1cc9a8a4c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Run this twice, to check that instance references are right\u0022 \u2014 "},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/Deedle.CSharp.Tests/Frame.cs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b956fe87c4aa0788c6459aef0163f72406be6a65c44b15f0f7a18b887f90a0"}},{"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":"8fcab4022004b1db2d9321d9e6fdca20dcc55cc29f4e4db61d647b144d80581d"},"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"}}]},{"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":"247c2da5205e8879b73d7c0dd2870cf44c66c683263a106aa870ecf3d9bec025"},"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"}}]},{"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":"6ae9e081d8bed87d8a4c271219c174d37169cf4b9302e8b51c9caa451fd5aa06"},"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"}}]},{"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":"03db26b53ae63ce5cc243727121d53234d3afb90362fdf80de7614f877d39c1a"},"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"}}]},{"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":"d1ab3d7935c0eb0b62005f8f7d3c526816ea2899824315b03de87cdb83c8ab76"},"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"}}]},{"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":"821b5fb4a5b226d80acaa62086ba2bbfc7a36335f8c57c144e32d4e3ffb4afbf"},"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"}}]},{"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":"e182df9e8c4e46f842bb45272b514bffa09a93cd979873504de8bd5245759e8a"},"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"}}]},{"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":"ae39846328633b87d7b7c40ff21a17f4e0c5e464753240a6d692c1c91f13fbe5"},"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"}}]},{"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":"71853be95d5db2263e6987f2002f579e39b4829b7f5732800a1c999443c5ad56"},"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"}}]},{"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":"8b29da248fc5d0adbf40e039e1ed64a985e0b35e03ae8fff44b7c10718c9d71c"},"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"}}]},{"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":"136fdb204cadd78cc15be5727cfe809aee0c97777bdf8ed179336be41d4e2d6c"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"3156cc6ad8d7faab026d04c1c469a2dedbc93e21288260fcdb9f6e26096ba63b"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"ee62fddfad5b87939481e9416916c4990c9ab25cc622e994824878178c8db6fa"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"0790a402945238d33c272b56da845900e479ec28f6f0dbc4db73c5ccf58ac7b1"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D30","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":"7289a1ddb698c7f36b60ac7c323f1d20e8621ec0c64c2af707c2469abc7320cc"}},{"ruleId":"D30","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":"821c074a7ffaaf7830dbe8db95066e8e9124b22b2730a82d4df75728c223c764"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/FSharp.Data/Net/Http.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"affd794e8e7caef8f12f0c108a82468ba97b285eeb8fecb38993445057cdf436"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/Vectors/VirtualVector.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a337f306c9447d3faa5408f97ef14ed09d923736d404060d7978bf9e2dfae8c4"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/VirtualFrame.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9450e646683a610f43cea23ccc0bd69694f18b1388c043edb4e641c9270ce452"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle.Excel/Excel.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa1d2362748f999f59a4ee808accfe001ee58ab5ca69e215a3e8e565730700b"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Deedle/Indices/VirtualIndex.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7f27a4798c6952ce5ceffdbbd17205067f9aaddfee83187cff1a997f4ce272"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 22 smaller file(s) also have no living knowledge \u2014 folded into the freshness score and metrics rather than raised one row each \u2014 most significant first: src/Deedle/Common/Ranges.fs, src/Deedle/Vectors/Vector.fs, src/Deedle.MathNetNumerics/LinearRegression.fs, src/Deedle/FSharp.Data/Csv/CsvRuntime.fs, src/Deedle/Indices/MultiKey.fs, src/Deedle/FSharp.Data/CommonRuntime/StructuralInference.fs, src/Deedle.MathNetNumerics/Stats.fs, src/Deedle.MathNetNumerics/LinearAlgebra.fs (and 14 more) (27 orphaned of 56 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 56 of the 61 production source files in this repository met that bar). 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":"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":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"}},{"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":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"}},{"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":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"}},{"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":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"}},{"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":"0752d0df7434000fcabf1048e2de30a7a1a8b982b3db9a19898c4dec199856b4"}},{"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":"fe274ba5adebde25ca0b3db842e44cbb1aaeb7cfecfbb7215cd452596ba1f4c2"}},{"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"}},{"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":"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 203643 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":[],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}}],"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-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-250","guid":"52ee12e8-390a-7351-b1e6-388afa694e54","name":"CWE-250","shortDescription":{"text":"CWE-250"},"helpUri":"https://cwe.mitre.org/data/definitions/250.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":"CWE-353","shortDescription":{"text":"CWE-353"},"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":"CWE-506","shortDescription":{"text":"CWE-506"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"CWE-522","shortDescription":{"text":"CWE-522"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"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-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"CWE-829","shortDescription":{"text":"CWE-829"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"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":23,"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."]}]}