{"$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":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"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":"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":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"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":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"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":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"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":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"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":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"SymbolicConverter.OfSymbolInternal (cyclomatic 160): SymbolicConverter.OfSymbolInternal has cyclomatic complexity 160 (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":"Prime/Prime/SymbolicConverter.fs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebeb6c4292f489560ed72d674917240a4f32b1268c3d73d3a3ed73b0b4d61c43"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprConverter.ConvertFrom (cyclomatic 106): ExprConverter.ConvertFrom has cyclomatic complexity 106 (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":"Prime/Prime.Scripting/Scripting.fs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"4568821eb1f4f97477d77742850cbbd4b4530062b43c1bf4df949741250c0bb1"}},{"ruleId":"D1","level":"warning","message":{"text":"Subquery.eval (cyclomatic 89): Subquery.eval has cyclomatic complexity 89 (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":"Prime/Prime.Ecs/EcsPrelude.fs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"68dcc5e04f98058745c4ca9fb35a121ac5d913feac1aaa947cc003bfbcdbfb33"}},{"ruleId":"D1","level":"warning","message":{"text":"SymbolicConverter.ToSymbolInternal (cyclomatic 60): SymbolicConverter.ToSymbolInternal has cyclomatic complexity 60 (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":"Prime/Prime/SymbolicConverter.fs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"69dd286f24fb5787881be223cbebbb2525c9087d1e97b6c432e57d5e20e72729"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprConverter.ConvertTo (cyclomatic 53): ExprConverter.ConvertTo has cyclomatic complexity 53 (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":"Prime/Prime.Scripting/Scripting.fs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb738b69262402d0c3e6f329223dbcdfac174b45a46d5b6ce1e70c5b1635d777"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr.toFSharpTypeOpt (cyclomatic 52): Expr.toFSharpTypeOpt has cyclomatic complexity 52 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/Scripting.fs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5a8d878d72248d78c8697775115c1aca892893edbb35245972623ebab3dd4f"}},{"ruleId":"D1","level":"warning","message":{"text":"Subquery.unquote (cyclomatic 39): Subquery.unquote has cyclomatic complexity 39 (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":"Prime/Prime.Ecs/EcsPrelude.fs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"80add113e819ce1f8e754bbd8b8713a25764a9d5d3eb70e7713934be79e09b45"}},{"ruleId":"D1","level":"warning","message":{"text":"ScriptingPrimitives.evalScanWhile (cyclomatic 36): ScriptingPrimitives.evalScanWhile has cyclomatic complexity 36 (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":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"242525cac98795fcc911faa3cea1a5e82b497072bdb20d639ac7defcc0c773d2"}},{"ruleId":"D1","level":"warning","message":{"text":"ScriptingPrimitives.evalIndexIntInner (cyclomatic 23): ScriptingPrimitives.evalIndexIntInner has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"212ccad7de9e4663a306a245f429fe9d554aa311095e203481ebc3fc87a1f111"}},{"ruleId":"D1","level":"warning","message":{"text":"ScriptingPrimitives.evalTryUnconsInner (cyclomatic 23): ScriptingPrimitives.evalTryUnconsInner has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"59901fe7e54d445c9578b262fddff49c070d279d0f6c9a8088285f1759b7945d"}},{"ruleId":"D1","level":"warning","message":{"text":"ScriptingPrimitives.evalCons (cyclomatic 23): ScriptingPrimitives.evalCons has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f461c018d9731a5f7fbfdeb91f5b384050508efd46ddc966b763e160af576d5"}},{"ruleId":"D1","level":"warning","message":{"text":"ScriptingMarshalling.tryExport (cyclomatic 23): ScriptingMarshalling.tryExport has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/ScriptingMarshalling.fs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fe29ed65f2875f85ffe6f4b79c29264930fbe07d9ce2322b17e500c96336bf"}},{"ruleId":"D1","level":"warning","message":{"text":"Subquery.eq (cyclomatic 22): Subquery.eq has cyclomatic complexity 22 (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":"Prime/Prime.Ecs/EcsPrelude.fs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7476075bd4ade55f9d301e80cd5c62ae9b22bd5a272789b16618b1d05c6947"}},{"ruleId":"D1","level":"warning","message":{"text":"FSetTreeModule.compareStacks (cyclomatic 22): FSetTreeModule.compareStacks has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/FSet.fs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"49469d19bbf9b0a74c13a5c1111df1624acd6b1c10104a3c50be7f1cfd4a83a6"}},{"ruleId":"D1","level":"warning","message":{"text":"ScriptingPrimitives.evalFoldWhile (cyclomatic 22): ScriptingPrimitives.evalFoldWhile has cyclomatic complexity 22 (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":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8219701c8acf5f57702996f037f6a756083086e4f9909647b3355925f5a047"}},{"ruleId":"D1","level":"warning","message":{"text":"FMapTreeModule.change (cyclomatic 19): FMapTreeModule.change has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/FMap.fs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"827b5ed6c7235245214cfdba426808697b5c53a2e0e2c550e8f4dfffc196e0b6"}},{"ruleId":"D1","level":"warning","message":{"text":"ScriptingPrimitives.evalMapi (cyclomatic 19): ScriptingPrimitives.evalMapi has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This shape REPEATS in the file: one other method here (ScriptingPrimitives.evalMap) 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 is NOT this file\u0027s highest cyclomatic complexity: ScriptingPrimitives.evalGetTypeName (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b9280bcec40ff70bbe6aabdf42218b7ee07cf5b8bafbf49782564de9a42388"}},{"ruleId":"D1","level":"warning","message":{"text":"ScriptingPrimitives.evalMap (cyclomatic 19): ScriptingPrimitives.evalMap has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This shape REPEATS in the file: one other method here (ScriptingPrimitives.evalMapi) 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 is NOT this file\u0027s highest cyclomatic complexity: ScriptingPrimitives.evalGetTypeName (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2614b8bddc6d0dadc9d51e91d510bcb581045c623c6fb93ecdbe45ed32bb06f"}},{"ruleId":"D1","level":"warning","message":{"text":"ScriptingPrimitives.evalApplyScript (cyclomatic 18): ScriptingPrimitives.evalApplyScript has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: ScriptingPrimitives.evalGetTypeName (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c756d619a2666a1b50b509518e18b1303069a615c6e1f6b7fbf2c11a51288f7"}},{"ruleId":"D1","level":"warning","message":{"text":"ScriptingMarshalling.tryImport (cyclomatic 18): ScriptingMarshalling.tryImport has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/ScriptingMarshalling.fs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e54ffbf2712438e48f6f95ae088d366e6fbf2b253e1afcd54a8f12bbdcc5c2"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeExtensions.Type.TryGetDefaultValue (cyclomatic 17): TypeExtensions.Type.TryGetDefaultValue has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/Reflection.fs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c98120652243700830f95e17251786391acfe398478402c4222b58d67186a4b"}},{"ruleId":"D1","level":"warning","message":{"text":"ScriptingSystem.evalAlterIntInner (cyclomatic 17): ScriptingSystem.evalAlterIntInner has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: ScriptingSystem.eval (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/ScriptingSystem.fs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58026ecbc952b55c29495f7f83d89f526ed6c647dbc0acc1dbe40a31d004956"}},{"ruleId":"D1","level":"warning","message":{"text":"ScriptingPrimitives.evalScanWhileCodata (cyclomatic 17): ScriptingPrimitives.evalScanWhileCodata has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: ScriptingPrimitives.evalGetTypeName (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"86493b3929324cdbf694f34b09923aef1c3caa133da5a5e038de521fd4aa2168"}},{"ruleId":"D1","level":"warning","message":{"text":"ScriptingPrimitives.evalContains (cyclomatic 17): ScriptingPrimitives.evalContains has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: ScriptingPrimitives.evalGetTypeName (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d3cab5c3718312ab8eddcc9ff285b176fe646249ae12cdd9f78ae75dc5f52b"}},{"ruleId":"D1","level":"warning","message":{"text":"PrettyPrinterModule.symbolToPrettySymbol (cyclomatic 16): PrettyPrinterModule.symbolToPrettySymbol has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/PrettyPrinter.fs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ce2a9c31646f696b2bbeb6b38abf85ed9a330f31b4d732743b2df3d67272a7"}},{"ruleId":"D1","level":"warning","message":{"text":"FMapTreeNodeModule.equals (cyclomatic 16): FMapTreeNodeModule.equals has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/FMap.fs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"934ee20216a4a23a4bc62cfe9ecbc9ceca4faf494bfe1615616671bfd432f362"}},{"ruleId":"D1","level":"warning","message":{"text":"ScriptingPrimitives.evalScani (cyclomatic 16): ScriptingPrimitives.evalScani has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This shape REPEATS in the file: one other method here (ScriptingPrimitives.evalScan) 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 is NOT this file\u0027s highest cyclomatic complexity: ScriptingPrimitives.evalGetTypeName (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37c1124d87266b444c9e6c223ab4c66ff36e74af5ad522ede596cabe9e00d27"}},{"ruleId":"D1","level":"warning","message":{"text":"ScriptingPrimitives.evalScan (cyclomatic 16): ScriptingPrimitives.evalScan has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This shape REPEATS in the file: one other method here (ScriptingPrimitives.evalScani) 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 is NOT this file\u0027s highest cyclomatic complexity: ScriptingPrimitives.evalGetTypeName (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66e501302bb2349fbdfd110bed71a3aa0d4959a2f1143a4d7db3202a343dcca"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolicConverter.OfSymbolInternal (cognitive 368): SymbolicConverter.OfSymbolInternal has cognitive complexity 368 (threshold 15). Drivers by points: match/switch 60 (274 pts), if/else 53 (79 pts), error handling 3 (12 pts), boolean chains 3 (nesting depth added 249). 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":"Prime/Prime/SymbolicConverter.fs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee4f1d8beaf2a6bd0f02af559ad24e479c3c1ad2187ee9274761957d0666e37"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprConverter.ConvertFrom (cognitive 346): ExprConverter.ConvertFrom has cognitive complexity 346 (threshold 15). Drivers by points: match/switch 45 (250 pts), if/else 24 (81 pts), error handling 2 (12 pts), boolean chains 3 (nesting depth added 272). 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":"Prime/Prime.Scripting/Scripting.fs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"8138ec3d71db20145b30997394c5e94b33ef4ab6a33cf3c67649b5e47b555bf2"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolicConverter.ToSymbolInternal (cognitive 97): SymbolicConverter.ToSymbolInternal has cognitive complexity 97 (threshold 15). Drivers by points: if/else 63 (89 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 28). 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":"Prime/Prime/SymbolicConverter.fs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7f01d1754d974c6ee5636665b2aceaa258824e689bc2c6905fb58dbb5d8a72"}},{"ruleId":"D2","level":"warning","message":{"text":"FSetTreeModule.compareStacks (cognitive 77): FSetTreeModule.compareStacks has cognitive complexity 77 (threshold 15). Drivers by points: if/else 29 (75 pts), match/switch 2 (nesting depth added 46). 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":"Prime/Prime/FSet.fs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"158e83d7c11c9bf81dbe59f3098bdd67c88f34b0e5d2c5f09508fc2b33f1a3a4"}},{"ruleId":"D2","level":"warning","message":{"text":"Expr.toFSharpTypeOpt (cognitive 71): Expr.toFSharpTypeOpt has cognitive complexity 71 (threshold 15). Drivers by points: match/switch 15 (42 pts), if/else 12 (29 pts) (nesting depth added 44). 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":"Prime/Prime.Scripting/Scripting.fs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"318ffd023be8232f2e0d416ca2da347ba48c89a33927ca93032c5b0dc326cb8e"}},{"ruleId":"D2","level":"warning","message":{"text":"Subquery.eval (cognitive 63): Subquery.eval has cognitive complexity 63 (threshold 15). Drivers by points: match/switch 26 (57 pts), if/else 2 (4 pts), boolean chains 2 (nesting depth added 33). 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":"Prime/Prime.Ecs/EcsPrelude.fs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a08d4e454853494d3764aecc27824039b5289f2955f7f1b571858b9b9768752"}},{"ruleId":"D2","level":"warning","message":{"text":"ScriptingMarshalling.tryExport (cognitive 48): ScriptingMarshalling.tryExport has cognitive complexity 48 (threshold 15). Drivers by points: match/switch 10 (41 pts), if/else 4 (6 pts), boolean chains 1 (nesting depth added 33). 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":"Prime/Prime.Scripting/ScriptingMarshalling.fs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e18283b6116bc1155a43925e22d26f80954c2a1160bb50cf4fa013f866cf4c9"}},{"ruleId":"D2","level":"warning","message":{"text":"FMapTreeModule.change (cognitive 40): FMapTreeModule.change has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (22 pts), match/switch 5 (18 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/FMap.fs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc570dbb41c2994961ee54b3e4d76306f30f6dd0a09cbfd0b1b50af52d6a59d3"}},{"ruleId":"D2","level":"warning","message":{"text":"ScriptingMarshalling.tryImport (cognitive 40): ScriptingMarshalling.tryImport has cognitive complexity 40 (threshold 15). Drivers by points: match/switch 7 (27 pts), if/else 8 (13 pts) (nesting depth added 25). 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":"Prime/Prime.Scripting/ScriptingMarshalling.fs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"170d015d120bb2fc6cc44165cf90689a170b2567bbd8ef7f4e0a58f40464003f"}},{"ruleId":"D2","level":"warning","message":{"text":"FMapTreeNodeModule.equals (cognitive 33): FMapTreeNodeModule.equals has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 4 (16 pts), if/else 10 (13 pts), boolean chains 4 (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/FMap.fs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95ee73a229b629b2ee6cbaf0157d7e119cb44f7338b6d1aaad73c7a79e67f38"}},{"ruleId":"D2","level":"warning","message":{"text":"Ecs.Notify (cognitive 32): Ecs.Notify has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 6 (18 pts), loops 5 (14 pts) (nesting depth added 21). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Ecs/Ecs.fs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"b376804b7cdf25c20a272ae0da6ae71012d0382c6903308d528ac1788bf39ee9"}},{"ruleId":"D2","level":"warning","message":{"text":"FSetTreeNodeModule.equals (cognitive 32): FSetTreeNodeModule.equals has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 4 (16 pts), if/else 9 (12 pts), boolean chains 4 (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/FSet.fs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"e074418ab2cfdee9715b240302bc714645ffcfb5a52e6ac905143d1fd8c5dca5"}},{"ruleId":"D2","level":"warning","message":{"text":"Subquery.unquote (cognitive 31): Subquery.unquote has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 9 (22 pts), if/else 5 (6 pts), loops 1 (3 pts) (nesting depth added 16). 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":"Prime/Prime.Ecs/EcsPrelude.fs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cec0602de86a3862a38f0125e31ae2384fbda878e78c60b45e17866d6cea421"}},{"ruleId":"D2","level":"warning","message":{"text":"ScriptingPrimitives.evalScanWhile (cognitive 31): ScriptingPrimitives.evalScanWhile has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 14 (31 pts) (nesting depth added 17). 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":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2b34663c0017967738761f9e86437e543b87596cd02ec21f366a2d785585be"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprConverter.ConvertTo (cognitive 29): ExprConverter.ConvertTo has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 5 (14 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/Scripting.fs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c5d9f60dab1372be5c455ac8948ab86649dc6ad89f75846b9cc6ab6617e142"}},{"ruleId":"D2","level":"warning","message":{"text":"FMapTreeModule.foldSectionOpt (cognitive 25): FMapTreeModule.foldSectionOpt has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/FMap.fs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ee900b955bb62d456e5a5314a7b9c65f44ef2de71bf32f684b72f4d0622d17"}},{"ruleId":"D2","level":"warning","message":{"text":"PrettyPrinterModule.prettySymbolsToPrettyStr (cognitive 22): PrettyPrinterModule.prettySymbolsToPrettyStr has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (22 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/PrettyPrinter.fs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9775e878f62d034b4ff5073414be476102449cb0a55c8ee7ab1270970a1649"}},{"ruleId":"D2","level":"warning","message":{"text":"Subquery.eq (cognitive 20): Subquery.eq has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (13 pts), if/else 4 (7 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Ecs/EcsPrelude.fs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd388fc5f0b9ea21fbe90c40669540d8ffba775b702855fcea7c21f468f98420"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeExtensions.Type.TryGetDefaultValue (cognitive 20): TypeExtensions.Type.TryGetDefaultValue has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 1, match/switch 1 (nesting depth added 3). 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":"Prime/Prime/Reflection.fs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"22671eeddf7a7e58eec2c457512e756028427d93efbaeafdf291613f5bafd657"}},{"ruleId":"D2","level":"warning","message":{"text":"FMapTreeModule.remove (cognitive 20): FMapTreeModule.remove has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (20 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/FMap.fs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c999c76ef2e039700899fe7eee661a98ec8d73936f9929c83854129cc66a031"}},{"ruleId":"D2","level":"warning","message":{"text":"FSetTreeModule.remove (cognitive 20): FSetTreeModule.remove has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (20 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/FSet.fs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"581698cd062d9246517a56ce9d205042aef78b842b811b0dab331a6f3a9da343"}},{"ruleId":"D2","level":"warning","message":{"text":"ScriptingSystem.evalAlterIntInner (cognitive 18): ScriptingSystem.evalAlterIntInner has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 4 (6 pts), boolean chains 1 (nesting depth added 8). 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":"Prime/Prime.Scripting/ScriptingSystem.fs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"721549bfe9abc0fd8d504d1e38c82260fa4605e4bedc4c692de7214f5a82de56"}},{"ruleId":"D2","level":"warning","message":{"text":"PrettyPrinterModule.symbolToPrettySymbol (cognitive 17): PrettyPrinterModule.symbolToPrettySymbol has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/PrettyPrinter.fs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d726eaee560cd2da98fe623020f5f3f2834caa484b7b119dfe6069a4fdd7c03c"}},{"ruleId":"D2","level":"warning","message":{"text":"ScriptingPrimitives.evalIndexIntInner (cognitive 17): ScriptingPrimitives.evalIndexIntInner has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 4 (6 pts), boolean chains 2 (nesting depth added 6). 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":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"efaf2abbf029b344f84538afc3999f7a2c6be7b6a774daa919fb0ad530bb573e"}},{"ruleId":"D2","level":"warning","message":{"text":"ScriptingPrimitives.evalToString (cognitive 17): ScriptingPrimitives.evalToString has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 4 (6 pts) (nesting depth added 8). 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":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45c314b6679d7bb75fcacd858af674fc00f96ef2c6ea5f1311b89f36121d175"}},{"ruleId":"D2","level":"warning","message":{"text":"ScriptingPrimitives.evalToTable (cognitive 17): ScriptingPrimitives.evalToTable has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 4 (6 pts) (nesting depth added 8). 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":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62f2615d2deefec0a53e0739035273b160b764ed30e8fe6ae97ac9718c0551b"}},{"ruleId":"D2","level":"warning","message":{"text":"FMapTreeModule.equals (cognitive 16): FMapTreeModule.equals has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/FMap.fs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"709a7dc64435c4da36f33a5b74bb236bc397f433a1e44813cdd564bf277352ef"}},{"ruleId":"D2","level":"warning","message":{"text":"FSetTreeModule.balance (cognitive 16): FSetTreeModule.balance has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (16 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/FSet.fs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d364524e8b150d0d135a73a11eacc36e3bd4b2bf3513e81f6c22b1e30064973"}},{"ruleId":"D2","level":"warning","message":{"text":"ScriptingPrimitives.evalTryUnconsInner (cognitive 16): ScriptingPrimitives.evalTryUnconsInner has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 7 (13 pts), if/else 2 (3 pts) (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ceb24de2f6c8594ffad57c12a20eaf84f70a8b30366985e77fe9c44942b89d"}},{"ruleId":"D2","level":"warning","message":{"text":"ScriptingPrimitives.evalScanWhileCodata (cognitive 16): ScriptingPrimitives.evalScanWhileCodata has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 7 (16 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d74ff213cbe28d06f39aba14f00ced14bed8bec7808f58dd8d93c84eaaee00"}},{"ruleId":"D2","level":"warning","message":{"text":"ScriptingPrimitives.evalScaniCodata (cognitive 16): ScriptingPrimitives.evalScaniCodata has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 7 (16 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: 2 other methods here (ScriptingPrimitives.evalScanCodata, ScriptingPrimitives.evalFoldiCodata) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"875f4b318bf6afdb67e6fd6645ad64ef2ac77a8a177267dabd50f4cdc6995c2e"}},{"ruleId":"D2","level":"warning","message":{"text":"ScriptingPrimitives.evalScanCodata (cognitive 16): ScriptingPrimitives.evalScanCodata has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 7 (16 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: 2 other methods here (ScriptingPrimitives.evalScaniCodata, ScriptingPrimitives.evalFoldiCodata) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"d182a134aaf9f3f9486a0877c029c8eff2ec2378a9298d1b11a54d604490949f"}},{"ruleId":"D2","level":"warning","message":{"text":"ScriptingPrimitives.evalFoldiCodata (cognitive 16): ScriptingPrimitives.evalFoldiCodata has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 7 (16 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: 2 other methods here (ScriptingPrimitives.evalScaniCodata, ScriptingPrimitives.evalScanCodata) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f49197a06ea8396e37f5d38b436a5c853f9b5646359206ad7e3724aa3d1dcae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Prime.Ecs/Ecs.fs: FileTooLong \u2014 1753 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1253 over it, 3.51\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":"Prime/Prime.Ecs/Ecs.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"462a5687466d565c0c7c256906bfe48c2ec0f3afe89af7dc199b75cd5244379c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Prime.Scripting/ScriptingPrimitives.fs: FileTooLong \u2014 1165 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 72 functions. The bar is 500 significant lines; this is 665 over it, 2.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":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b296a20002902f5602c39a46ced5a595c9c255f23b8d314938468990aff2b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Prime/FMap.fs: FileTooLong \u2014 1035 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 58 functions. The bar is 500 significant lines; this is 535 over it, 2.07\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":"Prime/Prime/FMap.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78661787406975ef013458cf316d3a27195f8e65360a5c684d68cc29f0fc0d4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: List: TooManyFunctions \u2014 60 functions. The bar is 30 functions; this is 30 over it, 2.00\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":"Prime/Prime/List.fs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ffc3861ad717032f05248f21e19bab53c1d462fff97116f00610f51b459e5d7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: FSetTreeModule: TooManyFunctions \u2014 58 functions. The bar is 30 functions; this is 28 over it, 1.93\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":"Prime/Prime/FSet.fs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f5830b9cb96fa15348064226f465f3b3a0b2555bb6fd30208c600daddb9da5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Prime/FSet.fs: FileTooLong \u2014 947 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 447 over it, 1.89\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":"Prime/Prime/FSet.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"203fa0d4a9d2d90cfd37cc8c395f07cd52a24097f36291e0c195af77c534633a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Prime.Scripting/Scripting.fs: FileTooLong \u2014 938 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 438 over it, 1.88\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":"Prime/Prime.Scripting/Scripting.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"740e6a07d319f2d9eb7e6a0a74d02b8a30ebd45ffb06439eb0b6dbababec4955"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Query: TooManyMethods \u2014 52 methods. The bar is 30 methods; this is 22 over it, 1.73\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":"Prime/Prime.Ecs/Ecs.fs"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bbfb302f4f636571b71d07757ecef5e9ecf557a1ea2cd613b8607fdb681475b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Prime/SymbolicConverter.fs: FileTooLong \u2014 847 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 347 over it, 1.69\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":"Prime/Prime/SymbolicConverter.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ec71e99df6963d49449e675fb3747776af43e627e1d5690c7170c39b78506b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: Operators: TooManyFunctions \u2014 50 functions. The bar is 30 functions; this is 20 over it, 1.67\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":"Prime/Prime/Operators.fs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"67874f84bd49802c58e14440f5a41df074b6ab4776bdf66d8908e74010514a74"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FSharpFMap\u00602: 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":"Prime/Prime/FMap.fs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe295297a30fa5908ab9e77f5c62e98b4d6f42ab143fff2fd4a3f999d836d37"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FSharpFSet\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":"Prime/Prime/FSet.fs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b632ade5e3640f376d4db9e7cabf68d2dde894eda3c4317a03d3b9834c63c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Prime.Scripting/ScriptingSystem.fs: FileTooLong \u2014 623 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 51 functions. The bar is 500 significant lines; this is 123 over it, 1.25\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":"Prime/Prime.Scripting/ScriptingSystem.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b6d0acfd9c3352e7fb81b27b244f6e0b0ac60a741f9b1a83add6fc3efd8a3b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: STSet: TooManyFunctions \u2014 37 functions. The bar is 30 functions; this is 7 over it, 1.23\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/STSet.fs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c29c80666d66fe2c771954bd6a4e2a2a3e3bfeefc8e3d0cf6c2d72d0400f90"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: TSet: TooManyFunctions \u2014 37 functions. The bar is 30 functions; this is 7 over it, 1.23\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/TSet.fs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"66dfad838df2878eba1bb48e46b5dbc7378a5daa2fe6e4fabfe0aa6d065e9226"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: STList: 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":"Prime/Prime/STList.fs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebcd4435db71305f3760af27381d45d890849318a2734e3a794558564ee1f52f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: TList: 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":"Prime/Prime/TList.fs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c03effff9512cceaad21d75283393adf920b9acbdd596c002230b3c93c75801"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: USet: TooManyFunctions \u2014 32 functions. The bar is 30 functions; this is 2 over it, 1.07\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":"Prime/Prime/USet.fs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3506af890fdf65e11921f63d79561eb25d6b35fffba6d88602cbcac540185a9f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Prime.Scripting/ScriptingUnary.fs: FileTooLong \u2014 531 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 31 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/ScriptingUnary.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d086fb471540d868108480e53486ffe3b206082c9a6788f0ed8e69a636b7105"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: FSetModule: 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":"Prime/Prime/FSet.fs"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80c86bc4454f270c69441b6a60d91d8b20bacfbece8ac844703cd5c0dd9a836"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: SUList: 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":"Prime/Prime/SUList.fs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"7680da8e967700aebfee6a98b28510e8279fb4ffc9518cd1a437aec607974121"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: SUSet: 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":"Prime/Prime/SUSet.fs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef42fa3593dc2ba25fc838816b0bdaac49ff34fb6d1023f0f80f1a911dd184e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: UList: 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":"Prime/Prime/UList.fs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb15e03483e7f2672dd0cd04da3ee9d21db27247408a610d50b8cbcf66b4c53"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (75 shared lines): Prime/Prime/STMap.fs:4-252 | Prime/Prime/TMap.fs:4-253 \u2014 These two members are variants of one another: 75 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/STMap.fs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"2776223d72ecbce7b621a54ecddafc6ccecaa60b33de339fa960c5b70a9af9c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (68 shared lines): Prime/Prime/STList.fs:4-302 | Prime/Prime/TList.fs:4-302 \u2014 These two members are variants of one another: 68 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/STList.fs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c6cd4251fddb3216c59e4afe9bb64fddbd43d5be7277a041d8b145b0dcee88"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (51 shared lines): Prime/Prime/OMap.fs:4-252 | Prime/Prime/SOMap.fs:4-237 \u2014 These two members are variants of one another: 51 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/OMap.fs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9b47c17889391b4f97e8f12125439a79927afba52db5c34fb9c0794c8eee19"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (43 shared lines): Prime/Prime/OSet.fs:4-201 | Prime/Prime/SOSet.fs:4-199 \u2014 These two members are variants of one another: 43 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/OSet.fs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"7367a28df39ad1a5d5eeab4ed24c3b5d03327c15384b30e18ec08281b62e3599"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (288 corresponding lines): Prime/Prime/STSet.fs:4-291 | Prime/Prime/TSet.fs:4-291 \u2014 These two members are one piece of code written twice and then edited apart: 288 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/STSet.fs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b797da5d72e320c9ac8e555ae43aa05810ea05244988afe1886b6ad7cf4f7a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (239 corresponding lines): Prime/Prime/SUSet.fs:4-242 | Prime/Prime/USet.fs:4-244 \u2014 These two members are one piece of code written twice and then edited apart: 239 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/SUSet.fs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f9ccb4a77ad71fc0e36d7e51da8fe2972f50d9d07b6ab9cf77ebbc9cddd401"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (204 corresponding lines): Prime/Prime/SUList.fs:4-207 | Prime/Prime/UList.fs:4-207 \u2014 These two members are one piece of code written twice and then edited apart: 204 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/SUList.fs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc30883e5b996e9d1b0fe205f733024aedba98824ae97601c973ea968b3b2aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (173 corresponding lines): Prime/Prime/SUMap.fs:4-176 | Prime/Prime/UMap.fs:4-192 \u2014 These two members are one piece of code written twice and then edited apart: 173 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/SUMap.fs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"0503f709d9dac05f2839462ce2090f0471a5c0ced62b0dcdc525cc1acbe2952c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (132 corresponding lines): Prime/Prime/Either.fs:4-135 | Prime/Prime/ValueEither.fs:4-137 \u2014 These two members are one piece of code written twice and then edited apart: 132 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/Either.fs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"7feeb7424b84564b8fa150e1f27f3f5704013e3ae045038d86cb203aad9e68b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): Prime/Prime/GenericList.fs:4-66 | Prime/Prime/HashSet.fs:4-78 \u2014 These two members are one piece of code written twice and then edited apart: 63 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/GenericList.fs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f9770da68edaf7a1013b34dab04aefd071100ac79a18b8084a601ae45c82b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 26\u002B corresponding lines): Prime/Prime.Ecs/AssemblyInfo.fs:4-29 | Prime/Prime.Scripting/AssemblyInfo.fs:4-29 | Prime/Prime/AssemblyInfo.fs:4-29 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 26 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":"Prime/Prime.Ecs/AssemblyInfo.fs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30c94accb2e61aab12cb962b5bf89a3bdca54c66309f783ab9af153053ab25a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): Prime/Prime/HMap.fs:98-131 | Prime/Prime/HSet.fs:94-127 \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":"Prime/Prime/HMap.fs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca8676971ff2f23dfaa96fbc9bdd2d0c9600623020eca0f6acfbd9904b91138"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): Prime/Prime/STMap.fs:155-177 | Prime/Prime/TMap.fs:155-177 \u2014 before extracting anything, compare \u0060Prime/Prime/STMap.fs\u0060 and \u0060Prime/Prime/TMap.fs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 75 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":"Prime/Prime/STMap.fs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee286a00effb14cae536b25e1f27d1ac16b542816b468087b1b40372aecad25d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): Prime/Prime/Array.fs:52-72 | Prime/Prime/List.fs:271-291 \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":"Prime/Prime/Array.fs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82f54fe4b580832125ea257fa1c9629d332ba3a4fc7018bc769961bf639cf62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): Prime/Prime/HMap.fs:76-94 | Prime/Prime/HSet.fs:72-90 \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":"Prime/Prime/HMap.fs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"9768d2a89489df4ec2f07aeda06abbfd37953fa225b067c9274d11e9f4ce5c33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (49 lines \u00D7 2): Prime/Prime/STList.fs:117-165 | Prime/Prime/TList.fs:117-165 \u2014 before extracting anything, compare \u0060Prime/Prime/STList.fs\u0060 and \u0060Prime/Prime/TList.fs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 68 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":"Prime/Prime/STList.fs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"d757b426faee8d7fe78faaea3421a980b59a0477ee04cbc0cc4f1c6c2049b53a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): Prime/Prime.Scripting/ScriptingPrimitives.fs:400-414 | Prime/Prime.Scripting/ScriptingPrimitives.fs:460-476 \u2014 both copies are in the same file, so extract the block 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":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"8728079117aa879898bcf3ed3f43880fa163a61a3341dc545fe24347ee27ecb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): Prime/Prime/OMap.fs:60-75 | Prime/Prime/SOMap.fs:61-76 \u2014 before extracting anything, compare \u0060Prime/Prime/OMap.fs\u0060 and \u0060Prime/Prime/SOMap.fs\u0060 as WHOLE FILES: this scan already matched 4 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":"Prime/Prime/OMap.fs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f47dbe17c104b509ff418aa6a3adff221a06c0e8aa65b51143df62b8ffe2ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): Prime/Prime/STSet.fs:119-154 | Prime/Prime/TSet.fs:119-154 \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":"Prime/Prime/STSet.fs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c75331fc6e1a90b5f94cfd539f54d2c33d96c455af6977f2dea471282616aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): Prime/Prime/OSet.fs:49-62 | Prime/Prime/SOSet.fs:50-63 \u2014 before extracting anything, compare \u0060Prime/Prime/OSet.fs\u0060 and \u0060Prime/Prime/SOSet.fs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 43 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":"Prime/Prime/OSet.fs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"9633c221eb5c12d78f8fed7d90af47b0e9baba7fb340e262b55d3c4f2bc8dc1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): Prime/Prime/FMap.fs:1080-1092 | Prime/Prime/FMap.fs:1131-1143 \u2014 both copies are in the same file, so extract the block 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":"Prime/Prime/FMap.fs"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9d963040107e26151726496a8985623044d180134417bafb8ac369b1f9697e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): Prime/Prime/SUSet.fs:32-44 | Prime/Prime/USet.fs:32-44 \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":"Prime/Prime/SUSet.fs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"280d844cc90feed3136b6e812a38c73044d11a45088067c001b64b83962b447b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): Prime/Prime.Ecs/Ecs.fs:1048-1059 | Prime/Prime.Ecs/Ecs.fs:1064-1073 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Prime/Prime.Ecs/Ecs.fs:1048\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Ecs/Ecs.fs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddecf28064b3fd763c42257672489daaa50553f85403e77e7cf920de7e58644c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): Prime/Prime/STList.fs:263-274 | Prime/Prime/TList.fs:263-274 \u2014 before extracting anything, compare \u0060Prime/Prime/STList.fs\u0060 and \u0060Prime/Prime/TList.fs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 68 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":"Prime/Prime/STList.fs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"53300a13e92a1ce14c6cf0b87398e19b7913588c8c9c55bf0a4ac375e91adff8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): Prime/Prime/STMap.fs:199-210 | Prime/Prime/TMap.fs:199-210 \u2014 before extracting anything, compare \u0060Prime/Prime/STMap.fs\u0060 and \u0060Prime/Prime/TMap.fs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 75 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":"Prime/Prime/STMap.fs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ab113554f41e1c442cbccbeb39cc7d3437ddfccfa89cba299a4bfffdfdf256"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 3): Prime/Prime.Ecs/Ecs.fs:1034-1044 | Prime/Prime.Ecs/Ecs.fs:1049-1057 | Prime/Prime.Ecs/Ecs.fs:1064-1072 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Prime/Prime.Ecs/Ecs.fs:1034\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Ecs/Ecs.fs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"e835b876ad04a8e1c1b1894f6d6d79aea790c8c361b60cbab8d7673470672c11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): Prime/Prime/FMap.fs:619-629 | Prime/Prime/FSet.fs:533-543 \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":"Prime/Prime/FMap.fs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"905e46efc9c0a62ed02a6442fe75d50dcd6ba4ea3f8082a81eaa1a4f0858f6de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): Prime/Prime/OMap.fs:170-180 | Prime/Prime/SOMap.fs:172-182 \u2014 before extracting anything, compare \u0060Prime/Prime/OMap.fs\u0060 and \u0060Prime/Prime/SOMap.fs\u0060 as WHOLE FILES: this scan already matched 4 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":"Prime/Prime/OMap.fs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"1777d2851d2a823a1cbd734fd29054c16d3ab4023182f8cf827be2acd536befe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 4): Prime/Prime.Ecs/Ecs.fs:1021-1030 | Prime/Prime.Ecs/Ecs.fs:1035-1042 | Prime/Prime.Ecs/Ecs.fs:1049-1056 | Prime/Prime.Ecs/Ecs.fs:1064-1071 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Prime/Prime.Ecs/Ecs.fs:1021\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Ecs/Ecs.fs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd74f00e42cbecf65199758c69fea4aba10745bcaf2e325c955ed9fcda23a73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): Prime/Prime/OMap.fs:11-25 | Prime/Prime/SOMap.fs:11-25 \u2014 before extracting anything, compare \u0060Prime/Prime/OMap.fs\u0060 and \u0060Prime/Prime/SOMap.fs\u0060 as WHOLE FILES: this scan already matched 4 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":"Prime/Prime/OMap.fs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"816dd6d293a3b8148aaa4a60132c81c56f66132e323f1737ef22d038894e587c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): Prime/Prime/OSet.fs:11-25 | Prime/Prime/SOSet.fs:11-25 \u2014 before extracting anything, compare \u0060Prime/Prime/OSet.fs\u0060 and \u0060Prime/Prime/SOSet.fs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 43 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":"Prime/Prime/OSet.fs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ceab68c973a399f87da1062576be914ac98d5f4c1e624749196ddc4089884c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Prime/Prime/STMap.fs:61-70 | Prime/Prime/TMap.fs:61-70 \u2014 before extracting anything, compare \u0060Prime/Prime/STMap.fs\u0060 and \u0060Prime/Prime/TMap.fs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 75 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 \u0060Prime/Prime/STMap.fs:61\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":"Prime/Prime/STMap.fs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"db945e64dbd405f5a771f8892bcc9feaa06e8e2b858e4dcb37f18b2849bae5a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): Prime/Prime/STMap.fs:116-145 | Prime/Prime/TMap.fs:116-145 \u2014 before extracting anything, compare \u0060Prime/Prime/STMap.fs\u0060 and \u0060Prime/Prime/TMap.fs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 75 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":"Prime/Prime/STMap.fs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf6cb0d206887ddb4eff01505c64aca85565e4ee07c0c88598f89d536924f1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Prime/Prime/STSet.fs:61-70 | Prime/Prime/TSet.fs:61-70 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Prime/Prime/STSet.fs:61\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":"Prime/Prime/STSet.fs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ea5f7dde0278199a98a8782c2e51381a5642461f2e8fdf00bcfd61096f06dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 6): Prime/Prime.Ecs/Ecs.fs:1563-1571 | Prime/Prime.Ecs/Ecs.fs:1578-1584 | Prime/Prime.Ecs/Ecs.fs:1593-1599 | Prime/Prime.Ecs/Ecs.fs:1609-1615 | Prime/Prime.Ecs/Ecs.fs:1626-1632 | Prime/Prime.Ecs/Ecs.fs:1644-1650 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Prime/Prime.Ecs/Ecs.fs:1563\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Ecs/Ecs.fs"},"region":{"startLine":1563}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b75b43532dcc519b9b47fae3c4165cfae3531613adb34de66438627b62ef40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 6): Prime/Prime.Ecs/Ecs.fs:1702-1710 | Prime/Prime.Ecs/Ecs.fs:1718-1724 | Prime/Prime.Ecs/Ecs.fs:1734-1740 | Prime/Prime.Ecs/Ecs.fs:1751-1757 | Prime/Prime.Ecs/Ecs.fs:1769-1775 | Prime/Prime.Ecs/Ecs.fs:1788-1794 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Prime/Prime.Ecs/Ecs.fs:1702\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Ecs/Ecs.fs"},"region":{"startLine":1702}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebcc600e51b82f9b6648a3a4c8d21455b67a248e0f6e6b0f323a59d1221c680"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 5): Prime/Prime.Ecs/Ecs.fs:1009-1017 | Prime/Prime.Ecs/Ecs.fs:1022-1028 | Prime/Prime.Ecs/Ecs.fs:1035-1041 | Prime/Prime.Ecs/Ecs.fs:1049-1055 | Prime/Prime.Ecs/Ecs.fs:1064-1070 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Prime/Prime.Ecs/Ecs.fs:1009\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Ecs/Ecs.fs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"775d694a36b3e36f0f309929975805780b412a6ce3ba996ac82cbcaf94eb558e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Prime/Prime.Ecs/Ecs.fs:462-470 | Prime/Prime.Ecs/Ecs.fs:541-549 \u2014 both copies are in the same file, so extract the block 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":"Prime/Prime.Ecs/Ecs.fs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8a675c553db859cbb3b7af9b02b04fb548015d7231132a67c1ab9091b39a08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Prime/Prime.Scripting/Scripting.fs:273-281 | Prime/Prime.Scripting/Scripting.fs:287-295 \u2014 both copies are in the same file, so extract the block 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":"Prime/Prime.Scripting/Scripting.fs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb60ff2ab74de490849ff5d42f21d28aa5e816e4a245b751b7da65b997708320"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Prime/Prime.Scripting/ScriptingPrimitives.fs:441-449 | Prime/Prime.Scripting/ScriptingPrimitives.fs:678-686 \u2014 both copies are in the same file, so extract the block 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":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"725cc159a71b1716a1dac0aa66b2a14d9ad965a477c4ff2a833ddeff17f90bcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Prime/Prime/HMap.fs:137-145 | Prime/Prime/HSet.fs:133-141 \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":"Prime/Prime/HMap.fs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b98019d8ae0fff6783f392deee73f2d66c4255ace8fb163604aef0c66f8463"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Prime/Prime/OMap.fs:131-139 | Prime/Prime/SOMap.fs:133-141 \u2014 before extracting anything, compare \u0060Prime/Prime/OMap.fs\u0060 and \u0060Prime/Prime/SOMap.fs\u0060 as WHOLE FILES: this scan already matched 4 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Prime/Prime/OMap.fs:131\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/OMap.fs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c7b6e3e892864bac7f0270b417724dff13c2266765ce9c4c74e8242900388c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Prime/Prime/OSet.fs:130-138 | Prime/Prime/SOSet.fs:132-140 \u2014 before extracting anything, compare \u0060Prime/Prime/OSet.fs\u0060 and \u0060Prime/Prime/SOSet.fs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 43 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 \u0060Prime/Prime/OSet.fs:130\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/OSet.fs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f057d26ae35cdaf118387d74e2a6cf5358e2ec0dc8a10427504932f77898ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 7): Prime/Prime.Ecs/Ecs.fs:1550-1557 | Prime/Prime.Ecs/Ecs.fs:1564-1569 | Prime/Prime.Ecs/Ecs.fs:1578-1583 | Prime/Prime.Ecs/Ecs.fs:1593-1598 | Prime/Prime.Ecs/Ecs.fs:1609-1614 | Prime/Prime.Ecs/Ecs.fs:1626-1631 | Prime/Prime.Ecs/Ecs.fs:1644-1649 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Prime/Prime.Ecs/Ecs.fs:1550\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Ecs/Ecs.fs"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2b10c2ae3697e43d8229dfde4fea4043b2a5c90ae7b64747d8e5b61ac69492"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 7): Prime/Prime.Ecs/Ecs.fs:1688-1695 | Prime/Prime.Ecs/Ecs.fs:1703-1708 | Prime/Prime.Ecs/Ecs.fs:1718-1723 | Prime/Prime.Ecs/Ecs.fs:1734-1739 | Prime/Prime.Ecs/Ecs.fs:1751-1756 | Prime/Prime.Ecs/Ecs.fs:1769-1774 | Prime/Prime.Ecs/Ecs.fs:1788-1793 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Prime/Prime.Ecs/Ecs.fs:1688\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Ecs/Ecs.fs"},"region":{"startLine":1688}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c94d3c8e5db876b64f94a21a6ac009482103a0584578b4069dbaa685e0dfc2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20138 lines \u00D7 3): Prime/Prime.Scripting/ScriptingPrimitives.fs:1097-1104 | Prime/Prime.Scripting/ScriptingPrimitives.fs:1118-1125 | Prime/Prime.Scripting/ScriptingPrimitives.fs:1140-1141 \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 before the matched lines, \u0060Prime/Prime.Scripting/ScriptingPrimitives.fs:1118\u0060 calls \u0060Violation\u0060 and \u0060Prime/Prime.Scripting/ScriptingPrimitives.fs:1140\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"f004b976d05e720a5b7ffd4ba0be0237f9dac758331e6ac2a9418585a04443f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Prime/Prime/Dictionary.fs:80-87 | Prime/Prime/Map.fs:119-126 \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":"Prime/Prime/Dictionary.fs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"802cbc33f8ec8780e37a8156bcfbf4b76d0a3fdd101530cc37e302b64dc9b8ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Prime/Prime/SHashSet.fs:71-78 | Prime/Prime/SList.fs:87-94 \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":"Prime/Prime/SHashSet.fs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"6034c7a03dc1385d1c78e13831aefaa08e28136ae047a0b508fc091b6d1e39f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20137 lines \u00D7 26): Prime/Prime.Ecs/Ecs.fs:762-763 | Prime/Prime.Ecs/Ecs.fs:775-776 | Prime/Prime.Ecs/Ecs.fs:789-790 | Prime/Prime.Ecs/Ecs.fs:804-805 | Prime/Prime.Ecs/Ecs.fs:820-821 | Prime/Prime.Ecs/Ecs.fs:837-838 | Prime/Prime.Ecs/Ecs.fs:855-856 | Prime/Prime.Ecs/Ecs.fs:874-875 | Prime/Prime.Ecs/Ecs.fs:1131-1137 | Prime/Prime.Ecs/Ecs.fs:1147-1153 | Prime/Prime.Ecs/Ecs.fs:1164-1170 | Prime/Prime.Ecs/Ecs.fs:1182-1188 | Prime/Prime.Ecs/Ecs.fs:1201-1207 | Prime/Prime.Ecs/Ecs.fs:1221-1227 | Prime/Prime.Ecs/Ecs.fs:1242-1248 | Prime/Prime.Ecs/Ecs.fs:1264-1270 | Prime/Prime.Ecs/Ecs.fs:1287-1293 | Prime/Prime.Ecs/Ecs.fs:1312-1318 | Prime/Prime.Ecs/Ecs.fs:1332-1338 | Prime/Prime.Ecs/Ecs.fs:1353-1359 | Prime/Prime.Ecs/Ecs.fs:1375-1381 | Prime/Prime.Ecs/Ecs.fs:1398-1404 | Prime/Prime.Ecs/Ecs.fs:1422-1428 | Prime/Prime.Ecs/Ecs.fs:1447-1453 | Prime/Prime.Ecs/Ecs.fs:1473-1479 | Prime/Prime.Ecs/Ecs.fs:1500-1506 \u2014 all 26 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060Prime/Prime.Ecs/Ecs.fs:1319\u0060 calls \u0060Add\u0060, \u0060Length\u0060, \u0060fun\u0060 and \u0060Prime/Prime.Ecs/Ecs.fs:1138\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":"Prime/Prime.Ecs/Ecs.fs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"2744ebb1c7f3355995fbba52f79a52df483e97c1c196bdbd6a5a180ef518c29c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 7): Prime/Prime.Ecs/Ecs.fs:1680-1686 | Prime/Prime.Ecs/Ecs.fs:1694-1700 | Prime/Prime.Ecs/Ecs.fs:1709-1715 | Prime/Prime.Ecs/Ecs.fs:1725-1731 | Prime/Prime.Ecs/Ecs.fs:1742-1748 | Prime/Prime.Ecs/Ecs.fs:1760-1766 | Prime/Prime.Ecs/Ecs.fs:1779-1785 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Prime/Prime.Ecs/Ecs.fs:1680\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":"Prime/Prime.Ecs/Ecs.fs"},"region":{"startLine":1680}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1c29fc3d975350197b03ae411ec0ab509065d7d09ff2db7c19b7567fa61ae9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 7): Prime/Prime/SymbolicConverter.fs:530-536 | Prime/Prime/SymbolicConverter.fs:588-594 | Prime/Prime/SymbolicConverter.fs:616-622 | Prime/Prime/SymbolicConverter.fs:647-653 | Prime/Prime/SymbolicConverter.fs:678-684 | Prime/Prime/SymbolicConverter.fs:717-723 | Prime/Prime/SymbolicConverter.fs:753-759 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/SymbolicConverter.fs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4e1070ce363ff6554270a02b3cb27fdfa3adda009873536767a499d446e38c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): Prime/Prime.Ecs/Ecs.fs:1555-1561 | Prime/Prime.Ecs/Ecs.fs:1569-1575 | Prime/Prime.Ecs/Ecs.fs:1584-1590 | Prime/Prime.Ecs/Ecs.fs:1600-1606 | Prime/Prime.Ecs/Ecs.fs:1617-1623 | Prime/Prime.Ecs/Ecs.fs:1635-1641 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Prime/Prime.Ecs/Ecs.fs:1555\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":"Prime/Prime.Ecs/Ecs.fs"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d7eba068eb71ddc22c490746b53399b07ff47a0f5551c2bfba3cc4023668fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): Prime/Prime/SymbolicConverter.fs:785-791 | Prime/Prime/SymbolicConverter.fs:799-805 | Prime/Prime/SymbolicConverter.fs:813-819 | Prime/Prime/SymbolicConverter.fs:827-833 \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":"Prime/Prime/SymbolicConverter.fs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2ef628f96f76521d25de998a77f2ffea73ba0266353076159d1652b7aba335"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): Prime/Prime.Scripting/ScriptingPrimitives.fs:409-415 | Prime/Prime.Scripting/ScriptingPrimitives.fs:471-477 | Prime/Prime.Scripting/ScriptingPrimitives.fs:708-714 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d3c4e4e15bc3a2f940aae3df669115feb2b3f663b4b4be39c3e42c1eabc36c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): Prime/Prime/FMap.fs:678-684 | Prime/Prime/FSet.fs:701-707 | Prime/Prime/FSet.fs:716-722 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/FMap.fs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac64b6a499711cdc4de1e212a70630dc8e5b58a0aa6faded9856ae72ef056d47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 4): Prime/Prime/SymbolicConverter.fs:602-608 | Prime/Prime/SymbolicConverter.fs:633-639 | Prime/Prime/SymbolicConverter.fs:664-670 | Prime/Prime/SymbolicConverter.fs:694-699 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Prime/Prime/SymbolicConverter.fs:694\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/SymbolicConverter.fs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2887b33a0a25a2d5b219d2a388276107f9735376f7c6241979df3855c9d6a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Prime/Prime.Scripting/ScriptingPrimitives.fs:411-417 | Prime/Prime.Scripting/ScriptingPrimitives.fs:648-654 \u2014 both copies are in the same file, so extract the block 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":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f16db3678e0514acd22c02fdf9dc590cedf5f04f5ebec7be6271e1f2b95ac86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Prime/Prime.Scripting/ScriptingPrimitives.fs:567-573 | Prime/Prime.Scripting/ScriptingPrimitives.fs:575-581 \u2014 both copies are in the same file, so extract the block 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":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b6b295f17e629b0218b24f62116c9665088f8a85c332838db8724b9c437d2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20137 lines \u00D7 5): Prime/Prime.Scripting/ScriptingPrimitives.fs:548-549 | Prime/Prime.Scripting/ScriptingPrimitives.fs:587-593 | Prime/Prime.Scripting/ScriptingPrimitives.fs:631-637 | Prime/Prime.Scripting/ScriptingPrimitives.fs:778-780 | Prime/Prime.Scripting/ScriptingPrimitives.fs:814-817 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Prime/Prime.Scripting/ScriptingPrimitives.fs:587\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":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf551aef5760bdf053b6eb80f8a7e84dedbb8ef33f71fb0a89ceefe55ee537a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Prime/Prime.Scripting/ScriptingPrimitives.fs:611-617 | Prime/Prime.Scripting/ScriptingPrimitives.fs:619-625 \u2014 both copies are in the same file, so extract the block 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":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"3660a1eab773c6e0549cae8bdd9998fb4fbbc778e157bd616cc9da724af89bbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Prime/Prime.Scripting/ScriptingPrimitives.fs:735-741 | Prime/Prime.Scripting/ScriptingPrimitives.fs:750-756 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Prime/Prime.Scripting/ScriptingPrimitives.fs:735\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":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32f0eab36396f0f7fde58222a783ab2a2690a79a821825ee7d9e8be902114b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Prime/Prime/STList.fs:39-45 | Prime/Prime/TList.fs:39-45 \u2014 before extracting anything, compare \u0060Prime/Prime/STList.fs\u0060 and \u0060Prime/Prime/TList.fs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 68 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":"Prime/Prime/STList.fs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"219ade05135d29ecd5333c05097b9fc091ac1c47eb13bd4c094d50fedfb83f18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20136 lines \u00D7 15): Prime/Prime.Ecs/Ecs.fs:1193-1195 | Prime/Prime.Ecs/Ecs.fs:1213-1214 | Prime/Prime.Ecs/Ecs.fs:1234-1235 | Prime/Prime.Ecs/Ecs.fs:1256-1257 | Prime/Prime.Ecs/Ecs.fs:1279-1280 | Prime/Prime.Ecs/Ecs.fs:1303-1304 | Prime/Prime.Ecs/Ecs.fs:1319-1324 | Prime/Prime.Ecs/Ecs.fs:1340-1344 | Prime/Prime.Ecs/Ecs.fs:1362-1366 | Prime/Prime.Ecs/Ecs.fs:1385-1389 | Prime/Prime.Ecs/Ecs.fs:1409-1413 | Prime/Prime.Ecs/Ecs.fs:1434-1438 | Prime/Prime.Ecs/Ecs.fs:1460-1464 | Prime/Prime.Ecs/Ecs.fs:1487-1491 | Prime/Prime.Ecs/Ecs.fs:1515-1519 \u2014 all 15 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Prime/Prime.Ecs/Ecs.fs:1319\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Ecs/Ecs.fs"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4b9b4ea53a5a4d29a483bd7a31124c620328d75cd6973906fc32feae3f54d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 6): Prime/Prime.Ecs/Ecs.fs:1849-1853 | Prime/Prime.Ecs/Ecs.fs:1865-1870 | Prime/Prime.Ecs/Ecs.fs:1883-1888 | Prime/Prime.Ecs/Ecs.fs:1903-1908 | Prime/Prime.Ecs/Ecs.fs:1925-1930 | Prime/Prime.Ecs/Ecs.fs:1949-1954 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Prime/Prime.Ecs/Ecs.fs:1849\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Ecs/Ecs.fs"},"region":{"startLine":1849}}}],"partialFingerprints":{"codehealthFindingId/v1":"076aa5e3738a9a4f7867b821f0b7ddda033e54c0aff7d47aac7c9fa14f9b008e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): Prime/Prime.Ecs/Ecs.fs:1868-1873 | Prime/Prime.Ecs/Ecs.fs:1887-1892 | Prime/Prime.Ecs/Ecs.fs:1908-1913 | Prime/Prime.Ecs/Ecs.fs:1931-1936 | Prime/Prime.Ecs/Ecs.fs:1956-1961 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Prime/Prime.Ecs/Ecs.fs:1868\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":"Prime/Prime.Ecs/Ecs.fs"},"region":{"startLine":1868}}}],"partialFingerprints":{"codehealthFindingId/v1":"b674af9c394a05b558a11f538c08acfdc760c6e94813ef6412857c49d27e03cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): Prime/Prime.Scripting/ScriptingPrimitives.fs:411-416 | Prime/Prime.Scripting/ScriptingPrimitives.fs:473-478 | Prime/Prime.Scripting/ScriptingPrimitives.fs:647-653 | Prime/Prime.Scripting/ScriptingPrimitives.fs:710-715 \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":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd80b838e4f32e59b0f1b2004871551cadc8129b90751187dfafb0566f9e3190"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): Prime/Prime.Scripting/ScriptingPrimitives.fs:722-727 | Prime/Prime.Scripting/ScriptingPrimitives.fs:735-740 | Prime/Prime.Scripting/ScriptingPrimitives.fs:750-755 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Prime/Prime.Scripting/ScriptingPrimitives.fs:722\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":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"89645bd761d3bef315a0b043969f33eaa401a9824a0991b0eb7531a2d36a2506"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Prime/Prime.Ecs/Ecs.fs:446-451 | Prime/Prime.Ecs/Ecs.fs:525-530 \u2014 both copies are in the same file, so extract the block 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":"Prime/Prime.Ecs/Ecs.fs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6632c190154c3468862e89aa4c9efaf0316bd27f7154bf51adc6de0f81d98b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Prime/Prime.Scripting/ScriptingPrimitives.fs:420-427 | Prime/Prime.Scripting/ScriptingPrimitives.fs:480-487 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Prime/Prime.Scripting/ScriptingPrimitives.fs:420\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fedf3d2141564a7caf15ef939a7fef2def820bd12fe4a7bcbeabfea78063672"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Prime/Prime.Scripting/ScriptingPrimitives.fs:511-516 | Prime/Prime.Scripting/ScriptingPrimitives.fs:523-528 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Prime/Prime.Scripting/ScriptingPrimitives.fs:511\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1a3cc650793fca3cc6b4b6fc11ca4202bca3d56d5dd39a5436d4acc61c48bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Prime/Prime.Scripting/ScriptingPrimitives.fs:657-662 | Prime/Prime.Scripting/ScriptingPrimitives.fs:717-722 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Prime/Prime.Scripting/ScriptingPrimitives.fs:657\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e46c9ca19459e7d1da6da30c173af1e20b30fa2c98263b67bcb199a9f0ea44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Prime/Prime.Scripting/ScriptingPrimitives.fs:858-866 | Prime/Prime.Scripting/ScriptingPrimitives.fs:912-920 \u2014 both copies are in the same file, so extract the block 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":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"895fde7279a41189bdca1355c44eac9ee54364a6119fd270a444b9a82c59c88d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Prime/Prime.Scripting/ScriptingPrimitives.fs:1038-1043 | Prime/Prime.Scripting/ScriptingPrimitives.fs:1066-1071 \u2014 both copies are in the same file, so extract the block 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":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dcdab1c5d12991a008ac9678094b4acc3be2647ef97bf4f16a75de19bf82289"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Prime/Prime/FMap.fs:698-703 | Prime/Prime/FSet.fs:734-739 \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":"Prime/Prime/FMap.fs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"13edfac5eb0d9f7e82bbb536e76c8850a22585f54876d23bc70ca646ca2c7cc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Prime/Prime/SymbolicConverter.fs:767-772 | Prime/Prime/SymbolicConverter.fs:841-846 \u2014 both copies are in the same file, so extract the block 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":"Prime/Prime/SymbolicConverter.fs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"2738284f1fcdf6e57b9a13062e1ade214c399ef7912b1e2d76edeaa376031f21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 12): Prime/Prime.Ecs/Ecs.fs:150-153 | Prime/Prime.Ecs/Ecs.fs:163-167 | Prime/Prime.Ecs/Ecs.fs:179-183 | Prime/Prime.Ecs/Ecs.fs:197-201 | Prime/Prime.Ecs/Ecs.fs:217-221 | Prime/Prime.Ecs/Ecs.fs:239-243 | Prime/Prime.Ecs/Ecs.fs:1844-1847 | Prime/Prime.Ecs/Ecs.fs:1859-1863 | Prime/Prime.Ecs/Ecs.fs:1877-1881 | Prime/Prime.Ecs/Ecs.fs:1897-1901 | Prime/Prime.Ecs/Ecs.fs:1919-1923 | Prime/Prime.Ecs/Ecs.fs:1943-1947 \u2014 all 12 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":"Prime/Prime.Ecs/Ecs.fs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a1147f7ef6d1d465ae95793164abdb403881f99d402725921022378ce60e36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 10): Prime/Prime.Ecs/Ecs.fs:1581-1585 | Prime/Prime.Ecs/Ecs.fs:1596-1600 | Prime/Prime.Ecs/Ecs.fs:1612-1616 | Prime/Prime.Ecs/Ecs.fs:1629-1633 | Prime/Prime.Ecs/Ecs.fs:1647-1651 | Prime/Prime.Ecs/Ecs.fs:1721-1725 | Prime/Prime.Ecs/Ecs.fs:1737-1741 | Prime/Prime.Ecs/Ecs.fs:1754-1758 | Prime/Prime.Ecs/Ecs.fs:1772-1776 | Prime/Prime.Ecs/Ecs.fs:1791-1795 \u2014 all 10 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Prime/Prime.Ecs/Ecs.fs:1581\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Ecs/Ecs.fs"},"region":{"startLine":1581}}}],"partialFingerprints":{"codehealthFindingId/v1":"407343fd52f4219f6f3a4fba0815bdf2815c6de15828db23e1d38ae8b5836463"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): Prime/Prime.Ecs/Ecs.fs:1568-1572 | Prime/Prime.Ecs/Ecs.fs:1583-1587 | Prime/Prime.Ecs/Ecs.fs:1599-1603 | Prime/Prime.Ecs/Ecs.fs:1616-1620 | Prime/Prime.Ecs/Ecs.fs:1634-1638 | Prime/Prime.Ecs/Ecs.fs:1653-1657 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Prime/Prime.Ecs/Ecs.fs:1568\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":"Prime/Prime.Ecs/Ecs.fs"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"b792d8de22dfec3c68aa7d90f6c2b03ededb0ad6df8ad9d8cd525628999fc054"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): Prime/Prime.Ecs/Ecs.fs:1852-1856 | Prime/Prime.Ecs/Ecs.fs:1868-1873 | Prime/Prime.Ecs/Ecs.fs:1887-1892 | Prime/Prime.Ecs/Ecs.fs:1908-1913 | Prime/Prime.Ecs/Ecs.fs:1931-1936 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Prime/Prime.Ecs/Ecs.fs:1852\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":"Prime/Prime.Ecs/Ecs.fs"},"region":{"startLine":1852}}}],"partialFingerprints":{"codehealthFindingId/v1":"206531c5c2c7f3bc7bbe00bc2d68404a2e5dd727ce671e5d250ffea80ed747ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 5): Prime/Prime.Ecs/EcsPrelude.fs:242-244 | Prime/Prime.Ecs/EcsPrelude.fs:258-262 | Prime/Prime.Ecs/EcsPrelude.fs:274-278 | Prime/Prime.Ecs/EcsPrelude.fs:290-294 | Prime/Prime.Ecs/EcsPrelude.fs:306-310 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Ecs/EcsPrelude.fs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e9423e5b7a77cca437fe045952dc7bc1c2723cbca22a63aafc1c6cc3e3e942"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): Prime/Prime.Scripting/ScriptingPrimitives.fs:423-427 | Prime/Prime.Scripting/ScriptingPrimitives.fs:483-487 | Prime/Prime.Scripting/ScriptingPrimitives.fs:512-516 | Prime/Prime.Scripting/ScriptingPrimitives.fs:524-528 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Prime/Prime.Scripting/ScriptingPrimitives.fs:423\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d65d0ad32c1c6ddfa3435170a56cb19c74eb0176628f84b4a1f4a542fb66a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): Prime/Prime/SymbolicConverter.fs:290-294 | Prime/Prime/SymbolicConverter.fs:298-302 | Prime/Prime/SymbolicConverter.fs:306-310 | Prime/Prime/SymbolicConverter.fs:314-318 \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":"Prime/Prime/SymbolicConverter.fs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"64be69a1f26280a862f66665b6adb500dfa4c5041826f391199be4f782bb9f6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): Prime/Prime.Scripting/ScriptingPrimitives.fs:500-505 | Prime/Prime.Scripting/ScriptingPrimitives.fs:516-521 | Prime/Prime.Scripting/ScriptingPrimitives.fs:528-533 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Prime/Prime.Scripting/ScriptingPrimitives.fs:500\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":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3822b755e9eaf2d252a5549b1b7b397ec3e5def428df87ededc7e439f24170"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): Prime/Prime.Scripting/ScriptingPrimitives.fs:737-741 | Prime/Prime.Scripting/ScriptingPrimitives.fs:752-756 | Prime/Prime.Scripting/ScriptingPrimitives.fs:761-766 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Prime/Prime.Scripting/ScriptingPrimitives.fs:737\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":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"5723a7977f7fe80309427e937ce353bde2ab1f5994a2cb905a560124d7611cfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 3): Prime/Prime.Scripting/ScriptingPrimitives.fs:550-554 | Prime/Prime.Scripting/ScriptingPrimitives.fs:594-598 | Prime/Prime.Scripting/ScriptingPrimitives.fs:779-781 \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 before the matched lines, \u0060Prime/Prime.Scripting/ScriptingPrimitives.fs:550\u0060 calls \u0060Violation\u0060 and \u0060Prime/Prime.Scripting/ScriptingPrimitives.fs:779\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"42620d2f8a624a9f38558874627ef926e789bb689fd8f94c59859904d2db975b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Prime/Prime.Scripting/ScriptingSystem.fs:433-438 | Prime/Prime.Scripting/ScriptingSystem.fs:447-452 \u2014 both copies are in the same file, so extract the block 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":"Prime/Prime.Scripting/ScriptingSystem.fs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"d703e05b1555a8222ad9010f38dd32c2c9b06d694724e050720c53fde6c6dba4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): Prime/Prime/FMap.fs:1027-1038 | Prime/Prime/FSet.fs:1039-1050 \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":"Prime/Prime/FMap.fs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"0536bc1c4852204ef3e041dba19d74b721ad8b39792ec8a37505ce3033b1160d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): Prime/Prime/FMap.fs:1041-1052 | Prime/Prime/FSet.fs:1053-1064 \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":"Prime/Prime/FMap.fs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"43bdc00394567aaa380bc7f55de3366fbe01c80078d515d0ec846d6d7ae1eed9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): Prime/Prime.Ecs/AssemblyInfo.fs:13-23 | Prime/Prime/AssemblyInfo.fs:13-23 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Ecs/AssemblyInfo.fs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7557bff30590c63016dd2aeeea53442fec359bdc8d978f2334ac6b273ea419"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Prime/Prime.Scripting/ScriptingPrimitives.fs:1006-1011 | Prime/Prime.Scripting/ScriptingPrimitives.fs:1044-1049 \u2014 both copies are in the same file, so extract the block 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":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4cb177869726ba969f686fa20f106ceffa604ca90f1bc8e99d3d790291b6bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Prime/Prime.Scripting/ScriptingPrimitives.fs:362-366 | Prime/Prime.Scripting/ScriptingPrimitives.fs:985-989 \u2014 both copies are in the same file, so extract the block 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":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4e60c0d0098b93c1fd8a3d70dcf7d9c4301913b3e5e111b1b92aab009052b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Prime/Prime/OSet.fs:70-74 | Prime/Prime/SOSet.fs:71-75 \u2014 before extracting anything, compare \u0060Prime/Prime/OSet.fs\u0060 and \u0060Prime/Prime/SOSet.fs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 43 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":"Prime/Prime/OSet.fs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"51786743badabd534d9afb52ab5284728015863037ce3e5378bea7a825d812c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Prime/Prime.Scripting/ScriptingUnary.fs:112-116 | Prime/Prime.Scripting/ScriptingUnary.fs:129-133 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Prime/Prime.Scripting/ScriptingUnary.fs:112\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/ScriptingUnary.fs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfb900392e0db5a00049dac093ada1e3fead019612f66968fc0f753051bb1d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Prime/Prime/Either.fs:17-21 | Prime/Prime/ValueEither.fs:17-21 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/Either.fs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a4f51c6a56ea624aac890534aaa588c49c83244a7b14187df8e85a869a0713"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): Prime/Prime/SymbolicConverter.fs:144-148 | Prime/Prime/SymbolicConverter.fs:180-184 | Prime/Prime/SymbolicConverter.fs:195-199 | Prime/Prime/SymbolicConverter.fs:210-214 | Prime/Prime/SymbolicConverter.fs:225-229 | Prime/Prime/SymbolicConverter.fs:322-326 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/SymbolicConverter.fs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f1ea7f76e34b2609977819ef5f5c3e0b658b1bdc44372e36173e2b2e0323c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Prime/Prime/SymbolicConverter.fs:247-251 | Prime/Prime/SymbolicConverter.fs:269-273 \u2014 both copies are in the same file, so extract the block 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":"Prime/Prime/SymbolicConverter.fs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e4885723114a2e1b36d6651b2168aa458869aa5b675cea38653e23011e0d64"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FSharpFSet\u00601 (LCOM4 6): FSharpFSet\u00601\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/FSet.fs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33778d4c93ce450cffa9b39db4f1c3929b5043d0ab1ed31589b1311a94bd18b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime.Ecs/EcsPrelude.fs: 9.8% line coverage (28/287)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Ecs/EcsPrelude.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4c17dc77f6efbaf2977e34760243d545756879a09f49f406f684a2c76481fd"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime.Ecs/Ecs.fs: 15.3% line coverage (187/1223)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Ecs/Ecs.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11b6bd1f10e23b985f69baa529e9558ac87decebd366da29c00060a17e3c04d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/Core.fs: 0.0% line coverage (0/3)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/Core.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fffdec4a37b8a56b8b64c514ff1dbb46826ba8c334c7204537b9c786f36e78f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/PartialEquate.fs: 0.0% line coverage (0/8)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/PartialEquate.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"132b96411d6e4ad5e351a09b34c1e3845761ab0198672ddcd5c7b7cdddf67588"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/PartialCompare.fs: 0.0% line coverage (0/13)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/PartialCompare.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57393088d5615fe0338128696d5aff5e7115f470b51129d4efdb91dca05f210"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/TopologicalSort.fs: 0.0% line coverage (0/66)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/TopologicalSort.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"859a367c28078f1df1c527f4cac6c3212aae2a4024a2e6a873fc723f0dd3c5a7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/Either.fs: 17.4% line coverage (12/69)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/Either.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7d97140d14018eabe3c86c79ab81e0f8f7e66f7d98ba86bfcc978990b56031"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/ValueEither.fs: 0.0% line coverage (0/71)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/ValueEither.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6b6a761f1031dad9cb9a6b88df2a9ee8a178fa3ced03b6685918c0ee74922d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/FList.fs: 0.0% line coverage (0/87)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/FList.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9a97564998c5007f36e202d2c1b44c0f324c12c4cfe5fbcf7aea2c5e20b9d0"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/FSet.fs: 0.0% line coverage (0/592)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/FSet.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02beb117d80d1c2b2124341e601b58e4a2d8fd77cf98aef74fc0321b027dc5b3"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/FMap.fs: 0.0% line coverage (0/636)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/FMap.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee3e1fa90337fb529664e5104e8a89067f66a65b7e9381946712da412fe8959"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/FQueue.fs: 0.0% line coverage (0/98)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/FQueue.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d496af5db5685f36c3ea91f5abb4e81d9a555608481152a91633ad47e28821f4"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/FDeque.fs: 0.0% line coverage (0/153)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/FDeque.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ccb9b1e8debd0a7d0d803650a09865aa9d2b1b695d86bc990479ed47f720df"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/FStack.fs: 0.0% line coverage (0/133)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/FStack.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"042aedb9b510f2d8ba68d54fbcd567e748fa6319528b98c031a843433e75679c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/TExpr.fs: 0.0% line coverage (0/21)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/TExpr.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e80b8f4c2c7662d82868174a1d7c57e767c1e24ccb7d11b3ba20cac829e2353"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/OSet.fs: 0.0% line coverage (0/81)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/OSet.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16dc123dc0c00012859f9c00234ac0d6f66f528be558f679358dc6091a0c2b27"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/OMap.fs: 0.0% line coverage (0/103)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/OMap.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcad1c69cd0a320c708d1656e2c12134681fc7a249861e51d54139f8e18b28dc"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/SOSet.fs: 0.0% line coverage (0/80)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/SOSet.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d65718aa3d334eec7e3d6aaf311a89ae8479885342ea7be4ca812508408422f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/SOMap.fs: 0.0% line coverage (0/96)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/SOMap.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4972790127614136f5503d2b25e34b0ef69433e0ee200e7b916eef6c2cd96843"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/ForgetfulDictionary.fs: 0.0% line coverage (0/67)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/ForgetfulDictionary.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"172f55b848ddbe941ec61b3330d02c2e98c8ef802dfed6ca0ccc71ed8ccddb2c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/Vsync.fs: 0.0% line coverage (0/60)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/Vsync.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"636171fb7c1e840668ab939edda10cf0062ca91060c633d4fe29ab3127d9d926"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/Reflection.fs: 28.7% line coverage (74/258)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/Reflection.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"348e3b688007d5e855368a4a1b07615dba4f963fba68197aa021bdf8505717e5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/SymbolicConverter.fs: 26.3% line coverage (183/696)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/SymbolicConverter.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21769842b1eca0e6c657cd25a18d0c0a9e097a8e32a7644932460a6348fb686e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/Generic.fs: 16.7% line coverage (3/18)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/Generic.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f4b5c090a78c2bc68af4ca7913bc87089fb5ba6a775e4e612dd3e8b95664b7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/SymbolicOperators.fs: 4.8% line coverage (3/63)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/SymbolicOperators.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed52bd10ef64d8a31fe2bc836269e32f29ffbc46920317b6b7f272e9d19dc3e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/Whisp.fs: 0.0% line coverage (0/232)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/Whisp.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"467ae3f8cc2fdcfe8c286266f81b72ffaf6c84767620fa929c65092fc8a141b2"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/KeyedArray.fs: 0.0% line coverage (0/76)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/KeyedArray.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46cff2e59db766ddb3ad8d204e0a44b85875391294bbbc2bbe0ff46545ac75c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/ListTree.fs: 0.0% line coverage (0/82)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/ListTree.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c5c669836bb5d6922e24e36c55ca1988228648f01172303d56ed4931f2b87b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/HMap.fs: 36.1% line coverage (56/155)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/HMap.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56ea2eec5f89fc606a60c45cc4fef84a6aec6d4fac57829dd4febf49628b2d8"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/HSet.fs: 47.7% line coverage (62/130)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/HSet.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6330953e7ef677fbb7944bed9cd8d197a657789ab3aa66b71732787ce2ef588e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/SUMap.fs: 16.2% line coverage (11/68)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/SUMap.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2428f632f7aee03a68dd2fd26c11c0aaf798e9a3338047f1c8332f1502a86021"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/SUSet.fs: 10.0% line coverage (11/110)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/SUSet.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8297f7cb4378785d1218e13f78aa9f5e5e90dcae720b38fe2a4ffde9f086d98f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/SUList.fs: 23.5% line coverage (20/85)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/SUList.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a984ad6ba6e850c8b45707c71cf829cd816ad0e82cabf4ed3d3f7ef10fbc3cb2"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/STSet.fs: 42.5% line coverage (62/146)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/STSet.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b022ded7e5fba74504f53118c17f7e2f5c6756ca5cc9e08b528fd0becefe875c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/UMap.fs: 14.5% line coverage (11/76)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/UMap.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"576580d0d03ce8f7e761693a328d82a79e248d0fd6ab52d6623f53be806f2f4a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/USet.fs: 10.1% line coverage (11/109)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/USet.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58d2032422bd80a3c2bcb89cecb18311b074f88426d65c2b33d4f1ee064231f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/UList.fs: 23.5% line coverage (20/85)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/UList.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7eec5baebc68e446424da2561c18ff7d82be029cf897ee5571018b9518da1d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/TSet.fs: 42.5% line coverage (62/146)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/TSet.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"459ef02d98be6b7c81c4001b093213da70ed91debc6e159bec807a7750c35321"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/MutantCache.fs: 0.0% line coverage (0/19)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/MutantCache.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89378b98f52d3378d34799726ad7a98c9a4545251da0499f4e453e67d1161f5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/KeyedCache.fs: 0.0% line coverage (0/14)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/KeyedCache.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c374c9b32f13623575b2b3317dd3d4e83667fa7be1d80b6e49fb36db77df129"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/Rand.fs: 43.8% line coverage (21/48)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/Rand.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11b6494c1204347e23e40813eff82f816f382001abc21045a62e1d1c983b6d8"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/SDictionary.fs: 37.1% line coverage (23/62)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/SDictionary.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da6beb0d64680524583eae7386d908dbd5f1b32f935da79a15256d967ea0d07"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/SHashSet.fs: 31.8% line coverage (21/66)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/SHashSet.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79e507d449a6ded029ae07096cad2b39b7febcfb2ac21ad823396f8411508d7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/SList.fs: 27.3% line coverage (36/132)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/SList.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5def7a714e6119b18db6e254ace700c2cab6df84a456b7b4136f54e668e9faf"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/SArray.fs: 26.4% line coverage (47/178)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/SArray.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3693b1faf536ef9900d252bdfa89b0504c96d4a3a7e6369632f265e1818ef06d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/Dictionary.fs: 15.4% line coverage (6/39)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/Dictionary.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5107665498bc29a38ddf8e32755b84fde9ecead0e597efb1d80b41508a7fbe"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/HashSet.fs: 10.3% line coverage (3/29)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/HashSet.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2cf1dc04e1d321fccadba9146303e969dac481efd3bf13dbc8bd1577255592"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/GenericList.fs: 0.0% line coverage (0/23)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/GenericList.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"051a8eec1452a3839a64a36d72e5cebb3b4ca7d372524b01936f40e1bbd5b254"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/Map.fs: 7.5% line coverage (3/40)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/Map.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02660464a39d1f313c6657b77551ddd25c53af1b3cca18abf61666b3cc51808e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/Set.fs: 0.0% line coverage (0/23)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/Set.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ca4b82f31ce33b0554a2e178650e557f8e851f9dea0065a7b401ff090fbcf4"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/List.fs: 9.1% line coverage (15/165)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/List.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"376570c31eceb2ab66caaff59f6dab72e986cc22fd549005df372ad62efee61f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/String.fs: 21.2% line coverage (25/118)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/String.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f13bfc876b306dd4118722746c2da10f3e6eae263e93a11c766d00b5523684"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/Array.fs: 11.7% line coverage (7/60)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/Array.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f96e04013577c6dc1be62a7b0633f1efabb8c7371eb2cb445149077c2073ff4"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/Seq.fs: 25.5% line coverage (24/94)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/Seq.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea1faa0085efc9c822e129a811c896f0b87285623c883f0036993435e374572"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/ValueTriple.fs: 0.0% line coverage (0/23)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/ValueTriple.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0850685327a6ac69dfde9dc20db37c4c9e3ba58a4766b9bed7699d8410201abc"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/Triple.fs: 0.0% line coverage (0/23)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/Triple.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"453dc4428e5fa988b0c30b1db9f5426ba6a6ee743616022fa20fa24506ae114d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/ValuePair.fs: 8.3% line coverage (1/12)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/ValuePair.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb054f973a6e7abb822d9401d67ea787fe530500965e765da912f01f7df398a6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/Pair.fs: 0.0% line coverage (0/10)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/Pair.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed37851a51b8849b226ffa256cc655c57029f6a336df6d88e928b0f3bc2e450"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/ValueOption.fs: 0.0% line coverage (0/9)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/ValueOption.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"abdacc271c9d798b69ffe3398c16651ab3315774a628eb898dbf56eeb57d27d8"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/Option.fs: 0.0% line coverage (0/15)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/Option.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66241edfd6a500742e7a5a60900fed4282e1dd511ed47191257a064be84f6d25"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime/Operators.fs: 12.5% line coverage (10/80)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/Operators.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca0e0ebb4ea34ff68089fa5ef7183091983aa600ffec74e56a27510f2faf697"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime.Scripting/ScriptingPrimitives.fs: 2.1% line coverage (20/951)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/ScriptingPrimitives.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71a0efa710acfe4081a78b63184abaa4c596fa3fe6d088ea97b8cfe6d80c473"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime.Scripting/ScriptingMarshalling.fs: 0.0% line coverage (0/235)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/ScriptingMarshalling.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e42406184560cd6e5c7e157105f0608bf0f52f0d063d95cfe69baef39ed76b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime.Scripting/ScriptingBinary.fs: 8.3% line coverage (22/266)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/ScriptingBinary.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9288049ae95d87b20dc2e039fb1f5d053d128ddcf5abae96a69bb2164dabdde"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime.Scripting/ScriptingUnary.fs: 5.9% line coverage (30/507)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/ScriptingUnary.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"744a2b49aa85044af3c3c870d5b2ff7387f7908184db821c37fcffcc3841a21b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime.Scripting/Scripting.fs: 26.3% line coverage (158/600)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/Scripting.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"789eef89eaf0ea726365882bafe3ee4704e025a8ab5e9b0e440d3f5dfaafa754"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: Prime/Prime.Scripting/ScriptingPrelude.fs: 4.5% line coverage (1/22)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting/ScriptingPrelude.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dcd8602061c163b8ac70421844459c4460bce1c03b3121d554ff0a78390ba64"}},{"ruleId":"D8","level":"warning","message":{"text":"No test project references Prime.Scripting.Repl: No test project in this repository references Prime.Scripting.Repl (1 production source file(s)), so \u0060dotnet test\u0060 never loads it and no coverage tool can measure it \u2014 its code is absent from the 17.7% above rather than counted at zero. This is the whole assembly, not a gap within one: add a test project that references it (or a ProjectReference from an existing suite) and its coverage starts being measured."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting.Repl/Prime.Scripting.Repl.fsproj"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eceae7a089927b0fffe089599237b527e30abcea22d268ab56f63368e9dfa58"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Prime/Prime/SymbolicConverter.fs: Prime/Prime/SymbolicConverter.fs changed 3 times in last 90 days, max cyclomatic complexity 160 in SymbolicConverter.OfSymbolInternal at line 413. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:45:13 -05:00\u0027 --until=\u00272026-11-13 07:45:13 -05:00\u0027 --full-history --no-merges -- Prime/Prime/SymbolicConverter.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/SymbolicConverter.fs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3dce7d3c94ec8fdc8cfa5b423c023cad2db9c31d6019f4f7cbe5e495fd61eab"}},{"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 \u0060Prime/Prime.Scripting.Repl/Prime.Scripting.Repl.fsproj\u0060 makes this repository a deployable product (line 4)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Scripting.Repl/Prime.Scripting.Repl.fsproj"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14c2288a2226ab09e6185977bb8ca9a0ab36c42a8d79cb06091b41c56ecd96a"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 4 project(s) overshoot their size bounds, lowering Project Cohesion to 5.0/10. The most over is \u0060Prime/Prime\u0060 (12824 LoC, 202 module-visible types across 1 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: UMap.fs \u2194 USet.fs: \u0060Prime/Prime/UMap.fs\u0060 and \u0060Prime/Prime/USet.fs\u0060 change together 57% of the time (8 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package \u2014 so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060cb6bb6ac\u0060 Added OSet and OMap to SymbolicConverter. Work on collections.; \u0060a1189e6a\u0060 Intermediate commit.; \u0060352bdf49\u0060 Added OSet type. \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/UMap.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fb2ef1a0180317da6de58f9d02eebe5ec856c84459e84ced340320e7afe629"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: Dictionary.fs \u2194 HashSet.fs: \u0060Prime/Prime/Dictionary.fs\u0060 and \u0060Prime/Prime/HashSet.fs\u0060 change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package \u2014 so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060ec0c4842\u0060 Changed extension module naming to follow standard approach used else\u2026; \u0060182176f8\u0060 Partial reversion of 9454bf2f7d0f1883057fa9b002eddb1d4b9873bb.; \u00609454bf2f\u0060 Improved overly simplistic hashes. \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime/Dictionary.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db7c34c605a3a6e5d5f92b94af83cc926d0977e3eda37436509e431f3ffcc48"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"P1","level":"warning","message":{"text":"No CI pipeline: No CI workflow found (.github/workflows, azure-pipelines.yml, .gitlab-ci.yml, \u2026) \u2014 changes aren\u0027t gated by an automated build/test."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"44f01af96e50474fba2df84d95ddf4f7e1d34c29c307830b9efc9057daa6b670"}},{"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) \u2014 this repository has no CI pipeline yet, so run it locally to clear the existing findings, then make it a step of the first workflow you add so a regression fails the build. What was searched, so you can tell an absence from a miss: the 0 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060Prime/Prime.Ecs/Prime.Ecs.fsproj\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Prime/Prime.Ecs/Prime.Ecs.fsproj"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1efa2437ecf013d99c8cc56762f5abffddf1745b0f54ebec74fdb885b40541"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"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"}}],"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-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]}],"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":0,"secretScannerRunsExcluded":0}}}]}