{"$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":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"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":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"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"]}},{"id":"D39","name":"IL Efficiency","shortDescription":{"text":"IL Efficiency"},"helpUri":"https://codehealth.canine.dev/dimensions/D39"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"IntMap.mergeWithKey\u0027 (cyclomatic 27): IntMap.mergeWithKey\u0027 has cyclomatic complexity 27 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/IntMap.fs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56fe0763a48328701e5c608ca6e294387c3587215ba992ae6d6ec6334b44e6c"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.remove (cyclomatic 17): Node.remove 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/FSharpx.Collections.Experimental/ChampHashMap.fs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9a93ad7324dac8b2def6095c03df331c63d6f018bc2cfc21826ee577fefc32"}},{"ruleId":"D2","level":"warning","message":{"text":"BitmapIndexedNode.FSharpx.Collections.INode.assoc (cognitive 41): BitmapIndexedNode.FSharpx.Collections.INode.assoc has cognitive complexity 41 (threshold 15). Drivers by points: if/else 37, loops 4 (nesting depth added 23). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/PersistentHashMap.fs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba0c92bfb9684a5645de5f07a7cab65ac09f331e823c54ccb7f0695b5815b51"}},{"ruleId":"D2","level":"warning","message":{"text":"BitmapIndexedNode.FSharpx.Collections.INode.assoc (cognitive 34): BitmapIndexedNode.FSharpx.Collections.INode.assoc has cognitive complexity 34 (threshold 15). Drivers by points: if/else 31, loops 3 (nesting depth added 18). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/PersistentHashMap.fs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33c76b362c15bf8030254c8c51e5036be1d239d3a99f70670e053fb40f24eba"}},{"ruleId":"D2","level":"warning","message":{"text":"SetTree.rebalance (cognitive 28): SetTree.rebalance has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14, match/switch 14 (nesting depth added 16). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/TaggedCollections.fs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"81be4ff23d1cd75ddb3279bef5fb1fec358313f3d2e379fab101ec80acad4ee7"}},{"ruleId":"D2","level":"warning","message":{"text":"MapTree.rebalance (cognitive 28): MapTree.rebalance has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14, match/switch 14 (nesting depth added 16). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/TaggedCollections.fs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d39a6cca3123fc90fc33752bac15dea004631eb53adf41e1de4ca35c5b2db6"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.remove (cognitive 27): Node.remove has cognitive complexity 27 (threshold 15). Drivers by points: if/else 19, match/switch 6, boolean chains 2 (nesting depth added 13). 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/FSharpx.Collections.Experimental/ChampHashMap.fs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"42392577a7d2f0bb9d068f185b41867cb6d0cdab3125ee12c8d20bdc04c13bb2"}},{"ruleId":"D2","level":"warning","message":{"text":"BitmapIndexedNode.FSharpx.Collections.INode.without (cognitive 24): BitmapIndexedNode.FSharpx.Collections.INode.without has cognitive complexity 24 (threshold 15). Drivers by points: if/else 24 (nesting depth added 12). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/PersistentHashMap.fs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3bd0425be2b72e5ee3c4d13882110fcb4f36ef80c6bbe0f6608912c5fb1a519"}},{"ruleId":"D2","level":"warning","message":{"text":"BitmapIndexedNode.FSharpx.Collections.INode.without (cognitive 24): BitmapIndexedNode.FSharpx.Collections.INode.without has cognitive complexity 24 (threshold 15). Drivers by points: if/else 24 (nesting depth added 12). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/PersistentHashMap.fs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"98524821820a4c47b1edffbab7676426f8cc111dd4f90182a060d8ac80d88be0"}},{"ruleId":"D2","level":"warning","message":{"text":"PersistentHashMap\u00602.Add (cognitive 20): PersistentHashMap\u00602.Add has cognitive complexity 20 (threshold 15). Drivers by points: if/else 19, boolean chains 1 (nesting depth added 7). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/PersistentHashMap.fs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"0315c136c3f11b67efab9e3466c210781754e7bc6461fe35da9e8615131d87cc"}},{"ruleId":"D2","level":"warning","message":{"text":"LeftistHeap\u00601.merge (cognitive 18): LeftistHeap\u00601.merge has cognitive complexity 18 (threshold 15). Drivers by points: if/else 16, match/switch 2 (nesting depth added 9). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/LeftistHeap.fs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"4894bba5778becea1a65edb4d34962b9a4e8a7a284601510bf3b4d920fd359ee"}},{"ruleId":"D2","level":"warning","message":{"text":"Heap\u00601.ofSeq (cognitive 18): Heap\u00601.ofSeq has cognitive complexity 18 (threshold 15). Drivers by points: if/else 16, match/switch 2 (nesting depth added 9). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/PriorityQueue.fs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c356ae70f965f3e148fe59051957663a58fa9035db55b3380ead83f1b882990"}},{"ruleId":"D2","level":"warning","message":{"text":"Heap\u00601.Tail (cognitive 17): Heap\u00601.Tail has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, match/switch 6 (nesting depth added 7). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/PriorityQueue.fs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"1621b393c2bd7c227873ae846d9fc622da8b028db5782bd282c8b5602e0f84c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/FSharpx.Collections.Experimental/BatchedQueue.fs:41-56 | src/FSharpx.Collections.Experimental/HoodMelvilleQueue.fs:86-101 \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/FSharpx.Collections.Experimental/BatchedQueue.fs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34bcf5b46e22632aa89e521d478e1f9fb27827cf508267635f4889482c536c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/FSharpx.Collections.Experimental/BatchedDeque.fs:397-411 | src/FSharpx.Collections.Experimental/Deque.fs:396-410 \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/FSharpx.Collections.Experimental/BatchedDeque.fs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f569d029c042183818d88593917a9a94c5855b48880a2bb951fe23a5b92d9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/FSharpx.Collections.Experimental/BinaryRandomAccessList.fs:303-317 | src/FSharpx.Collections.Experimental/SkewBinaryRandomAccessList.fs:288-302 \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/FSharpx.Collections.Experimental/BinaryRandomAccessList.fs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc8cb574fd1699ff67cd7d764df5f4abe6903284613e038a80ff1a84ab926dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/FSharpx.Collections/Deque.fs:12-26 | src/FSharpx.Collections/Queue.fs:8-22 \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/FSharpx.Collections/Deque.fs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f597b7bc303c375b1730d3d7331d1225d8fd389bf6570770d690384db83707"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): src/FSharpx.Collections.Experimental/BankersDeque.fs:397-410 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:340-353 | src/FSharpx.Collections.Experimental/Deque.fs:339-352 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:509-522 \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/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d438b9f715260978a7c7834ff350005bb54667b8b15cad685c1ff186c5980b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/FSharpx.Collections.Experimental/BatchedQueue.fs:90-103 | src/FSharpx.Collections.Experimental/HoodMelvilleQueue.fs:147-160 | src/FSharpx.Collections.Experimental/PhysicistQueue.fs:134-147 \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/FSharpx.Collections.Experimental/BatchedQueue.fs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"1744ddaeb52a4d28faaaf00b48cbb48c6a4145435c018e518afec2e51503369e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): src/FSharpx.Collections.Experimental/BankersQueue.fs:108-120 | src/FSharpx.Collections.Experimental/BatchedQueue.fs:94-106 | src/FSharpx.Collections.Experimental/HoodMelvilleQueue.fs:151-163 | src/FSharpx.Collections.Experimental/PhysicistQueue.fs:138-150 \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/FSharpx.Collections.Experimental/BankersQueue.fs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8bf68ddf92469c393b7cf54a79ff233fd91167ff532290f090d183d7a146646"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/FSharpx.Collections.Experimental/BatchedDeque.fs:85-97 | src/FSharpx.Collections.Experimental/Deque.fs:95-107 \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/FSharpx.Collections.Experimental/BatchedDeque.fs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e958301365e2081bebf99baf4afaf7ccdcc6d7f176a9af61816f43b6043dfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/FSharpx.Collections.Experimental/BatchedDeque.fs:243-255 | src/FSharpx.Collections.Experimental/Deque.fs:242-254 \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/FSharpx.Collections.Experimental/BatchedDeque.fs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc8fcd1cea7d890f38eeca6afd7667e59345d7180081d02efd6124f7d35f057"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/FSharpx.Collections/RandomAccessList.fs:184-196 | src/FSharpx.Collections/PersistentVector.fs:208-220 \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/FSharpx.Collections/RandomAccessList.fs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"282cb536296f7bfe0ec74f911bacc84b92fb3542e4d11aab887c118198eb76aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FSharpx.Collections.Experimental/BatchedDeque.fs:31-42 | src/FSharpx.Collections.Experimental/Deque.fs:55-66 \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/FSharpx.Collections.Experimental/BatchedDeque.fs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2e2899801aea80bea20c1b4d19e32ba7a1f537d6db81f84546ec05cfb1d0c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FSharpx.Collections.Experimental/BatchedDeque.fs:321-332 | src/FSharpx.Collections.Experimental/Deque.fs:320-331 \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/FSharpx.Collections.Experimental/BatchedDeque.fs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"8338197b429cda92b3a6d08153c0d92e4c8ee579127e7fe6814e313e79e404d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FSharpx.Collections.Experimental/BinomialHeap.fs:266-277 | src/FSharpx.Collections.Experimental/PairingHeap.fs:247-258 \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/FSharpx.Collections.Experimental/BinomialHeap.fs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff79943e2a9fcfe06e7e4ce5e51c271cb38fc7090317745c2ead16f937c6351"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FSharpx.Collections/RandomAccessList.fs:93-104 | src/FSharpx.Collections/PersistentVector.fs:82-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/RandomAccessList.fs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d62e9baa6ae15009fd0c6305ccf629797fbb1353899abb9a4e42d3ff74987d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FSharpx.Collections/RandomAccessList.fs:237-248 | src/FSharpx.Collections/PersistentVector.fs:272-283 \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/FSharpx.Collections/RandomAccessList.fs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"a520afd9133426161e3b5c86243724bdd36325c81bc5abb33d1d5098e2b622fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FSharpx.Collections/PersistentVector.fs:88-99 | src/FSharpx.Collections/PersistentVector.fs:278-289 \u2014 both copies are in the same file, so extract the block 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/FSharpx.Collections/PersistentVector.fs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"8660500fcc7681843c4eedfc53f698d4605cbaf0b60a10c9630e2a7cab3748d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharpx.Collections.Experimental/BankersDeque.fs:246-256 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:333-343 \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/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b330e0e1705708558d9411998be6323b7622e93f20d51d7df173d15a8d3dce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharpx.Collections.Experimental/DList.fs:86-96 | src/FSharpx.Collections.Experimental/DList.fs:99-109 \u2014 both copies are in the same file, so extract the block 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/FSharpx.Collections.Experimental/DList.fs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af8453291988dead0138769b8f5736902358b0915a55b5b4a4e813a23be561f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharpx.Collections/PersistentVector.fs:72-82 | src/FSharpx.Collections/PersistentVector.fs:262-272 \u2014 both copies are in the same file, so extract the block 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/FSharpx.Collections/PersistentVector.fs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f3bb018eb00f48ca07c979109307667417360f0874ca3c618232aac5e6a873"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharpx.Collections/PersistentVector.fs:146-156 | src/FSharpx.Collections/PersistentVector.fs:342-352 \u2014 both copies are in the same file, so extract the block 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/FSharpx.Collections/PersistentVector.fs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29dcb2e919e6a10fe4b5f4fdb3c712c5ea5fbaefd3fdc44154363ba2c792a44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharpx.Collections/PersistentHashMap.fs:782-792 | src/FSharpx.Collections/PersistentHashMap.fs:877-887 \u2014 both copies are in the same file, so extract the block 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/FSharpx.Collections/PersistentHashMap.fs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84b913fc7ee95cce43741c857e0f37bfd7e8814c2c9adb6073194b67b96ba13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/FSharpx.Collections.Experimental/BatchedDeque.fs:56-65 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:75-84 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:214-223 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:233-242 \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/FSharpx.Collections.Experimental/BatchedDeque.fs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef0f538f6910a7be79beb7e8b037e9446d5a1776405a4a1fd0273d52dd38945"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharpx.Collections.Experimental/BankersDeque.fs:218-227 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:305-314 \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/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fcacf5c193b9fe1be5fce9fd776ba797fdf97adcbd905e8ca719bccc0f043e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharpx.Collections.Experimental/BankersDeque.fs:360-369 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:472-481 \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/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64a36debf8e63f154536e15db736bcebd2a2a929a2c3179809c20732795593d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharpx.Collections/DList.fs:52-61 | src/FSharpx.Collections/DList.fs:67-76 \u2014 both copies are in the same file, so extract the block 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/FSharpx.Collections/DList.fs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"52cee1ccc734139e44b7e90ae457fc365e75db4e3e7690d2f02bea8f032d0878"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/FSharpx.Collections.Experimental/BankersDeque.fs:331-339 | src/FSharpx.Collections.Experimental/BankersDeque.fs:362-370 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:443-451 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:474-482 \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/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a914d89074144b1c4174f49fb8de2d36ea60b5434c73a6c8495a037cb85007e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharpx.Collections.Experimental/BankersDeque.fs:170-178 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:257-265 \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/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c831409d42d86d8d95133bd3fcc5dc5890008b7836ae25224586adf9f0f7d51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharpx.Collections.Experimental/BankersDeque.fs:195-203 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:282-290 \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/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"7933186d24578a7259a10296d0272a3526789327f3d84ceefeede7c3100ae04f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharpx.Collections.Experimental/BankersDeque.fs:206-214 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:293-301 \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/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2af112ebdb6f5e6fa19d022bfdce7ffa4127a36a6d8ec0d0e555d563c7a62bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharpx.Collections.Experimental/BankersDeque.fs:234-242 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:321-329 \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/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ce2b78a94ee7038704fe27da1e5e816ee131e5b8cf5f425ccad9225b009838"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharpx.Collections.Experimental/IntMap.fs:714-722 | src/FSharpx.Collections.Experimental/IntMap.fs:728-736 \u2014 both copies are in the same file, so extract the block 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/FSharpx.Collections.Experimental/IntMap.fs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"692181167faa495989d84948b0437a917f689f7e24939316b5f0dbd9894cbe27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharpx.Collections.Experimental/ChampHashMap.fs:87-95 | src/FSharpx.Collections.Experimental/ChampHashMap.fs:110-118 \u2014 both copies are in the same file, so extract the block 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/FSharpx.Collections.Experimental/ChampHashMap.fs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f39fe2814894469731ab9cb3c5eafffa735e668edd9a49cd722065da50a0f49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharpx.Collections/PersistentHashMap.fs:95-103 | src/FSharpx.Collections/PersistentHashMap.fs:106-114 \u2014 both copies are in the same file, so extract the block 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/FSharpx.Collections/PersistentHashMap.fs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2178dc19fdd72f9ceb1fde27d5e930e4c0329086f9cb60aebca717d8ff869c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharpx.Collections.Experimental/BankersDeque.fs:321-328 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:433-440 \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/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"0653a3919da37a8277195d81e4119020a689a71586050bd3eb1b64094e98e877"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharpx.Collections.Experimental/BatchedDeque.fs:191-198 | src/FSharpx.Collections.Experimental/Deque.fs:203-210 \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/FSharpx.Collections.Experimental/BatchedDeque.fs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c03f329c1b674c55378161b8fdc7a174c71ed9207debdfc609f280a89bf0133"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharpx.Collections.Experimental/BatchedDeque.fs:283-290 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:309-316 \u2014 both copies are in the same file, so extract the block 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/FSharpx.Collections.Experimental/BatchedDeque.fs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6712bb7753587e759116587f646ec243e9e944dcb50cc8070d9009327aa745"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharpx.Collections.Experimental/BatchedDeque.fs:312-319 | src/FSharpx.Collections.Experimental/Deque.fs:311-318 \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/FSharpx.Collections.Experimental/BatchedDeque.fs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43a75b3137971de6882c9ae047c1956f2bc5dffd5b28bc256c37784de087913"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharpx.Collections.Experimental/IntMap.fs:179-186 | src/FSharpx.Collections.Experimental/IntMap.fs:209-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/FSharpx.Collections.Experimental/IntMap.fs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fbcc3f209225f6c8205f73285736c96a255672190740c6fae787291fd775028"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharpx.Collections.Experimental/Deque.fs:171-180 | src/FSharpx.Collections.Experimental/Deque.fs:200-207 \u2014 both copies are in the same file, so extract the block 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/FSharpx.Collections.Experimental/Deque.fs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab011d72c752eee7cd8235c6f2914dea2c12899a5d5569469b070569e0913edb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharpx.Collections.Experimental/Deque.fs:282-289 | src/FSharpx.Collections.Experimental/Deque.fs:308-315 \u2014 both copies are in the same file, so extract the block 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/FSharpx.Collections.Experimental/Deque.fs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be16bee64b999386a5c9472916ba4edf4b76dedfec16098ee582fd1c89966b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharpx.Collections.Experimental/RealTimeDeque.fs:461-469 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:478-485 \u2014 both copies are in the same file, so extract the block 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/FSharpx.Collections.Experimental/RealTimeDeque.fs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a05c8d7ab6a96687efcd21c5b25afebeca37cab55c034c9bbd4bb7dcd361630"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharpx.Collections/RandomAccessList.fs:369-376 | src/FSharpx.Collections/PersistentVector.fs:392-399 \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/FSharpx.Collections/RandomAccessList.fs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b49e00c8e661b9642a5d29df241946ba2aa3ba9852c7aaf2a37e223e790fc66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharpx.Collections/PersistentHashMap.fs:147-155 | src/FSharpx.Collections/PersistentHashMap.fs:429-436 \u2014 both copies are in the same file, so extract the block 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/FSharpx.Collections/PersistentHashMap.fs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b965ce6c8252b39142fdbebcb3e3c15c100d5fc024d0d9b660b61655aa666c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharpx.Collections/PersistentHashMap.fs:502-509 | src/FSharpx.Collections/PersistentHashMap.fs:571-578 \u2014 both copies are in the same file, so extract the block 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/FSharpx.Collections/PersistentHashMap.fs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e35f01d2f7c63f952fe1b4d5f5ab8bc4b29139da1222460045cde306d1577d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharpx.Collections/PersistentHashMap.fs:542-549 | src/FSharpx.Collections/PersistentHashMap.fs:619-626 \u2014 both copies are in the same file, so extract the block 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/FSharpx.Collections/PersistentHashMap.fs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df2bb2ff880c51f5d81cc21dd93ba5073421be4efc3061e0c0c7580c2f34d21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharpx.Collections/PersistentHashMap.fs:647-654 | src/FSharpx.Collections/PersistentHashMap.fs:674-682 \u2014 both copies are in the same file, so extract the block 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/FSharpx.Collections/PersistentHashMap.fs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef31357bf2373d2c01d30ecf498a83cb7b498a55ee640d671360539a653a5a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharpx.Collections.Experimental/BankersDeque.fs:112-118 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:183-189 \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/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b5733dc1519663f9cf1baccebb32fa12f0ccadb78c6d175db243d750810f2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharpx.Collections.Experimental/BankersDeque.fs:119-125 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:190-196 \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/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd40deeef122b7978f56d38bbd2ceebc6a126d968abb6942122103b24f35b7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharpx.Collections.Experimental/BankersDeque.fs:149-155 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:236-242 \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/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07470bc6457ad149f02f989f12c61de70dac8f64bdd1ab7da3ca5721065aabc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharpx.Collections.Experimental/BankersDeque.fs:156-162 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:243-249 \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/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fb190b21a20c402e39488241edbef067970d090a99f618216f5ce46453b385"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharpx.Collections.Experimental/IntMap.fs:158-164 | src/FSharpx.Collections.Experimental/IntMap.fs:194-201 \u2014 both copies are in the same file, so extract the block 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/FSharpx.Collections.Experimental/IntMap.fs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ac82e59f1dcbe45b77929f407373a0da595e63174310adeac9eff7c744be24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharpx.Collections.Experimental/Deque.fs:191-198 | src/FSharpx.Collections.Experimental/Deque.fs:204-210 \u2014 both copies are in the same file, so extract the block 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/FSharpx.Collections.Experimental/Deque.fs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb97fa464a47f6c5b555f959d126552c0c4c9c6452b3d4187459b1dae91402d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharpx.Collections.Experimental/Deque.fs:274-280 | src/FSharpx.Collections.Experimental/Deque.fs:286-292 \u2014 both copies are in the same file, so extract the block 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/FSharpx.Collections.Experimental/Deque.fs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26b75e89b2cc7fb925f1cc5d083dcc2c901c099adf3293fd53d74ee25c22f16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharpx.Collections.Experimental/RealTimeDeque.fs:433-440 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:447-453 \u2014 both copies are in the same file, so extract the block 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/FSharpx.Collections.Experimental/RealTimeDeque.fs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbdc15356944b30a941d83210cd6922e76186b10b29e90229e5428f179a7e370"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharpx.Collections/Deque.fs:151-157 | src/FSharpx.Collections/PriorityQueue.fs:220-227 \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/FSharpx.Collections/Deque.fs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb07b73024e0122289d80efbc0254b2e31d5f102ef9403855199462316d93a07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharpx.Collections/TaggedCollections.fs:851-857 | src/FSharpx.Collections/TaggedCollections.fs:865-872 \u2014 both copies are in the same file, so extract the block 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/FSharpx.Collections/TaggedCollections.fs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"07fe93c0b634c87cd2d89bab80565eadaf995d3c7542e7481c25ae31450499b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharpx.Collections.Experimental/BankersDeque.fs:49-54 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:98-103 \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/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f55171f37506b79dbe73a5e160aa3e15ddfd38ffc4eaa34f806ddd05c9c70e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharpx.Collections.Experimental/IntMap.fs:363-368 | src/FSharpx.Collections.Experimental/IntMap.fs:375-380 \u2014 both copies are in the same file, so extract the block 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/FSharpx.Collections.Experimental/IntMap.fs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"e352d5426738f5b832748a1b80cf5c6312822d1a8832289ed4bb89808ece029c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharpx.Collections.Experimental/Deque.fs:301-306 | src/FSharpx.Collections.Experimental/Deque.fs:313-318 \u2014 both copies are in the same file, so extract the block 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/FSharpx.Collections.Experimental/Deque.fs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"846b5d5e6a1e4661fca6d42eeaea3ddbf8a0153846ef72fe748e8f384f367b23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharpx.Collections/Deque.fs:55-60 | src/FSharpx.Collections/Deque.fs:69-74 \u2014 both copies are in the same file, so extract the block 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/FSharpx.Collections/Deque.fs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a286233298fe89d3c06806cc25c320ebc0fcc054376b42e50e8d8c528b9ef3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharpx.Collections/Deque.fs:74-79 | src/FSharpx.Collections/Deque.fs:124-129 \u2014 both copies are in the same file, so extract the block 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/FSharpx.Collections/Deque.fs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"560a1a34e42e6b73849b4fe270106f5d824b290246626193ba702434fd643ee1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharpx.Collections/DList.fs:120-125 | src/FSharpx.Collections/DList.fs:132-137 \u2014 both copies are in the same file, so extract the block 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/FSharpx.Collections/DList.fs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac67047f8cea221395b18f7d863b302e35aa16d12d246ce7d54cd9d791c4057"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharpx.Collections/DList.fs:171-176 | src/FSharpx.Collections/PriorityQueue.fs:220-226 \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/FSharpx.Collections/DList.fs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fec3d3961c66c81dc6090b0fa73b5f33a9f2dd18fe28d21a965b54f8c145f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharpx.Collections/RandomAccessList.fs:423-428 | src/FSharpx.Collections/PersistentVector.fs:184-190 \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/FSharpx.Collections/RandomAccessList.fs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"440036ab93b4deb726fb215666e31fb574ed207cece4a205e27aa68fda12873c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharpx.Collections/TaggedCollections.fs:704-709 | src/FSharpx.Collections/TaggedCollections.fs:712-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/FSharpx.Collections/TaggedCollections.fs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fbeb2b396e67082a3d8f5606c5ba77ae84d6ce38abc6e3e555549b7920dab8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharpx.Collections.Experimental/BankersDeque.fs:33-37 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:82-86 \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/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b93f71cfadda33ccad9e186cff92a09a30d23ffed8652f8c4cecb5f97a183b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharpx.Collections.Experimental/BankersDeque.fs:39-43 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:88-92 \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/FSharpx.Collections.Experimental/BankersDeque.fs:39\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/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5a7f07319b752a9e6277a954947933f92df04486722d44d2c8d499c4d1d3a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharpx.Collections.Experimental/BinomialHeap.fs:128-132 | src/FSharpx.Collections.Experimental/PairingHeap.fs:41-45 \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/FSharpx.Collections.Experimental/BinomialHeap.fs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e773ab1014e074de05658ba2e04603ba84bd83be6d99e7ea6d7f430c9d4b1ca5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharpx.Collections.Experimental/IntMap.fs:151-155 | src/FSharpx.Collections.Experimental/IntMap.fs:187-191 \u2014 both copies are in the same file, so extract the block 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/FSharpx.Collections.Experimental/IntMap.fs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"072256a69ac56a2d468c898cf39d2b8c23db3b121eea6aff1c37b647c184516a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharpx.Collections.Experimental/IntMap.fs:172-176 | src/FSharpx.Collections.Experimental/IntMap.fs:202-206 \u2014 both copies are in the same file, so extract the block 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/FSharpx.Collections.Experimental/IntMap.fs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"129bd495a064502d815b5d843cb8a4a97a651df1e01bc73d2e11d1605b33b127"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharpx.Collections.Experimental/IntMap.fs:467-471 | src/FSharpx.Collections.Experimental/IntMap.fs:480-484 \u2014 both copies are in the same file, so extract the block 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/FSharpx.Collections.Experimental/IntMap.fs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"48cee6bdd1a1cce135317bb5e5872b05b047a6d37421414ea659c0af4f8c6c5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharpx.Collections.Experimental/RealTimeDeque.fs:69-73 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:87-91 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/RealTimeDeque.fs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"67006457f1ce6d87cd4cb0728382b2f8d68367e91eb9404c31f03299a7f7e739"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 test suite did not build: Coverage NOT MEASURED: this repository did not build in our analyzer environment (a C#/MSBuild compiler error), so no coverage could be collected. It is excluded from the score rather than counted as a near-zero defect. We did not read WHERE the failing diagnostic is, so this does not claim the fault is in your test code \u2014 a repository written for an older SDK band can compile for you and not for us. Run \u0060dotnet build\u0060 on this commit; if it succeeds, the gap is ours. Committing the Cobertura/OpenCover/lcov report your CI already produces also lets us measure real coverage without building anything."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 1 significant file(s) lose their only recent owner: src/FSharpx.Collections/Collections.fs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3762e02f767f37592c7090f98c1aa2cb125299c9879dca475f0c2eac42aeb20a"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found at common paths; consider documenting architectural decisions in Docs/ADL/ or similar."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022[create-hashmap]\u0022 \u2014 delete - the [/create-hashmap] marker already labels this section"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/csharp/PersistentHashMap.cs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a10fa3368edfd3e58ca947773400a2d1eb19ac97bd46cee5f6ff6ca9238bffa"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create an empty PersistentHashMap and add some elements\u0022 \u2014 delete - the code is self-evident; keep only the /[/...] markers for navigation"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/csharp/PersistentHashMap.cs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"64272fa34c31b9bce5a7aa6967ae4e83ade25dcb9c29a81a66653697592ed867"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check no. of elements in the PersistentHashMap\u0022 \u2014 delete - count() already says this"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/csharp/PersistentHashMap.cs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d14f87eaf83b5e0cab74890d2363c20412425953a276ef7c20aec67bac63e3d"}},{"ruleId":"D28","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":"0e7dc205f8fc5ae1306d45b7d0c6da56c6cc0f518a0e5cdfe287b731a4229d07"}},{"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":"e75effab32a89b2a50f742ecc33058bda4c7e8c632f85c3a95cd0294328a65c0"},"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":"ecead23b2a2e1384d11d9a96dfd51f9346d6291f835524ce90d33b2e165dbb3d"},"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":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a80c51272d9b6d0ddf0bfe8367adccf31da8f01e749ce0478379de8a3263de09"}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c15da98dccd3b6fd378cfdff14d19a86311446e2743e97e860c5e1e32d364573"}},{"ruleId":"D30","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":"ec01db2bc24e03cc2a6d600048bfcf82b0bce74bebbdd01076755c8288825fbd"}},{"ruleId":"D30","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":"686b62b3e677b86bc8d1bb61a91962627d79bb1c63a556d8d937283df57a8c32"}},{"ruleId":"D34","level":"note","message":{"text":"Concentrated knowledge decay: 32 of 43 significant files have no living knowledge, while the repository is still being changed at a low rate (21 commit(s) in the last 90 days) \u2014 so this is one repo-wide knowledge-decay state, not 32 separate risks. The code moved on without the people who understood these files: document them or schedule a read-through before the next change lands in them."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"008bd8d3156a7f5206da709f59f1f87af76671c6b9becea72c8c9cffbcbd4f8e"}},{"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/FSharpx.Collections/TaggedCollections.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"459a4f8c89ef9d07f9cd2d81a8b932b94b964356ba6bd5c3ec3a4a37b236e0bb"}},{"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/FSharpx.Collections.Experimental/IntMap.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"326e5a60262137cef3b1a7c1c9d245edf04f020327fc4f642293c29c41ba7e0e"}},{"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/FSharpx.Collections.Experimental/RealTimeDeque.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82948cba04d264dae4081cb8d5fcc1f55cd22ba8ba64ff30d1f9e37d0a75685a"}},{"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":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"}}],"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":14,"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."]}]}