{"$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":"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":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"id":"D33","name":"JS/npm Dependency Vulnerabilities","shortDescription":{"text":"JS/npm Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D33","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}},{"id":"D38","name":"OSV Dependency Vulnerabilities","shortDescription":{"text":"OSV Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D38","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"LookupReader\u00604.Compute (cyclomatic 42): LookupReader\u00604.Compute has cyclomatic complexity 42 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Demo/Scratch/LookupAll.fs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d2e84fa50c0e809c99b262b6d9e93d36f75c64db82de4c8e38c0589012d6a4"}},{"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":"HashMap.[HashMap] map2/choose2 (cyclomatic 28): HashMap.[HashMap] map2/choose2 has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Test/FSharp.Data.Adaptive.Tests/HashMap.fs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6d8a98ff859fc25a872e004722d72dd806e6cda19e98035b30ba8dba53a642"}},{"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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":"ABag.collect (cyclomatic 19): ABag.collect 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/Demo/Scratch/ABag.fs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f04e09b27f621667b5928aeaa3f6c64295bd6b7829f13e315453e1b99e387ef"}},{"ruleId":"D1","level":"warning","message":{"text":"DeltaOperationList.ofArrayMyersBackup (cyclomatic 18): DeltaOperationList.ofArrayMyersBackup has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Test/FSharp.Data.Adaptive.Tests/Benchmarks/ListDeltaBenchmarks.fs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1c1571d4468769f6b93a8fd34dce3e177dde26f13944dbac9966d9f0f47aa3"}},{"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."},"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."},"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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":2161}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd11b779f0365d71c0ac265141b6c86f710792a207844714edcccb6642ab63b"}},{"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/Test/FSharp.Data.Adaptive.Tests/Benchmarks/ListDeltaBenchmarks.fs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"91373417fc5df93fe0ce25d538a504264c0944065bc979b6587224f32e1586b3"}},{"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."},"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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1931}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3efc97934cdc85ec7a64acc8cd0e6f5c1ef209a1e3982b88fd30bbdd9dc9686"}},{"ruleId":"D1","level":"warning","message":{"text":"LookupAll.example (cyclomatic 16): LookupAll.example 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/Demo/Scratch/LookupAll.fs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1981aa8835544efb5d682f4f79ea9bd7aa9f606a032471d330cfb4274a95900"}},{"ruleId":"D2","level":"warning","message":{"text":"LookupReader\u00604.Compute (cognitive 90): LookupReader\u00604.Compute has cognitive complexity 90 (threshold 15). Drivers by points: match/switch 71, if/else 10, loops 9 (nesting depth added 65). 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/Demo/Scratch/LookupAll.fs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"74cc433db2b9d3771dc5e5ba8d878e56bbc9ce0377c8d54837ab95288cb43df1"}},{"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 44, loops 24, match/switch 4 (nesting depth added 52). 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/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 39, loops 24, match/switch 4 (nesting depth added 48). 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":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 39, loops 24, match/switch 4 (nesting depth added 48). 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":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb581f9344f8e8ddc37a4bcc31a7c1e906cfd0522b2cfa92846d552395d36d0"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexList.computeDeltaToArrayBaseline (cognitive 67): IndexList.computeDeltaToArrayBaseline has cognitive complexity 67 (threshold 15). Drivers by points: if/else 39, loops 24, match/switch 4 (nesting depth added 48). 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/Test/FSharp.Data.Adaptive.Tests/Benchmarks/ListDeltaBenchmarks.fs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c95cfe4db808a33f8576be0c70e10611c10a2b774433d1d120104812690aa2"}},{"ruleId":"D2","level":"warning","message":{"text":"MapExtImplementation.replaceRange (cognitive 60): MapExtImplementation.replaceRange has cognitive complexity 60 (threshold 15). Drivers by points: match/switch 33, if/else 25, 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":"ABag.collect (cognitive 48): ABag.collect has cognitive complexity 48 (threshold 15). Drivers by points: match/switch 29, loops 17, if/else 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/Demo/Scratch/ABag.fs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6089aa519abeac4640213a3b686f3f714b24a94427272ef208a0628d6f3636"}},{"ruleId":"D2","level":"warning","message":{"text":"WeakOutputSet.Remove (cognitive 47): WeakOutputSet.Remove has cognitive complexity 47 (threshold 15). Drivers by points: if/else 42, loops 3, match/switch 2 (nesting depth added 28). 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/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 30, match/switch 17 (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 36, if/else 11 (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 36, if/else 11 (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 44, 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 28, if/else 11 (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 37, 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 27, match/switch 11 (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/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 27, match/switch 11 (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/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 18, match/switch 9, error handling 5, loops 4 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/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 32, match/switch 2 (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 23, match/switch 11 (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":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 22, match/switch 11, 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 23, match/switch 11 (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":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 23, match/switch 11 (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":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 23, match/switch 11 (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":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 23, match/switch 11 (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":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 23, match/switch 11 (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":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 23, match/switch 11 (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":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 23, match/switch 11 (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":2810}}}],"partialFingerprints":{"codehealthFindingId/v1":"d582329bc1f102a2a2ffdc253390cfeda9e42a333bbcf7e1046c08d04e9f80a3"}},{"ruleId":"D2","level":"warning","message":{"text":"ASet.[ASet] ofSetTree (cognitive 34): ASet.[ASet] ofSetTree has cognitive complexity 34 (threshold 15). Drivers by points: if/else 30, boolean chains 2, loops 2 (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/Test/FSharp.Data.Adaptive.Tests/ASet.fs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"26bb43e2e830135288e45e532ceca66e948c22d9f5df46ea2b3d40a9d3592200"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexListModule.alterAt (cognitive 33): IndexListModule.alterAt has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 20, if/else 12, 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 19, match/switch 14 (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 22, match/switch 11 (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 21, match/switch 11, 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":"DeltaOperationList.ofArrayMyersBackup (cognitive 33): DeltaOperationList.ofArrayMyersBackup has cognitive complexity 33 (threshold 15). Drivers by points: if/else 21, boolean chains 6, loops 6 (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/Test/FSharp.Data.Adaptive.Tests/Benchmarks/ListDeltaBenchmarks.fs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1e10a6927183fc3f5b07ce38c9d89fc0c07a23925930d623d78b8745d0f473"}},{"ruleId":"D2","level":"warning","message":{"text":"MapExtImplementation.choose2 (cognitive 32): MapExtImplementation.choose2 has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16, match/switch 16 (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 19, boolean chains 6, loops 6 (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":"ABag.sortByInternal (cognitive 31): ABag.sortByInternal has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 22, if/else 7, loops 2 (nesting depth added 18). 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/Demo/Scratch/ABag.fs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"e101b1fac4854760ec2f71d26e5196212da752637b51c5e98b593b31cb2fb80a"}},{"ruleId":"D2","level":"warning","message":{"text":"DeltaOperationList.ofArrayMyers (cognitive 31): DeltaOperationList.ofArrayMyers has cognitive complexity 31 (threshold 15). Drivers by points: if/else 19, boolean chains 6, loops 6 (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/Test/FSharp.Data.Adaptive.Tests/Benchmarks/ListDeltaBenchmarks.fs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0d2b1c3e9495ca6ee36da14b0539c59aabae6a23463abe3fb91c512df2e5ea"}},{"ruleId":"D2","level":"warning","message":{"text":"WeakOutputSet.Consume (cognitive 30): WeakOutputSet.Consume has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18, match/switch 8, loops 4 (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 29, boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/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 29, boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/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 29, boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/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 28, match/switch 2 (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 16, match/switch 14 (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":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 16, match/switch 14 (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":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 18, if/else 11 (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 17, match/switch 11, 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 17, match/switch 11, 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":"ABag.ofAList (cognitive 28): ABag.ofAList has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 20, loops 6, if/else 2 (nesting depth added 19). 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/Demo/Scratch/ABag.fs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed262fa2cd3e51c68ef523c9d47b0211e056ca6f1aef4fe1afd56d5b6f8cf546"}},{"ruleId":"D2","level":"warning","message":{"text":"MapNode.tryRemove (cognitive 27): MapNode.tryRemove has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15, match/switch 12 (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":"AListSub.run (cognitive 27): AListSub.run has cognitive complexity 27 (threshold 15). Drivers by points: loops 16, match/switch 7, if/else 4 (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Demo/Scratch/AListSub.fs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfcc5833f986b0edbd5c4f0529589d5eac9b1026a8acc9fc54298c82917fdbb2"}},{"ruleId":"D2","level":"warning","message":{"text":"AList.[AList] sub random (cognitive 27): AList.[AList] sub random has cognitive complexity 27 (threshold 15). Drivers by points: loops 16, match/switch 7, if/else 4 (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Test/FSharp.Data.Adaptive.Tests/AList.fs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb304aa470ebc7dde061f72d7ee682d7d3e3acd07b51312b7574205654858f4"}},{"ruleId":"D2","level":"warning","message":{"text":"HashMap.[HashMap] map2/choose2 (cognitive 26): HashMap.[HashMap] map2/choose2 has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 19, loops 4, if/else 3 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Test/FSharp.Data.Adaptive.Tests/HashMap.fs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc27f80914c4b8454f8653e110a1168e107aa87ffbb2364af70c22a3ba3f38b"}},{"ruleId":"D2","level":"warning","message":{"text":"MapExtImplementation.changeV (cognitive 25): MapExtImplementation.changeV has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 14, if/else 11 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/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 14, if/else 11 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/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 14, if/else 11 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/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 18, match/switch 6, 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 17, match/switch 8 (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":"LookupAll.example (cognitive 25): LookupAll.example has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13, match/switch 9, loops 2, boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Demo/Scratch/LookupAll.fs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"6611621a2e118581d973197ef8d4479b61abca6a86cc6510a759080d3c588d48"}},{"ruleId":"D2","level":"warning","message":{"text":"ABag.sortWith (cognitive 24): ABag.sortWith has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 15, if/else 7, loops 2 (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/Demo/Scratch/ABag.fs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e95d6e62bade0b83583c874edbb801cc186542795f54c672cd9c7afc6d7690"}},{"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 17, if/else 4, 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":"Pretty.print (cognitive 21): Pretty.print has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 16, if/else 5 (nesting depth added 12). 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/Demo/FileSystem/PrettyPrint.fs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4d92a7baff1f91bf9b89ebd7a572381553dff94d1da8b276f66181686566b7"}},{"ruleId":"D2","level":"warning","message":{"text":"SetNode.addInPlace (cognitive 20): SetNode.addInPlace has cognitive complexity 20 (threshold 15). Drivers by points: if/else 18, match/switch 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/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 18, match/switch 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2108}}}],"partialFingerprints":{"codehealthFindingId/v1":"85624e8f91b5065588a730e81f1ceea99377a263864c7a80fa2b9790188ab77b"}},{"ruleId":"D2","level":"warning","message":{"text":"AList.[MapExt] neighbours (cognitive 20): AList.[MapExt] neighbours has cognitive complexity 20 (threshold 15). Drivers by points: if/else 19, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Test/FSharp.Data.Adaptive.Tests/AList.fs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75f10c9b15092e1792ebfad19457d0b49faeea1b2fec09a4ab397fa752e6735"}},{"ruleId":"D2","level":"warning","message":{"text":"MapExtImplementation.sliceAt (cognitive 19): MapExtImplementation.sliceAt has cognitive complexity 19 (threshold 15). Drivers by points: if/else 18, 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 17, match/switch 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f7d114b37efb7ec5d75403d61a6da53a3a7315f05a88fccd487e278b9c7f08"}},{"ruleId":"D2","level":"warning","message":{"text":"FileSystem.watchDirectory (cognitive 19): FileSystem.watchDirectory has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 15, if/else 2, loops 2 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Demo/EventInterop/Program.fs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd5fec53b6e7e1da731f104ec552f4cf37f123fc768d600ee8bc8e1878cbc8b"}},{"ruleId":"D2","level":"warning","message":{"text":"ABag.unionMany\u0027 (cognitive 19): ABag.unionMany\u0027 has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 10, loops 7, if/else 2 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Demo/Scratch/ABag.fs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"b324c5754c3ccfc32f7ce15951c9e698a78fc77e63a4434e3cb40592ed8fb096"}},{"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 18 (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":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 18 (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":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 15, 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 16, boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/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 16, boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2374}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b01628aafa70a4da9a475535f80a370d79097f6ea101b3dacb3ef5cb750d9fa"}},{"ruleId":"D2","level":"warning","message":{"text":"ABag.ofASet (cognitive 18): ABag.ofASet has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 10, loops 6, if/else 2 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Demo/Scratch/ABag.fs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b75b0a89560fb17ce68e0aa9a44c58caab7246b43f105aa09d54dfd3991eb13"}},{"ruleId":"D2","level":"warning","message":{"text":"AMap.[AMap] reference impl (cognitive 18): AMap.[AMap] reference impl has cognitive complexity 18 (threshold 15). Drivers by points: loops 8, if/else 7, match/switch 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Test/FSharp.Data.Adaptive.Tests/AMap.fs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3bc69e81746f59a5d03a4962763e9f810e672eb33d10962ced0c7a9ddaae49e"}},{"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 12, match/switch 5 (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."},"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 12, match/switch 5 (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."},"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 17 (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":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 17 (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":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 16, 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":"Program.main (cognitive 17): Program.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6, loops 6, match/switch 4, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Demo/EventInterop/Program.fs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"945f1f8c70123262271e9572d0a7904e272d0ac96a250c43ca7ecd45a71f5b75"}},{"ruleId":"D2","level":"warning","message":{"text":"ASet.[ASet] mapA/flattenA/chooseA async (cognitive 17): ASet.[ASet] mapA/flattenA/chooseA async has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, loops 4 (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/Test/FSharp.Data.Adaptive.Tests/ASet.fs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62d8f506b2aa4001a21727fe286a7a0ca77c36108d1dfcc50921318ce57e9a6"}},{"ruleId":"D2","level":"warning","message":{"text":"Helpers.mapequal (cognitive 17): Helpers.mapequal has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, match/switch 5, loops 4 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Test/FSharp.Data.Adaptive.Tests/Utilities/Helpers.fs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"2763812866faacaa7015cb907d5c6358b422bd85b657e93725d1ff9047c7356c"}},{"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 7, loops 6, if/else 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/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 16 (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":"D2","level":"warning","message":{"text":"ABag.choose (cognitive 16): ABag.choose has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 14, if/else 2 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Demo/Scratch/ABag.fs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"55bf98ae8f649a37d7cbd0ff6a3fba6a2d9028e828cde8068daf97cda1ae5013"}},{"ruleId":"D2","level":"warning","message":{"text":"ABag.filter (cognitive 16): ABag.filter has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 14, if/else 2 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Demo/Scratch/ABag.fs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fe4cf29600d3fee77264a056b181e2e3a77687f3534ba07573408f08cc35e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:209-227 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:219-237 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"179ad31c3aa25883bfa6a5ddeeb684dd3dd8d4c285625bcf7c4e0b61d2489238"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1489-1506 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1499-1515 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:1577-1593 \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/AdaptiveHashSet/AdaptiveHashSet.fs:1489\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/AdaptiveHashSet/AdaptiveHashSet.fs"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"da89fc9c83c9fb67d7dc66039e2c37e77246e13a623213e2628fc24e0b4ab7ba"}},{"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":"4df903d39da712d18722d507d4d3d1c7a4c395ef7fe1ef390807b3e5ca3db051"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:240-256 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:250-266 \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":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c078cd07abd43ab687b301e3c12a588a4ccd6e38274b885292ae219bb73f2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/Demo/Scratch/ABag.fs:306-322 | src/Demo/Scratch/ABag.fs:351-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:306\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":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"c603e1d26fd40a809ef9198f553dfc7cbdb2d6ff62be7c19946d843774caccd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fsi:3-18 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:3-18 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fsi"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfba40a79014f56fecb3954a461ec0268d4d514df276dc1daa99328dbd67a72d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:81-95 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:86-100 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:85-99 \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/AdaptiveHashSet/AdaptiveHashSet.fs:81\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":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d526a2243f8d3e0751cc2ffc8a445073366dbfca6ea8f9ca62659ea372afcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:166-180 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:176-190 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:175-189 \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/AdaptiveHashSet/AdaptiveHashSet.fs:166\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":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"95fa5390e17ca2c5bf080dde52df2c848b0796d367f4682117641c18d6687399"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): src/Demo/Scratch/Observable.fs:67-81 | src/Demo/Scratch/Observable.fs:111-125 | src/Demo/Scratch/Observable.fs:155-169 \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":"30737d51873d9508f37634ac678d09ecfc60dd0bf16e804ba1be6a6028e0648d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:247-261 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:320-335 \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":"88794c6cca0c1facf0802973dc86fc3044d3821d449f68710a073692946a470d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2727-2741 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:3710-3724 \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:2727\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":2727}}}],"partialFingerprints":{"codehealthFindingId/v1":"c765dae6c7b5947f05e9b4b3b990373766692961db83af1f1180353e55ece181"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:607-621 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:632-646 \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:607\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":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c11b71b4c2564ef64fd7a58aafbaa1174df9c3f85a7eedec9468f0d3c6ea82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:325-338 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:333-346 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:333-346 \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/AdaptiveHashSet/AdaptiveHashSet.fs:325\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":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"841b0e300003e920f1d1529ed8a72867e667050ee7615b6376f88a77adce05b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:628-641 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:676-689 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:724-737 \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":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc499ba18377b11af0e8d7dff6c5ec2695bb0431c5b8e62d80ad3958ec12c782"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/FSharp.Data.Adaptive/ShallowEquality.fs:155-168 | src/FSharp.Data.Adaptive/ShallowEquality.fs:203-216 \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/ShallowEquality.fs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b935a17d6df8b0d805032004525a75b9c15649f819c14a80de265daca57ebde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveValue/AdaptiveValue.fs:75-88 | src/FSharp.Data.Adaptive/Traceable/AbstractVal.fs:13-26 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/AdaptiveValue/AdaptiveValue.fs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4d40b9f5beda836d9dcb6d68a5c4917689e9d02891bb294a3a7078012d1fde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/FSharp.Data.Adaptive/Traceable/CountingHashSet.fs:323-336 | src/FSharp.Data.Adaptive/Traceable/CountingHashSet.fs:346-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharp.Data.Adaptive/Traceable/CountingHashSet.fs:323\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":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b68fbb7345f87c6933f5929af56c3c861b70d2cc3872e9704e9e85862b731c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:553-566 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:572-585 \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":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05d8dbf45c7b02bbff1e8d1ceba9512aba758112ad26aa0eb06b3e55edd5626"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashMap/ChangeableHashMap.fs:50-63 | src/FSharp.Data.Adaptive/AdaptiveIndexList/ChangeableIndexList.fs:38-51 \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/ChangeableHashMap.fs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3b05bf7c67769e06521460d212566f4dd2d2a5dc6afd27d7cfd1293dfe1283"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1746-1758 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2970-2982 \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":1746}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f6bc04b19c9bee06786948e965cd8110e347fa9c310077961a7b2c8c67292d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:311-323 | src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:392-404 \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":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6318b77f7741bee878d10f846198f67895fb47b384b72e6d0b96322dd82ef8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/FSharp.Data.Adaptive/Traceable/CountingHashSet.fs:304-317 | src/FSharp.Data.Adaptive/Traceable/CountingHashSet.fs:328-340 \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":"7a2708c37d4ec57b860502f7319d00537715b56e9e21a41c93210a7a203b0792"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1005-1017 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1029-1041 \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":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4581a70f696aac736fa58643c714b831a835eb5278466fffadf368dfad50082"}},{"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":"c52af362940419386e24f9d73d8976d9341f291bab7e24c1a0974e128f8a597e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:649-660 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:697-708 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:745-757 \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":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0cc4e36788e2d77027f4d380b5d525db51bb5daaff36d13f4dc3d5f512c848"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FSharp.Data.Adaptive/ShallowEquality.fs:276-287 | src/FSharp.Data.Adaptive/ShallowEquality.fs:324-335 \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":"69634b99560d0e9152121d6c49123807131db787c647bb882f7b0eba41e6554d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1623-1634 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1663-1674 \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":"a36723eb09edcd3f0364298afc1664b32082330efa816c2c496700b0289aefc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1641-1652 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1679-1690 \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":"d206b9c00f2832b7bb4c410b73e1ca00b72054dd413414e6f231d47e66ee52bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1839-1850 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3064-3075 \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":1839}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e1c70c67db2d29d079081a5dad0c4d551ad94e11dcabfd2f1a5916a9d392f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2473-2484 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2514-2525 \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":"1076d7dcb4c081ca568ba93d63220e293051f708db6528c8e6f94d9410380ed9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2492-2503 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2531-2542 \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":"ee6e5ef085efe6f50af4a6610e0160ecdcf20e39e6e7fabadac8c424679c86cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2844-2855 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2883-2894 \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":"c2370184425399f82b94527ededbf372b9b62cdc6d538f141b90c1065d17a8de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2863-2874 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2898-2909 \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":"7f88c0fb9ca41d23642136bb705712a3bf20f3b98680178133c39392be3dc6ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3135-3146 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3205-3216 \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":3135}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f1f30016d5d75bab0cbbc35800121747b2fb8afc08688b5b783c2f919a74fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:186-197 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:196-207 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"27935892e24f04ed42b70eb899a703531029748413474cb2bfe30e548b05f165"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:730-741 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:814-825 \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":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d612372859a396edf58ccf1f1d08c1c54e764cc3fd62338e58755633dd586c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:950-961 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:975-986 \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":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbe2664fe5d7b64f423339c996f2e0f1f5dc3d18208eacd24b47d24ce8139d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptifyHelpers.fs:32-43 | src/FSharp.Data.Adaptive/AdaptifyHelpers.fs:84-95 \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/AdaptifyHelpers.fs:32\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/AdaptifyHelpers.fs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"20300b3ca11bf1c9451dff5383d6a7349a7539c18e1fc89f8eb67f6099141ae8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/Demo/Scratch/ABag.fs:290-301 | src/Demo/Scratch/ABag.fs:335-346 \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. 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/Demo/Scratch/ABag.fs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c05befdb1c8813a65582ad25f46cb2dc77a9411ed7ac7ac33855dec2fb3603"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): src/FSharp.Data.Adaptive/AdaptiveValue/AdaptiveValue.fs:47-57 | src/FSharp.Data.Adaptive/AdaptiveValue/AdaptiveValue.fs:95-105 | src/FSharp.Data.Adaptive/AdaptiveValue/AdaptiveValue.fs:198-208 | src/FSharp.Data.Adaptive/Traceable/AbstractVal.fs:33-43 \u2014 there are 4 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 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/AdaptiveValue/AdaptiveValue.fs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35da0410d5f4289867d6f43bd8f831e10b58579228624f8873be1e437e263d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:354-364 | src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:438-448 | src/FSharp.Data.Adaptive/AdaptifyHelpers.fs:235-245 \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/Deltas.fs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9c4a06e61325cfd1de5cf1620364eb0122f2c496ca389a582b4f46fe5872b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/Demo/Scratch/Observable.fs:50-60 | src/Demo/Scratch/Observable.fs:94-104 | src/Demo/Scratch/Observable.fs:138-148 \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:50\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":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"7622454adcf7888fa8368e8dfff888b970b036744f735523d1ae0010ddc53b5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1703-1714 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2921-2931 \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/HashCollections.fs"},"region":{"startLine":1703}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc60594a5250a7d9a496076b5b7eeeaf0d26d591ffa398c6ebead717687eabf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1773-1783 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2997-3007 \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:1773\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":1773}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ce405b87f7da4699ebabb4f069c1b498f408a3797f5b5d7e206f70d7b023b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1440-1450 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1498-1508 \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":"fef66dc4ff9534058967b826e3166114fbf8dd7c31eafa23f453d84465bca242"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1468-1478 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1528-1538 \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":1468}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba37853c6a20cc724e923ea86faf79a2e0bd4e28ee475cc13b0b629b1056b2dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2271-2281 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2360-2371 \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":"7ade5fc7a858b42ea67bdb1acec1981cbd8e4cbcd25926e75a7db23b0064d6b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:576-586 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:832-842 \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:576\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":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"5afe8796fe03ae398a3fc0d2f19e74382b55c15e6c14adbe20cbf58f74a5f408"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:823-833 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:736-746 \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":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f150ac3215ac3441872bee71eb23c06a9c3774a2b5941e3f1a4f8124810ea9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:838-848 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:751-761 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca38e6da7f579a30588c2e8b64a143001ff5c249ade5420b3ca9d8b872a7be74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:562-572 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:580-590 \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/AdaptiveIndexList.fs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0d8423caec06392693c997e4cf15560c2ffef0e61c39516bb2d9b8f4d5a120"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:643-653 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:727-738 \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/AdaptiveIndexList.fs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c54ddbddbbe6c2764f997caf175964f3cbd72ddde9f488996fdc5d42886266f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:110-119 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:115-124 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:114-123 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e5990257393053d7832ba28e99b9fae9c251db7d0859bed4e10308085faeea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:446-455 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:503-512 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:469-478 \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/AdaptiveHashSet/AdaptiveHashSet.fs:446\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":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe48b360aee81d29fbebe4f8b7e5dca1f4615c1c921d59389841e4c89cd992b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:391-400 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:801-810 \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":"fbfddaa7d0c26c7f9555cfc03f8a567bb7a6b0e7549b715f1d553235aa2513d1"}},{"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":"80538fb6528dea21d8782448620d406bd51730995601ae1aa7322f290d8645ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2143-2152 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2567-2576 \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":"6035f9d33c1945b6ac83d56b643bb3a9bf61f5acdafd33bca1b6337da05d3759"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2153-2163 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2577-2586 \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":2153}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc4057267ce85ad2368c5c2f33c5aeecb1eb113bb66f0ab9c55cf13afe09c3f"}},{"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":"53da78da837cbbc5380661420a55b03824adea0d14523c72f723b6bfc6fcf46b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:227-236 | src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:256-265 \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":"2e5236a0dd73e6f7ccd097659ee5f8f6ebd614b951b3af647372989019d29b06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharp.Data.Adaptive/Core/Transaction.fs:58-67 | src/FSharp.Data.Adaptive/Core/AdaptiveObject.fs:231-240 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/Transaction.fs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a737340f75a8e146830c2f5a739a32f32fd3f189fb018cbc30730fbbcfa6d1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharp.Data.Adaptive/Traceable/History.fs:448-457 | src/FSharp.Data.Adaptive/Traceable/History.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/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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Traceable/History.fs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d77d90d781571af24f8a6615b1aafc24517bfe69bb154abfb9d6658e54e8d04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi:12-23 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:12-21 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5df129412c7041af62da07926193cebbf3c9f9da0d53b1e359336e6e5b591f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:515-524 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:530-539 \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:515\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":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c8da8dfdf01feae86a852b059099a7cee966e635980e50718f2c39761e76f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:989-998 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1056-1066 \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/AdaptiveHashSet/AdaptiveHashSet.fs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f881d64ebc59eea55011d53e51ae3ba3985d588da58cd070e018d2abf78eae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1209-1218 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1223-1232 \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":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"86988715fc0495256dbb1d808807cda353e5e67abc73590c60c7797019eaa87e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1592-1601 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:1849-1858 \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":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"acbe5bb25a8ee64393bad6713ec6a94ed22c6d020bf63a0d56c346d1f2ae2ab9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1631-1640 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:1800-1809 \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":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8ab6da8414e8b4bb8ab37644a3884d6ee7d092f63989492d2f77ed474c0c9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:282-291 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:281-290 \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:282\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":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40ed20657877ddcbc030df58cb519c15d602572f8966f34fae5ad54007423fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:457-467 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:474-483 \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:474\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":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd118ac97f5b5a3f1a8e37923f7b3bbe98eb0266bbb8f4418b1f1d32ac0beced"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:518-527 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:536-545 \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/AdaptiveIndexList.fs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27818fe2134484e3d15ba4f6e53016b42f8bc94b302d67abf5b48da44918b1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/Demo/Scratch/ABag.fs:189-198 | src/Demo/Scratch/ABag.fs:207-216 \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":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ba949dc7ec64efd0f3944e9464eb2749b451fc23b7f0e72b36f9d64c296e2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/CSharp.Data.Adaptive/HashSet.fs:10-18 | src/CSharp.Data.Adaptive/IndexList.fs:9-17 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/CSharp.Data.Adaptive/HashSet.fs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f193893e125d7eae204d394d5d082631a72d24db479c683b947e9cf382de752f"}},{"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":"c2ea1ff7f682c506d70504d81ebfcc8f8adc11ccc4c5204f22f222069ec19d5b"}},{"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":"3af68b1652089dd23da9ec9a122247b74866f3998d81d8e8aa2ad6af88878d86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1402-1410 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2588-2596 \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":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd44966dad72184feee44b615a0ee57a0c3cb6a6b5b7e160b2f6d877cb15a03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1452-1460 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1565-1573 \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":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f802c9bd7380e8b1d169c4c283bc961c223f24e3c625793e7443ead8db9360"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1673-1682 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2893-2901 \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/HashCollections.fs"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9b51d676a27608504b23b54ca009d5844d9754948ea7118a051f389fc8f0a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1734-1743 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2959-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"159f71049d61302c44b1137e7985ea55edd8f5f67a84dff7caf8323f5954e657"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1861-1869 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3086-3094 \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":1861}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c53c494163289d71f57325a532443abfc2a34b3cc6b1bcceb9df15be44a7b1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2124-2132 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2548-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":2124}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd4ed8db9a1960b5899ff985b433a023beb766a0a52baf9af7dc7d4abf650b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2347-2356 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2486-2494 \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":2347}}}],"partialFingerprints":{"codehealthFindingId/v1":"083b84abf31143e9a94f3774509ac61c031f3762b309833978bfa6bb04fa6ef2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:220-228 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:233-241 \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":"09ace0aa292c79fcd49bdc790e8a0928536956f2c42dd80e3f92588aa44912b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveIndexList/ChangeableIndexList.fs:147-155 | src/FSharp.Data.Adaptive/AdaptiveIndexList/ChangeableIndexList.fs:162-170 \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":"8d9da4b1d51b60a53f24f62229829519a9e0eeec6ca7cca0622184e9405e2339"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Demo/Scratch/LookupAll.fs:98-106 | src/Demo/Scratch/LookupAll.fs:115-123 \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":"ce817170d612cb167071b56ec572bb8dbf3c643a2ca8f5981e6bda775de54e39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Demo/Scratch/ABag.fs:279-287 | src/Demo/Scratch/ABag.fs:324-332 \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/Demo/Scratch/ABag.fs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"561a928c12245fc4efde1259c72495f40039ed3efe873c2f39f0d03db98b6f2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1349-1356 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1510-1517 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2666-2673 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2732-2739 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2788-2795 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1349\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":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"6593cbf0593a54ed6ecb6ec6500f0f779a7c4be96d68bedc9f4d05799473a59b"}},{"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":"0559ba62c8a26314a3bc815d1de22a41402aff2d427a4da84138b40a5b165919"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:531-538 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:554-561 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:606-613 \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":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ac82d46f94fa65ef95afa8c4f9f613f803f7ee427fd6cece3258a24df22df2"}},{"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":"cad8c7f9c630c5950a1fd1f178cd39f904aeb22fed548572701b2fcd79f313b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/FSharp.Data.Adaptive/CollectionExtensions.fs:116-123 | src/FSharp.Data.Adaptive/CollectionExtensions.fs:144-151 | src/FSharp.Data.Adaptive/CollectionExtensions.fs:180-187 \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":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e666f3a50b7830f3fd284d58961ab25e3831f94d603c0fb71f16c97b3ab30d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/CSharp.Data.Adaptive/ASet.fs:162-169 | src/CSharp.Data.Adaptive/AList.fs:144-151 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/CSharp.Data.Adaptive/ASet.fs:162\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/ASet.fs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b22c6ab66e6ba8714c2d4b690be57be88bccea334231a1717441614f1422b5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/CSharp.Data.Adaptive/ASet.fs:171-178 | src/CSharp.Data.Adaptive/AList.fs:153-160 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/CSharp.Data.Adaptive/ASet.fs:171\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/ASet.fs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"b491e59a59625f4cce55a0f91cfcc67cf5974e82d22d46f55d299938456bc8b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/CSharp.Data.Adaptive/AList.fs:265-272 | src/CSharp.Data.Adaptive/AList.fs:273-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":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2e8ed3585f69dac69930a4465385cd3872659cb2662f11548359af86633ab8"}},{"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":"c73d5b97cf8401d424f6a397a8b1de098ebc504bb4fcdb552bdb90748dc27fd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1249-1256 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1297-1304 \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":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"39452ba12ecfa8789c19af5261ffa1695990fad6bad16549b2b172e9a5a2d976"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1368-1375 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1529-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1368\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":1368}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96d17f4684a6852476c476f15abb5fe4af815642144c50b7759bba06e3b1173"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2404-2411 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2427-2434 \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":"d593cd3a6c1d9b5485ff2948006b38f0f7cb113cd64a4a19a34acd767dadfe1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2420-2427 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2443-2450 \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:2420\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":2420}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19b817d428e0d3ba5c8e291b0a94c3a7831bf46e8aa72978170422f7b25b047"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3586-3593 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3594-3601 \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/HashCollections.fs"},"region":{"startLine":3586}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad7057d12240a896d6471d3265fbf3e37318a9d854991cffc875b9885942d36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:119-126 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:360-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3c443ad4e52b33d32e18d8e5bae3e11d7093a03bbe22241f0dc36d482564e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:821-828 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:903-910 \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":"1ae021f4b4517368c0db057f98daf70cec366d10ffa078f806cce608cb117e9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:833-840 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:915-922 \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":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf6ef3da9d8a5fe3b230aae205aa5dc8edbf432716e58c214267c25e3e64328"}},{"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":"7289c24880abec222b5154b2d9666c5446aed63cbe9679125b6d4d978419cde8"}},{"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":"6f8489aeed8bea5d24007b2ae4928ff13197a53b5e688a1a191cbd750a26a08c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1580-1587 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1612-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":1580}}}],"partialFingerprints":{"codehealthFindingId/v1":"2553a36b53d681a3791b858d08e563f673a33e1daf05a34bc55afbb9350f730b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2029-2036 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2054-2061 \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":2029}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c35d5fa247369d707f3e0ba54de2f007d7b551bda031dc2964d41cbac847ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2778-2785 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2859-2867 \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":2778}}}],"partialFingerprints":{"codehealthFindingId/v1":"842fd1d9d53c8542c161fc13b6d966c871e97e97b8da7f4cd2b4cd6c432db5a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:448-455 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:466-473 \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/IndexList.fs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe4b5df3e12b2500828770f80c305c257a388565d49f71f01175b8feb14bfe1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:509-516 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:533-540 \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":"15f072e939ce862c3689e8c30c9e86c4c79d71135533a3eac836573156d1213f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:557-564 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:580-587 \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":"5ea2eb356dd7267edaa86c61c041ea12a366b6bbe3ad69590f13758b3f1c264a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveValue/AdaptiveReduction.fs:118-125 | src/FSharp.Data.Adaptive/AdaptiveValue/AdaptiveReduction.fs:139-146 \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/AdaptiveValue/AdaptiveReduction.fs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78bf4ae082e47848f9dc2ecfe9803b922c118a1e6381ab47beb47eaef8bf8b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi:211-218 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fsi:302-309 \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":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"db85733a792dc0042725540aed59586b4c7e0bcc1956ea7183dbe106911c8d38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:614-621 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:710-717 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"322d22163470c83a4a5e76e8b29e04aeec2dba511fd77933b31b3caff316f712"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:956-963 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1021-1028 \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:956\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":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"3293e4ade78c04dd749b4c4fe9442df9cfacdde57849b6e325d37e347d39e900"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1089-1096 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1133-1140 \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":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b4b50c30f07bcd98b38c86bf3216d7d9c47c0afde271f31fa7eb0dd5286bc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1100-1107 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1146-1153 \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":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"547c7f39dd3340a1d05753ad3be8d530b90332eeee3e8c8cd4fe6f48105fb9ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/CollectionExtensions.fs:678-685 | src/FSharp.Data.Adaptive/CollectionExtensions.fs:720-727 \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":"d886933946d9fdb786c72ebb156efb460fb9f0fba5b8f17bcdaa81b051d76898"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptifyHelpers.fs:64-71 | src/FSharp.Data.Adaptive/AdaptifyHelpers.fs:150-157 \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/AdaptifyHelpers.fs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f71a075552313745feac26751d7ab7e5a0ad9b3c602d950cacdeb2a56851edc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptifyHelpers.fs:99-106 | src/FSharp.Data.Adaptive/AdaptifyHelpers.fs:256-263 \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":"06c913982b77c6c10793d527fc4898f43a68ace0262d3bd4ed24f4bb53875327"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Demo/Scratch/ABag.fs:152-159 | src/Demo/Scratch/ABag.fs:168-175 \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":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e04c466366911a2c1c8b529c6aad46a43e193ef0d68a1cd361659fcdb5e6d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 13): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1294-1300 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1349-1356 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1403-1410 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1453-1460 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1510-1517 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1566-1573 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1654-1662 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2506-2513 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2589-2596 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2666-2673 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2732-2739 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2788-2795 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2875-2882 \u2014 all 13 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:1294\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":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1d70b21d734d3f38d076e4a091e40e2c12613883fbd51651393415e382f867"}},{"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":"560f3098118c4ca5a2ead9ed0495cbda15c530efe563c6c40b4846d262d73788"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/CSharp.Data.Adaptive/ASet.fs:9-15 | src/CSharp.Data.Adaptive/AList.fs:9-15 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/CSharp.Data.Adaptive/ASet.fs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5564f5cf0d7535deabcf18c839f1fc0c1bf17663524343dd5029f6e10fa9837"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/CSharp.Data.Adaptive/ASet.fs:94-100 | src/CSharp.Data.Adaptive/AList.fs:79-85 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/CSharp.Data.Adaptive/ASet.fs:94\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/ASet.fs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41808d68f4c12a6ea461f4999bdffde61e053a2d820985c1fb2179973c5b19a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/CSharp.Data.Adaptive/ASet.fs:102-108 | src/CSharp.Data.Adaptive/AList.fs:87-93 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/CSharp.Data.Adaptive/ASet.fs:102\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/ASet.fs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5fe2944385fe09501e569515f9ffb9f0366f10b4086428ee07cdf4e3078a69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.Adaptive/ShallowEquality.fs:220-227 | src/FSharp.Data.Adaptive/ShallowEquality.fs:361-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. 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/ShallowEquality.fs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"65742ab4f7ecec6c89ee83e27b915fda2836bfd243a7234a68de8e69789670e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 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":"0eca5f301d4efa7a0c3c7fc4c31b143e22ff9336bdd8dec3c3e3368fafd6c567"}},{"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":"a74fa5ba7c75f5f76fb7f5d9d5377c8e5bd1d56a3d54fc6794a694e6a20bdde2"}},{"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":"fa0625fd1c673be5fd640bdc275b700f34bba444634ce091620d2fe41cdb3fed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1482-1488 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1537-1543 \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:1482\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":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0fb95a6b0de4d09bbc807f926ec62b152adc931175a6cbfb73653cd524c5597"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2640-2646 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2706-2712 \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:2640\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":2640}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b439d78bbfb1726d874f6876fe52b51c181715bf7819f96a87993ee9d992fbe"}},{"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":"e1554f731580d3dff36a0c80a801a0e69bd12e850f4c4f2dfc82f322fde5fd76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3916-3922 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3924-3930 \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":3916}}}],"partialFingerprints":{"codehealthFindingId/v1":"78122697d60516f09b541a4a0af131de77a58dc4f601a1cd6dbdd9cc0d48ea46"}},{"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":"9a48d369b6bd0956f210fb899e5c112e2168a84ca5c286f180f45633226733ba"}},{"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":"26285ce228494aa7151041e38cab7a707e956d6d29bc108e1357f82ffbcf8c67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:543-549 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:566-572 \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":"5b3e4ae124e859401f203fd10b76f45454b0671de44a464570236d755ed2e9c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:767-773 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2187-2193 \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":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"2339c8829c12174e10f8c1406172d9bfbfd69b60c6e894e4f11acd616b8d23a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1081-1087 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1110-1116 \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":"623995629d4d5a0739fa4771fb2d036a689838aa654b8693a06d22a218246720"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1091-1097 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1120-1126 \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":"4175bb626845fc156438786a1a911f255d4abc6dc87236ec210061a6598d4003"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1280-1286 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1308-1314 \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":"a13dca986500543ec837115697db61d6f7cea14815bcb81c2fb1493e3067ce6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1883-1889 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2198-2205 \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":1883}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa15a7d362ef42f9ecc6a7df0197184a91e5bb01929a30fe34f2a68d71d2e3bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2299-2305 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2308-2315 \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":2299}}}],"partialFingerprints":{"codehealthFindingId/v1":"39444d8146aa82f0e030e3e8bfd1a8cc397bc69becca73548bdea50385ac2270"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/Deltas.fs:205-211 | src/FSharp.Data.Adaptive/Traceable/CountingHashSet.fs:277-283 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/Deltas.fs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d2af1e810537963fd87e21b27d1f2306c6229d7669dbf0e3d1eb0d46d3af5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 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":"c8bdec6cbbf1132b58507bc431ff9f365fac6857f666345fc4c216769645fc61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Demo/Scratch/ABag.fs:246-252 | src/Demo/Scratch/ABag.fs:371-377 \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:371\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/Demo/Scratch/ABag.fs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"f918894528138cac76fd1ace8542c8c69e93f60799ae57af0d31761e97e54cef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Demo/Scratch/ABag.fs:559-565 | src/Demo/Scratch/ABag.fs:606-613 \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":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"c476dea52e7960a1df2b7ec835ca4d41a0b2a74b4433f5a487697df6d52b8a93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 7): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1227-1232 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1271-1276 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1323-1329 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1377-1383 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1484-1490 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1539-1545 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1604-1610 \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":"2b9dc3a74c1284cb5269bf9e4a17f8b9d1a08a40e83fc8c09777cc24347cc0f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2381-2386 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2640-2646 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2706-2712 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2762-2768 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2826-2831 \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. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs"},"region":{"startLine":2381}}}],"partialFingerprints":{"codehealthFindingId/v1":"239e8ba63f11714262382b99e0ebcdc8e6dc3f03b337e7ea08814fad2c754680"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:3229-3234 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2756-2761 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2838-2843 \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":"26f708eb09e9fe50f72ba5bd1124fa018e5f0745b923b9c3fedc9201cf314339"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:566-571 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1296-1301 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1324-1329 \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. 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":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7b8f3e81143f13ee740ac8a425145646b3e4d98a55ec4a6c7c78dfd0757380"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:778-783 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1883-1889 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:2198-2205 \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":"78cac9458ebd9ea4c023825e3ceef07a5f245c7d8b46f62be639a0d288307e1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1448-1453 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:1485-1492 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:1563-1570 \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/AdaptiveHashSet/AdaptiveHashSet.fs"},"region":{"startLine":1448}}}],"partialFingerprints":{"codehealthFindingId/v1":"51cd5b138f60526abcc0b2528c6d64957a8a953292a52d0fe4c2fd8878543fef"}},{"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":"09ec6fcb28afec59ef9a8809be248792315046457e4e1f7007f668f27ba659c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1395-1400 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2581-2586 \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/HashCollections.fs"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b21e3c3a12ab685b27822668b5a2f14a54cdb32de4bfb31df68f527551c523"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2456-2461 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2563-2569 \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":"4b794eef1e74fd3d3f10d0ae87e98cae690bd680b9cd0422329da73270f058bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2683-2688 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2749-2755 \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:2683\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":2683}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc7a2f12386933c7dd7def80ca240dd0763810388301455fe0cbb7e853681b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:495-500 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:507-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":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efcc589b09c22f3c13d1aa23e186ab954d066145a5a30179e7c959e662912f1"}},{"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":"895ce30892c69037078e39192519497b99ef528b36e8661de2d1212198a4ac79"}},{"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":"c31fe9634bba75b6a78e8cc79bb2252dcce6f258808a7abad5eef6db5baeac95"}},{"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":"cbc07f5f9b9b0c2a2efa40755f88294914db0c0fba78b435e3dd37d4bb8134a4"}},{"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":"0d6a41763aed87a7c4fe8075e2392e5b6f1a12afd945f0782e9161f2a7d58b17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1426-1431 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1484-1489 \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":"71c0d7190d0f7372c2025b61d2e69a6fbc81047fe083f37adb428100cd1c1254"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:3738-3743 | src/FSharp.Data.Adaptive/Datastructures/IndexListDelta.fs:162-167 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/Datastructures/MapExt.fs"},"region":{"startLine":3738}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc89d03fffb678e8806ceb6f54e451ffc497be436022b9cb5026060d05915a9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1102-1107 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1117-1122 \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/IndexList.fs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc57486fce56e0b457f70dfa8d6f9c7437c084ee3968f30ef20573afa99ff772"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1313-1318 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1346-1351 \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/IndexList.fs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"168c98f010a43dc818a388df5137fbaed95ef962c570184621e52f1aba38238e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi:203-208 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi:228-233 \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.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"c379838c1d79243cc47e7b0d6b58598709d4f9e7d4260614ca102b4ea8df566f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:49-54 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:35-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":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5948a54fd69f4516997047a89f1f1898840ba94ba016626ecbf3f424c58cb3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:1441-1446 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:1556-1561 \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":1441}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc15025088ce36f348e7964127ae8d5de90c602c6146d67752dd4ee3cf60da7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fsi:205-210 | src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fsi:230-235 \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.fsi:205\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.fsi"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc71f4e89b5df6a4cf7e62753d858d509e30148e85c7ee8c199ec618c5b1e55"}},{"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":"aed6d944e3caa09765ea20c58877e43bab8dfe6fb905e2dfb19de48b90c572ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashMap/AdaptiveHashMap.fs:125-130 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fs:124-129 \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:125\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":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"9943a4f243876cb29e2a335be15ad5452b341b0c9f5fb853c6669c7fcf51263d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fsi:294-299 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fsi:319-324 \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.fsi:294\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.fsi"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b92d3536289a93070e278bb10f800a606ea2df6369f0ec30f8db2c4889e1643"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2060-2064 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2080-2084 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2100-2104 \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":"3a4710a9f8fc615ff1d2469d7dc94a536b2faea7879a333e60ad17f37a5a85f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharp.Data.Adaptive/ShallowEquality.fs:313-317 | src/FSharp.Data.Adaptive/ShallowEquality.fs:400-405 \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":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56cfa872be957c16adbe9b9819cb23416a07411b6b6bebc7d9cb67a621c281c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:593-597 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:603-607 \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":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73f465bd416f47b86991bb6c76cd9942c24e06e6843146fb9fc9f33c9fff8bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1903-1907 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:1944-1948 \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":1903}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f81512a70fb358ec01d56c6afea12cf13da1e38c1bf021fd48282cd179cb27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2294-2298 | src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs:2689-2693 \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/HashCollections.fs"},"region":{"startLine":2294}}}],"partialFingerprints":{"codehealthFindingId/v1":"febd04be4c3aad6c489943b335743916ae3aa4866ab73d4dd1cbd665e939d10a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1033-1037 | src/FSharp.Data.Adaptive/Datastructures/MapExt.fs:1049-1053 \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":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"85125bc65be62c98c8f26687b0dea8d48877b3a072d86ccbfe786c96b1c7bd0d"}},{"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":"8fb20d269eef9ff6882bfc683801301370eb763360f201dec6035f06e945dbaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1330-1334 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1363-1367 \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/IndexList.fs"},"region":{"startLine":1330}}}],"partialFingerprints":{"codehealthFindingId/v1":"797730916a6bb380c1b8f8d39e14774415b6b5d5f3694834661a271a423d4d89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1402-1406 | src/FSharp.Data.Adaptive/Datastructures/IndexList.fs:1418-1422 \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/IndexList.fs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f231c15032362e7d4ea294ca062eafe57b311f77e67309bf9550e53bb3247a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharp.Data.Adaptive/Datastructures/HashSetDelta.fs:94-98 | src/FSharp.Data.Adaptive/Datastructures/HashSetDelta.fs:106-110 \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/HashSetDelta.fs:94\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/HashSetDelta.fs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c0ed6794aa1a0542a34ae5d5f3f3c8a9deeb2b36a0f15e22857ce6b22ed113"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi:59-63 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fsi:68-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"84198298f5610cce1c419d08a28ff2cb79a47c4d97e9ea1000ce131102f7974b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fsi:182-186 | src/FSharp.Data.Adaptive/AdaptiveIndexList/AdaptiveIndexList.fsi:273-277 \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:182\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":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3ad011be6a959e2bcd473677205b2319e6075e1e3c98d3daa0168498486463"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:488-492 | src/FSharp.Data.Adaptive/AdaptiveHashSet/AdaptiveHashSet.fs:496-500 \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:488\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":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d9d2ebaee1a6ddc1ad8f9e98c27cbce1d6bc5a644695994dbf7d1ab0d616f5"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 3 significant file(s) lose their only recent owner: src/FSharp.Data.Adaptive/Datastructures/HashCollections.fs, 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":"D19","level":"warning","message":{"text":"Low XML-doc coverage: CSharpInterop: CSharpInterop: 0 % XML-doc coverage (0/12)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Demo/CSharpInterop/CSharpInterop.csproj"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f141d09cc94c07cfcee7835290685e2cdfc6888d0db7c74bed75daaa547b01"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022BenchmarkDotNet=v0.12.1, OS=Windows 10.0.19042\u0022 \u2014 ignore - this is standard benchmark metadata; the real value would be WHY these benchmarks are run on which dotnet/sdk versions"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Demo/CSharpInterop/Benchmarks.cs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bfbd2034c08b79558d1ca392e1bdee5ed92db188754c2a1acefbec19a07ed9e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022[Host]     : .NET Core 3.1.12 (CoreCLR 4.700.21.6504, CoreFX 4.700.21.6905), X64 RyuJIT\u0022 \u2014 ignore - restates the host/runtime configuration"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Demo/CSharpInterop/Benchmarks.cs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eeeed7327707f0c8253e1e312a6473931489a4430bbe32c3f55233e42e61dc4"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022BenchmarkRunner.Run\u003CForEachBenchmarks\u003E();\u0022 \u2014 delete - boilerplate call; only comment on why benchmarks are run in this order"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Demo/CSharpInterop/Program.cs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"92722437d17e2a9b6e7b077686ad1284fd0cb61e9295486d799f8938d4653dac"}},{"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":"fb267f2ab41c95615bf1fb1864a50cb936c7295ced6b7812fed0fd361697105a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"36d920e5c19412bea921dacd31ff3eebbf3c029ce52d47f77f6afdec7e5d69be"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6265ba0200eb1d22902036a0b12f5b4f2ee6133912b15ffc291d910e5a7bd3d4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d47aec683f24570b5a4484e5c5dd727d6c1274dc208c72fae188055ebb15f2d5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"25ee1c1bc13311d8e262b0e6df2cc661ae38699b3f851e5b370cb05fc93a054e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"53a04377b829ad9a83faf01aad75b1156e6526d5b85d30627f71e0e52df48379"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"93f54f6e1975774e02a27cc02209d5fc6f565fc39c3adea72b8c0ba1812a1717"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2e51670061da459939592feddbc4334483392ecc72b22f233e692d47312b6db5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e521a76467e43fd88d861d4971fa972867eaf0e7d87ab162806a4247f7d5b12b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9e58b6ca279de4942b4d0fa92ae40acde52b7dadf092b416dd499dc17a2930fc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cadcd2d518b5ec1b7c65e72957a20800a7c23dbcea42182c78ae13c3d704ce12"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D34","level":"note","message":{"text":"Dormant codebase: 30 of 42 significant files have no living knowledge \u2014 the codebase as a whole is dormant, not 30 separate risks. Re-engage owners or document before change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4c69f1e54b7dd6fe9029dd02df6ba8f8145b789f2f18dbdaa086c40ded49dba6"}},{"ruleId":"D34","level":"note","message":{"text":"Largest orphaned file: One of the largest files with no living knowledge remaining \u2014 a reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/MapExt.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e68f2eb2171f925e4923f51d33e75ea9305f2684fd9b63a9c0ec72df9223093"}},{"ruleId":"D34","level":"note","message":{"text":"Largest orphaned file: One of the largest files with no living knowledge remaining \u2014 a reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Datastructures/Deltas.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1123331827faf0c600aa9673ec1ecb3adec8960c466f829053818c93fe83a5fb"}},{"ruleId":"D34","level":"note","message":{"text":"Largest orphaned file: One of the largest files with no living knowledge remaining \u2014 a reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.Adaptive/Traceable/History.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"147391bedc8b2ff6d8f757c3459d4f2d89c64a29a99422cebfe16b9378901d78"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9658270ba49f37ed04e99ab1263b6393cd42aed8bdfb7aafd9fa1070f5491895"}}],"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-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"CWE-353","shortDescription":{"text":"CWE-353"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":16,"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."]}]}