{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"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"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"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":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"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"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D32","name":"Data Compliance (PII/GDPR)","shortDescription":{"text":"Data Compliance (PII/GDPR)"},"helpUri":"https://codehealth.canine.dev/dimensions/D32","relationships":[{"target":{"id":"CWE-359","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-312","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-200","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-359","CWE-312","CWE-200"],"owasp":"A01:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"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":"ApplyDelta.applyDeltaSingletonStateEff (cyclomatic 31): ApplyDelta.applyDeltaSingletonStateEff has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":2281}}}],"partialFingerprints":{"codehealthFindingId/v1":"75154f5a95b6ad7239b793ab5b4475a912658a8572ea9f91eb440b23187a9b70"}},{"ruleId":"D1","level":"warning","message":{"text":"MapExtImplementation.replaceRange (cyclomatic 30): MapExtImplementation.replaceRange has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":1888}}}],"partialFingerprints":{"codehealthFindingId/v1":"733605da4ef3b57fa5015ccb00b337e9afb6aa7815155b5225138c69effaeaf9"}},{"ruleId":"D1","level":"warning","message":{"text":"MapExtImplementation.choose2Helper (cyclomatic 29): MapExtImplementation.choose2Helper has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":2502}}}],"partialFingerprints":{"codehealthFindingId/v1":"643a0b5716ece2c5170e50224d9007838f2dccab859fe5016fcfab911ca48532"}},{"ruleId":"D1","level":"warning","message":{"text":"ApplyDelta.applyDeltaSingleEff (cyclomatic 27): ApplyDelta.applyDeltaSingleEff has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":2371}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6c7632234af60bf168696d73ccf14a69df3972d1a6a8b171085b60d500189f"}},{"ruleId":"D1","level":"warning","message":{"text":"MapExtImplementation.computeDelta (cyclomatic 26): MapExtImplementation.computeDelta has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":1984}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f56a71aaef8c02e994beb8145b48dacf9fe010ab67c9d859d19210be636dc7a"}},{"ruleId":"D1","level":"warning","message":{"text":"MapExtImplementation.sliceEx (cyclomatic 20): MapExtImplementation.sliceEx has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2c6c132d4e3311576b4fd070b6d2dee4211048ad6cd01720ae99c58a5c2308"}},{"ruleId":"D1","level":"warning","message":{"text":"SetNode.union (cyclomatic 20): SetNode.union has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 7 other methods here (SetNode.xor, SetNode.difference, SetNode.computeDelta, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"496898fbf13346e44fea1711c743c2eb7db0decf1ee34941f7004112d5e9a932"}},{"ruleId":"D1","level":"warning","message":{"text":"SetNode.intersect (cyclomatic 20): SetNode.intersect has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"30fecba1db2327ea38da9371f76e11a3207feaebfad9c26ed134c7aa5d016395"}},{"ruleId":"D1","level":"warning","message":{"text":"SetNode.xor (cyclomatic 20): SetNode.xor has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 7 other methods here (SetNode.union, SetNode.difference, SetNode.computeDelta, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1477}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a9025499885eb92becfd4eecd580310b91fcafecb6cfa3c9bd40a4b96d0c25"}},{"ruleId":"D1","level":"warning","message":{"text":"SetNode.difference (cyclomatic 20): SetNode.difference has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 7 other methods here (SetNode.union, SetNode.xor, SetNode.computeDelta, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1532}}}],"partialFingerprints":{"codehealthFindingId/v1":"227a0abd0783ae5e05b7256a80b92054bf5c4233e7f1408daf1648c1a78278bf"}},{"ruleId":"D1","level":"warning","message":{"text":"SetNode.computeDelta (cyclomatic 20): SetNode.computeDelta has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 7 other methods here (SetNode.union, SetNode.xor, SetNode.difference, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1589}}}],"partialFingerprints":{"codehealthFindingId/v1":"64377d054a8529facf7ca2b7f2db100bd39f4cfe6162dadebaa0d2daa46db008"}},{"ruleId":"D1","level":"warning","message":{"text":"SetNode.applyDelta (cyclomatic 20): SetNode.applyDelta has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (MapNode.applyDelta) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1742}}}],"partialFingerprints":{"codehealthFindingId/v1":"3952b0d1d69e5e6914252c8bc515f91335fa8c4a305e2d12ee7e8c76ee6b00d2"}},{"ruleId":"D1","level":"warning","message":{"text":"MapNode.unionWithV (cyclomatic 20): MapNode.unionWithV has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 7 other methods here (SetNode.union, SetNode.xor, SetNode.difference, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2632}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86ef016f2b13afadb2609201273499625ff915b74bf7086ba81bc22e65532cd"}},{"ruleId":"D1","level":"warning","message":{"text":"MapNode.unionWith (cyclomatic 20): MapNode.unionWith has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 7 other methods here (SetNode.union, SetNode.xor, SetNode.difference, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2698}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd1991f014a23bad27186030bb2b3160d4fd60a7bcdefda9d853eef9e78ace0"}},{"ruleId":"D1","level":"warning","message":{"text":"MapNode.union (cyclomatic 20): MapNode.union has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 7 other methods here (SetNode.union, SetNode.xor, SetNode.difference, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2755}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2bde8e9169a86ca4d77a7bc21a0e1eec7679a7140eba0b648e3fcc8cdc44b44"}},{"ruleId":"D1","level":"warning","message":{"text":"MapNode.computeDelta (cyclomatic 20): MapNode.computeDelta has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 7 other methods here (SetNode.union, SetNode.xor, SetNode.difference, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2810}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81568c5109ee78530d0f7ba58caa9ef6c424834d0fc0b045a22dca44aa05f74"}},{"ruleId":"D1","level":"warning","message":{"text":"MapNode.applyDelta (cyclomatic 20): MapNode.applyDelta has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (SetNode.applyDelta) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2966}}}],"partialFingerprints":{"codehealthFindingId/v1":"11aa07ff4e4f748a583a8af70bbe5080a3bac96488c6e15fe14f970bd3ae65f3"}},{"ruleId":"D1","level":"warning","message":{"text":"IndexListModule.alterAt (cyclomatic 19): IndexListModule.alterAt has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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/FSharp.Data.Adaptive/Datastructures/IndexList.fs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"688eedbba4ee7a2ad51f189bf16ae2c31e7350bc4c04ab5252b4910f1d4ba4e8"}},{"ruleId":"D1","level":"warning","message":{"text":"MapExtImplementation.changeWithNeighbours (cyclomatic 19): MapExtImplementation.changeWithNeighbours has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":1821}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91469ead526b07fb0f4a60ab00df56db21b4e09852090ebda91faff43f156e1"}},{"ruleId":"D1","level":"warning","message":{"text":"ApplyDelta.applyDeltaSingletonState (cyclomatic 19): ApplyDelta.applyDeltaSingletonState has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d568a676af83e582b0e105e9c64be817b29b9c160108079f2b3db7cd36c51e"}},{"ruleId":"D1","level":"warning","message":{"text":"SetNode.overlaps (cyclomatic 19): SetNode.overlaps has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfc8ee9767bc17e8b8389612e1ab01838757f594d2945c5c6144a74b87bc06f"}},{"ruleId":"D1","level":"warning","message":{"text":"SetNode.intersectionCount (cyclomatic 19): SetNode.intersectionCount has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1425}}}],"partialFingerprints":{"codehealthFindingId/v1":"bafb314382e84a51ad6a5e876e50ab6bbe15a4a43287299a55076edf7efbf3b9"}},{"ruleId":"D1","level":"warning","message":{"text":"MapNode.choose2V (cyclomatic 19): MapNode.choose2V has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2450}}}],"partialFingerprints":{"codehealthFindingId/v1":"1127748f06bfb20c4192c6d557ea89f6597ac3474f70c6b7ed7e89496202f6e4"}},{"ruleId":"D1","level":"warning","message":{"text":"MapNode.intersect (cyclomatic 19): MapNode.intersect has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2557}}}],"partialFingerprints":{"codehealthFindingId/v1":"265ad4d49a68f8c03c900d0613fca74264b791642aa692e2b63406a1983df709"}},{"ruleId":"D1","level":"warning","message":{"text":"DeltaOperationList.ofArrayMyers (cyclomatic 17): DeltaOperationList.ofArrayMyers has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/Deltas.fs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa05b1c5a67b332c19559d82ec33ad80c845e9eb2e58006f7885e54b20490ae6"}},{"ruleId":"D1","level":"warning","message":{"text":"MapExtImplementation.changeV (cyclomatic 17): MapExtImplementation.changeV has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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 shape REPEATS in the file: 2 other methods here (MapExtImplementation.change, ApplyDelta.applyDeltaSingle) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b5b5d1f7b179f349e9f712a89af2888235208bb5cb748d619f654b28aa072f"}},{"ruleId":"D1","level":"warning","message":{"text":"MapExtImplementation.change (cyclomatic 17): MapExtImplementation.change has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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 shape REPEATS in the file: 2 other methods here (MapExtImplementation.changeV, ApplyDelta.applyDeltaSingle) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d233bae64203a457187f8b868fdf37889a2479f7da8ca7d6028744aee78376"}},{"ruleId":"D1","level":"warning","message":{"text":"ApplyDelta.applyDeltaSingle (cyclomatic 17): ApplyDelta.applyDeltaSingle has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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 shape REPEATS in the file: 2 other methods here (MapExtImplementation.changeV, MapExtImplementation.change) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":2161}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd11b779f0365d71c0ac265141b6c86f710792a207844714edcccb6642ab63b"}},{"ruleId":"D1","level":"warning","message":{"text":"ChangeableModelListGeneric\u00604.Update (cyclomatic 16): ChangeableModelListGeneric\u00604.Update has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/AdaptifyHelpers.fs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e061ef23c1150d877001f75e5d847f3749494fa26405b56c78c6b17bd3545bc"}},{"ruleId":"D1","level":"warning","message":{"text":"MapExtImplementation.choose2 (cyclomatic 16): MapExtImplementation.choose2 has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":2584}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfdad1e36192497d386e06a2a30a59482a12b8267e9a7ec85ad5ad548beabab"}},{"ruleId":"D1","level":"warning","message":{"text":"SetNode.subset (cyclomatic 16): SetNode.subset has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c793b425c1a3045037630ffd5d16e97b8985de1426dae13c809913de750ad82"}},{"ruleId":"D1","level":"warning","message":{"text":"MapNode.alterV (cyclomatic 16): MapNode.alterV has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (MapNode.alter) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1890}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eab9aab6967f43d9389222d97ecb5820d70c7eb9793d121b0ee047c7c55d6e4"}},{"ruleId":"D1","level":"warning","message":{"text":"MapNode.alter (cyclomatic 16): MapNode.alter has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (MapNode.alterV) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1931}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3efc97934cdc85ec7a64acc8cd0e6f5c1ef209a1e3982b88fd30bbdd9dc9686"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeableModelListGeneric\u00604.Update (cognitive 72): ChangeableModelListGeneric\u00604.Update has cognitive complexity 72 (threshold 15). Drivers by points: if/else 14 (44 pts), loops 5 (24 pts), match/switch 1 (4 pts) (nesting depth added 52). To reduce it, flatten the nesting: this score is depth rather than breadth \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/FSharp.Data.Adaptive/AdaptifyHelpers.fs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"038d0dadef8afae2cfec32039c7a54ee65b70a3e762a27357a4927880e490ac1"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexList.computeDeltaToArray (cognitive 67): IndexList.computeDeltaToArray has cognitive complexity 67 (threshold 15). Drivers by points: if/else 13 (39 pts), loops 5 (24 pts), match/switch 1 (4 pts) (nesting depth added 48). To reduce it, flatten the nesting: this score is depth rather than breadth \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. This shape REPEATS in the file: one other method here (IndexList.computeDeltaToArrayAndGetResult) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/Deltas.fs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8a24e2009721539175f0be61f5233a5efdae9bd1060c0061b92233629d3cb5"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexList.computeDeltaToArrayAndGetResult (cognitive 67): IndexList.computeDeltaToArrayAndGetResult has cognitive complexity 67 (threshold 15). Drivers by points: if/else 13 (39 pts), loops 5 (24 pts), match/switch 1 (4 pts) (nesting depth added 48). To reduce it, flatten the nesting: this score is depth rather than breadth \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. This shape REPEATS in the file: one other method here (IndexList.computeDeltaToArray) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/Deltas.fs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb581f9344f8e8ddc37a4bcc31a7c1e906cfd0522b2cfa92846d552395d36d0"}},{"ruleId":"D2","level":"warning","message":{"text":"MapExtImplementation.replaceRange (cognitive 60): MapExtImplementation.replaceRange has cognitive complexity 60 (threshold 15). Drivers by points: match/switch 9 (33 pts), if/else 15 (25 pts), boolean chains 2 (nesting depth added 34). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":1888}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b69cb404736daaa45abd3ac0f497aad25ae081c4d788c0389473d17591fccb"}},{"ruleId":"D2","level":"warning","message":{"text":"WeakOutputSet.Remove (cognitive 47): WeakOutputSet.Remove has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (42 pts), loops 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth \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/FSharp.Data.Adaptive/Core/Core.fs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe16ce3c7ae40335cce45ff6098fc58dfcb798c2ec853518ffd8102065e5178c"}},{"ruleId":"D2","level":"warning","message":{"text":"MapExtImplementation.computeDelta (cognitive 47): MapExtImplementation.computeDelta has cognitive complexity 47 (threshold 15). Drivers by points: if/else 22 (30 pts), match/switch 5 (17 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":1984}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c7fc9b78080fbb292a40db3a97822142b390e6551b7dcc478bf9c585f25aade"}},{"ruleId":"D2","level":"warning","message":{"text":"MapExtImplementation.choose2Helper (cognitive 47): MapExtImplementation.choose2Helper has cognitive complexity 47 (threshold 15). Drivers by points: match/switch 11 (36 pts), if/else 9 (11 pts) (nesting depth added 27). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":2502}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad98e98359ab6b4fc7e0df7e1eae457ac4aef65764be5125c675561e8f82e52"}},{"ruleId":"D2","level":"warning","message":{"text":"ApplyDelta.applyDeltaSingletonStateEff (cognitive 47): ApplyDelta.applyDeltaSingletonStateEff has cognitive complexity 47 (threshold 15). Drivers by points: match/switch 12 (36 pts), if/else 9 (11 pts) (nesting depth added 26). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":2281}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0f3689e4116b8eb105eaaae0ae96bc1a456ed331eb13bfac752dc0820f39ac"}},{"ruleId":"D2","level":"warning","message":{"text":"MapExtImplementation.sliceEx (cognitive 45): MapExtImplementation.sliceEx has cognitive complexity 45 (threshold 15). Drivers by points: if/else 28 (44 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"af29b4e9892c320d64b4e65c7435618bfd1363ee0a78d8c805c22ffded19894b"}},{"ruleId":"D2","level":"warning","message":{"text":"ApplyDelta.applyDeltaSingleEff (cognitive 39): ApplyDelta.applyDeltaSingleEff has cognitive complexity 39 (threshold 15). Drivers by points: match/switch 10 (28 pts), if/else 9 (11 pts) (nesting depth added 20). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":2371}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6a31837386b877d8305542bb475c5eb3c2abf809b5e08840a9e0fbbb175e6d"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexListEnumerator\u00601.Collect (cognitive 38): IndexListEnumerator\u00601.Collect has cognitive complexity 38 (threshold 15). Drivers by points: if/else 19 (37 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/IndexList.fs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b348278e50c5130c26c94297bff4462730466165db76c6ea25769c5bc3ac295"}},{"ruleId":"D2","level":"warning","message":{"text":"SetNode.applyDelta (cognitive 38): SetNode.applyDelta has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (27 pts), match/switch 4 (11 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (MapNode.applyDelta) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1742}}}],"partialFingerprints":{"codehealthFindingId/v1":"250d0d59c962853b7fa51629296d95d75df2cfc97addeab0656a52e4a67e3d5b"}},{"ruleId":"D2","level":"warning","message":{"text":"MapNode.applyDelta (cognitive 38): MapNode.applyDelta has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (27 pts), match/switch 4 (11 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (SetNode.applyDelta) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2966}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6216040fbb1bcf63a555b446afca9209dc8b6a735efd6280e38619fbaf9da3"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction.Commit (cognitive 36): Transaction.Commit has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 2 (9 pts), error handling 1 (5 pts), loops 2 (4 pts) (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \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/FSharp.Data.Adaptive/Core/Transaction.fs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a22519917fe0373a273ecc3f797283bc810fc62b34cc5330f88d3a11935e91"}},{"ruleId":"D2","level":"warning","message":{"text":"SetNode.alter (cognitive 34): SetNode.alter has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17 (32 pts), match/switch 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"9320dfaeeaea8900e88e70b37a41cdfa6473e76111085ca66f4221610f1d6740"}},{"ruleId":"D2","level":"warning","message":{"text":"SetNode.union (cognitive 34): SetNode.union has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (23 pts), match/switch 4 (11 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (SetNode.xor, SetNode.difference, SetNode.computeDelta, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0884363123d1a7aef632b5e9eae9bd08da2455f9a033f678f649afb8431fb3"}},{"ruleId":"D2","level":"warning","message":{"text":"SetNode.intersect (cognitive 34): SetNode.intersect has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (22 pts), match/switch 4 (11 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee3336fcf94217f6d09a6dd5b8f3b59df9dced255f02f84b94a64fda3783cb7"}},{"ruleId":"D2","level":"warning","message":{"text":"SetNode.xor (cognitive 34): SetNode.xor has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (23 pts), match/switch 4 (11 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (SetNode.union, SetNode.difference, SetNode.computeDelta, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1477}}}],"partialFingerprints":{"codehealthFindingId/v1":"74284a08f873a86aa97ee48b937ffc45b80b44937c308a85625de24dcad929a0"}},{"ruleId":"D2","level":"warning","message":{"text":"SetNode.difference (cognitive 34): SetNode.difference has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (23 pts), match/switch 4 (11 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (SetNode.union, SetNode.xor, SetNode.computeDelta, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1532}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e322b3066a30028a30ae4dd2430aafca495d1227659c61f9107734184e54d6"}},{"ruleId":"D2","level":"warning","message":{"text":"SetNode.computeDelta (cognitive 34): SetNode.computeDelta has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (23 pts), match/switch 4 (11 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (SetNode.union, SetNode.xor, SetNode.difference, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1589}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ab1dc904bc55ffb9a0e1e20bdcd4fe7c2f3d3d93c4bd6500e7cb58187c4352"}},{"ruleId":"D2","level":"warning","message":{"text":"MapNode.unionWithV (cognitive 34): MapNode.unionWithV has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (23 pts), match/switch 4 (11 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (SetNode.union, SetNode.xor, SetNode.difference, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2632}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc3e281e9c669fbe990c319604682eea4aef5805e127ce7cb2750bbc2da0cb8"}},{"ruleId":"D2","level":"warning","message":{"text":"MapNode.unionWith (cognitive 34): MapNode.unionWith has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (23 pts), match/switch 4 (11 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (SetNode.union, SetNode.xor, SetNode.difference, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2698}}}],"partialFingerprints":{"codehealthFindingId/v1":"50be54a2191bc604561a5ef61db38498c6125e69497bc758d7006751452052f7"}},{"ruleId":"D2","level":"warning","message":{"text":"MapNode.union (cognitive 34): MapNode.union has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (23 pts), match/switch 4 (11 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (SetNode.union, SetNode.xor, SetNode.difference, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2755}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ddbbf6ac0ddafbe65f4408661d25206a01b283c569c11de1904708ecc3a589a"}},{"ruleId":"D2","level":"warning","message":{"text":"MapNode.computeDelta (cognitive 34): MapNode.computeDelta has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (23 pts), match/switch 4 (11 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (SetNode.union, SetNode.xor, SetNode.difference, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2810}}}],"partialFingerprints":{"codehealthFindingId/v1":"d582329bc1f102a2a2ffdc253390cfeda9e42a333bbcf7e1046c08d04e9f80a3"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexListModule.alterAt (cognitive 33): IndexListModule.alterAt has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 6 (20 pts), if/else 6 (12 pts), boolean chains 1 (nesting depth added 20). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/IndexList.fs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0d46219f2129a16315a729bad18e0f0675cc4c77ed2920af726819cf5ac14d"}},{"ruleId":"D2","level":"warning","message":{"text":"MapExtImplementation.changeWithNeighbours (cognitive 33): MapExtImplementation.changeWithNeighbours has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 5 (14 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":1821}}}],"partialFingerprints":{"codehealthFindingId/v1":"536a5c3a9efb0eca2f87dd70c09075a7eea68cd9c56161e7c0fa01cbe1af6be5"}},{"ruleId":"D2","level":"warning","message":{"text":"MapNode.choose2V (cognitive 33): MapNode.choose2V has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (22 pts), match/switch 4 (11 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2450}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec373a20ef6de85693a00d7d3e3eef85051d1d40fd36a5ba1512b74e5d7b4221"}},{"ruleId":"D2","level":"warning","message":{"text":"MapNode.intersect (cognitive 33): MapNode.intersect has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (21 pts), match/switch 4 (11 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2557}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf1d62fac5fad7e63e18c18cc62bd0a935d5eea02f30c7d5b654ce83b5d42da"}},{"ruleId":"D2","level":"warning","message":{"text":"MapExtImplementation.choose2 (cognitive 32): MapExtImplementation.choose2 has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 4 (16 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":2584}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6d8f4b642e076aa5400389426ed6755a2c8955ccff868f618de199e5659f1a"}},{"ruleId":"D2","level":"warning","message":{"text":"DeltaOperationList.ofArrayMyers (cognitive 31): DeltaOperationList.ofArrayMyers has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 6, loops 3 (6 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/Deltas.fs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2389a9777fca3ddfd2a4943bde050d6051ac9e570cab1986d11ca4e731be6d"}},{"ruleId":"D2","level":"warning","message":{"text":"WeakOutputSet.Consume (cognitive 30): WeakOutputSet.Consume has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 3 (8 pts), loops 2 (4 pts) (nesting depth added 19). The drivers above price the dispatch low by construction \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/FSharp.Data.Adaptive/Core/Core.fs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f913063a187d594b5dec7aa743a577a5a932f5bd00f8d9bcf05210e412afbf2"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexListDeltaEnumerator\u00601.MoveNext (cognitive 30): IndexListDeltaEnumerator\u00601.MoveNext has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \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/FSharp.Data.Adaptive/Datastructures/IndexListDelta.fs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e0b043c5f40ec382fa68f6272c9165e17732b9371e4d77b1f80b6b86a47355"}},{"ruleId":"D2","level":"warning","message":{"text":"MapExtMappingEnumerator\u00603.MoveNext (cognitive 30): MapExtMappingEnumerator\u00603.MoveNext has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \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. This shape REPEATS in the file: one other method here (MapExtEnumerator\u00602.MoveNext) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":2700}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e9f15d9aa8f408805187a2c2dc091c173373a39ca7f669b38ad4a9aec521eb"}},{"ruleId":"D2","level":"warning","message":{"text":"MapExtEnumerator\u00602.MoveNext (cognitive 30): MapExtEnumerator\u00602.MoveNext has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \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. This shape REPEATS in the file: one other method here (MapExtMappingEnumerator\u00603.MoveNext) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":3683}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7bc91c9ffda8c700aac8f65baad77a12650568a05630e877a4c18525d43464"}},{"ruleId":"D2","level":"warning","message":{"text":"SetNode.tryRemove (cognitive 30): SetNode.tryRemove has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (28 pts), match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b556ffb81f6a9a6769f68a3114ca6d10b9128aa64c7de31d09d92da2e7368b"}},{"ruleId":"D2","level":"warning","message":{"text":"MapNode.alterV (cognitive 30): MapNode.alterV has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 5 (14 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (MapNode.alter) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1890}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7f276a0d0f4e46c1c553b25d45c399e5fb31588fccdb12845c6b403eeaaab4"}},{"ruleId":"D2","level":"warning","message":{"text":"MapNode.alter (cognitive 30): MapNode.alter has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 5 (14 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (MapNode.alterV) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1931}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c49f183652ac61785b0aa756273e85789f041fa0f71fa50032710f092b84114"}},{"ruleId":"D2","level":"warning","message":{"text":"ApplyDelta.applyDeltaSingletonState (cognitive 29): ApplyDelta.applyDeltaSingletonState has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 6 (18 pts), if/else 9 (11 pts) (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c1d63f875d74645a6efaed10cd65c8b57672ae0bbe4e35871f95a5b8dfc96c"}},{"ruleId":"D2","level":"warning","message":{"text":"SetNode.overlaps (cognitive 29): SetNode.overlaps has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 4 (11 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body: most of this score is breadth rather than depth \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdcaa1a52d6625f01ddb93a08b4b67aba1c3c47a90178c07323646c751a71860"}},{"ruleId":"D2","level":"warning","message":{"text":"SetNode.intersectionCount (cognitive 29): SetNode.intersectionCount has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 4 (11 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body: most of this score is breadth rather than depth \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1425}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5bb9e9ac49836e6e796d7d2453f3a6697b2ba6d289e669650b5e045f66bed9f"}},{"ruleId":"D2","level":"warning","message":{"text":"MapNode.tryRemove (cognitive 27): MapNode.tryRemove has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 4 (12 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2001}}}],"partialFingerprints":{"codehealthFindingId/v1":"4285fb144cf32b4a1fcbbb01f35d2a6dbfb6f970ddf6e385af9167b10ef044e8"}},{"ruleId":"D2","level":"warning","message":{"text":"MapExtImplementation.changeV (cognitive 25): MapExtImplementation.changeV has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 9 (11 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: 2 other methods here (MapExtImplementation.change, ApplyDelta.applyDeltaSingle) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"949a2cec27fcc81b451d0b6c4da9a74af5e55fdbdb1fdae9c00370b486955de5"}},{"ruleId":"D2","level":"warning","message":{"text":"MapExtImplementation.change (cognitive 25): MapExtImplementation.change has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 9 (11 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: 2 other methods here (MapExtImplementation.changeV, ApplyDelta.applyDeltaSingle) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"f587862f0c896f670ef4b4e568681c6a59bbb2726b3dc32cf7651c4e7a4d4a13"}},{"ruleId":"D2","level":"warning","message":{"text":"ApplyDelta.applyDeltaSingle (cognitive 25): ApplyDelta.applyDeltaSingle has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 9 (11 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: 2 other methods here (MapExtImplementation.changeV, MapExtImplementation.change) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":2161}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b9cc08680c62b86cd10fc7ff6473872fc1915e053c2153d7961d1855e23f68"}},{"ruleId":"D2","level":"warning","message":{"text":"SetNode.subset (cognitive 25): SetNode.subset has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (18 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b37d9ed82083f0a6bf1d523901a2a737e7e8ed9ad5545b9695bcdbda87596e7"}},{"ruleId":"D2","level":"warning","message":{"text":"MapNode.applyDeltaNoState (cognitive 25): MapNode.applyDeltaNoState has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 3 (8 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2919}}}],"partialFingerprints":{"codehealthFindingId/v1":"636d2a8e484ea0a42c2d4557c3509ba016b164c25edb64c65f249df46fb9a883"}},{"ruleId":"D2","level":"warning","message":{"text":"ListSetMapReader\u00602.Compute (cognitive 22): ListSetMapReader\u00602.Compute has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (17 pts), if/else 1 (4 pts), loops 1 (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/CollectionExtensions.fs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"588465ee7706be2b68f6f4cda0fc714d015371ac243f915e08526ce0df97209d"}},{"ruleId":"D2","level":"warning","message":{"text":"SetNode.addInPlace (cognitive 20): SetNode.addInPlace has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (MapNode.addInPlace) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b9d6b5e57e9e5135b68186b7eddcdf01ff049e5ebe2a8f8d071231bdd919c9"}},{"ruleId":"D2","level":"warning","message":{"text":"MapNode.addInPlace (cognitive 20): MapNode.addInPlace has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (SetNode.addInPlace) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2108}}}],"partialFingerprints":{"codehealthFindingId/v1":"85624e8f91b5065588a730e81f1ceea99377a263864c7a80fa2b9790188ab77b"}},{"ruleId":"D2","level":"warning","message":{"text":"MapExtImplementation.sliceAt (cognitive 19): MapExtImplementation.sliceAt has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":1761}}}],"partialFingerprints":{"codehealthFindingId/v1":"f313866f81f958f5084ab697a8838f1a4b3ebcb4ee2965b717850b853a0e707d"}},{"ruleId":"D2","level":"warning","message":{"text":"SetNode.applyDeltaNoState (cognitive 19): SetNode.applyDeltaNoState has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f7d114b37efb7ec5d75403d61a6da53a3a7315f05a88fccd487e278b9c7f08"}},{"ruleId":"D2","level":"warning","message":{"text":"MapExtImplementation.tryRemove\u0027 (cognitive 18): MapExtImplementation.tryRemove\u0027 has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (18 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (MapExtImplementation.tryRemove) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"e733d6b7967fa18835a4714c3c77ba51be3ea6e13a307f067bf27e8c09852624"}},{"ruleId":"D2","level":"warning","message":{"text":"MapExtImplementation.tryRemove (cognitive 18): MapExtImplementation.tryRemove has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (18 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (MapExtImplementation.tryRemove\u0027) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6619619b05c0010bb7788e0ff2817b2cd4b70a9c2d2047649998d38cdf44828"}},{"ruleId":"D2","level":"warning","message":{"text":"MapExtImplementation.equals (cognitive 18): MapExtImplementation.equals has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":2658}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ace0f3a7910c436d64d199d129f37f65c346c98d49fde495052ad0ba2c80fa"}},{"ruleId":"D2","level":"warning","message":{"text":"SetNode.equals (cognitive 18): SetNode.equals has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (MapNode.equals) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c37cea57e901f6649bfd050edbc4209d802e9c9b09b651f3b2a57f4e3fea2f4"}},{"ruleId":"D2","level":"warning","message":{"text":"MapNode.equals (cognitive 18): MapNode.equals has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (SetNode.equals) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2374}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b01628aafa70a4da9a475535f80a370d79097f6ea101b3dacb3ef5cb750d9fa"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexList\u00601.GetSlice (cognitive 17): IndexList\u00601.GetSlice has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (5 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \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 shape REPEATS in the file: one other method here (IndexList\u00601.GetSlice) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/IndexList.fs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb0a8a2431bf7332100e8de6cd2c3fa3fe45e5d1fca66948a8a483977df8164"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexList\u00601.GetSlice (cognitive 17): IndexList\u00601.GetSlice has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (5 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \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 shape REPEATS in the file: one other method here (IndexList\u00601.GetSlice) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/IndexList.fs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ab1a5507d6437b86f18feb544dd62c26ad64f6c5ff10dca93cfedafb53f832"}},{"ruleId":"D2","level":"warning","message":{"text":"MapExtImplementation.getNeighbours (cognitive 17): MapExtImplementation.getNeighbours has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (17 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (MapExtImplementation.getNeighboursAt) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":1424}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f33cd9e8507da903067443cc80990b28667c2fd0fffb5585a55c9df38567efd"}},{"ruleId":"D2","level":"warning","message":{"text":"MapExtImplementation.getNeighboursAt (cognitive 17): MapExtImplementation.getNeighboursAt has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (17 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (MapExtImplementation.getNeighbours) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40ef0122985f53ed4b6e64d12cab3afc539b8fc47f9e91dcf3fa84a00f66444"}},{"ruleId":"D2","level":"warning","message":{"text":"MapExtBackwardMappingEnumerator\u00603.MoveNext (cognitive 17): MapExtBackwardMappingEnumerator\u00603.MoveNext has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":2792}}}],"partialFingerprints":{"codehealthFindingId/v1":"5833b1982ffee9be194ccc295f7a204ec32a8ea719bd27f5b0fb7d3316e4deea"}},{"ruleId":"D2","level":"warning","message":{"text":"ListTreeReader\u00601.Compute (cognitive 16): ListTreeReader\u00601.Compute has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 2 (7 pts), loops 3 (6 pts), if/else 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/CollectionExtensions.fs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"f760c54fd2258293774d84be8511669774c5122491310c454a3e2d357a1d36fa"}},{"ruleId":"D2","level":"warning","message":{"text":"MapExtImplementation.unionWith (cognitive 16): MapExtImplementation.unionWith has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (16 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df57a723863a5c63ffc0c7af1874c3da66da803833024783ee0179a867f9bd5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Datastructures/HashCollections.fs: FileTooLong \u2014 3649 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3149 over it, 7.30\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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69236cd51903c839f87347b026da85d180f1cb77c4845de92390629f90b9b9e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Datastructures/MapExt.fs: FileTooLong \u2014 3206 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2706 over it, 6.41\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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"055044bd74d2621f9e72b2070ee4fd8295a4df98d899a926b363328bf8dd1334"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MapExt\u00602: TooManyMethods \u2014 132 methods. The bar is 30 methods; this is 102 over it, 4.40\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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":2867}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e77dcb3a35065406ee51576d64061c222c5f0182ea2724f1a708f2c6595cc2d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: MapExt: TooManyFunctions \u2014 97 functions. The bar is 30 functions; this is 67 over it, 3.23\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":3757}}}],"partialFingerprints":{"codehealthFindingId/v1":"035857fca2226ff5bd704c56bf0264c51c9f901ba0577e653737c1495b9daded"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: MapExtImplementation: TooManyFunctions \u2014 86 functions. The bar is 30 functions; this is 56 over it, 2.87\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"59fe7f1a723c424d54b587ded6cef3515d7c25df09f4bd334ebf22b7975d06be"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: AdaptiveIndexList/AdaptiveIndexList.fs: FileTooLong \u2014 1373 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 78 functions. The bar is 500 significant lines; this is 873 over it, 2.75\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/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b9ab1512fddc426a14e1627279cdc61c77c0bb77b25fa8371e473f13eac727"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FSharpHashSet\u00601: TooManyMethods \u2014 73 methods. The bar is 30 methods; this is 43 over it, 2.43\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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":3255}}}],"partialFingerprints":{"codehealthFindingId/v1":"8478c2b1a02491157e121e61a64ec447f32174afb0557e14f1c9665fef6441d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: AdaptiveHashSet/AdaptiveHashSet.fs: FileTooLong \u2014 1215 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 54 functions. The bar is 500 significant lines; this is 715 over it, 2.43\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/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5132f52b29e6d445ab56f204359ac901ad6b4ff13dd9aa13d18b449c69ba59"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: AdaptiveHashMap/AdaptiveHashMap.fs: FileTooLong \u2014 1201 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 57 functions. The bar is 500 significant lines; this is 701 over it, 2.40\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/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1825142df05008186d732adf83a26ac5ff1f8f11f52b53472728238bcea8642"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AdaptiveHashSet: TooManyMethods \u2014 68 methods. The bar is 30 methods; this is 38 over it, 2.27\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/CSharp.Data.Adaptive/ASet.fs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"165b8e216cfb1ef7f0a5b5328ac8d1425fb94e0c90ef9a93265a792e51dbf29a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FSharpHashMap\u00602: TooManyMethods \u2014 66 methods. The bar is 30 methods; this is 36 over it, 2.20\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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":3682}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a2699397900907b5c5d4e48d1d87ef995b0fbc6bf6def4313dc9f36ca84ede"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IndexList\u00601: TooManyMethods \u2014 65 methods. The bar is 30 methods; this is 35 over it, 2.17\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/FSharp.Data.Adaptive/Datastructures/IndexList.fs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"674bada4d708d3df44bd8f5ba75a7fd9d8d53d245f568bc383a0281a36054d74"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AdaptiveIndexList: TooManyMethods \u2014 64 methods. The bar is 30 methods; this is 34 over it, 2.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/CSharp.Data.Adaptive/AList.fs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b43c7f3c1de4131f8276ca1a1e123ac62abdee156c46b95b85a9ce8af646b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Datastructures/IndexList.fs: FileTooLong \u2014 1026 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 106 functions. The bar is 500 significant lines; this is 526 over it, 2.05\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/FSharp.Data.Adaptive/Datastructures/IndexList.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73282f35066faac0daff797afc87cb92753f10ce818b8aed4cfa303aaae3a073"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: HashMapModule: TooManyFunctions \u2014 55 functions. The bar is 30 functions; this is 25 over it, 1.83\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":4285}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc081d41dc7cda002fecf63c9848079d8aad1de62b543e99e5a141fff55fbb8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AdaptiveHashMap: TooManyMethods \u2014 50 methods. The bar is 30 methods; this is 20 over it, 1.67\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/CSharp.Data.Adaptive/AMap.fs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"246164a8f8b2be0aed7ed82d34c1a57c634f193690442f41c104d7dba482924d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: MapNode: TooManyFunctions \u2014 40 functions. The bar is 30 functions; this is 10 over it, 1.33\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1882}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5648922faee3a8b3492f6e7e293e8607d13cb291e37ac22e344d4db23a1a2b1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: HashSetModule: TooManyFunctions \u2014 40 functions. The bar is 30 functions; this is 10 over it, 1.33\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":4115}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd27ecc3e864cbe0987878c23674f1a8cfbd101354b98d4bcf5f3dab821e9526"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CountingHashSet\u00601: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\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/FSharp.Data.Adaptive/Traceable/CountingHashSet.fs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8520172b74bc55028b60642ecf4744a15ba8df610b21a03fbe1fa91366a2b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FSharp.Data.Adaptive/CollectionExtensions.fs: FileTooLong \u2014 639 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 139 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/CollectionExtensions.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7114c9e574cbb4a4396298faaff67e61aa6dc0306c78654f9ce4ea2541a3a4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: CountingHashSetModule: TooManyFunctions \u2014 37 functions. The bar is 30 functions; this is 7 over it, 1.23\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Traceable/CountingHashSet.fs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbeaa5f3b861254cf2e80cb19601add25cf4ceae2442d40a7efe1093078a2020"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: MapLinked: TooManyFunctions \u2014 35 functions. The bar is 30 functions; this is 5 over it, 1.17\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e558cceda8082e09b58a7515dee5a69a9c65a974ace5116761945e0ed2f8fb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ChangeableIndexList\u00601: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\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/FSharp.Data.Adaptive/AdaptiveIndexList/ChangeableIndexList.fs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac9570cfb8150f3b502c0f23bd6fbd7abf4e7167067e97a7b4902d8f25a617f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (298 corresponding lines): src/CSharp.Data.Adaptive/AList.fs:1-298 | src/CSharp.Data.Adaptive/ASet.fs:1-314 \u2014 These two members are one piece of code written twice and then edited apart: 298 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/CSharp.Data.Adaptive/AList.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d224090f1a3ceec476fc038e00122c1c897ecfc2722a379a9d0220a7d80be4c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45\u201346 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:240-284 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:230-275 \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/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:240\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/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ddee30d306e5ddce2d8b80f7239e939bf714f9e27865ab8c51d31efb0c4b5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveValue/AdaptiveValue.fs:70-105 | src/FSharp.Data.Adaptive/Traceable/AbstractVal.fs:8-43 \u2014 before extracting anything, compare \u0060src/FSharp.Data.Adaptive/AdaptiveValue/AdaptiveValue.fs\u0060 and \u0060src/FSharp.Data.Adaptive/Traceable/AbstractVal.fs\u0060 as WHOLE FILES: 91% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/AdaptiveValue/AdaptiveValue.fs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"927a26644fff7c42596d94674e9dcc41feec3c5e6278d22b27a8379755a4e762"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3130-3161 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3200-3231 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":3130}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4813401252ee413f60f5e228be5cad8e8b61ca511184a4a7c436c628b795f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 3): src/FSharp.Data.Adaptive/AdaptifyHelpers.fs:199-224 | src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:319-345 | src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:400-426 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/AdaptifyHelpers.fs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"2133332b52235ebcfc64521be36725a3ba1e51f37a4a11b7da0cdff4db37fb12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2724-2750 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:3707-3733 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2724\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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":2724}}}],"partialFingerprints":{"codehealthFindingId/v1":"6553a7196b71f69e074eeac818f1f494ed73897d8dc7345ab10ab485e8e57409"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 3): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:335-358 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:327-350 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:335-358 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:335\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/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"db105971f30719e709678e080342653da4e99d721624661ee7bce2f9564ea1d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:727-750 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:812-834 \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/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:727\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/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e3232881556ea5e8707e7a89894e8253ff46deda35bb126eff8788a8b5c232"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201324 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:1-24 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fsi:1-21 \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/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3e343f35f358cc76080d7f8ef68e9a57a2804d3d8bd1da3f720a6ec15e1b67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (67\u201368 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1814-1880 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3038-3105 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1814}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67884228c1c1f62098c71bf6aec56dd01da1f4878546bfb024094c8bedee16f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:640-662 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:725-747 \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/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:640\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/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"554bdba68ca7182aa1f6b91fd915da7357cab464ff5068d582df7f89c581040d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:173-194 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:163-184 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:172-193 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:173\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/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0aece1b05114d3846690ab68c4cc54edf9ca038511cdd2695880911d841959"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:210-231 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:200-221 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:209-230 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:210\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/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec84f261c63b0b933b8014f59f306b8d5a270646816cfda997f87b58c982e1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:84-104 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:79-99 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:83-103 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:84\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/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd743ffef0a37bbed03aa0782ae20098f248a21dd86c2730a08cc8e7a6a2358"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:608-628 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:634-653 \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/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:634\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/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a53421337d874a9d04709fc8c1624528217b0944456701d409577668048fd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:955-974 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:981-999 \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/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff31ed6740d10b1a262464f4e6df78dfb97274dc15500fab2a742b3e31d11152"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201320 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1010-1029 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1035-1051 \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/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbaa41832f5d103a1d4b35dbd52c287de4334f60b03c0491ea0f7cbfd7a595a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 3): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1505-1522 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1517-1535 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:1583-1600 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1505\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/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs"},"region":{"startLine":1505}}}],"partialFingerprints":{"codehealthFindingId/v1":"87152ccc2848ca481869ea47aabcaded9c3dd196b758d935b4e6abaa0ab8e0f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): src/FSharp.Data.Adaptive/Datastructures/IndexListDelta.fs:118-136 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2711-2729 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:3694-3712 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/IndexListDelta.fs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"4836cf7b55cba256083e5565d007b0bfef3400fed729ed6747274df03fc098c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:247-264 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:320-338 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d01e1c0613fecef8dea3ec4e17215ef61927f2aeb43fc809fe198a6205db17b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/FSharp.Data.Adaptive/Traceable/CountingHashSet.fs:318-336 | src/FSharp.Data.Adaptive/Traceable/CountingHashSet.fs:341-359 \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/FSharp.Data.Adaptive/Traceable/CountingHashSet.fs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"682783346c74fa784f1e2899a638855294a3e13fa593cdd6e1d0352587d3e963"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 3): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:673-689 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:721-737 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:769-786 \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/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f1dca31e30cf21ba459502babee4a44199bddaf57aaea7b5e34180c0399e93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1771-1788 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2995-3012 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"9896a936e413886997a17aa694b791d02036fc049a2e08a99fb7fe1e91209e92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 3): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:114-129 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:109-125 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:113-128 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:114\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/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"faeee044c31be7bbbb2c7f14be278df4add1846779af39317a8a80e2a9df0e71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptifyHelpers.fs:227-243 | src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:430-446 \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/FSharp.Data.Adaptive/AdaptifyHelpers.fs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f973a5864be7a103e387f210635c74d2a48fbf7f84def41a7976cfc1b7233d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1617-1633 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:1852-1868 \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/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs"},"region":{"startLine":1617}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5ccf81c86f792be210068b61ab1d0760ad5488aff8775d2a28311e30830bdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/FSharp.Data.Adaptive/Traceable/History.fs:212-229 | src/FSharp.Data.Adaptive/Traceable/History.fs:244-260 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Traceable/History.fs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8db2fbba7e0b1dbf898fd5864aa09cba920674b49776933da45e94a7263f980"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 9): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:86-101 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:177-191 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:341-354 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:81-96 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:167-181 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:333-346 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:85-100 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:176-190 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:341-354 \u2014 there are 9 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 9 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:86\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/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"9184776426eacdc32c33bbc2ae55be5b370171a92084859b80d7955b96d60cf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1803-1818 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1848-1863 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3027-3042 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3073-3088 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"dddca04f5ebafc53972658550e6ddad5da3c94e2ca97abe5f43a391c3f640d15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptifyHelpers.fs:26-41 | src/FSharp.Data.Adaptive/AdaptifyHelpers.fs:78-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/FSharp.Data.Adaptive/AdaptifyHelpers.fs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"86828dd3cfccedf10c6f86f1354049d2c94c91035a56885d3316d2cda0634a15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashMap/ChangeableHashMap.fs:50-65 | src/FSharp.Data.Adaptive/AdaptiveIndexList/ChangeableIndexList.fs:38-53 \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/FSharp.Data.Adaptive/AdaptiveHashMap/ChangeableHashMap.fs:50\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/FSharp.Data.Adaptive/AdaptiveHashMap/ChangeableHashMap.fs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e58b66fddef57638bb06875ca6d5b46d62ea37097af55212fd9f04d7645ed10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1728-1743 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2954-2967 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2954\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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c9d0602a9748cfe4cc3ed48a0c932340785524cb48358b2dbadeea757a7a7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1745-1760 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2969-2984 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1745}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd44cad1eeb33d6c295cf3cd0c989a489db050545da3abe63eb3e672e1a235c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:569-583 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:587-601 \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/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:569\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/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec1412a1f40e87439ce139c05ee6d41744ac382e0b85cf8bb1d4e06000ce66e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1651-1665 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2873-2885 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1651}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa2725eac7531db6077a05ad134f4d37e97ff3383a7c199c035440d305ec76f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1280-1294 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1308-1322 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b823ae45e55c5fb362c18ea4a45630fa548f80c336f7c78443f90e713541c63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2752-2766 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2834-2848 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2752\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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":2752}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6eab3cbdff18c0e8bc4ff42cdaae7b33fa186939dfba74a1c8063b739c6859b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:253-266 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:243-256 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:252-265 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:253\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/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"e456e72b0e9ba09a830e288deb6c2ba0999f3b77e979e5c62330c5f29f94cd74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:655-668 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:703-716 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:751-764 \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/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e6060abace96d1116f5cb9a57333cd8d8c736f3f243040693a96672c8e0eb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:560-573 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:579-592 \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/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"3833ee7631ec9cfa30b3b13482c69697b044623b33847b81acd1dac634eef23c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:605-618 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:861-874 \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/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:605\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/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c6c2b404c9c21c6ad2d2505bd6004cadb1b7d376b9d71f378678e63dc64855"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:525-538 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:543-555 \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/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:525\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/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"853cdf54d2decb022434645914b5d4cab9c485d6261052f0887a6cdd47c9146f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1913-1926 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1954-1967 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1913\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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1913}}}],"partialFingerprints":{"codehealthFindingId/v1":"4295a8c91bb9b8aa5091dd7acf20e2a596dc91bbb318e8b13640a17ff05c619e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2271-2283 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2360-2373 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":2271}}}],"partialFingerprints":{"codehealthFindingId/v1":"a795b6acdab2aed2f24f98c727552592b274fb3351c63b2b25f5790b7352da32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/FSharp.Data.Adaptive/ShallowEquality.fs:276-288 | src/FSharp.Data.Adaptive/ShallowEquality.fs:324-337 \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/FSharp.Data.Adaptive/ShallowEquality.fs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2592c7c2c6476930b5c34b3316a5bb2e68884da9bd82cbd4486d97478022733"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1914-1925 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1955-1966 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1985-1997 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1985\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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1914}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a77a7e5410fb593fd501713727579e594239bcfbdabdfcd7f9dd7d3d2156cb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:830-842 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:743-755 \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/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b91e0e21cb728998e45be358479e3d6341b267e237a96721cde07405dd24c4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:974-986 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1029-1040 \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/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"644e2229cdc19c5386341c8c8dfbcb39a45c6c934bf3f56c6a0f7d2f2d3a141e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201313 lines \u00D7 3): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1351-1363 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1512-1524 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1577-1580 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1577\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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7dca1e3ec03fae004bda71afc4f788c79a40b0eac59ace2df21258a6e11400"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2473-2485 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2514-2526 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2473}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9cf81501b8f8c347a28cc77cee07a2d4eb9002cd19fdf26f149bad41fb4cde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2492-2504 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2531-2543 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2492}}}],"partialFingerprints":{"codehealthFindingId/v1":"97fad80716d4756c02fd952d71f31f6b2ba3815600021164b75488a9505e5b08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1466-1478 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1526-1536 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2548d016ba0871581cb203c734189b719641055b214822d14a01d10a930f714"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 4): src/FSharp.Data.Adaptive/AdaptiveValue/AdaptiveValue.fs:47-58 | src/FSharp.Data.Adaptive/AdaptiveValue/AdaptiveValue.fs:95-106 | src/FSharp.Data.Adaptive/AdaptiveValue/AdaptiveValue.fs:198-209 | src/FSharp.Data.Adaptive/Traceable/AbstractVal.fs:33-43 \u2014 before extracting anything, compare \u0060src/FSharp.Data.Adaptive/AdaptiveValue/AdaptiveValue.fs\u0060 and \u0060src/FSharp.Data.Adaptive/Traceable/AbstractVal.fs\u0060 as WHOLE FILES: 91% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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/FSharp.Data.Adaptive/AdaptiveValue/AdaptiveValue.fs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2e03f83f8f5036fcd71e73065fb32191629d1c1630656815ae313a94468a7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:897-908 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1915-1926 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1956-1967 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1987-1998 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e2ccfdf2454f3f326e28bb63fa4e7cf55065b7903fab6a74ce570eff57efde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1782-1793 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1830-1841 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3006-3017 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3055-3066 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1782}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0d893c37f780b2b8d600e8876ee1f36f80fe35f664ce83b6df685bca8c808a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/FSharp.Data.Adaptive/AdaptifyHelpers.fs:235-246 | src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:354-365 | src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:438-449 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/AdaptifyHelpers.fs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"9febe7e578a62c1e74c0cc265ade6ccb43d89cda3801dfeae2e2c592ab097ecc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:510-521 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:475-486 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:476-487 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:510\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/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a923fa0313073cf3fcea93feed7128f85eb759055d6764f647d9c638219076"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:464-475 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:481-490 \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/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:481\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/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"2591f104ccbac59c9ffa7c8a964f3cd50c4c47669ada3a48281f99a4925c65b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:12-21 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi:12-23 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi:29\u0060 calls \u0060CompilationRepresentation\u0060 and \u0060src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:27\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"51425cbcc450b2ce1afaca7d251c43aaca0e9ce7aa10f12d3f03dd6a47c97b5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:542-553 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:557-568 \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/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:542\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/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd1b2ffcf54943ed0fcd452587667a92b9fb5a277b07606d444bc5ef1e444bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveValue/AdaptiveReduction.fs:116-124 | src/FSharp.Data.Adaptive/AdaptiveValue/AdaptiveReduction.fs:134-145 \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/FSharp.Data.Adaptive/AdaptiveValue/AdaptiveReduction.fs:134\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/AdaptiveValue/AdaptiveReduction.fs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"3350ecf90c34532f618b339eaa87bfbfc9273f10eb5ee603d7912250f272f81a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:227-238 | src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:256-267 \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/FSharp.Data.Adaptive/Datastructures/Deltas.fs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e6ca13b53e09af886dbd322de93dce360254ce7807e7f0810c18a6e225da11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:391-402 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:801-812 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2c440882e73bdbe11cf279306277e111007eb77f504e405746cfc204ffbc22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FSharp.Data.Adaptive/ShallowEquality.fs:155-167 | src/FSharp.Data.Adaptive/ShallowEquality.fs:203-214 \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/FSharp.Data.Adaptive/ShallowEquality.fs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be8faebd9995fde45cb4e9049caf18baca91c4127fa7fef838eff483db62bc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FSharp.Data.Adaptive/Traceable/History.fs:448-459 | src/FSharp.Data.Adaptive/Traceable/History.fs:481-492 \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/FSharp.Data.Adaptive/Traceable/History.fs:448\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/FSharp.Data.Adaptive/Traceable/History.fs:493\u0060 calls \u0060Invoke\u0060 and \u0060src/FSharp.Data.Adaptive/Traceable/History.fs:460\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Traceable/History.fs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce2c9af301f1de4dffc3a434077de5f78ca8072f4a4235d163d771030fd3adf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptifyHelpers.fs:99-109 | src/FSharp.Data.Adaptive/AdaptifyHelpers.fs:256-266 \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/FSharp.Data.Adaptive/AdaptifyHelpers.fs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1f4e7fbbc9f50787f9594aaf333ec49f4fda46147f0bd7018c5b23319bbafb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:196-206 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:186-196 \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/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b9b88210f613ed47850c0cc9224b928c57abf3cf7e7c5642cfb2c65323da7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:287-297 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:286-296 \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/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:287\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/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"4871ab4df1e85690f0db31ca05b158782a9e6bd9e714240b706402ae4da1535f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:951-961 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1006-1016 \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/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"73eb6708cd1780bccba65446c8c99dcfc4c2685b46648c6c12e63d14e7e6a7a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1107-1116 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1152-1162 \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/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4feb33f1fa316d87b6236300e757f40ce936c3e37fdab258995bb56dc1d0612"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1016-1024 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1082-1092 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e79c25c05dfb30c9f9bf278232560aac0f33ec68eba92c8223132b21e61aeed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1237-1247 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1251-1261 \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/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b2ae0aeb1a7b43abc9100a0e703bad88a7165a979ff24875074197363fff42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1623-1633 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1663-1673 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1623}}}],"partialFingerprints":{"codehealthFindingId/v1":"575ab61c0472030a40cbb4aabca152a944d0591bfbf06ad9f1fa31815dbf0bf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1641-1651 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1679-1689 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"daacf6238f336a3f0a63f588786b0f2b9a8196ed717edb256db90b557aaf38cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2844-2854 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2883-2893 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2844}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2dfa40de7ac46ed0f4eac7058620cc32cdf8156d71e082b651c04b0b248bce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2863-2873 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2898-2908 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2863}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88fef9db1c7bee02f46688ebbe083a8658cca7ee5670cfc974a16dc3e3ae57e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1577-1587 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1609-1619 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3105b3f86b40f7848a912296288a76757fb153f9a1d2f82a2024f9cdd883abe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2028-2038 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2053-2063 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":2028}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec1408820c8c885ea6760f3b3946ff3a2b5d9f406f8066814dcbfda06c32dd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2122-2132 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2547-2556 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2122\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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":2122}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a734cc45fe8f03aeed1a3ee1c310b0baf273b579e6e6cab56e507a02ff6e41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:268-277 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:258-268 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:267-276 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:268\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/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a3b51bcc77287912ee0e7f810b1886222d6750bdd1fe6444d9fdf7d5cdd66b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/FSharp.Data.Adaptive/Datastructures/IndexListDelta.fs:150-159 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2743-2752 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:3726-3735 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/IndexListDelta.fs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"393ea4aacac3a56d7ad8f4d2b9b6f0f71f2d37c67a6e63f224f07dd47aed3aef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/CSharp.Data.Adaptive/HashSet.fs:9-18 | src/CSharp.Data.Adaptive/IndexList.fs:8-17 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/CSharp.Data.Adaptive/HashSet.fs:7\u0060 calls \u0060CompiledName\u0060 and \u0060src/CSharp.Data.Adaptive/IndexList.fs:5\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/CSharp.Data.Adaptive/HashSet.fs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"68623033fc34ad0569d1dc3efbc7ad37696eb692fd69fa417b5f118583c53c53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:845-854 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:758-767 \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/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee511a3cd0ac8c1896aeaad6eacfc1e1945f52b883f6a2c1f1bfaf6476c0c4f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1096-1105 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1140-1149 \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/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"938c1804e0c26c47e84f5badcc7030ad31c5bfd2d695299cb17189b5f343ebac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:985-994 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1050-1059 \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/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:985\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/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5c0ef23a3977560054dd6212ef5bf5212cf91732fbd22346f64e36b915c763"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharp.Data.Adaptive/CollectionExtensions.fs:113-122 | src/FSharp.Data.Adaptive/CollectionExtensions.fs:177-186 \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/FSharp.Data.Adaptive/CollectionExtensions.fs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfec92ca54490ce3581aa0a50932abd0e0c12ac480ae97f731c0233e00df8060"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1703-1713 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2921-2930 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1703}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e05ee760145e77523260a5c13fb9b4e09e3be7a6ee1f9a1b078cb423e77c54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:4247-4256 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:4257-4266 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:4247\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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":4247}}}],"partialFingerprints":{"codehealthFindingId/v1":"e830a5c62f7be734bd90579ce8b95fb0c3a9bb367c75d761e099d0b546d15a91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:509-518 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:533-542 \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/FSharp.Data.Adaptive/Datastructures/IndexList.fs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f66d1ac1078ce4e8cb37d79b4956aab2318e8d1954c72146d9550c9bac0918"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:987-996 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:997-1006 \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/FSharp.Data.Adaptive/Datastructures/IndexList.fs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a0806de9ed6207109286727e418ef732f605b0f0c8bb45b66c70963c2ad4a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:118-128 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:359-369 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe3b491737046b282dd401ed7e30adec29eb36012589a0d9a788471fe7bd3a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1091-1100 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1120-1129 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"df82e1b6fccbf3bc4c16b031a401055712a3bf9e515fbc28f373ff70676ba782"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1440-1449 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1498-1507 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba565c70007bf77d687cade4fb684409a2e377ced00b355fae1e9c9bc903e580"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharp.Data.Adaptive/Traceable/CountingHashSet.fs:304-313 | src/FSharp.Data.Adaptive/Traceable/CountingHashSet.fs:328-337 \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/FSharp.Data.Adaptive/Traceable/CountingHashSet.fs:304\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/FSharp.Data.Adaptive/Traceable/CountingHashSet.fs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d2362192fbf924ec24ffa2e7b4ecdaa7d042ade8bb22bdb720d201888df0af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 14): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1246-1252 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1295-1300 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1350-1356 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1404-1410 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1454-1460 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1511-1517 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1567-1573 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1656-1664 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2507-2515 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2590-2596 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2667-2673 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2733-2739 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2789-2795 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2876-2884 \u2014 all 14 copies are in the same file, so extract the block into one function there and call it from every one of those sites \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1246\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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f9ba6e97fc71feca9563dff828ac9ef04375085ae1228c004f78e99ebb36f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): src/FSharp.Data.Adaptive/CollectionExtensions.fs:115-122 | src/FSharp.Data.Adaptive/CollectionExtensions.fs:143-151 | src/FSharp.Data.Adaptive/CollectionExtensions.fs:179-186 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/CollectionExtensions.fs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4221fc1b7c0b7e5f79ea143c72ff9a6f3bd447c89dd1da9c7982d257421038a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:719-727 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2707-2715 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:3690-3698 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/IndexList.fs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a45d61da0c19b472159512a3760f511d14ce8a47b911b58b4f34f7f0c96604"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2269-2277 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2345-2353 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2358-2366 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":2269}}}],"partialFingerprints":{"codehealthFindingId/v1":"8038ba88c2e0cccbfc59e479aac0296d8983817ecf8efc5d186876acb2732ad9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/CSharp.Data.Adaptive/AList.fs:9-17 | src/CSharp.Data.Adaptive/ASet.fs:9-17 \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/CSharp.Data.Adaptive/AList.fs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b79379e67786e89b9aab92091b1792e74aab33b0c3ba43083142b2ffa8aafa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20139 lines \u00D7 3): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:643-651 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:698-700 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:739-747 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d8db9ef03366f7906f3f83d7292bf5cfc3bcbabab022c6df71a920f09bef0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1659-1667 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:1806-1814 \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/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs"},"region":{"startLine":1659}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3fdbd2a1d3238ed8e1160ba269ab28146d892ba373471ee935e9a1aed674f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharp.Data.Adaptive/CollectionExtensions.fs:678-686 | src/FSharp.Data.Adaptive/CollectionExtensions.fs:720-728 \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/FSharp.Data.Adaptive/CollectionExtensions.fs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f03cdf066f9a26c928ed5b5024ac5c38432db3233f974ac03b3bbd82b1bf50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharp.Data.Adaptive/Core/AdaptiveObject.fs:231-239 | src/FSharp.Data.Adaptive/Core/Transaction.fs:58-67 \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/FSharp.Data.Adaptive/Core/AdaptiveObject.fs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"78502271038f9cbde73d091d2a234f1002df1ffadc883c3f17d2ba3e8579cb35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:59-67 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:103-111 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"35951d5f05ad47874dc064bbd95c70527b248b9a56b31889af5db76d675f706a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:280-288 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:291-297 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5263dd7385298edc0e5175db9007fed38bebce1a6e0760c1cfa359661a4c89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1235-1243 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1279-1287 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1235\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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"75199d0e38d21ab0ea1ec16b170f9c8665de68376caead9dea699fc7efeab40d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:557-565 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:580-588 \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/FSharp.Data.Adaptive/Datastructures/IndexList.fs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"31bb3973b9d022df95597fcc2707fe5a82b3b4085aa38291f1a071b2f9bc7800"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2143-2151 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2567-2575 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":2143}}}],"partialFingerprints":{"codehealthFindingId/v1":"6460791616d6d2d77fd371bc828b7d936261b2565db173f15c37a7df02131b29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2153-2162 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2577-2585 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":2153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7df6afffa5edb28588fdcbaae1cdcfc6c4a467fdc18475358416622e38c611b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): src/FSharp.Data.Adaptive/Utilities/PriorityQueue.fs:178-186 | src/FSharp.Data.Adaptive/Utilities/PriorityQueue.fs:239-245 \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/FSharp.Data.Adaptive/Utilities/PriorityQueue.fs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9225d24b02a8f6150be65e1ae99075931a041c0fb9d94289ba3a5cc1221708"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 7): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1227-1233 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1271-1277 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1323-1330 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1377-1384 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1484-1491 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1539-1546 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1604-1611 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1227\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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"f522f3ec5df4a25320cbabd5146f08889f24cd3c303d648a15517666f0b17d4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 5): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:532-539 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:555-562 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:607-614 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1285-1291 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1313-1319 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. 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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a780e4ec2983d89c7d805f36c32da5eb2f4e3ba9849ed3e29a401cc409b763"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1322-1329 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1338-1345 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1355-1362 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1371-1378 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/IndexList.fs"},"region":{"startLine":1322}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e3e2c2d95fc85d64c106f9b3bace332e4750e7f85b46fd20c8e1e9147e6cae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1394-1401 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1410-1417 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1426-1433 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/IndexList.fs"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e30c6d859e93580b9956689fa8080091d23defd69370c0b2082ea422d6d88a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveIndexList/ChangeableIndexList.fs:147-154 | src/FSharp.Data.Adaptive/AdaptiveIndexList/ChangeableIndexList.fs:162-169 \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/FSharp.Data.Adaptive/AdaptiveIndexList/ChangeableIndexList.fs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c85f6adf6e17f042141f288c8a03b211b03b3d8e0a5cb6e7f0273e37abae52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1055-1062 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2362-2369 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"277965721e0e17107a2c4fc1172be97a3ade950c90da7600990a22a053b7c23a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1332-1373 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1493-1534 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81be6afaf28f9e4a33db90810828048d0c62ca403675b4e0589fca652d13f95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1673-1681 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2893-2900 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b258d3198bfbd0836ab722656b9018f3d8c3cb59873319b590b4e2e0dbdf42c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2418-2425 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2441-2448 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2418}}}],"partialFingerprints":{"codehealthFindingId/v1":"177dec15b1ec5bb917f6977f704198080fcfcda4ed1a05d4444d5a311eee0a23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2649-2668 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2715-2734 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2649}}}],"partialFingerprints":{"codehealthFindingId/v1":"93632b19598105040fe5e6c07ab68c5f24bfefc042c654abf1eb19e215eb67b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:220-227 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:233-240 \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/FSharp.Data.Adaptive/Datastructures/IndexList.fs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb072bd516c73712a79a978fb00d2637f8b7789e218900556c533cde3a70a73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:769-776 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:805-812 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs:769\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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"73386e50d16c2e3022b069e8b71f17ea894e2bb3cef86637e631382636282e43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:844-851 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:926-933 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"779d7c2d578aab46ed8455c39e0bdafa40764296ba491070270f7f8a6b50db21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:856-863 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:938-945 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce20748c136559d386738a50174e002b2063cafc9c597a9609a6c9f4d4680ef7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1297-1304 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1325-1332 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1297\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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d68ef2f9c4cc9004da899c1bb5bec86cfa8cefe4841af25bc86684231e48b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2347-2355 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2486-2493 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":2347}}}],"partialFingerprints":{"codehealthFindingId/v1":"2328aa4a9e73ec2a59fff25385712efc0b84256ce4eacb554af5cb8012bfe094"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2649-2655 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2715-2721 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2771-2777 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2649}}}],"partialFingerprints":{"codehealthFindingId/v1":"50be42c3ef0d00ac4785074d8326ddcc5fdd5e70dc4b70c247c580e7e6e48974"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3229-3235 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2756-2762 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2838-2844 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":3229}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75ef1bb04568bd1b7995323970b61395a8ec9c028ad57a821ed2852b2344407"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3916-3922 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3924-3930 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3932-3938 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":3916}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f917ea033500d2572d7f4933007abdc9f5d86cdd4b926bc198fb112cf76e3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/CSharp.Data.Adaptive/AList.fs:79-85 | src/CSharp.Data.Adaptive/ASet.fs:94-100 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/CSharp.Data.Adaptive/AList.fs:79\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/CSharp.Data.Adaptive/AList.fs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e976dd6ffee12e0ac9ba7da96da26c2ef662655a937f3d77f125f3f95160a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/CSharp.Data.Adaptive/AList.fs:87-93 | src/CSharp.Data.Adaptive/ASet.fs:102-108 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/CSharp.Data.Adaptive/AList.fs:87\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/CSharp.Data.Adaptive/AList.fs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e31bb087b72eb0bc986c3dfa9a4d9744a1556a493adf05faa9abcca77e2fd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/CSharp.Data.Adaptive/AList.fs:144-150 | src/CSharp.Data.Adaptive/ASet.fs:165-171 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/CSharp.Data.Adaptive/AList.fs:144\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/CSharp.Data.Adaptive/AList.fs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"651b8fe04483f6e0bd342e6a72784b2a0c2113bda68094a53f9960aee8888e10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/CSharp.Data.Adaptive/AList.fs:153-159 | src/CSharp.Data.Adaptive/ASet.fs:174-180 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/CSharp.Data.Adaptive/AList.fs:153\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/CSharp.Data.Adaptive/AList.fs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c869fe6b2e354f90ab06e341ba86790933a9eb5a43dbe3977c08d4d7d53a28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/CSharp.Data.Adaptive/AList.fs:266-272 | src/CSharp.Data.Adaptive/AList.fs:274-280 \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/CSharp.Data.Adaptive/AList.fs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f5764a2323b462965d7b4068789e9c9ee8f75c01abad7bb2897a097f87821d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:186-192 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:195-201 \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/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d04932284ea006685d78cff379f49a4f244c511cb4c3c5689ba961eebb8f5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:204-210 | src/FSharp.Data.Adaptive/Traceable/CountingHashSet.fs:276-282 \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/FSharp.Data.Adaptive/Datastructures/Deltas.fs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"4486a2b39168e221234b122c13b0af5071710990bc8a088f23850cf3c6649963"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:697-703 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:722-728 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"49754b03975b1e1b072445837fe7f0e05458aaa3a876a852751e11336ca2bf20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1317-1323 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2756-2762 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6909323e3bbbfa7b9aadc245c906e249f9a5c7a49f7a62b4bca6431fe301ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2404-2410 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2427-2433 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2404}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7e7578d1acc707cac3fca953191a1425aaa4b459c022e866c74620c9d5fb44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2934-2940 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2945-2951 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2934}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12d0d304b60122378b00dd8de49472c5f649c218d54eecd5f8edca55ba3b67e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3586-3592 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3594-3600 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":3586}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c6d1df4bbad3590d5d3719904ee9a9975cb77202a1ff76fada7eb849fcd1a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3965-3971 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3973-3979 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":3965}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c583c4dc3a6af33af2d95547e5c1a25babfb889f4a73b3ba8d5cb35e5f7106"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:448-454 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:466-472 \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/FSharp.Data.Adaptive/Datastructures/IndexList.fs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c41e31410b7f1bee70cfc4fe049bec94226428d0d324e88c9cce2c28b09f5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:346-352 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:405-411 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aac4c9258c38cf6e46c2398d8bd42934444ca12f80ed99b9957bf3ccf10b769"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:821-827 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:903-909 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a63dbfb136baa483d768327773b401f318b47b42575aee0b90293801566386"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:832-839 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:914-921 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7841620643934dea798f98a6c9343b4833d991aad3b22835360cee6b7b761d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1492-1499 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1477-1482 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:1570-1577 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be8c5033e974332ef258fcce10bf1dae3a9b1c7dc759cc62a8d011f4a55e4c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptifyHelpers.fs:61-69 | src/FSharp.Data.Adaptive/AdaptifyHelpers.fs:147-155 \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/FSharp.Data.Adaptive/AdaptifyHelpers.fs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5c8f38d5acdbb1a91c440e875edc3fe6f0a4ed21d0f2b7aea25e0bf344c0dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:43-49 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:43-48 \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/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:43\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/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"5240e98e3dc6d956ca847b534b8964ef5c177c595982a26d00007fec50d07c83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:48-54 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:34-40 \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/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"93457c77936fbca3b94692db69bc13eb240f3204b01302bf176e04097c882481"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1470-1475 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:1563-1568 \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/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs"},"region":{"startLine":1470}}}],"partialFingerprints":{"codehealthFindingId/v1":"e172ff9747aa6ae22d3e198cf2e4d102c20f750f1adca853f6d8c7036416de5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1287-1292 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1396-1401 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1287\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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1287}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eefd49215df1a135104ccccc019105c05cfcfdafb2e216ad2febc4ae12cf433"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1446-1451 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2582-2587 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1446\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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"129ae7906d9bc945cef579d0edb8ae17ef9f2429c553e86569952f12c374f29a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20136 lines \u00D7 5): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:859-869 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2663-2664 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2675-2680 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2729-2730 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2741-2746 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. 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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2680\u0060 calls \u0060Mask\u0060 and \u0060src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2664\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd146fbc456d4a25e8b371b259964627a18e29bb0894302ef675f1886690ad4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:494-500 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:506-512 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"048a4c5d980bd01baf69a4f1ebe6a76db39a7856b86915b480f057d0c91e86bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:543-548 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:566-571 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs:543\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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"3082b707ce173a62ae9c6d4f5ffed97d3a64d16a0fc198381ee5be050c6a62d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:767-772 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2187-2192 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c3216ba1b8513793aa5137f243acfab1124c04f361a0e93735a60ce5aac8b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:868-873 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:952-957 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb959903c7fb4c5496bd9cfc4391804e41da5f151e03339a968f76211d4f8575"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:876-881 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:960-965 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b604e90e247afb29fde4d536a8f6d0e3fa90170fcebd3585921720a65bf751"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:884-889 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:968-973 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ac6a55db926d35ef5ec1c67f7097052fb991a96f8af0e3c2be81cc48780204"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:892-897 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:976-981 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6bf63ec6a92b532629ea47c21791a6d325aedb9d67cc5d99d9ec511af3cf7ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1081-1086 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1110-1115 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec17df0683676fd9c9b182e3448170b1eae98709eddf0d686226d97fe20cdce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 3): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:778-781 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1883-1888 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2198-2204 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38861402098a34ea836b2862a6515301d421e701fc7a46f65575c8e1d3be8e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2299-2304 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2308-2314 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":2299}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6bc20eb46f864dad7dccf59e79e25bc7ef9bc787a4fc748d5f933dbcdc5aa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.Adaptive/ShallowEquality.fs:219-224 | src/FSharp.Data.Adaptive/ShallowEquality.fs:360-365 \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/FSharp.Data.Adaptive/ShallowEquality.fs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"21aed15d7e16b720f64fa140a613321ba2da133d6f280046445c06967e899bcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7): src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1320-1324 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1336-1340 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1353-1357 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1369-1373 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1392-1396 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1408-1412 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1424-1428 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/IndexList.fs"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95c08491b08fe1d4a21de2ddd3ac53e764932e3deacccb65507e55955c5ff0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 6): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2381-2385 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2640-2644 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2706-2710 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2762-2766 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2826-2830 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2986-2989 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2381\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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2381}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36e1278c267b65756cbf0018a66a3c60057b4d52d3f9f19a760b8a01fe0e11b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:545-551 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:568-574 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:770-776 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:806-812 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"78be61a21695f36050c06b8e6891c14edd09d6edb4dcfaa2fd37a0e001ad109b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:566-570 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1296-1300 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1324-1328 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs:566\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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"25bcb21da310cbbc94abfb8a7bdfad7df4d38e6713565ca5828c46b47e25f834"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:517-521 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:525-529 \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/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:517\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/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"564d85bc0117d74f3213795a55a2fe1f76ba8b02beb4987e3f894e2a86a22d13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi:58-63 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fsi:67-72 \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/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi:58\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/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c4bce49c6a5c7e9ddb5cdecb2931bc7830fef1191ab41dc1687f0c61cbda7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 8): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi:203-204 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi:211-215 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi:228-229 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi:234-236 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fsi:294-295 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fsi:302-306 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fsi:319-320 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fsi:325-327 \u2014 there are 8 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 8 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi:203\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 before the matched lines, \u0060src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi:234\u0060 calls \u0060when\u0060, \u0060member\u0060 and \u0060src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi:211\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/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b57ff5377cd2a794b46a15c0544b4c6b8fd3c14125c3308c2f00030ed3585a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1395-1399 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2581-2585 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"57313aff48e06e270e935af5f744cc1236eea6dc15106a2aa2e645ccf5461741"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1445-1449 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1557-1562 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1445}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ff874a16ea6921cb30711b5c4924f7773c2a20afa0802206cd51a4b805dc70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2456-2460 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2563-2567 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2456\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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2456}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9759cfbdd3ac203465c9dbc97734d3fd6cc2cc69726cd025b0ef8c83ce9e311"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1102-1106 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1117-1121 \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/FSharp.Data.Adaptive/Datastructures/IndexList.fs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"685e93c0512cc6adc10d58ccdc41ce95128b36a266be99775f7f9f2a86e6823d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1313-1317 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1346-1350 \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/FSharp.Data.Adaptive/Datastructures/IndexList.fs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55be07fd6dc25d4b207fdde10f93b9571c5f6a2621e0b87ed767eb62e9c47a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1091-1095 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1105-1110 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3e8ce4770c862cf1dbdeaeeb7d92877a4a85bfd544732e00a76ae8234537b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1426-1432 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1484-1490 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40967ecee6ad2a6da119e8dee7958a88362f9e32d89e269fe7ac5b31266976f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1542-1546 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1559-1563 \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/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ce2b43eb48e843d985806188cd56dc7670a195f27923b8f8f73b172ea1af81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 3): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3250-3251 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2778-2782 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2859-2863 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. 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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":3250}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56c4c98d2c2995358237f8b65f306bae190bd58e9c49c5bbd767c0bba1fc6d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi:218-224 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fsi:309-315 \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/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c719eb639d41c3b6bcc5f6a1519dcc86c05aff1c313caf11568e976ff148e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:305-309 | src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:387-391 \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/FSharp.Data.Adaptive/Datastructures/Deltas.fs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"782d19b3020a20b3b07d664615bc771eb7dc6f4b7cb1e0fc6765733299b9f005"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2060-2065 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2080-2085 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2100-2105 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2060\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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2060}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0280b98002219c851a8a6325e4e009cfc38389d2721eca89847bb9b51df6ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2658-2662 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2724-2728 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2780-2784 \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/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2658}}}],"partialFingerprints":{"codehealthFindingId/v1":"8237223c07f63832853f0a50ec4ec6dd0d566286f4e1632870bd6e25cd769a46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/Demo/Scratch/ABag.fs:305-322 | src/Demo/Scratch/ABag.fs:350-367 \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/Demo/Scratch/ABag.fs:305\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/Demo/Scratch/ABag.fs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12ac2751aab25fae180a8fb330f6c244b8ef7bdd4a2c1af50902c4a60ec96d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/Demo/Scratch/Observable.fs:63-77 | src/Demo/Scratch/Observable.fs:151-165 \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/Demo/Scratch/Observable.fs:63\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Demo/Scratch/Observable.fs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a45369eb97d82b66c683e5b8fbab0e8333d8102e9d9c17ee640c371d898a82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): src/Demo/Scratch/Observable.fs:67-79 | src/Demo/Scratch/Observable.fs:111-123 | src/Demo/Scratch/Observable.fs:155-167 \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/Demo/Scratch/Observable.fs:67\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/Demo/Scratch/Observable.fs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6ec5fd935a019c0325dad196b66e32a564a742078525577a1a1aa18ab32dea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/Demo/Scratch/ABag.fs:188-199 | src/Demo/Scratch/ABag.fs:207-217 \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/Demo/Scratch/ABag.fs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"7376bc066b96d55c32b5dcc6602c4a3f4af30f87241cb9841ebaf558cd03455e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/Demo/Scratch/Observable.fs:48-58 | src/Demo/Scratch/Observable.fs:92-102 | src/Demo/Scratch/Observable.fs:136-146 \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/Demo/Scratch/Observable.fs:48\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/Demo/Scratch/Observable.fs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21bd068334b87385bb88129a78ecf5d093990e65f97c129849e2f6d1db0afcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Demo/Scratch/ABag.fs:290-300 | src/Demo/Scratch/ABag.fs:335-345 \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/Demo/Scratch/ABag.fs:290\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/Demo/Scratch/ABag.fs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"e633040041f581c1ce4f7762692095cf1a1229e1f58ceb26bfe73a9ec2da4e40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/Demo/Scratch/ABag.fs:151-160 | src/Demo/Scratch/ABag.fs:168-176 \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/Demo/Scratch/ABag.fs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3eae519b5d232139ed858f31fa6480b21a755a71f9763f5ecba3e55a97f033d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/Demo/Scratch/ABag.fs:276-285 | src/Demo/Scratch/ABag.fs:322-330 \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/Demo/Scratch/ABag.fs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ff59e76e648c9ad267b7654b4719521e38ca794afd75b956e6bd96e62cdf30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/Demo/Scratch/ABag.fs:557-567 | src/Demo/Scratch/ABag.fs:604-615 \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/Demo/Scratch/ABag.fs:557\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/Demo/Scratch/ABag.fs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3fff47fddbb036e128100770e8fafa1c511a71c08d23b5693508fd32d0f942"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/Demo/Scratch/LookupAll.fs:98-107 | src/Demo/Scratch/LookupAll.fs:115-124 \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/Demo/Scratch/LookupAll.fs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c89df192d5cfb5f54940d46cdc0d30a560af0ce6ca8603022c5370cbb069a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Demo/Scratch/ABag.fs:246-250 | src/Demo/Scratch/ABag.fs:371-375 \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/Demo/Scratch/ABag.fs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"9851a962e36d317fe5c6a022c02c33f599168f571ada923891e85584506488b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Demo/Fable/Program.fs:10-18 | src/Demo/Fable/Program.fs:22-30 \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/Demo/Fable/Program.fs:10\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/Demo/Fable/Program.fs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b2ec2589836b9a2d4b5b9d7fe8d8b4306716bb85317eb5be705e63381a429b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Demo/Fable/Program.fs:79-83 | src/Demo/Fable/Program.fs:84-88 \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/Demo/Fable/Program.fs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf43bcf9432062d6cb49b304f7b18532bf25552b708966bc2ca4246e581c82f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: History\u00602 (LCOM4 5): History\u00602\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Traceable/History.fs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"a967862e1d25e76fe7f3f3cbd3af1655b4ce846c172b29910f2c780f005ae18c"}},{"ruleId":"D12","level":"note","message":{"text":"Outdated: FSharp.Core: FSharp.Core 4.7.2 \u2192 11.0.101 available (referenced by FSharp.Data.Adaptive)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"71097badbe27b5625a274b76342e1f8adbf51dabf5de4d1138532fe38f00ae7e"}},{"ruleId":"D12","level":"note","message":{"text":"Outdated: FsUnit: FsUnit 3.4.1 \u2192 8.0.0 available (referenced by FSharp.Data.Adaptive.Tests)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"38240edda6f731f06d2b21bb71ea7228852ebfec8f5b82f487b9321685958d07"}},{"ruleId":"D12","level":"note","message":{"text":"Outdated: Microsoft.Extensions.DependencyInjection.Abstractions: Microsoft.Extensions.DependencyInjection.Abstractions 8.0.2 \u2192 11.0.0 available (referenced by FSharp.Data.Adaptive.Tests)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"975f7090c672cd42740e422628e485e691d2c29a30f7397b39d26918aeb57e4a"}},{"ruleId":"D12","level":"note","message":{"text":"Outdated: Microsoft.Extensions.Logging.Abstractions: Microsoft.Extensions.Logging.Abstractions 8.0.2 \u2192 11.0.0 available (referenced by FSharp.Data.Adaptive.Tests)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5d1d778014b65cbfa7ca8eb15a6eacf49d85cea868e48c56a7866e7acc38b158"}},{"ruleId":"D12","level":"note","message":{"text":"Outdated: NUnit3TestAdapter: NUnit3TestAdapter 3.15.1 \u2192 6.3.1 available (referenced by FSharp.Data.Adaptive.Tests)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4d94bcb7e7737fd97dfa9e239a890c95433b4c78a1ea635b334a5e6b01b1bed3"}},{"ruleId":"D12","level":"note","message":{"text":"Outdated: System.CodeDom: System.CodeDom 8.0.0 \u2192 11.0.0 available (referenced by FSharp.Data.Adaptive.Tests)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ec1e2b5587cecf1c893ffe4f5e84043d465f36aa07ce0cf72862b9c36be0f616"}},{"ruleId":"D12","level":"note","message":{"text":"Outdated: System.Collections.Immutable: System.Collections.Immutable 8.0.0 \u2192 11.0.0 available (referenced by FSharp.Data.Adaptive.Tests)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fdb3ea170ff1450edcee5e4e7b3cdacf8072f16ea695440aaeea0a487508be80"}},{"ruleId":"D12","level":"note","message":{"text":"Outdated: System.Management: System.Management 8.0.0 \u2192 11.0.0 available (referenced by FSharp.Data.Adaptive.Tests)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6fd0a16e24c5e83b2ed063c0a98363cb209e4b43365281dd8dadb5d6e697eed1"}},{"ruleId":"D12","level":"note","message":{"text":"Outdated: System.Reflection.Metadata: System.Reflection.Metadata 8.0.1 \u2192 11.0.0 available (referenced by FSharp.Data.Adaptive.Tests)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9dde8938de42c9cce1c0f37eaf725b2919431bb5054f74dde7050c1ac3cf4edd"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: Microsoft.DotNet.InternalAbstractions: Microsoft.DotNet.InternalAbstractions 1.0.0 \u2014 Other,Legacy"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e6cf53c257b0604ceccc95b753db3b397ce2339213ae94f82390e3d7c5f169c4"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 2 significant file(s) lose their only recent owner: src/FSharp.Data.Adaptive/Datastructures/IndexList.fs, src/FSharp.Data.Adaptive/Datastructures/Index.fs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7ff980b6e3e8ff97abb967beb3b513aa93a7cae8b490ee8dd010cdd16cf03ae8"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 1 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (4 single-owned of 35 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 35 of the 49 production source files in this repository met that bar). They are anonymized user #2 (2 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: src/FSharp.Data.Adaptive/Traceable/History.fs, src/FSharp.Data.Adaptive/Core/Callbacks.fs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D27","level":"note","message":{"text":"Scattered collaborators: 96 % of calls cross a namespace and only 57 % of collaborators are co-located \u2014 group each feature\u0027s code into a vertical slice so a call\u0027s collaborators sit together."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5aad4a4530bac3928d3a065a664be89d023ecfc865f9bf79ac05754b3bffe322"}},{"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":"969b9e533779b89b57eea221f97968ae31c756111a0701bc115d2e0333ea3bf1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f6d629032dff8af67a8377dc92a11bc9f3174a637468e2db142a019acc12e4ab"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6847d536369ed82b746f9b6d4d590d1ebcf4fb6f0d5786fad3c98ee38d6b5504"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6deb22de4459d55e5301959b0b9ba4dab002b3d2c3fb21f964f13d43587aff39"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"77847d4d9e715398297c158f302f573115261fa4ec2a7243fa64534887cf387b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e7efc20376ca82d297e418b4690e33529d542653dba1b7d7d2bb15afc33b69a4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"801e60aed41b1830aa35670f62ac1a60a301a9b98f6d9a13478d3be3430260a0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eca0d79a5c8b32b1d32d17adeed54e8bf4045e3e5122f4a9479da6c4481f7387"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d1c8099c7ef2013a8812c98ac636dd763212ae1bc0df3979fbca3aa1fa922dcd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"79e2fd5e017cf58f406d9805b9c9a8dd9544de1e5f6af42ce48ab33227f6de59"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d89ff8be40979a750f71a1b1785d33a78ab956aa773c1a40e692751cfa2edca2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D32","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":"26d35d28564e0df21c70bb5679c9dfe7ef9db7841b3fec5d7af5eb4d0982d00a"}},{"ruleId":"D32","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":"6549da404df7a19b9c9a5b4c66789941fdc16646c8368c40f5e23abf32f42f22"}},{"ruleId":"D32","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":"19ae4dea53755fca717bef904b3ad14ddf2135af5530af5b399f2658b8fe8681"}},{"ruleId":"D32","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":"d947401cf7ec86eadc2b53d1336762223a17beffbfbedc214930cd2ae768c8c6"}},{"ruleId":"D32","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":"00d043cfc50ebd0ff0d890b276fc99ddd569160ada4e223604e782fb53932e16"}},{"ruleId":"D32","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":"981637ce8712a9655ba421528884307379bd83120937c3b76decfb28dabba492"}},{"ruleId":"D32","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":"2675aea13a5b16bb9dbacd259d7143e288d197a55d0cebdbc9c18fbc23b67204"}},{"ruleId":"D32","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":"f432ad9631c686df0c585837cfece2600be95197b7582b5dff9d99b0546ed245"}},{"ruleId":"D32","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":"091ec33072d4469f450e5bee3ef90e0adb19f5521dc8415ed423d827cba14cf1"}},{"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"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"eeed2d3792b87d71d40b69152387bea443e359d949d9504db11989b2fc309608"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"6c9e1c66cfdc8ecd0631d6845188e06eacd570c0f896bdb6eb35ca34adfbafa7"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"f565882c0a115fb9578e0145fd6b0e800a1762ed087db622de4d0ffa7bcb5dc2"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"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":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page \u2014 but when a run fails on a user\u0027s machine, neither they nor you have anything to read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add \u0060semgrep --config=auto\u0060 plus gitleaks for committed secrets (F# is not a CodeQL language and has no language-specific SAST engine) as a CI step. What was searched, so you can tell an absence from a miss: the 3 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/dotnet.yml"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060src/FSharp.Data.Adaptive/FSharp.Data.Adaptive.fsproj\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/FSharp.Data.Adaptive.fsproj"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"9454728e06f12fa6632bcd52e3e9cf5d4943c89bbd2d18e144bd60b4b6fe9876"}},{"ruleId":"SC1","level":"warning","message":{"text":"NuGet dependencies are not locked: No packages.lock.json and no central package management \u2014 restores aren\u0027t reproducible or pinned (SSDF PW.4.4). Enable \u003CRestorePackagesWithLockFile\u003Etrue\u003C/RestorePackagesWithLockFile\u003E (commit the lockfile) or adopt Directory.Packages.props. Advisory \u2014 never scored."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0a97b4f69ccac509400ece7eedefb06d3ede0522cd4d8bcb5c068bea719545a6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lowerBound.IsConstant \u0026\u0026 upperBound.IsConstant\u0060 appears character-identically in 2 files \u2014 src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs, src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs"},"region":{"startLine":1649}}}],"partialFingerprints":{"codehealthFindingId/v1":"923011d61fe4802c0c2fef89d0c098e9b872ea99138cbc18fb17e5712f872616"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060reader.State.Count \u003C= 2 || reader.State.Count \u003C= ops.Count\u0060 appears character-identically in 3 files \u2014 src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs, src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs, src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"444f4511a13859980fa5c40d2d8ca47d5a8cc4530e4f04b9725f627eba1601a7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state.Count \u003C= 2 || state.Count \u003C= ops.Count\u0060 appears character-identically in 3 files \u2014 src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs, src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs, src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b23a6a4dec1624c41451cf818a74bc83a97808a774149851ee77f30ea6159c0"}},{"ruleId":"X5","level":"note","message":{"text":"Nullable reference types not enabled everywhere: 0/1 NRT-eligible project(s) enable \u003CNullable\u003Eenable\u003C/Nullable\u003E (projects targeting a pre-C#-8 framework are excluded \u2014 NRTs aren\u0027t available there). NRTs catch a whole class of null-deref bugs at compile time."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"80b24de9378624a0ce4846d60457395befcaec8e109ea81d289a370c9f7bfd5d"}}],"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-200","guid":"b0ce3b1d-7a29-fe50-8aab-9aba899d2988","name":"Exposure of Sensitive Information to an Unauthorized Actor","shortDescription":{"text":"Exposure of Sensitive Information to an Unauthorized Actor"},"helpUri":"https://cwe.mitre.org/data/definitions/200.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-312","guid":"96724ece-b0b2-a45c-83f9-0869fa3f6bea","name":"Cleartext Storage of Sensitive Information","shortDescription":{"text":"Cleartext Storage of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/312.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-359","guid":"b7dfe5b0-0351-645b-a311-b936102c2929","name":"Exposure of Private Personal Information to an Unauthorized Actor","shortDescription":{"text":"Exposure of Private Personal Information to an Unauthorized Actor"},"helpUri":"https://cwe.mitre.org/data/definitions/359.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-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":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"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":28,"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."]}]}