{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"IntMap.mergeWithKey\u0027 (cyclomatic 27): IntMap.mergeWithKey\u0027 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/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 17 (37 pts), loops 1 (4 pts) (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/FSharpx.Collections/PersistentHashMap.fs holds 5 of the 9 methods over the threshold \u2014 including the worst \u2014 and 68 of the 109 points over it (62%), 2.6\u00D7 the next-largest file (src/FSharpx.Collections/TaggedCollections.fs at 26). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/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 15 (31 pts), loops 1 (3 pts) (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/FSharpx.Collections/PersistentHashMap.fs holds 5 of the 9 methods over the threshold \u2014 including the worst \u2014 and 68 of the 109 points over it (62%), 2.6\u00D7 the next-largest file (src/FSharpx.Collections/TaggedCollections.fs at 26). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/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 8 (14 pts), match/switch 4 (14 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (MapTree.rebalance) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/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 8 (14 pts), match/switch 4 (14 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (SetTree.rebalance) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/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 9 (19 pts), match/switch 3 (6 pts), 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 12 (24 pts) (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. This shape REPEATS in the file: one other method here (BitmapIndexedNode.FSharpx.Collections.INode.without) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/FSharpx.Collections/PersistentHashMap.fs holds 5 of the 9 methods over the threshold \u2014 including the worst \u2014 and 68 of the 109 points over it (62%), 2.6\u00D7 the next-largest file (src/FSharpx.Collections/TaggedCollections.fs at 26). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/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 12 (24 pts) (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. This shape REPEATS in the file: one other method here (BitmapIndexedNode.FSharpx.Collections.INode.without) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/FSharpx.Collections/PersistentHashMap.fs holds 5 of the 9 methods over the threshold \u2014 including the worst \u2014 and 68 of the 109 points over it (62%), 2.6\u00D7 the next-largest file (src/FSharpx.Collections/TaggedCollections.fs at 26). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/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 12 (19 pts), 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/FSharpx.Collections/PersistentHashMap.fs holds 5 of the 9 methods over the threshold \u2014 including the worst \u2014 and 68 of the 109 points over it (62%), 2.6\u00D7 the next-largest file (src/FSharpx.Collections/TaggedCollections.fs at 26). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/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 8 (16 pts), match/switch 1 (2 pts) (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":"D3","level":"warning","message":{"text":"FileTooLong: FSharpx.Collections/TaggedCollections.fs: FileTooLong \u2014 1082 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 582 over it, 2.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/TaggedCollections.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"564f4f47cdb991f06aaa7c1920d8293877b238614ac1e8518b714a5c8e2e1de1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: ResizeArray: TooManyFunctions \u2014 56 functions. The bar is 30 functions; this is 26 over it, 1.87\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/ResizeArray.fs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"9908e1878e58733f092063cf1907be6b7b65bdac752ced63fa43767b37d0877a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: SetTree: TooManyFunctions \u2014 51 functions. The bar is 30 functions; this is 21 over it, 1.70\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/TaggedCollections.fs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"335f10f928b7e29a410734d76db488401a9d18b1e8429ee9c7b388d139141c9c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: NonEmptyList: TooManyFunctions \u2014 48 functions. The bar is 30 functions; this is 18 over it, 1.60\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/NonEmptyList.fs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93d005bf498bc2af35fff0d8d5276598bd3efeb7c89a4f03ae1b7a69457dfe1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FSharpx.Collections/PersistentHashMap.fs: FileTooLong \u2014 781 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 281 over it, 1.56\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/PersistentHashMap.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1cd7d486f3b9801055d222766b6262937ab74620a0c2ea09eee128eff73245"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: LazyList: TooManyFunctions \u2014 45 functions. The bar is 30 functions; this is 15 over it, 1.50\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/LazyList.fs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8b533583349894fdfe63ccd04d5670073f5ec11ed5db87baf81e1b45d42ffa"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BinomialHeap\u00601: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BinomialHeap.fs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee84adcee4b28ddf22739729e666bd469fb6895b1a2bf038b2b0235ed019d727"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FSharpx.Collections.Experimental/IntMap.fs: FileTooLong \u2014 666 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 104 functions. The bar is 500 significant lines; this is 166 over it, 1.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/IntMap.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"382d2670bdbc7d38b4f046d461c6e23a91d0a5182a14e44993c686c337ae0480"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FSharpx.Collections/Collections.fs: FileTooLong \u2014 653 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 34 functions. The bar is 500 significant lines; this is 153 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/Collections.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c60efb2f0bb6ec5021f5f344ca74ec080e96679408582e59947c0795f3be98c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Set\u00602: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/TaggedCollections.fs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c6a2b30285be1bf1ec6814f368586bddaf024a188c62bf898c534f556fb756"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: BankersDeque: TooManyFunctions \u2014 36 functions. The bar is 30 functions; this is 6 over it, 1.20\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a80f9b7c017bcb78772790c7cf664b0bf57474c5ee0fe05a9f932743b011fc4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: DList: TooManyFunctions \u2014 36 functions. The bar is 30 functions; this is 6 over it, 1.20\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/DList.fs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a595e8b13d761df694fe44ec793b07432b1123ff80b3284b06bb651828f7333"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: MapTree: TooManyFunctions \u2014 36 functions. The bar is 30 functions; this is 6 over it, 1.20\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/TaggedCollections.fs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc147e434f1a6f08e3b691e22f9eb093dd54107570fe9dd9d9854433d166ea90"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SkewBinomialHeap\u00601: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/SkewBinomialHeap.fs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f6b1c39527e9dd2d081969d929c93e8d8988b2f5c17190568b9f3f10d0e47e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FSharpx.Collections/PersistentVector.fs: FileTooLong \u2014 560 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 46 functions. The bar is 500 significant lines; this is 60 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/PersistentVector.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3a7155759f765e8bdfd9a87e2cdf6fbb5d5398262fecef82110827d938ce0f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: FlatList: TooManyFunctions \u2014 33 functions. The bar is 30 functions; this is 3 over it, 1.10\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/FlatList.fs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf955d34d204585adc7139e4a4d15345f1cfbe6a21e897e9c8b85479e58d7b5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: Deque: TooManyFunctions \u2014 33 functions. The bar is 30 functions; this is 3 over it, 1.10\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/Deque.fs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"326b0c844b63cac1b860748d347c85ed998a5bc578abdd413ed7abba7fcc4413"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: RandomAccessList: TooManyFunctions \u2014 31 functions. The bar is 30 functions; this is 1 over it, 1.03\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/RandomAccessList.fs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"79105be96f46613fe1d3a34e94d4a4369c91d4027b71a625800f07ac46d83bc6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Map\u00603: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/TaggedCollections.fs"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcacd31719bb655f7a8a0a2c8a5ef7651e94a89545458b6731352279bc6cb82"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FSharpx.Collections.Experimental/RealTimeDeque.fs: FileTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 36 functions. The bar is 500 significant lines; this is 3 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/RealTimeDeque.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0bbf8971739b150d18d88104dca35474de9e5381fc25846f23a432cbb996f46"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (10 members, 50\u002B identical tokens): src/FSharpx.Collections.Experimental/BankersDeque.fs:9-612 | src/FSharpx.Collections.Experimental/BankersQueue.fs:7-202 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:5-529 | src/FSharpx.Collections.Experimental/BatchedQueue.fs:7-201 | src/FSharpx.Collections.Experimental/BinaryRandomAccessList.fs:5-383 | src/FSharpx.Collections.Experimental/Deque.fs:8-524 | src/FSharpx.Collections.Experimental/HoodMelvilleQueue.fs:7-257 | src/FSharpx.Collections.Experimental/PhysicistQueue.fs:7-245 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:9-723 | src/FSharpx.Collections.Experimental/SkewBinaryRandomAccessList.fs:5-368 \u2014 These 10 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 10 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 10 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7bb3d319f5303b5a4ee5e2c7afc1e1174057c788995d1628ec9a075576ff62a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/FSharpx.Collections/DList.fs:1-332 | src/FSharpx.Collections/Deque.fs:3-292 | src/FSharpx.Collections/PriorityQueue.fs:5-405 | src/FSharpx.Collections/Queue.fs:3-207 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/DList.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"509eb120cb0e128296024476c09418b80248011201d9702a050c1a871fe7c75d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 77\u002B corresponding lines): src/FSharpx.Collections.Experimental/EagerRoseTree.fs:1-94 | src/FSharpx.Collections.Experimental/IndexedRoseTree.fs:1-77 | src/FSharpx.Collections.Experimental/RoseTree.fs:1-93 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 77 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/EagerRoseTree.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb3f8abbc4de76f264042aa769ff326a4cb9e7ca3249958f9279170a3da1b51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (74\u201375 lines \u00D7 2): src/FSharpx.Collections.Experimental/BatchedDeque.fs:85-158 | src/FSharpx.Collections.Experimental/Deque.fs:95-169 \u2014 before extracting anything, compare \u0060src/FSharpx.Collections.Experimental/BatchedDeque.fs\u0060 and \u0060src/FSharpx.Collections.Experimental/Deque.fs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BatchedDeque.fs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea218c623e321c34ab7486734491352cf5c3063e18ddae0589892ab52064679"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (76\u201377 lines \u00D7 4): src/FSharpx.Collections.Experimental/BankersDeque.fs:378-454 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:321-396 | src/FSharpx.Collections.Experimental/Deque.fs:320-395 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:490-565 \u2014 before extracting anything, compare \u0060src/FSharpx.Collections.Experimental/BankersDeque.fs\u0060 and \u0060src/FSharpx.Collections.Experimental/RealTimeDeque.fs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75ff8768946923978f8e1160fefcefa761420cf36259db76f4e39c53374613e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (71 lines \u00D7 2): src/FSharpx.Collections.Experimental/BinaryRandomAccessList.fs:247-317 | src/FSharpx.Collections.Experimental/SkewBinaryRandomAccessList.fs:232-302 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BinaryRandomAccessList.fs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b31039e7d8c508d8b10238903e3ad74aac65fd7c58a2cc77288e071313ad89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): src/FSharpx.Collections.Experimental/BatchedDeque.fs:243-279 | src/FSharpx.Collections.Experimental/Deque.fs:242-278 \u2014 before extracting anything, compare \u0060src/FSharpx.Collections.Experimental/BatchedDeque.fs\u0060 and \u0060src/FSharpx.Collections.Experimental/Deque.fs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BatchedDeque.fs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c22f485582d5a38c45001bda9591a33009bc6d9703e07ddd2609d5c294189c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): src/FSharpx.Collections.Experimental/BinomialHeap.fs:265-288 | src/FSharpx.Collections.Experimental/PairingHeap.fs:247-269 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BinomialHeap.fs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b0baaf42cb4af79dfdbf8462d9131a1a33cd9bf4a6c811fe2c7952d634fbfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 4): src/FSharpx.Collections.Experimental/BankersQueue.fs:106-128 | src/FSharpx.Collections.Experimental/BatchedQueue.fs:94-114 | src/FSharpx.Collections.Experimental/HoodMelvilleQueue.fs:151-171 | src/FSharpx.Collections.Experimental/PhysicistQueue.fs:138-158 \u2014 before extracting anything, compare \u0060src/FSharpx.Collections.Experimental/BatchedQueue.fs\u0060 and \u0060src/FSharpx.Collections.Experimental/HoodMelvilleQueue.fs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BankersQueue.fs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8e62e0a421753de844de6f3f69788b49edbaec9105a7bda687b0d93ed57d92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2): src/FSharpx.Collections.Experimental/BankersDeque.fs:166-212 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:253-299 \u2014 before extracting anything, compare \u0060src/FSharpx.Collections.Experimental/BankersDeque.fs\u0060 and \u0060src/FSharpx.Collections.Experimental/RealTimeDeque.fs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ce81d142436db91591d9b89216ca35d4bd38020069332eb47e0f78e362de97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/FSharpx.Collections/PersistentVector.fs:208-225 | src/FSharpx.Collections/RandomAccessList.fs:184-201 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/PersistentVector.fs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5ccbfde3c799f7cd31310fe158e5f3380c33028f913b6a50137d7c97c4e193"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 4): src/FSharpx.Collections/DList.fs:23-39 | src/FSharpx.Collections/Deque.fs:14-27 | src/FSharpx.Collections/PriorityQueue.fs:48-61 | src/FSharpx.Collections/Queue.fs:10-23 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharpx.Collections/DList.fs:23\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/DList.fs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"880d7ddfb894c6cb6a5361e5902e87e026d556ac8a91603e7632baf0a1397bee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/FSharpx.Collections/PersistentVector.fs:138-154 | src/FSharpx.Collections/PersistentVector.fs:334-350 \u2014 both copies are in the same file, so extract the block 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":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d6c8c117a8a0399db81cd52efe78780438f6a3dcdec241332f92a76ff3c7ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/FSharpx.Collections/RandomAccessList.fs:81-97 | src/FSharpx.Collections/RandomAccessList.fs:225-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/FSharpx.Collections/RandomAccessList.fs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5158775cffc5615291a32aff7a145545d0c45975b872f740af53b1a6b5ed19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/FSharpx.Collections/PersistentVector.fs:71-86 | src/FSharpx.Collections/PersistentVector.fs:261-276 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/PersistentVector.fs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"56984d1cb87294eef60aa00269c16fff0be786d478c5326769e3da724ba66347"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 10): src/FSharpx.Collections.Experimental/BankersDeque.fs:420-434 | src/FSharpx.Collections.Experimental/BankersQueue.fs:123-137 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:363-377 | src/FSharpx.Collections.Experimental/BatchedQueue.fs:109-123 | src/FSharpx.Collections.Experimental/BinaryRandomAccessList.fs:278-292 | src/FSharpx.Collections.Experimental/Deque.fs:362-376 | src/FSharpx.Collections.Experimental/HoodMelvilleQueue.fs:166-180 | src/FSharpx.Collections.Experimental/PhysicistQueue.fs:153-167 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:532-546 | src/FSharpx.Collections.Experimental/SkewBinaryRandomAccessList.fs:263-277 \u2014 before extracting anything, compare \u0060src/FSharpx.Collections.Experimental/BankersDeque.fs\u0060 and \u0060src/FSharpx.Collections.Experimental/RealTimeDeque.fs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e54a35c76a80a90960fecef8d98f967a1ad857a86359a8d77deda1b45e2995"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): src/FSharpx.Collections.Experimental/BatchedDeque.fs:400-414 | src/FSharpx.Collections.Experimental/BatchedQueue.fs:126-140 | src/FSharpx.Collections.Experimental/Deque.fs:399-413 \u2014 before extracting anything, compare \u0060src/FSharpx.Collections.Experimental/BatchedDeque.fs\u0060 and \u0060src/FSharpx.Collections.Experimental/Deque.fs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BatchedDeque.fs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8f5d1bcbd6be335b81334da944f6dbd1fe04eccf90620b69476f93e942ed64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/FSharpx.Collections.Experimental/BatchedDeque.fs:31-45 | src/FSharpx.Collections.Experimental/Deque.fs:55-68 \u2014 before extracting anything, compare \u0060src/FSharpx.Collections.Experimental/BatchedDeque.fs\u0060 and \u0060src/FSharpx.Collections.Experimental/Deque.fs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BatchedDeque.fs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd0f04bd50fc71b79eabf18c8b6daeb2ac4da5ee67f354b1f9e4455df5bb831"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): src/FSharpx.Collections/DList.fs:50-64 | src/FSharpx.Collections/DList.fs:65-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. 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/DList.fs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14e8edbcd7bc8d1213d30a9f5b0f7e8f9f6c94c08f540dc75f98b0261c3306f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/FSharpx.Collections.Experimental/BatchedDeque.fs:172-184 | src/FSharpx.Collections.Experimental/Deque.fs:183-196 \u2014 before extracting anything, compare \u0060src/FSharpx.Collections.Experimental/BatchedDeque.fs\u0060 and \u0060src/FSharpx.Collections.Experimental/Deque.fs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BatchedDeque.fs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"4837eef4cddf8149560131b8eadccc630910ab95b8878919a7fb624fa6413547"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/FSharpx.Collections.Experimental/BankersDeque.fs:246-258 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:333-345 \u2014 before extracting anything, compare \u0060src/FSharpx.Collections.Experimental/BankersDeque.fs\u0060 and \u0060src/FSharpx.Collections.Experimental/RealTimeDeque.fs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66d72b740e464c5562d9aa0aef632b5b6a34bd48ee913b8458f54c27d67dc42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/FSharpx.Collections.Experimental/BankersDeque.fs:360-372 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:472-484 \u2014 before extracting anything, compare \u0060src/FSharpx.Collections.Experimental/BankersDeque.fs\u0060 and \u0060src/FSharpx.Collections.Experimental/RealTimeDeque.fs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7f11d1bad783d1f5da3979d1b4d9f2d3bf85f4c0c5152a027926caad1d6153"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/FSharpx.Collections.Experimental/BatchedDeque.fs:293-305 | src/FSharpx.Collections.Experimental/Deque.fs:292-304 \u2014 before extracting anything, compare \u0060src/FSharpx.Collections.Experimental/BatchedDeque.fs\u0060 and \u0060src/FSharpx.Collections.Experimental/Deque.fs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BatchedDeque.fs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"c959c96e096c65ddb7db23fc60810b6720fa81028ff62a438870f34509111f32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/FSharpx.Collections.Experimental/BatchedQueue.fs:41-53 | src/FSharpx.Collections.Experimental/HoodMelvilleQueue.fs:86-98 \u2014 before extracting anything, compare \u0060src/FSharpx.Collections.Experimental/BatchedQueue.fs\u0060 and \u0060src/FSharpx.Collections.Experimental/HoodMelvilleQueue.fs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BatchedQueue.fs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"221211dbe153976b379de0ceb84d8900b7480b1c8cbba15bc0df7c833609f4d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/FSharpx.Collections/PersistentHashMap.fs:782-794 | src/FSharpx.Collections/PersistentHashMap.fs:877-889 \u2014 both copies are in the same file, so extract the block 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":"e983f5a0bb29c80ff5988e439748941413c9bc0292825c34a6a1b8bc3b8456cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FSharpx.Collections.Experimental/BatchedDeque.fs:54-65 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:73-84 \u2014 both copies are in the same file, so extract the block 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":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5e6836fababfd57792fb6bca96ceea19b92076983ddbee520e7ca390f7a71b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FSharpx.Collections.Experimental/BatchedDeque.fs:212-223 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:231-242 \u2014 both copies are in the same file, so extract the block 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":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24a01df029927ce388f00d86a1391bf195f7259b5f726c9ae46df56186aa973"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): src/FSharpx.Collections.Experimental/DList.fs:85-96 | src/FSharpx.Collections.Experimental/DList.fs:98-107 \u2014 both copies are in the same file, so extract the block 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":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63fb8700bca1512cd5c2e6b7e7cf5cfe50c2b448eb3be4debcb6529b1d5f599"}},{"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":"e08fea1f43de59b623627aeb919149af7ca58769c2dc7298b98f698e8769ef8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FSharpx.Collections/PersistentVector.fs:82-93 | src/FSharpx.Collections/RandomAccessList.fs:93-104 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/PersistentVector.fs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"0215af02052a0b2a8f03f30cebdfa4a4ccc5361bd3c551b7c361352ffce66b7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FSharpx.Collections/PersistentVector.fs:272-283 | src/FSharpx.Collections/RandomAccessList.fs:237-248 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/PersistentVector.fs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ec4eb38d322f4b4b9965b259d888c74f2a6281e0ac952bf10bc090c415b928"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FSharpx.Collections/RandomAccessList.fs:99-110 | src/FSharpx.Collections/RandomAccessList.fs:243-254 \u2014 both copies are in the same file, so extract the block 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/RandomAccessList.fs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa19145bff0c05623839cf8dcaf614167c0689bd6d2035a59e9c3902d468b499"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharpx.Collections.Experimental/BankersDeque.fs:232-242 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:319-329 \u2014 before extracting anything, compare \u0060src/FSharpx.Collections.Experimental/BankersDeque.fs\u0060 and \u0060src/FSharpx.Collections.Experimental/RealTimeDeque.fs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a07295ef22f07b7787f8a8eca6656b51277164f011b698eeb7158a16297c2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharpx.Collections.Experimental/BankersDeque.fs:346-356 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:458-468 \u2014 before extracting anything, compare \u0060src/FSharpx.Collections.Experimental/BankersDeque.fs\u0060 and \u0060src/FSharpx.Collections.Experimental/RealTimeDeque.fs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b4b62e6edc5e2089706384f153a7898c59cf2917403a9e28bf75b2e6fbbc33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/FSharpx.Collections/PersistentHashMap.fs:145-155 | src/FSharpx.Collections/PersistentHashMap.fs:427-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":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"4901582dc41721d72ead4270d783ec31dedbd3c980c339ea5311644975309ae9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/FSharpx.Collections/PersistentHashMap.fs:647-656 | src/FSharpx.Collections/PersistentHashMap.fs:674-684 \u2014 both copies are in the same file, so extract the block 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":"471e05e833cc594e084e000445d2b216fdfe90bbfc7b2af94323d2608f42bb4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/FSharpx.Collections.Experimental/IntMap.fs:718-727 | src/FSharpx.Collections.Experimental/IntMap.fs:732-741 | src/FSharpx.Collections.Experimental/IntMap.fs:750-759 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/FSharpx.Collections.Experimental/IntMap.fs:742\u0060 calls \u0060fun\u0060 and \u0060src/FSharpx.Collections.Experimental/IntMap.fs:727\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/IntMap.fs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17fe8dc20739fd6ad99e5434abb5d57f82c6363946f37eeec9bf12941a79bab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharpx.Collections.Experimental/BankersDeque.fs:49-59 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:98-108 \u2014 before extracting anything, compare \u0060src/FSharpx.Collections.Experimental/BankersDeque.fs\u0060 and \u0060src/FSharpx.Collections.Experimental/RealTimeDeque.fs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"61aa017fd44398eb3746a8ea1f532217a00b9ef071dbcc088bdc5068a9033fba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/FSharpx.Collections.Experimental/BankersDeque.fs:217-225 | src/FSharpx.Collections.Experimental/BankersDeque.fs:248-256 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:304-312 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:335-343 \u2014 before extracting anything, compare \u0060src/FSharpx.Collections.Experimental/BankersDeque.fs\u0060 and \u0060src/FSharpx.Collections.Experimental/RealTimeDeque.fs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac3c568af495b944e90de42abe754daee28b2de89ab5ed158bc9f102b1e2d0c"}},{"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 before extracting anything, compare \u0060src/FSharpx.Collections.Experimental/BankersDeque.fs\u0060 and \u0060src/FSharpx.Collections.Experimental/RealTimeDeque.fs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1cef4c8068c9c9c1621745428f2077c09ed888016d7c17d818f4e58b06ecad2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/FSharpx.Collections.Experimental/BatchedDeque.fs:55-63 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:74-82 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:213-221 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:232-240 \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":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95c6ab9d3c6fe9858601ceed2eb715d1c275f40627b1d675f0051c6b0cf441d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/FSharpx.Collections.Experimental/BatchedDeque.fs:162-170 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:188-196 | src/FSharpx.Collections.Experimental/Deque.fs:173-181 | src/FSharpx.Collections.Experimental/Deque.fs:200-208 \u2014 before extracting anything, compare \u0060src/FSharpx.Collections.Experimental/BatchedDeque.fs\u0060 and \u0060src/FSharpx.Collections.Experimental/Deque.fs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BatchedDeque.fs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"b378bd0531147fce8016ea887e05ef2de96cc2b9d8a6a4a615880a1cfd2e7913"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/FSharpx.Collections.Experimental/BatchedDeque.fs:283-291 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:309-317 | src/FSharpx.Collections.Experimental/Deque.fs:282-290 | src/FSharpx.Collections.Experimental/Deque.fs:308-316 \u2014 before extracting anything, compare \u0060src/FSharpx.Collections.Experimental/BatchedDeque.fs\u0060 and \u0060src/FSharpx.Collections.Experimental/Deque.fs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BatchedDeque.fs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"07aa77c7ebce9d21f80d4fd9d80f52e3904ec399eacb6584ed9c80aa19c33f88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/FSharpx.Collections.Experimental/BankersDeque.fs:321-329 | src/FSharpx.Collections.Experimental/BankersDeque.fs:335-342 \u2014 both copies are in the same file, so extract the block 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/BankersDeque.fs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf6bc19a4361ce8324d99e7fc5d501a98eaed09d0838c34e6edec54b74cc502"}},{"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":"1ee6dd5abaee880d078ecc7561e1e8b0dcf740db0382bdd1257f3271c1bea5cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 2): src/FSharpx.Collections.Experimental/IntMap.fs:157-162 | src/FSharpx.Collections.Experimental/IntMap.fs:193-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. 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":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"692eb78fd33de491fd2a6c0e008465ed4234ef018a8574a0adb385ff75f58031"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharpx.Collections.Experimental/IntMap.fs:178-186 | src/FSharpx.Collections.Experimental/IntMap.fs:208-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":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcafad14af8ee64d263ac44921e6863961221a22dac89260ca864d1484030088"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/FSharpx.Collections/PersistentHashMap.fs:501-508 | src/FSharpx.Collections/PersistentHashMap.fs:570-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":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67d001d8ca63df852d558c5247c55ccd370430ec6ef8a856c65acefa356e07c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharpx.Collections/PersistentHashMap.fs:542-550 | src/FSharpx.Collections/PersistentHashMap.fs:619-627 \u2014 both copies are in the same file, so extract the block 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":"644f88a4a4c4b47c5dcbe82063979434f3760b1dbdd0725280e43c0f0e0beafa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/FSharpx.Collections/TaggedCollections.fs:851-858 | src/FSharpx.Collections/TaggedCollections.fs:865-873 \u2014 both copies are in the same file, so extract the block 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/TaggedCollections.fs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2fce339cad616d73980efa6d97244fd6c35ca639711c000a991f937a1729c44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/FSharpx.Collections.Experimental/BinomialHeap.fs:279-286 | src/FSharpx.Collections.Experimental/PairingHeap.fs:260-267 | src/FSharpx.Collections/PriorityQueue.fs:253-260 \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/FSharpx.Collections.Experimental/BinomialHeap.fs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e60d2326b762c98685e5a1be1892695bc96f9184be25e06fa7e8fde161abb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharpx.Collections.Experimental/BankersDeque.fs:319-326 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:431-438 \u2014 before extracting anything, compare \u0060src/FSharpx.Collections.Experimental/BankersDeque.fs\u0060 and \u0060src/FSharpx.Collections.Experimental/RealTimeDeque.fs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e3d7411a68e995a605148d1009d31d1af3540e39f92fbd620369d851a89105"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/FSharpx.Collections.Experimental/BatchedDeque.fs:153-160 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:166-172 \u2014 both copies are in the same file, so extract the block 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":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40ded632246d303aadd6cb0afa6379acf94f2440420231f4a6522f64bea1106"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/FSharpx.Collections.Experimental/BatchedDeque.fs:179-186 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:192-198 \u2014 both copies are in the same file, so extract the block 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":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"065e241dc1747b8ad82c38e2dc7e4f6737356655266c26e0c368a3c7ede7a836"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 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":"faf7209ae1facf8ca5df01f78d16f56815a4589b20f8963aab2715295f05391d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): src/FSharpx.Collections.Experimental/BankersDeque.fs:320-326 | src/FSharpx.Collections.Experimental/BankersDeque.fs:348-354 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:432-438 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:460-466 \u2014 before extracting anything, compare \u0060src/FSharpx.Collections.Experimental/BankersDeque.fs\u0060 and \u0060src/FSharpx.Collections.Experimental/RealTimeDeque.fs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c88d0089bd9b250d5d831283d2cd7a5c82121fc7eda22eeda8f81a6df5ad108"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): src/FSharpx.Collections.Experimental/BatchedDeque.fs:152-158 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:178-184 | src/FSharpx.Collections.Experimental/Deque.fs:163-169 | src/FSharpx.Collections.Experimental/Deque.fs:190-196 \u2014 before extracting anything, compare \u0060src/FSharpx.Collections.Experimental/BatchedDeque.fs\u0060 and \u0060src/FSharpx.Collections.Experimental/Deque.fs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BatchedDeque.fs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b67f7b5e6bf523cbbd3374e161495f6b2155019c7084714ce09fecac9e187b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): src/FSharpx.Collections.Experimental/BatchedDeque.fs:273-279 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:299-305 | src/FSharpx.Collections.Experimental/Deque.fs:272-278 | src/FSharpx.Collections.Experimental/Deque.fs:298-304 \u2014 before extracting anything, compare \u0060src/FSharpx.Collections.Experimental/BatchedDeque.fs\u0060 and \u0060src/FSharpx.Collections.Experimental/Deque.fs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BatchedDeque.fs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca64b52e911727798a645591b2a11bd2a3a3374f453b3204a979c544f45dbf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/FSharpx.Collections.Experimental/BankersDeque.fs:112-125 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:183-196 \u2014 before extracting anything, compare \u0060src/FSharpx.Collections.Experimental/BankersDeque.fs\u0060 and \u0060src/FSharpx.Collections.Experimental/RealTimeDeque.fs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02a26f670aeed435d1598f81c8e6a66ec4c9371d9d7b6ecf2ac502b432832d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/FSharpx.Collections.Experimental/BankersDeque.fs:149-162 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:236-249 \u2014 before extracting anything, compare \u0060src/FSharpx.Collections.Experimental/BankersDeque.fs\u0060 and \u0060src/FSharpx.Collections.Experimental/RealTimeDeque.fs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a81ffca3e631907774d991ff4d4a04ee60398ffdbcfacee065470b23b127540"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharpx.Collections.Experimental/BatchedDeque.fs:275-281 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:287-293 \u2014 both copies are in the same file, so extract the block 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":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d15cc539fbcca374cf8e55e19ab7a5a2a84fcc7dcbc3d99e12e9d54b78e4c0"}},{"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":"cc65d28bf4cb7e84092e9855a308540be9f9df7f95f810651f0ce9cec3930e12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharpx.Collections/Deque.fs:151-157 | src/FSharpx.Collections/PriorityQueue.fs:217-224 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/Deque.fs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd23ffb8fe6961feba60b35f996b8ed65113862c4c07adfce9ee3c61baa0474"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharpx.Collections/PersistentHashMap.fs:95-101 | src/FSharpx.Collections/PersistentHashMap.fs:106-112 \u2014 both copies are in the same file, so extract the block 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":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"de02a9e43d3726a7ca999ea74db4817d3fb92eee66cae14763a7552ea3036397"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): src/FSharpx.Collections/PersistentVector.fs:184-190 | src/FSharpx.Collections/RandomAccessList.fs:423-428 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/PersistentVector.fs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5defc93e8b8ecc90d31becae1b3f60ac1dd713e18294f3e65f01710096adcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharpx.Collections/DList.fs:119-125 | src/FSharpx.Collections/DList.fs:131-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":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"7790f9676adc2b53129728ac4774cc23f1aa0f7ac319c986693c30b621958516"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharpx.Collections/DList.fs:171-176 | src/FSharpx.Collections/PriorityQueue.fs:217-223 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/DList.fs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2bb72e4f1085301aa5300ea964d4ea330e9dac1fe4c93507b8fb0ce0bde4ad1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharpx.Collections/PersistentVector.fs:392-397 | src/FSharpx.Collections/RandomAccessList.fs:369-374 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/PersistentVector.fs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d1b0c88e4423543adb4399c8b22fc70b259c27f1e295f3474aadf49d90b08c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): src/FSharpx.Collections.Experimental/BatchedDeque.fs:274-279 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:287-291 | src/FSharpx.Collections.Experimental/Deque.fs:273-278 | src/FSharpx.Collections.Experimental/Deque.fs:286-290 \u2014 before extracting anything, compare \u0060src/FSharpx.Collections.Experimental/BatchedDeque.fs\u0060 and \u0060src/FSharpx.Collections.Experimental/Deque.fs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BatchedDeque.fs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"674854decaf47f80bc3042d63265d898bbdf8308ddcc8865509abb1ef37b24f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): src/FSharpx.Collections.Experimental/BatchedDeque.fs:300-305 | src/FSharpx.Collections.Experimental/BatchedDeque.fs:313-317 | src/FSharpx.Collections.Experimental/Deque.fs:299-304 | src/FSharpx.Collections.Experimental/Deque.fs:312-316 \u2014 before extracting anything, compare \u0060src/FSharpx.Collections.Experimental/BatchedDeque.fs\u0060 and \u0060src/FSharpx.Collections.Experimental/Deque.fs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BatchedDeque.fs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b68187d4daf6f5364c71ca9396ada647472e7c758dc927016c2880cddd08dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/FSharpx.Collections.Experimental/BankersDeque.fs:204-208 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:291-295 | src/FSharpx.Collections.Experimental/RealTimeDeque.fs:430-434 \u2014 before extracting anything, compare \u0060src/FSharpx.Collections.Experimental/BankersDeque.fs\u0060 and \u0060src/FSharpx.Collections.Experimental/RealTimeDeque.fs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b9025e08a19ccd034d8ba4716372018574cb02bbb9a5625e41be54b5e124fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharpx.Collections.Experimental/Deque.fs:164-169 | src/FSharpx.Collections.Experimental/Deque.fs:177-181 \u2014 both copies are in the same file, so extract the block 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":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d9520aef04d27a3ef2b8ede6228ee441d5434b61fb60282138d3e53821f9c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharpx.Collections.Experimental/Deque.fs:191-196 | src/FSharpx.Collections.Experimental/Deque.fs:204-208 \u2014 both copies are in the same file, so extract the block 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":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83c44980c1c1a445b55aa574a66893a1f97f13a109c76275e4a906fe950e86e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharpx.Collections.Experimental/IntMap.fs:358-367 | src/FSharpx.Collections.Experimental/IntMap.fs:370-379 \u2014 both copies are in the same file, so extract the block 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":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fc54b000bb0b3ecbb2e1e7e2ead895259812a2306c1b67f6e6901fa5ac8f6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 3): src/FSharpx.Collections/Deque.fs:55-59 | src/FSharpx.Collections/Deque.fs:69-73 | src/FSharpx.Collections/Deque.fs:121-124 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/FSharpx.Collections/Deque.fs:59\u0060 calls \u0060create\u0060 and \u0060src/FSharpx.Collections/Deque.fs:124\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/Deque.fs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9bb89844b2dbeb8f750988f86e50438abbceed1ba448fc0c1a404891900c13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharpx.Collections/TaggedCollections.fs:704-708 | src/FSharpx.Collections/TaggedCollections.fs:712-716 \u2014 both copies are in the same file, so extract the block 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/TaggedCollections.fs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"70dffc322579448aab42670342c2ef90f9c1c295e45c640589b44b7b96cf7e15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharpx.Collections.Experimental/IntMap.fs:440-446 | src/FSharpx.Collections.Experimental/IntMap.fs:455-461 \u2014 both copies are in the same file, so extract the block 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":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2778c0c6f36290f8adf1c87dc95615c235f7b666632bafebb5a7723f2447fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/FSharpx.Collections.Experimental/IntMap.fs:467-479 | src/FSharpx.Collections.Experimental/IntMap.fs:480-492 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/IntMap.fs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a30c5eae14db7dfff3e165fea8eca5fb2372b1481db0b8130fdb0657526c70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharpx.Collections.Experimental/IntMap.fs:530-536 | src/FSharpx.Collections.Experimental/IntMap.fs:544-550 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/IntMap.fs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"298f894b9b1f2037454efc18f853c2228cebf39dc9eca9107af5248e6bfa9eff"}},{"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 before extracting anything, compare \u0060src/FSharpx.Collections.Experimental/BankersDeque.fs\u0060 and \u0060src/FSharpx.Collections.Experimental/RealTimeDeque.fs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29778e55655b9b7a1ef573583e9c77488253f0224eec9e92af9a329ab3f6dc8"}},{"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 before extracting anything, compare \u0060src/FSharpx.Collections.Experimental/BankersDeque.fs\u0060 and \u0060src/FSharpx.Collections.Experimental/RealTimeDeque.fs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"bae6ac50bc7b1f9492947b195e554a9fb3c86220dc6195969582804568224320"}},{"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":"e8f41b233bdd21d8e3c117256a614eb25643f1717f1ecb062829689e27b99bfb"}},{"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":"cc088b7098904e78bc1b9dcb2fdbcb6f43a4fff1126b19f55f89143b3583d0c0"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 .NET and JavaScript/TypeScript suite: Coverage NOT MEASURED: the .NET half could not be measured \u2014 the repository wires up no coverage collector for \u0060--collect:\u0022XPlat Code Coverage\u0022\u0060 to use; the JavaScript/TypeScript half could not be measured \u2014 tests/fable/ runs mocha but declares no coverage provider, so the suite can run and still produce no lcov \u2014 add \u0060c8\u0060 (or \u0060nyc\u0060) as a devDependency so the suite can be wrapped for coverage. This repository\u0027s production source spans both ecosystems, and no partial figure is published as if it were the whole: coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository\u0027s maintainers can perform; once it passes, the real number is measured on the next scan."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D11","level":"error","message":{"text":"Test suite declares a test script but contains no test files: tests/fable/: The mocha suite in tests/fable/ was installed and launched successfully, and the runner then found no test files to run \u2014 Error: No test files found: \u0022dist\u0022. The package declares a test script, so it reads as a tested package to anyone who checks its manifest, but there is nothing behind the declaration: no test case exists, so it cannot detect a regression and its presence overstates how much of this repository is tested. The ask is the owner\u0027s: write the first test for this package, or remove the test script from a package that has none. This is not a report that the tests FAIL \u2014 there are none."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f4f7e7d267916accb8eabd43b5842961fa9498dd048578cd65e6c669569b4a3e"}},{"ruleId":"D12","level":"note","message":{"text":"Outdated: FSharp.Core: FSharp.Core 4.3.4 \u2192 11.0.101 available (referenced by FSharpx.Collections)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"71097badbe27b5625a274b76342e1f8adbf51dabf5de4d1138532fe38f00ae7e"}},{"ruleId":"D12","level":"note","message":{"text":"Outdated: Expecto: Expecto 8.13.1 \u2192 11.1.1 available (referenced by FSharpx.Collections.Tests)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"06ca7156da8d1b25b6ea96e62278fc27891149d001b8ae13cfbb536e5392396b"}},{"ruleId":"D12","level":"note","message":{"text":"Outdated: Expecto.FsCheck: Expecto.FsCheck 8.13.1 \u2192 11.1.1 available (referenced by FSharpx.Collections.Tests)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9d81206c985d4c1854f027b4ed11eee85dced8a3d52f09c3184d84294ebcf1de"}},{"ruleId":"D12","level":"note","message":{"text":"Outdated: System.Collections.Immutable: System.Collections.Immutable 6.0.0 \u2192 11.0.0 available (referenced by FSharpx.Collections.Tests)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fdb3ea170ff1450edcee5e4e7b3cdacf8072f16ea695440aaeea0a487508be80"}},{"ruleId":"D12","level":"note","message":{"text":"Outdated: System.Reflection.Metadata: System.Reflection.Metadata 8.0.1 \u2192 11.0.0 available (referenced by FSharpx.Collections.Tests)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9dde8938de42c9cce1c0f37eaf725b2919431bb5054f74dde7050c1ac3cf4edd"}},{"ruleId":"D12","level":"note","message":{"text":"Outdated: Microsoft.SourceLink.GitHub: Microsoft.SourceLink.GitHub 1.0.0 \u2192 11.0.100 available (referenced by csharp)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/csharp/csharp.csproj"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"be56aecefde28a692152602c3f38e435c8b8d8933cbd6b1ee21b836077c6d173"}},{"ruleId":"D12","level":"note","message":{"text":"Outdated: Paket.Core: Paket.Core 9.0.2 \u2192 12.0.0 available (referenced by build)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2105815d29c588765f7d007981a2aa7c762d382dd6608ee9c742c6985bc45301"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: System.Collections.Immutable: System.Collections.Immutable 6.0.0 \u2014 Legacy"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b7533073f76cabe3491fd926079b31d10343d3ff6ac7f74e45cafb70c2677014"}},{"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. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060docs/csharp/csharp.csproj\u0060 makes this repository a deployable product (line 4)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/csharp/csharp.csproj"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c8749a7f9f28ebb4e17854a2a643bb2dcbc2347d807734d5871c06bc416a98"}},{"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":"73fff3c6c9e2d9da7d4f738c40b8a223e17cfd14b0555814ffc82880faec5f41"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6625220732cf08c4004fd7edf84862bec7606144ad9bbaf2df1e92b0319c4b0e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f6d629032dff8af67a8377dc92a11bc9f3174a637468e2db142a019acc12e4ab"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e467572c1c0a1ea88399ba94552a7431833adfc41887b80263f9bcc0dd1f9410"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b85c0011fbfcd2032e5e2e6a076332963fa5431967cc6e19ac3ecd4181549798"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3156cc6ad8d7faab026d04c1c469a2dedbc93e21288260fcdb9f6e26096ba63b"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c9e6857191791f19034dc0c7c04d3997cd01da4cf465702883f5d4f78ae5df9c"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0790a402945238d33c272b56da845900e479ec28f6f0dbc4db73c5ccf58ac7b1"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/TaggedCollections.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea43f155619c1b230f7049d95cf4360fe45c8ad5cdaf8ad5b4a75c43cc038571"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/IntMap.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a13ba943c8e54a4223957c50712fdd74dab7c1e876baef50098ee704b1ec41f"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/RandomAccessList.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dafc4db5c88af8073ca47062e2eaa1308ac620bb9d4ced0718fd88576694d700"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 16 smaller file(s) also have no living knowledge \u2014 folded into the freshness score and metrics rather than raised one row each \u2014 most significant first: src/FSharpx.Collections.Experimental/BatchedDeque.fs, src/FSharpx.Collections.Experimental/ChampHashMap.fs, src/FSharpx.Collections.Experimental/BinomialHeap.fs, src/FSharpx.Collections.Experimental/SkewBinomialHeap.fs, src/FSharpx.Collections/DList.fs, src/FSharpx.Collections.Experimental/BlockResizeArray.fs, src/FSharpx.Collections/ByteString.fs, src/FSharpx.Collections/Interfaces.fs (and 8 more) (19 orphaned of 24 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 24 of the 34 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BatchedDeque.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ae0de185137ebee4c720637f24041377c12eaae03dfec3706636e3ee367636"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/ChampHashMap.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"483f706785e14f734392d791479a9f15b08926c90f0e8976a83565334067da25"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BinomialHeap.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94f35fce9ac6b4735cfc9ff07813978c3b79877f7e399bab18e2cb775aec47c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/SkewBinomialHeap.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"deda7867ba098f89b76d3ad38f165cb1cdd1fce21976e419b073ae7245384853"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/DList.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5974191c12c86fe96a3417aea468809b5c3a30466c7ce4b2487500874774bc28"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BlockResizeArray.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"059833232401e3b1c3ddb3530274792064ae51dd1f85bc02164cdb06422277b5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/ByteString.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab8a4f9bf0fb3d95c437cfe5a83212a1aaecb8663736e06598b9ca659c68bd1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/Interfaces.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07b6319fcdffca30f8fae58060dfccbd3d0b52bdbb15b6818cc965e513de88f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/FlatList.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a08ffafc902cbc968e223c2c77f902ff272479ab451336b3ccdcaae8f94884a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BKTree.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0024e2d59bf7c071e975acb5f97996a8251ad679846685d41c99b34c18f563"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/DList.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9493aa5d030368a348b61caecddeb2e1189db2201fadab8689909801f9e4251a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BootstrappedQueue.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e312fa6ff63673f6f3dcab8c30be3a90384b38a04e0a5eb8f5777946f3b18e85"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BinaryRoseTree.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1ff9b42d7a3476f84af2ff32604e32d661c74ab791597975a4db1bfc04d6ea"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/ImplicitQueue.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde9d9a76cfc40973ce59fe0db9f4f641c9617406a12f714437870c19bc09330"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/EagerRoseTree.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2883c38d39fe7f4b71b4a700995d31214ddd8df6316b321f856a179df2ef2c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/RoseTree.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c8a8a9f710c28d6890216083a699a8645baf99ef365055c22ebb04b97c5efa"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe274ba5adebde25ca0b3db842e44cbb1aaeb7cfecfbb7215cd452596ba1f4c2"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f1e7684f8281bd255ddef97105c7055c2ebae06964c8745716b83e174debe83"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 raises a \u0022not implemented\u0022 error: A shipped binding\u0027s whole body still raises a \u0022not implemented\u0022 error \u2014 generated scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections/Collections.fs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c621d8ccb2b364d9d72d02211fd092bc28150f6c165fa9b424c7372f1d7878e"}},{"ruleId":"M1","level":"note","message":{"text":"Thin README: The root README is 105 words, against a bar of 120. Of the three newcomer-critical sections this check looks for by heading, in the README and in the repository documents it links, it found no a testing section, no an architecture or project-map section. Sections are matched on HEADING text only, so material written under a heading this check does not recognise \u2014 or with no heading at all \u2014 is not seen and this row may understate what the document covers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88b11295dc6ac6146c259ace6043143959f96dc98628f8c8578b6c5f95b8149"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page \u2014 but when a run fails on a user\u0027s machine, neither they nor you have anything to read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add \u0060semgrep --config=auto\u0060 plus gitleaks for committed secrets (F# is not a CodeQL language and has no language-specific SAST engine) as a CI step. What was searched, so you can tell an absence from a miss: the 2 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/dotnet.yml"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060docs/csharp/csharp.csproj\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/csharp/csharp.csproj"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"be32178b1f502ee3a4b797135d98eca1b717d422ce3653e5ad9f8987a7570f7d"}},{"ruleId":"SC1","level":"warning","message":{"text":"NuGet dependencies are not locked: No packages.lock.json and no central package management \u2014 restores aren\u0027t reproducible or pinned (SSDF PW.4.4). Enable \u003CRestorePackagesWithLockFile\u003Etrue\u003C/RestorePackagesWithLockFile\u003E (commit the lockfile) or adopt Directory.Packages.props. Advisory \u2014 never scored."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0a97b4f69ccac509400ece7eedefb06d3ede0522cd4d8bcb5c068bea719545a6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(abs(a - c) \u003C= abs(xs.frontLength - d)) \u0026\u0026 (abs(a - c) \u003C= abs(a - ys.rBackLength))\u0060 appears character-identically in 2 files \u2014 src/FSharpx.Collections.Experimental/BankersDeque.fs, src/FSharpx.Collections.Experimental/RealTimeDeque.fs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fed82bab370206f5173997fbb4eefc0e2086e0bbc470b3a1f798ce37c18ee39"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(abs(xs.frontLength - d) \u003C= abs(a - c)) \u0026\u0026 (abs(xs.frontLength - d) \u003C= abs(a - ys.rBackLength) \u0026\u0026 (xs.frontLength \u003E 0))\u0060 appears character-identically in 2 files \u2014 src/FSharpx.Collections.Experimental/BankersDeque.fs, src/FSharpx.Collections.Experimental/RealTimeDeque.fs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Collections.Experimental/BankersDeque.fs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8731b6deca16bd16d9196a78e3eb717b2d6048f5f9a3449001f02932d1f8b6a"}},{"ruleId":"X5","level":"note","message":{"text":"Nullable reference types not enabled everywhere: 0/1 NRT-eligible project(s) enable \u003CNullable\u003Eenable\u003C/Nullable\u003E (projects targeting a pre-C#-8 framework are excluded \u2014 NRTs aren\u0027t available there). NRTs catch a whole class of null-deref bugs at compile time."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"80b24de9378624a0ce4846d60457395befcaec8e109ea81d289a370c9f7bfd5d"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-250","guid":"52ee12e8-390a-7351-b1e6-388afa694e54","name":"CWE-250","shortDescription":{"text":"CWE-250"},"helpUri":"https://cwe.mitre.org/data/definitions/250.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":15,"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."]}]}