{"$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":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"id":"D33","name":"JS/npm Dependency Vulnerabilities","shortDescription":{"text":"JS/npm Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D33","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}},{"id":"D38","name":"OSV Dependency Vulnerabilities","shortDescription":{"text":"OSV Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D38","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"SchemaDefinitions.coerceObjectListFilterInput (cyclomatic 99): SchemaDefinitions.coerceObjectListFilterInput has cyclomatic complexity 99 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Server.Middleware/SchemaDefinitions.fs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dda70e4ce2dd23996a76bab64c45a729e027820d578471ea1c4a2b56f7add25"}},{"ruleId":"D1","level":"warning","message":{"text":"Values.compileByType (cyclomatic 67): Values.compileByType has cyclomatic complexity 67 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Server/Values.fs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"148d397625e071ecbd09a876a96059271a52af9ed6266c2bbd8939d88e942a83"}},{"ruleId":"D1","level":"warning","message":{"text":"ObjectListFilterModule.buildFilterExpr (cyclomatic 65): ObjectListFilterModule.buildFilterExpr has cyclomatic complexity 65 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Server.Middleware/ObjectListFilterModule.fs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"104deeb73169771fde7fd81fe405ddcbd687436ab490624bbd2abc915d77d013"}},{"ruleId":"D1","level":"warning","message":{"text":"MSBuild.fromCliArguments (cyclomatic 61): MSBuild.fromCliArguments has cyclomatic complexity 61 (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":"build/MSBuild.fs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"715569759441e03b13238e39b240e02cfac9b7fa2319677c11d9bb7e8298c2b8"}},{"ruleId":"D1","level":"warning","message":{"text":"Provider.makeProvidedType (cyclomatic 58): Provider.makeProvidedType has cyclomatic complexity 58 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c37775c4390b0864a453b26a6782657ecc327409581204d7d318884f2b0acf8"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonValueHelper.getFieldValue (cyclomatic 57): JsonValueHelper.getFieldValue has cyclomatic complexity 57 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Client/BaseTypes.fs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae049c644bc7ad3b1885bd574da61b9e1439497820c47b2e81889196e416b062"}},{"ruleId":"D1","level":"warning","message":{"text":"Extensions.Document.ToQueryString (cyclomatic 49): Extensions.Document.ToQueryString has cyclomatic complexity 49 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/AstExtensions.fs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc847d525d84975d8ce0294555732800f2c6613f41e26609ede08d79718dd7a"}},{"ruleId":"D1","level":"warning","message":{"text":"Values.coerceVariableValue (cyclomatic 42): Values.coerceVariableValue has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Server/Values.fs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30190e2c01aa32a0f8141f1cb85ca9b95dd6ff2a58a58d28b505c74498dc032"}},{"ruleId":"D1","level":"warning","message":{"text":"Provider.getSchemaProvidedTypes (cyclomatic 42): Provider.getSchemaProvidedTypes has cyclomatic complexity 42 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a2de2c83ae25f609401b5e22f728aae5663fd17062a918722d82e6aef92ff5"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeCoercion.coerceFilter (cyclomatic 40): TypeCoercion.coerceFilter has cyclomatic complexity 40 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Server.Middleware/TypeCoercion.fs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"05560f5688ad1c49389db66d72950e52c4a9b866cb8a18d3a82c65ace42a4e89"}},{"ruleId":"D1","level":"warning","message":{"text":"ProvidedOperation.makeProvidedType (cyclomatic 39): ProvidedOperation.makeProvidedType 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":"src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2ceaa1631fe1056f0d1d1d6afe23faff1dea4691895433dcae81c37291b45c"}},{"ruleId":"D1","level":"warning","message":{"text":"Ast.checkInputValue (cyclomatic 32): Ast.checkInputValue has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/Validation.fs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c19a6c1809b1d6cb4be048a7d211d3ede685b8042dffc8ebc97983bf4550c2"}},{"ruleId":"D1","level":"warning","message":{"text":"Provider.getOperationMetadata (cyclomatic 28): Provider.getOperationMetadata has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9539afc126bef2858dbe722014f99d5e2777835aa60d7e2078d2df6e51381d"}},{"ruleId":"D1","level":"warning","message":{"text":"DotNet.install (cyclomatic 22): DotNet.install 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":"build/DotNet.fs"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ecc14b90e505d635777662203fa5a9e75375014cd8b1e06b31e21695cfbcde"}},{"ruleId":"D1","level":"warning","message":{"text":"Execution.direct (cyclomatic 22): Execution.direct 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":"src/FSharp.Data.GraphQL.Server/Execution.fs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"782ed6138f49bb2ef2c160637f4a184b06c46bcf39515b24f11a1e1526212ff9"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeMap.AddType (cyclomatic 19): TypeMap.AddType has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/TypeSystem.fs"},"region":{"startLine":2066}}}],"partialFingerprints":{"codehealthFindingId/v1":"9770b749a0076d1e7e9516f45016a49a0687295667f579ea0eea06142285491a"}},{"ruleId":"D1","level":"warning","message":{"text":"InputValue.OfObject (cyclomatic 19): InputValue.OfObject has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/Ast.fs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b1db374c0124036533ce128b2382920df1596fb55df7616f4691ab53462e99"}},{"ruleId":"D1","level":"warning","message":{"text":"ReflectionHelper.isAssignableWithUnwrap (cyclomatic 16): ReflectionHelper.isAssignableWithUnwrap has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Server/ReflectionHelper.fs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a466cb4c2f8f3901c0acced6bcfeb55563c537e603d726946e670cc742c47f"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonValue.WriteTo (cyclomatic 16): JsonValue.WriteTo has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Client/JsonValue.fs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b7f6c3ccf003288e9f9ca27d0f633a3c6636be42d92195b87559f4a55f8921"}},{"ruleId":"D2","level":"warning","message":{"text":"Values.compileByType (cognitive 145): Values.compileByType has cognitive complexity 145 (threshold 15). Drivers by points: if/else 73, match/switch 61, boolean chains 11 (nesting depth added 87). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Server/Values.fs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"12776f5a81c87698c0077d4ba83c2cea498c5cbb6980566c258d058db763115c"}},{"ruleId":"D2","level":"warning","message":{"text":"Values.coerceVariableValue (cognitive 74): Values.coerceVariableValue has cognitive complexity 74 (threshold 15). Drivers by points: if/else 52, match/switch 18, boolean chains 4 (nesting depth added 38). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Server/Values.fs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"6115592ec33598c1a1e9e17f0792f96793e0d7a7d5ff7d9285fcfbe8d13537ff"}},{"ruleId":"D2","level":"warning","message":{"text":"ObjectListFilterModule.buildFilterExpr (cognitive 70): ObjectListFilterModule.buildFilterExpr has cognitive complexity 70 (threshold 15). Drivers by points: match/switch 35, if/else 34, boolean chains 1 (nesting depth added 32). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Server.Middleware/ObjectListFilterModule.fs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f3a2af12e6c8b9c9eacdba7f0fb82ed7ebe0e6772c154bc1a6c9aa8ce613a3"}},{"ruleId":"D2","level":"warning","message":{"text":"Provider.makeProvidedType (cognitive 57): Provider.makeProvidedType has cognitive complexity 57 (threshold 15). Drivers by points: match/switch 56, if/else 1 (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":"src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fe87593ed35b2b4e3f9fa12cc22744759637881b2e3b533255cc9b59c95138"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonValueHelper.getFieldValue (cognitive 54): JsonValueHelper.getFieldValue has cognitive complexity 54 (threshold 15). Drivers by points: match/switch 54 (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":"src/FSharp.Data.GraphQL.Client/BaseTypes.fs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1527c552cd466036c1c9aab73da0bb6b6e1b4d8503bc7769c375af147444072"}},{"ruleId":"D2","level":"warning","message":{"text":"ProvidedOperation.makeProvidedType (cognitive 50): ProvidedOperation.makeProvidedType has cognitive complexity 50 (threshold 15). Drivers by points: match/switch 27, if/else 22, boolean chains 1 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"255a09e4e6665d93de4f9922945c4d61759117359d92eb2f257141a6fd77028b"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaDefinitions.coerceObjectListFilterInput (cognitive 48): SchemaDefinitions.coerceObjectListFilterInput has cognitive complexity 48 (threshold 15). Drivers by points: match/switch 25, boolean chains 23 (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":"src/FSharp.Data.GraphQL.Server.Middleware/SchemaDefinitions.fs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6268f774b5509ae1d076c4e5f69850fc7a1308017d7d70b7606bfd5d5fa8000e"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeCoercion.coerceFilter (cognitive 46): TypeCoercion.coerceFilter has cognitive complexity 46 (threshold 15). Drivers by points: match/switch 46 (nesting depth added 29). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Server.Middleware/TypeCoercion.fs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dcc5291337ab87087e85fdaf6404b0e4b56c656297f42c42c6447b220e6bf10"}},{"ruleId":"D2","level":"warning","message":{"text":"DotNet.install (cognitive 37): DotNet.install has cognitive complexity 37 (threshold 15). Drivers by points: if/else 24, error handling 8, match/switch 3, boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build/DotNet.fs"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0dcb93b9f0f96a144b716647193b593b6e5cc4d7e33418dfebd0a4118735e57"}},{"ruleId":"D2","level":"warning","message":{"text":"Ast.checkInputValue (cognitive 36): Ast.checkInputValue has cognitive complexity 36 (threshold 15). Drivers by points: match/switch 25, if/else 10, boolean chains 1 (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":"src/FSharp.Data.GraphQL.Shared/Validation.fs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd5d779a9ab07fa8e2cf064ce128e64925f24ec85804d1747dfb35661eedaec"}},{"ruleId":"D2","level":"warning","message":{"text":"Extensions.Document.ToQueryString (cognitive 33): Extensions.Document.ToQueryString has cognitive complexity 33 (threshold 15). Drivers by points: if/else 19, match/switch 13, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/AstExtensions.fs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"227cd578755f5d1e0bc3a453ef0ec97b39ad7c6d47562c1e5df6035c796297b9"}},{"ruleId":"D2","level":"warning","message":{"text":"MSBuild.fromCliArguments (cognitive 32): MSBuild.fromCliArguments has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 21, if/else 11 (nesting depth added 1). 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":"build/MSBuild.fs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"042c0fd6c3e77aed4e138858881f3ed3a14aaa1826ae1f26939fe0e41d29d7f1"}},{"ruleId":"D2","level":"warning","message":{"text":"Provider.getOperationMetadata (cognitive 29): Provider.getOperationMetadata has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 21, if/else 5, boolean chains 3 (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d9ff06afeeb8c9025c557c52271c393ef6e7cfc20ce429dc95b32bb5036b64"}},{"ruleId":"D2","level":"warning","message":{"text":"Ast.checkVariableUsageAllowedOnArguments (cognitive 27): Ast.checkVariableUsageAllowedOnArguments has cognitive complexity 27 (threshold 15). Drivers by points: if/else 19, match/switch 6, boolean chains 2 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/Validation.fs"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f3a00eb514cfaff9db52810e92a3d56f31e51e823de5d6e989787446fc7034"}},{"ruleId":"D2","level":"warning","message":{"text":"Provider.getSchemaProvidedTypes (cognitive 26): Provider.getSchemaProvidedTypes has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 13, boolean chains 8, if/else 5 (nesting depth added 5). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"546be7d27489d969300d58bc8878b8b714f9e145beb1c0b1bca0eca1ab4ee3da"}},{"ruleId":"D2","level":"warning","message":{"text":"Values.normalizeOptional (cognitive 25): Values.normalizeOptional has cognitive complexity 25 (threshold 15). Drivers by points: if/else 20, boolean chains 4, match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Server/Values.fs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a6c7a393499b05fc0f27c21246d4d93a77e4a3609fd3b2683eefd27b786223"}},{"ruleId":"D2","level":"warning","message":{"text":"Execution.direct (cognitive 22): Execution.direct has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 19, if/else 3 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Server/Execution.fs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21b51f0795cfb124d0d74747db10aaf08a4ae5f85bd2441879b651ee971359b"}},{"ruleId":"D2","level":"warning","message":{"text":"OperationErrorTests.Should parse all combinations of optional operation error fields (cognitive 22): OperationErrorTests.Should parse all combinations of optional operation error fields has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15, loops 7 (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":"tests/FSharp.Data.GraphQL.IntegrationTests/OperationErrorTests.fs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d069f86be90d08035dea9e19a34f27d3916d671ccf112a1a85b837f2f5b05f"}},{"ruleId":"D2","level":"warning","message":{"text":"List.combinations (cognitive 21): List.combinations has cognitive complexity 21 (threshold 15). Drivers by points: loops 19, if/else 2 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Client/Extensions.fs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"59fbc8da3f078589c03ba6d69eced067d815236f58db9e851c619446b1bdc1a4"}},{"ruleId":"D2","level":"warning","message":{"text":"NuGet.createNuSpecFromTemplate (cognitive 20): NuGet.createNuSpecFromTemplate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16, match/switch 4. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. 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":"build/NuGet.fs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"914c0b58da5cd3a2c10b0c05a32ad3091a364d0892c53a21ed97781c8b64f274"}},{"ruleId":"D2","level":"warning","message":{"text":"Linq.merge (cognitive 20): Linq.merge has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10, match/switch 10 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Server/Linq.fs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1374ef136a0bf117099386a18e1349795e5194f08bc110f2f4508d5b7bc76c"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonValue.WriteTo (cognitive 20): JsonValue.WriteTo has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, loops 4, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Client/JsonValue.fs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf0177e51a3bdd402ac8df27d125011e3318dfaded3ea3d7fa64be4f2e9b97f"}},{"ruleId":"D2","level":"warning","message":{"text":"ProvidedRecord.makeProvidedType (cognitive 20): ProvidedRecord.makeProvidedType has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, match/switch 6 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3cfaea76367bf2df12a131f9aab491ee3b1dc680002829fe5d2e2aa39f3f72"}},{"ruleId":"D2","level":"warning","message":{"text":"Ast.areTypesCompatible (cognitive 17): Ast.areTypesCompatible has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, boolean chains 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/Validation.fs"},"region":{"startLine":1410}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5357e195d5b31062d4c0f6d63c45d49c5ddce1bf3e7646992efdc78e84d022"}},{"ruleId":"D2","level":"warning","message":{"text":"AsyncVal.collectSequential (cognitive 17): AsyncVal.collectSequential has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 12, if/else 3, loops 2 (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":"src/FSharp.Data.GraphQL.Shared/AsyncVal.fs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b11a4e8095d5ae8dfcc358f9725d00a9bc37b8e8b7e9dc543f1b37dca464ba1"}},{"ruleId":"D2","level":"warning","message":{"text":"AsyncVal.collectParallel (cognitive 17): AsyncVal.collectParallel has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6, loops 6, match/switch 5 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/AsyncVal.fs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a670c8a086c733b47193b10c8667562bf48bcc7ff5ff092f42c06aa13806791"}},{"ruleId":"D2","level":"warning","message":{"text":"DB.fetchBooksPage (cognitive 16): DB.fetchBooksPage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, match/switch 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/relay-book-store/DB.fs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b182a82ca6adaf015dc8d0ad4a0090ec2308c463aaf2825d5d367a57e85b1d"}},{"ruleId":"D2","level":"warning","message":{"text":"Types.validateType (cognitive 16): Types.validateType has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, match/switch 1 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/Validation.fs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f3df689bbf12503fac3bd4f2a2dd6f2d062279460370a3bb617b9bd29f2f6a"}},{"ruleId":"D2","level":"warning","message":{"text":"Planning.planSelection (cognitive 16): Planning.planSelection has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 10, if/else 6 (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":"src/FSharp.Data.GraphQL.Server/Planning.fs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f67d48c3f50c9f4508169999a10f750514148f902b0f8b7b9be0c61bfd736c0"}},{"ruleId":"D2","level":"warning","message":{"text":"ReflectionHelper.isAssignableWithUnwrap (cognitive 16): ReflectionHelper.isAssignableWithUnwrap has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 7. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Server/ReflectionHelper.fs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1302f70ade6a5ca77af694caeb98139d2831dd4839615615cd17388b26b9124"}},{"ruleId":"D2","level":"warning","message":{"text":"ObjectListFilterModule.comparerToStringComparison (cognitive 16): ObjectListFilterModule.comparerToStringComparison has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, match/switch 5 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Server.Middleware/ObjectListFilterModule.fs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ec880686a3e2482a6e33499aa544622d88c8fb7befe85484b1e4fda72a2788"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FSharp.Data.GraphQL.Shared/TypeSystem.fs: FileTooLong \u2014 1597 significant lines (blank, comment-only and punctuation-only lines excluded). To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/TypeSystem.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f46ddb743ed4e9a35b2fbbd04e50a324d2f83baf1275cbbaac37babfa65102"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FSharp.Data.GraphQL.Shared/Validation.fs: FileTooLong \u2014 1368 significant lines (blank, comment-only and punctuation-only lines excluded). To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/Validation.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"364df1c1dc2a5c14019635f5c08b75fd6e403562db1763ed94793ed81e48d491"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Ast: TooManyMethods \u2014 67 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/Validation.fs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"1568abc9bb17175b68886dd2d108ee11868053778bf846fe5d940ea1922abd17"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs: FileTooLong \u2014 988 significant lines (blank, comment-only and punctuation-only lines excluded). To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"526600927af77740c7e1257b4df40d456f36770b9b86f416556a4ff3b42270aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs: FileTooLong \u2014 889 significant lines (blank, comment-only and punctuation-only lines excluded). To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab36b286b4f530db04861c901073dc78805c396d7920e1a50661bce19387d75"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Define: TooManyMethods \u2014 39 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd2d7fcb5a07415f60fe7cd86a3db9f4e8b1680242881e0357bec2c83a2d11c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Execution: TooManyMethods \u2014 38 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Server/Execution.fs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd354a36d2b098cf822f9dc4a12f39f436f7e6a4876257c7665e13f3d8b371b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Linq: TooManyMethods \u2014 37 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Server/Linq.fs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfea6292c7fe7a645c9996b2e5426cca0ab2fe21c3959a73ca610cb75634ad4f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FSharp.Data.GraphQL.Server/Values.fs: FileTooLong \u2014 575 significant lines (blank, comment-only and punctuation-only lines excluded). To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Server/Values.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ecf4fbb84328a25db60b6e095edcc39755a44f292bdd2e5e435555db354854"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FSharp.Data.GraphQL.Server/Execution.fs: FileTooLong \u2014 567 significant lines (blank, comment-only and punctuation-only lines excluded). To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Server/Execution.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d0ad2ef14d2859ac3a46d9f43d6a3c0790f38b12bbc3b5f71d024cd17ddfb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): samples/relay-book-store/Program.fs:39-51 | samples/chat-app/server/Program.fs:33-45 \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":"samples/relay-book-store/Program.fs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d241b9ea693179c7acdc0dd0883bd6f84f9b119cecf50eeac428127204eb549"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:1059-1071 | src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:1912-1924 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/TypeSystem.fs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56798c4890e9ec762f64a8e9081c1d2df66f38fd4a52b8d9d3a7d2efd0ec303"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/FSharp.Data.GraphQL.Server/ErrorTypes.fs:35-47 | src/FSharp.Data.GraphQL.Server/ErrorTypes.fs:84-96 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharp.Data.GraphQL.Server/ErrorTypes.fs:35\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Server/ErrorTypes.fs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"159b58bc9f2385a5e9e60aa04c7b7b0cc8a22bc6e1a2a903f687fc392db4cd9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/FSharp.Data.GraphQL.Server/Values.fs:482-494 | src/FSharp.Data.GraphQL.Server/Values.fs:613-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":"src/FSharp.Data.GraphQL.Server/Values.fs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ea35924dd7020ace8fec8f7718bb808edb5353b85e9561c6a2f77a279937e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:1600-1611 | src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:1639-1650 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:1600\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/TypeSystem.fs"},"region":{"startLine":1600}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3a9097a236bd620dd88a76b7641a306051a7cb9342ef71c3b33d76d5ad4833"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FSharp.Data.GraphQL.Client/GraphQLClient.fs:64-75 | src/FSharp.Data.GraphQL.Client/GraphQLClient.fs:155-167 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Client/GraphQLClient.fs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdbf896ff139222abf2ba6d17807e003e2a3ae8d9f9175ae5447b4d0a88d7b9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:1103-1113 | src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:1305-1315 | src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:1391-1401 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:1103\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/TypeSystem.fs"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae105c8fbdb2cd9980a5060ea6e777bf282a74793830e7dfa15eaece369f955c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharp.Data.GraphQL.Shared/Helpers/Reflection.fs:73-83 | src/FSharp.Data.GraphQL.Shared/Helpers/Reflection.fs:108-118 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/Helpers/Reflection.fs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4abc07950f8b88db218c5a31b31f88028dfa9156af1c5e95f5fab16e931d52a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharp.Data.GraphQL.Shared/Helpers/Reflection.fs:134-144 | src/FSharp.Data.GraphQL.Shared/Helpers/Reflection.fs:157-167 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/Helpers/Reflection.fs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"4552a2fff8ba3ceb678b10b0b2e25d9f108d688c8c8591fd6d0eba7f07611b7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharp.Data.GraphQL.Shared/Errors.fs:219-229 | src/FSharp.Data.GraphQL.Shared/Errors.fs:236-246 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/Errors.fs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96b68f21f3a80e3e8c5addc8e247b147b469722285b95d3250caad92beb74ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:1617-1629 | src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:1656-1666 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/TypeSystem.fs"},"region":{"startLine":1617}}}],"partialFingerprints":{"codehealthFindingId/v1":"059320bdbcf33c15a4302a9f4990623583b0eacb7420eef0191ddaaa00d59d17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharp.Data.GraphQL.Shared/Validation.fs:1038-1048 | src/FSharp.Data.GraphQL.Shared/Validation.fs:1208-1218 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharp.Data.GraphQL.Shared/Validation.fs:1038\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/Validation.fs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b08d7ad15fcafdb8128da7944c0efd78abb00a2dd1125427079ae507546f48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): samples/chat-app/server/Schema.fs:627-637 | samples/chat-app/server/Schema.fs:671-681 \u2014 both copies are in the same file, so extract the block 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 \u0060samples/chat-app/server/Schema.fs:627\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":"samples/chat-app/server/Schema.fs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae4cf7bccf5e240456554f7ae36c7c352f5781ae5253f1f097ef468618af7f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:1815-1824 | src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:1941-1951 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharp.Data.GraphQL.Shared/TypeSystem.fs:1815\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/TypeSystem.fs"},"region":{"startLine":1815}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e321c8cc19586cf6bc85803b496583574c9175a048d582ef0a8e6a53c5feda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharp.Data.GraphQL.Server/ErrorsProcessing.fs:21-30 | src/FSharp.Data.GraphQL.Server/ErrorsProcessing.fs:49-58 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Server/ErrorsProcessing.fs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca881e37741197a4243d3fc9d6111add51c82a369a89e8509e7ff3a2081494e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharp.Data.GraphQL.Server.Middleware/ObjectListFilterModule.fs:324-333 | src/FSharp.Data.GraphQL.Server.Middleware/ObjectListFilterModule.fs:360-369 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Server.Middleware/ObjectListFilterModule.fs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"454c2ef235ebd913ebddd607e4d574743958803b175685e45beb78659db47c4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs:376-385 | src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs:422-431 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs:376\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"93cbf47c2468bc9413814d6fe25c19b831db18dde29dff958494f5bd29071735"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): samples/chat-app/server/Schema.fs:756-765 | samples/chat-app/server/Schema.fs:799-808 \u2014 both copies are in the same file, so extract the block 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":"samples/chat-app/server/Schema.fs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"7671c8ca97d8f288628802ae6516a46cf961c3f07bf677beaa39cb9e4ff20053"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharp.Data.GraphQL.Shared/Errors.fs:242-250 | src/FSharp.Data.GraphQL.Shared/Errors.fs:262-270 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/Errors.fs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90e9f600c59fad6b468a095cf725fb8cd611ce4af0f1c0a0f584adc5c236916"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:24-32 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:37-45 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecbc5fb0c55cbdd7f08058035fdf7ad98f00e6c37b5a5454578bb37dcb49a397"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1085-1093 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1106-1114 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"099981cd7454f4d913fca9f2f703d39e9003381f6de83f48f5ec8a81e471f24a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1127-1135 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1150-1158 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"f608278428874d0425ecd953525dac8924ff64d668a2e10bed42de31981b613d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1269-1277 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1290-1298 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"5024a40ab24df5f20a0437c22ef39f777947147946e6a560b5fc84dd2e133951"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1311-1319 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1334-1342 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2fa3b4e0cc5e1a424970b56ce01cb9417607c16fe793f2729a7038ef121ed9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharp.Data.GraphQL.Shared/SchemaDefinitionsExtensions.fs:45-53 | samples/star-wars-api/AuthorizationMiddleware.fs:24-33 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/SchemaDefinitionsExtensions.fs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f4db8b5fdf6177ed2848844d2beed1666a47e18fcfb768fb64046625eec7d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharp.Data.GraphQL.Server/Linq.fs:225-233 | src/FSharp.Data.GraphQL.Server/Linq.fs:250-258 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Server/Linq.fs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"296c7b6c4a9c46ad911325f04fab0e133b7473ce09ba4aa371400c9a42ee2e99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1173-1180 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1198-1205 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1173\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"703f1a5ed65109448886e47b0439df7d99c6619b3a596a2c09521b7d92653842"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1222-1229 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1249-1256 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1222\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8e699ef44298f1a06613d3b875d03d6ce49324b7314f2b340012df65c6fe74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1357-1364 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1382-1389 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1357\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46ac7c8b592d61f2e9049afd74a8183239cc4592ce47d33c07c05b6cbde5fa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1406-1413 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1433-1440 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1406\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"16348b7d3e64e93cdba675309ff52e1c8d53b16b82ef053d348bdaa86b267299"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.GraphQL.Server/Values.fs:241-251 | src/FSharp.Data.GraphQL.Server/Values.fs:286-293 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Server/Values.fs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f09c47f4e7a046765bab3e85d83caa2eb5a89d1bf2421288424e075bc120ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharp.Data.GraphQL.Server/Linq.fs:235-242 | src/FSharp.Data.GraphQL.Server/Linq.fs:260-268 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Server/Linq.fs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f5944413b3fe2a81a104c55cf0c2a06062d3e84b718fb8e8aaf54689aa00d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.GraphQL.Server.AspNetCore/ServiceCollectionExtensions.fs:298-304 | src/FSharp.Data.GraphQL.Server.AspNetCore/ServiceCollectionExtensions.fs:318-324 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Server.AspNetCore/ServiceCollectionExtensions.fs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"227c995bc5b58d352607bed61dcaba851fcb755b589a33260d38737ccdfdb4b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1148-1154 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1196-1202 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1148\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"36487da7eb5309c169ccd4322eb1a1c28ae7fa20fff3aae15a8e9ea309d43a95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1333-1339 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1381-1387 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1333\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6246d05be5da2312826d140d783a5c1c8871c91fb71655a150e89a2ea89ec3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.GraphQL.Shared/SchemaDefinitionsExtensions.fs:83-89 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitionsExtensions.fs:99-105 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/SchemaDefinitionsExtensions.fs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b48e39b85923b82ca1fd90a894cdc5be856b8bd2b50eb91628b86e97738568e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.GraphQL.Shared/SchemaDefinitionsExtensions.fs:102-108 | samples/star-wars-api/AuthorizationMiddleware.fs:67-73 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/SchemaDefinitionsExtensions.fs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe3553bf84eb20f46717d8fac8bc0be84eefc49e7243af511d0539530bd56fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.GraphQL.Server/Planning.fs:273-279 | src/FSharp.Data.GraphQL.Server/Planning.fs:315-321 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Server/Planning.fs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81932022b0171de5c7afd7a6c47d7b2abab11c355922e62998304ad26608491"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.GraphQL.Server/Linq.fs:218-224 | src/FSharp.Data.GraphQL.Server/Linq.fs:243-249 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Server/Linq.fs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d590706e1b1b68b14d0e3ec6e34ff2c23a6cecad510350d6687a815dcf9baf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharp.Data.GraphQL.Client/JsonValue.fs:245-251 | src/FSharp.Data.GraphQL.Client/JsonValue.fs:262-268 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Client/JsonValue.fs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b0fa2044feb24744c6ad4984462e526aa1b1210cd204943f5ec80c99c53fe7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.GraphQL.Server.AspNetCore/ServiceCollectionExtensions.fs:44-49 | src/FSharp.Data.GraphQL.Server.AspNetCore/ServiceCollectionExtensions.fs:99-104 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharp.Data.GraphQL.Server.AspNetCore/ServiceCollectionExtensions.fs:44\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Server.AspNetCore/ServiceCollectionExtensions.fs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f90b96f4e03930c530b97ea25559fe7eeef8460927a0eab97fc8596508cc961"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.GraphQL.Shared/AsyncVal.fs:137-143 | src/FSharp.Data.GraphQL.Shared/AsyncVal.fs:174-179 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/AsyncVal.fs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"9101dff76fd810d0576ad4ecae9e0c7f3b6edf8f843c92839e6c8efb41e1ebbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:917-922 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:956-961 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:917\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac3132e81f68e16b4064d8b01ff0932d4749cdb27f38e26e15e62f400efc293"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:936-942 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:975-980 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:936\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c79da6267e52eab24846b5fd0d845ce2e19a65c8de562a1c9df28b9cfc22e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:993-998 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1031-1036 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:993\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee259c542cd1d98cee14b57e400664ffd6207569f28c1e7daa0a13919cb76f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1012-1017 | src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1052-1057 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs:1012\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/SchemaDefinitions.fs"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"c497630eb67b8f9a173bbf0f05a0d3a5c98a17cf0b76321c16c64517794cb57b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.GraphQL.Shared/SchemaDefinitionsExtensions.fs:60-65 | samples/star-wars-api/AuthorizationMiddleware.fs:62-69 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Shared/SchemaDefinitionsExtensions.fs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd1b86442252dc0a4ac2a90fdc25ef37edc55275241c78d58d48e6644e9836a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FSharp.Data.GraphQL.Server/Linq.fs:186-191 | src/FSharp.Data.GraphQL.Server/Linq.fs:196-201 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Server/Linq.fs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04a523319095df0bff439cac0fddbb15e0cc15637926ed67bdf4d1d497c2bd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharp.Data.GraphQL.Server.Middleware/ObjectListFilterModule.fs:351-355 | src/FSharp.Data.GraphQL.Server.Middleware/ObjectListFilterModule.fs:385-389 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Server.Middleware/ObjectListFilterModule.fs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f4af4e7d9405f0486469585748ea171ac816add071d5aefb398546946e0d25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs:200-204 | src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs:224-228 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"71085b08001795becea49abcfb2975818761f347d7281ca8bd008d2373bf2b43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs:609-613 | src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs:633-637 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs:609\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Client.DesignTime/ProvidedTypesHelper.fs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e42fbc7c66ca7ca01762385cd08dc2e1c6f2e2b313b61c1f38c2243a64c009"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 no coverage collector is wired up: Coverage NOT MEASURED: the test suite built and its tests PASSED, but the run produced no coverage data \u2014 \u0060--collect:\u0022XPlat Code Coverage\u0022\u0060 found no data collector, which is what a test project with no \u0060coverlet.collector\u0060 PackageReference does. Nothing is wrong with the suite or the build; there is simply no coverage instrumentation wired up. Add a \u0060coverlet.collector\u0060 PackageReference to the test project(s) (or commit the Cobertura/OpenCover/lcov report your CI produces) and real coverage will be measured. It is excluded from the score rather than counted as a near-zero defect."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/FSharp.Data.GraphQL.Server.Middleware/ObjectListFilterModule.fs: src/FSharp.Data.GraphQL.Server.Middleware/ObjectListFilterModule.fs changed 6 times in last 90 days, max complexity 65. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, behind tests written first."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Server.Middleware/ObjectListFilterModule.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06654963083468c4c074b1f2fe680ff55dfb52912dbbffb175bfb8d498ba168"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/FSharp.Data.GraphQL.Server.Middleware/SchemaDefinitions.fs: src/FSharp.Data.GraphQL.Server.Middleware/SchemaDefinitions.fs changed 2 times in last 90 days, max complexity 99. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, behind tests written first."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Server.Middleware/SchemaDefinitions.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efbc0caf6185d4a32c2af9696e572e7e92c5e925bb00b3068da05fa25dd3287"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/FSharp.Data.GraphQL.Client/BaseTypes.fs: src/FSharp.Data.GraphQL.Client/BaseTypes.fs changed 2 times in last 90 days, max complexity 57. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, behind tests written first."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharp.Data.GraphQL.Client/BaseTypes.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c33c312a13b74142564bc6943ad7c5ef4a1d6e37f46f8dbe02a578e07b5027"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 5 significant file(s) lose their only recent owner: src/FSharp.Data.GraphQL.Server/Planning.fs, src/FSharp.Data.GraphQL.Server.AspNetCore/ServiceCollectionExtensions.fs, src/FSharp.Data.GraphQL.Server.Relay/Connections.fs, src/FSharp.Data.GraphQL.Server/ReflectionHelper.fs, src/FSharp.Data.GraphQL.Server.Relay/Node.fs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6318dcab1163f3b2474aa48c92a52a046d6891251bb00d30319cd30e7bdd6592"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f39acc2b10735c8a3966f97e8b8620e7b996a79f8eb2028f323f95d5d8a32699"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9443145784b10715d09b4e774be4c358890edbcfa7ac92ef5cd9eb23520843d1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e4eb73e29e2457dfefa3d5652c9d2bef0e1b422eddc0b7da416b175dcaa838e4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"717a60d023d7c93e7b6e93c8864b340d776f1711268067e4a96a4238f5e7dba7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"73e1bb4aafbeedc08500a0f60ab55ac16f59f628caf0b9dbe91f4b82291554c5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a3c84a8e21c4bc260c9f2e55f58b05c2f11f89f94863bb6277f7f0148d1a90b0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"671f735abe44bd604b6ec3e309d769d1264fd09369ff14fa8f4ba35df66a666e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f7b6c6bfeb58c97fb3e71e9b46289e0e1f4818a871b20f07d81deec8df0302bc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"53ffd52a2352c1da8438cdbf044a8b55a74888144ff2a0cf97d13dea5c772754"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2756ad6eb59f320acfd637bddd84cc17320cc9caa5151f12f8ac7922483347ef"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D34","level":"note","message":{"text":"knowledge concentrated in recent work \u2014 freshness signal contradicted by repo activity: File-level freshness contradicts repo activity: 31 commits in the last 90 days, yet 26 of 48 significant files carry no living knowledge. Those two readings cannot both be true, so the per-file recency signal is treated as unreliable here and freshness is not scored for this run."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6e461071eb7c3d0d8a5f27dee27c23fcaef1256b0b0ff28c50eb743e940dbe9d"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"CWE-353","shortDescription":{"text":"CWE-353"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":15,"secretScannerRunsExcluded":0}},"redactionTokens":["A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."]}]}