{"$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":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D7","name":"Architectural Integrity","shortDescription":{"text":"Architectural Integrity"},"helpUri":"https://codehealth.canine.dev/dimensions/D7"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"FcsBridge.FindCoreWithinDeadline (cyclomatic 519): FcsBridge.FindCoreWithinDeadline has cyclomatic complexity 519 (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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold \u2014 including the worst \u2014 and 1523 of the 1704 points over it (89%), 27.2\u00D7 the next-largest file (LspBridge.fs at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":7124}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc9f81240e5f40a86198d5068354926ce888bc0159bbd8463f29c6799e02889"}},{"ruleId":"D1","level":"warning","message":{"text":"FcsBridge.Check (cyclomatic 258): FcsBridge.Check has cyclomatic complexity 258 (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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold \u2014 including the worst \u2014 and 1523 of the 1704 points over it (89%), 27.2\u00D7 the next-largest file (LspBridge.fs at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":11188}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c0a70a74e346a994d85bf88a947f2d07bafae2e3d0677cc9cf0e0dea143cb8"}},{"ruleId":"D1","level":"warning","message":{"text":"FcsBridge.ProjectOutlineWithinDeadline (cyclomatic 110): FcsBridge.ProjectOutlineWithinDeadline has cyclomatic complexity 110 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold \u2014 including the worst \u2014 and 1523 of the 1704 points over it (89%), 27.2\u00D7 the next-largest file (LspBridge.fs at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":13295}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5e8f80af98995ea71a568c29aa82755ee0c8644d2724bc3fc250641e348b96"}},{"ruleId":"D1","level":"warning","message":{"text":"FcsBridge.NugetMembers (cyclomatic 89): FcsBridge.NugetMembers has cyclomatic complexity 89 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold \u2014 including the worst \u2014 and 1523 of the 1704 points over it (89%), 27.2\u00D7 the next-largest file (LspBridge.fs at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":14369}}}],"partialFingerprints":{"codehealthFindingId/v1":"131dd6a5512955255d51205051989d297ede8a3c58171c77acd455a5d057fd6f"}},{"ruleId":"D1","level":"warning","message":{"text":"FcsBridge.RefactorImpact (cyclomatic 86): FcsBridge.RefactorImpact has cyclomatic complexity 86 (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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold \u2014 including the worst \u2014 and 1523 of the 1704 points over it (89%), 27.2\u00D7 the next-largest file (LspBridge.fs at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":16207}}}],"partialFingerprints":{"codehealthFindingId/v1":"0432f8ba4d69b145a1d958e514661a0239dcc08af52e39f6f88ea283b77f13e5"}},{"ruleId":"D1","level":"warning","message":{"text":"FcsBridge.TestsForSymbol (cyclomatic 83): FcsBridge.TestsForSymbol has cyclomatic complexity 83 (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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold \u2014 including the worst \u2014 and 1523 of the 1704 points over it (89%), 27.2\u00D7 the next-largest file (LspBridge.fs at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":10112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba52cd6b8e1f9efa627aed7fc13ac5e939b1d036be29be52f90f3e530b9c311a"}},{"ruleId":"D1","level":"warning","message":{"text":"FcsBridge.BuildFilePlan (cyclomatic 77): FcsBridge.BuildFilePlan has cyclomatic complexity 77 (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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold \u2014 including the worst \u2014 and 1523 of the 1704 points over it (89%), 27.2\u00D7 the next-largest file (LspBridge.fs at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":16920}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70fa0e8d5be53b6ec1f8b02d7f658e7cb91ca669d3ec6ec69e9e1c776755cbc"}},{"ruleId":"D1","level":"warning","message":{"text":"FcsBridge.PublicApi (cyclomatic 76): FcsBridge.PublicApi has cyclomatic complexity 76 (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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold \u2014 including the worst \u2014 and 1523 of the 1704 points over it (89%), 27.2\u00D7 the next-largest file (LspBridge.fs at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":14754}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3b4c3f19b7da92508b95e4a560a9778bb1a45d99342cddfb8e9511f93ba27c"}},{"ruleId":"D1","level":"warning","message":{"text":"FcsBridge.SignatureStatus (cyclomatic 68): FcsBridge.SignatureStatus has cyclomatic complexity 68 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold \u2014 including the worst \u2014 and 1523 of the 1704 points over it (89%), 27.2\u00D7 the next-largest file (LspBridge.fs at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":15138}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2371d1ba54c5df38ad062596546d12fb386fd59773da5a9613603cb8cfa311"}},{"ruleId":"D1","level":"warning","message":{"text":"FcsBridge.ResolveFastCheckExpectation (cyclomatic 62): FcsBridge.ResolveFastCheckExpectation has cyclomatic complexity 62 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold \u2014 including the worst \u2014 and 1523 of the 1704 points over it (89%), 27.2\u00D7 the next-largest file (LspBridge.fs at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":10858}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa721c961a52191788119a75b41b92e2beec0cbbf65062faade1a2d0d7197e7d"}},{"ruleId":"D1","level":"warning","message":{"text":"FcsBridge.DeadCode (cyclomatic 49): FcsBridge.DeadCode has cyclomatic complexity 49 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold \u2014 including the worst \u2014 and 1523 of the 1704 points over it (89%), 27.2\u00D7 the next-largest file (LspBridge.fs at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":17441}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3bab1e3cd81b84b890fd83e73a9b577ec1b69c34b1c62b908e99b0f32b96c08"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectHealth.createReport (cyclomatic 47): ProjectHealth.createReport has cyclomatic complexity 47 (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":"ProjectHealth.fs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fcb3004b24919d46fc265ea8f989a5fcc6f7826ed731b5660adf307e59ae681"}},{"ruleId":"D1","level":"warning","message":{"text":"FcsBridge.RecordFieldAudit (cyclomatic 46): FcsBridge.RecordFieldAudit has cyclomatic complexity 46 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold \u2014 including the worst \u2014 and 1523 of the 1704 points over it (89%), 27.2\u00D7 the next-largest file (LspBridge.fs at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":6364}}}],"partialFingerprints":{"codehealthFindingId/v1":"aefa3b7731a9777de240f25d5b098cad00e24388809818436940d1bfccf43af4"}},{"ruleId":"D1","level":"warning","message":{"text":"Program.mainCore (cyclomatic 43): Program.mainCore has cyclomatic complexity 43 (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":"Program.fs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd55ddff624be643c8d0b9662bcccaac162abcfdf9414d43920dd1925655808"}},{"ruleId":"D1","level":"warning","message":{"text":"FcsBridge.PositionIsUnsafe (cyclomatic 41): FcsBridge.PositionIsUnsafe has cyclomatic complexity 41 (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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold \u2014 including the worst \u2014 and 1523 of the 1704 points over it (89%), 27.2\u00D7 the next-largest file (LspBridge.fs at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":12889}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfb5aef4a39480253f0d94c29204f71967e95b9f4072a2ccd7e336647eb0df6"}},{"ruleId":"D1","level":"warning","message":{"text":"FsAutoCompleteBridge.SetProjectCore (cyclomatic 38): FsAutoCompleteBridge.SetProjectCore has cyclomatic complexity 38 (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":"LspBridge.fs"},"region":{"startLine":1951}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc89443073c14348a3479e487cf93a3393b7766bba7242f926b6ba89c2896c3"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckFsacSnapshotModule.ofDiagnosticsResponse (cyclomatic 35): CheckFsacSnapshotModule.ofDiagnosticsResponse has cyclomatic complexity 35 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold \u2014 including the worst \u2014 and 1523 of the 1704 points over it (89%), 27.2\u00D7 the next-largest file (LspBridge.fs at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5b7fe61c06e10d477db5e6fb22c521689735efc9533089e4d2192e1f82caf7"}},{"ruleId":"D1","level":"warning","message":{"text":"FcsBridge.SuggestOpen (cyclomatic 34): FcsBridge.SuggestOpen has cyclomatic complexity 34 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold \u2014 including the worst \u2014 and 1523 of the 1704 points over it (89%), 27.2\u00D7 the next-largest file (LspBridge.fs at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":15702}}}],"partialFingerprints":{"codehealthFindingId/v1":"207e80838a57daa49ee80117298fdb786f508b9b6a2fb3c1d7e9e074213c6a93"}},{"ruleId":"D1","level":"warning","message":{"text":"FcsBridge.FileOutlineCore (cyclomatic 33): FcsBridge.FileOutlineCore has cyclomatic complexity 33 (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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold \u2014 including the worst \u2014 and 1523 of the 1704 points over it (89%), 27.2\u00D7 the next-largest file (LspBridge.fs at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":5705}}}],"partialFingerprints":{"codehealthFindingId/v1":"2173c04e85c6ed841ce107bc6a827b36eb951c0d9a999eb3c3c731f650a97d17"}},{"ruleId":"D1","level":"warning","message":{"text":"FcsBridge.CheckCompileOrder (cyclomatic 32): FcsBridge.CheckCompileOrder has cyclomatic complexity 32 (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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold \u2014 including the worst \u2014 and 1523 of the 1704 points over it (89%), 27.2\u00D7 the next-largest file (LspBridge.fs at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":16005}}}],"partialFingerprints":{"codehealthFindingId/v1":"c869a5efa673169f81a798cd416a4ca56b49d578214b8ffd706cc003781ace9c"}},{"ruleId":"D1","level":"warning","message":{"text":"FsAutoCompleteBridge.DiagnosticsForContext (cyclomatic 31): FsAutoCompleteBridge.DiagnosticsForContext has cyclomatic complexity 31 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LspBridge.fs"},"region":{"startLine":2709}}}],"partialFingerprints":{"codehealthFindingId/v1":"766f4e28271f837478bdb5e64d1667532fbbc904cd177d4068187be54884d1b0"}},{"ruleId":"D1","level":"warning","message":{"text":"FcsBridge.TypeAtPosition (cyclomatic 29): FcsBridge.TypeAtPosition has cyclomatic complexity 29 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold \u2014 including the worst \u2014 and 1523 of the 1704 points over it (89%), 27.2\u00D7 the next-largest file (LspBridge.fs at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":12720}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6ea22d78df6848fe21d926a951bc07865bf03bb19f8f4db720b4761ed2a152"}},{"ruleId":"D1","level":"warning","message":{"text":"ProcessRunner.runAsyncWithOutputLimitCore (cyclomatic 27): ProcessRunner.runAsyncWithOutputLimitCore has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ProcessRunner.fs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"130537bb1ed43c183ed2815479b3806417033dc1d4f0aa3e396e90d7299f2706"}},{"ruleId":"D1","level":"warning","message":{"text":"FcsBridge.FindMemberUsages (cyclomatic 26): FcsBridge.FindMemberUsages has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold \u2014 including the worst \u2014 and 1523 of the 1704 points over it (89%), 27.2\u00D7 the next-largest file (LspBridge.fs at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":6203}}}],"partialFingerprints":{"codehealthFindingId/v1":"7468bfde09a3021b8343ce3e5e0d4452c1230284d1814ce1e3caf26fcbf99d8f"}},{"ruleId":"D1","level":"warning","message":{"text":"FcsBridge.ReviewScan (cyclomatic 25): FcsBridge.ReviewScan has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold \u2014 including the worst \u2014 and 1523 of the 1704 points over it (89%), 27.2\u00D7 the next-largest file (LspBridge.fs at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":17259}}}],"partialFingerprints":{"codehealthFindingId/v1":"4317eb0cca1580a4d1b033f11eb695c305bc64c5ff8e4711973bbf0049d98b09"}},{"ruleId":"D1","level":"warning","message":{"text":"ReviewScanner.scan (cyclomatic 24): ReviewScanner.scan has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold \u2014 including the worst \u2014 and 1523 of the 1704 points over it (89%), 27.2\u00D7 the next-largest file (LspBridge.fs at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":1738}}}],"partialFingerprints":{"codehealthFindingId/v1":"333db74c4154bc238d83ce78697ded87e5fb42f366796521f42ee54707f3837c"}},{"ruleId":"D1","level":"warning","message":{"text":"FsAutoCompleteBridge.DiagnosticFixes (cyclomatic 24): FsAutoCompleteBridge.DiagnosticFixes has cyclomatic complexity 24 (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":"LspBridge.fs"},"region":{"startLine":3251}}}],"partialFingerprints":{"codehealthFindingId/v1":"6533aa0ccd1bc51d344e14d3c9739f72c9ccf15b9a41cdec20cf67541f8a2698"}},{"ruleId":"D1","level":"warning","message":{"text":"Cursor.tryDecodeFind (cyclomatic 24): Cursor.tryDecodeFind has cyclomatic complexity 24 (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":"Cursor.fs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eba517638e2313b248475f3f1d8a4df2dbe38e88c6229b94f6d8c9b0d09ef65"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectHealth.analyzerSetupPreview (cyclomatic 23): ProjectHealth.analyzerSetupPreview has cyclomatic complexity 23 (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":"ProjectHealth.fs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6c460c51e6fd59565c6949af1d7e5824928f0fadbbd9f62785c174a785de54"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectFiles.classifyFile (cyclomatic 23): ProjectFiles.classifyFile has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ProjectFiles.fs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed05c116f240156b35cb41ab6699992aeec800bf082d509621d98cc2827ad1b1"}},{"ruleId":"D1","level":"warning","message":{"text":"FindResponseBudget.planResponse (cyclomatic 23): FindResponseBudget.planResponse has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Types.fs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"606effd18afd399b9002390b390dd26031cfd75614644fa9b2bc9e54d1819e6b"}},{"ruleId":"D1","level":"warning","message":{"text":"FcsBridge.FindPrivateSpan (cyclomatic 22): FcsBridge.FindPrivateSpan 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold \u2014 including the worst \u2014 and 1523 of the 1704 points over it (89%), 27.2\u00D7 the next-largest file (LspBridge.fs at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":12978}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7bacd232dca42b95a85aa7b70a18949a41e3b8fd6062c5ded66cf2a0f09c8b"}},{"ruleId":"D1","level":"warning","message":{"text":"FindInput.prepare (cyclomatic 22): FindInput.prepare has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FindInput.fs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"080ef7ef5f94d457a624c53fb32e6e73ca80360e177b323701cc8341df299b44"}},{"ruleId":"D1","level":"warning","message":{"text":"FcsBridge.FreshProjectCheck (cyclomatic 21): FcsBridge.FreshProjectCheck has cyclomatic complexity 21 (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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold \u2014 including the worst \u2014 and 1523 of the 1704 points over it (89%), 27.2\u00D7 the next-largest file (LspBridge.fs at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":10642}}}],"partialFingerprints":{"codehealthFindingId/v1":"f723d93f4c011c357933581a955b9d89136c7be074236ba028ea60eccd2b3097"}},{"ruleId":"D1","level":"warning","message":{"text":"FcsBridge.ReferencedSymbols (cyclomatic 21): FcsBridge.ReferencedSymbols has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold \u2014 including the worst \u2014 and 1523 of the 1704 points over it (89%), 27.2\u00D7 the next-largest file (LspBridge.fs at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":14163}}}],"partialFingerprints":{"codehealthFindingId/v1":"842087fba334879227585ba757f60f66d86fdf22511a0b4de4bc2f95e7f1237f"}},{"ruleId":"D1","level":"warning","message":{"text":"FcsBridge.ResolvePositionInFile (cyclomatic 21): FcsBridge.ResolvePositionInFile has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold \u2014 including the worst \u2014 and 1523 of the 1704 points over it (89%), 27.2\u00D7 the next-largest file (LspBridge.fs at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":6831}}}],"partialFingerprints":{"codehealthFindingId/v1":"9790e649d1f5dd4ed2e81dbff8d84a14309dcd6c4aba4c2aaf479c0ed021bf7e"}},{"ruleId":"D1","level":"warning","message":{"text":"FcsBridge.SymbolAtWord (cyclomatic 21): FcsBridge.SymbolAtWord has cyclomatic complexity 21 (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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold \u2014 including the worst \u2014 and 1523 of the 1704 points over it (89%), 27.2\u00D7 the next-largest file (LspBridge.fs at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":13146}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ec1df14d8524014d66fd2b39eaf9bdac16bfb6cfee297dfb4d9542773a6b14"}},{"ruleId":"D1","level":"warning","message":{"text":"Runner.Check (cyclomatic 19): Runner.Check has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ScriptChecking.fs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea699ca15918ce0a4b3d07193d6c2989a6011b7d69aec7e59dc359a5068d549"}},{"ruleId":"D1","level":"warning","message":{"text":"RenamePreviewShape.validateWorkspaceEdit (cyclomatic 19): RenamePreviewShape.validateWorkspaceEdit 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":"LspBridge.fs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39cd45d06a227977796aba17e74d291e56c318767d175a9817c7dcc0e6bc06b"}},{"ruleId":"D1","level":"warning","message":{"text":"FcsBridge.FindSymbol (cyclomatic 18): FcsBridge.FindSymbol has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold \u2014 including the worst \u2014 and 1523 of the 1704 points over it (89%), 27.2\u00D7 the next-largest file (LspBridge.fs at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":6653}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d009c8ee9190b00f1ab852930659d162033bbd8ae802d1e7411930879868767"}},{"ruleId":"D1","level":"warning","message":{"text":"SolutionParsing.discoverProjectsForFind (cyclomatic 18): SolutionParsing.discoverProjectsForFind has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ProjectFiles.fs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa76f6d366902f9de0747e7bd38ab24d9eadf9101e610a476098fe72f9dd814"}},{"ruleId":"D1","level":"warning","message":{"text":"FcsBridge.NugetTypes (cyclomatic 17): FcsBridge.NugetTypes has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: FcsBridge.fs holds 28 of the 49 methods over the threshold \u2014 including the worst \u2014 and 1523 of the 1704 points over it (89%), 27.2\u00D7 the next-largest file (LspBridge.fs at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":14260}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d6b1ad6fa6609988dc15d56cf70fa1c013d0d00ed108c19eeab492131ed748"}},{"ruleId":"D1","level":"warning","message":{"text":"MetadataAccessibility.candidateAssemblyPaths (cyclomatic 17): MetadataAccessibility.candidateAssemblyPaths has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"MetadataAccessibility.fs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"1092e6bc972322c76507cf67c1fa5a03036a2c5d2c2692856a05e82108ee024c"}},{"ruleId":"D1","level":"warning","message":{"text":"FsAutoCompleteBridge.RenamePreview (cyclomatic 17): FsAutoCompleteBridge.RenamePreview has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LspBridge.fs"},"region":{"startLine":3393}}}],"partialFingerprints":{"codehealthFindingId/v1":"e507cacad5d9afa6adb073635c5e65288ead22dc60b333d3ae11a2e66a5bffe9"}},{"ruleId":"D1","level":"warning","message":{"text":"ProcessContainment.Start (cyclomatic 17): ProcessContainment.Start has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ProcessRunner.fs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a387845464b1ec275e22f15d7be34b1a908feb23fff51bef0b3dfef1dcfa374"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstructorDiagnostics.collect (cyclomatic 16): ConstructorDiagnostics.collect has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ConstructorDiagnostics.fs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"17589774b711dffbfa150e829d4fd197977672c1d28354fe670e1cb4f29cc810"}},{"ruleId":"D1","level":"warning","message":{"text":"Collector.ObserveUses (cyclomatic 16): Collector.ObserveUses has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FindInventory.fs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"96814427803e5383f9144cbbc9c7a5d109f5eb35e2df41d14d3888238be8ea1c"}},{"ruleId":"D1","level":"warning","message":{"text":"DiagnosticIdentity.tryCanonicalFileKeyFromUri (cyclomatic 16): DiagnosticIdentity.tryCanonicalFileKeyFromUri 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":"LspBridge.fs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a89d04f5903b861a02cac04a18c737823a0b9cae15c90d90842b8c475e34d79"}},{"ruleId":"D1","level":"warning","message":{"text":"FsAutoCompleteBridge.StartLspUnsafe (cyclomatic 16): FsAutoCompleteBridge.StartLspUnsafe has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LspBridge.fs"},"region":{"startLine":2206}}}],"partialFingerprints":{"codehealthFindingId/v1":"720197cc150bfe7eb2258c37d03d6ebe9255a4a3221452036dd6b79eef5b2e5c"}},{"ruleId":"D2","level":"warning","message":{"text":"FcsBridge.FindCoreWithinDeadline (cognitive 2736): FcsBridge.FindCoreWithinDeadline has cognitive complexity 2736 (threshold 15). Drivers by points: if/else 275 (1532 pts), match/switch 73 (645 pts), error handling 28 (239 pts), loops 22 (228 pts), boolean chains 92 (nesting depth added 2246). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":7124}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b744c2da7279ad4d0f3624275d413caac927a7108538f568a32363512468781"}},{"ruleId":"D2","level":"warning","message":{"text":"FcsBridge.Check (cognitive 625): FcsBridge.Check has cognitive complexity 625 (threshold 15). Drivers by points: if/else 122 (290 pts), match/switch 54 (207 pts), error handling 17 (93 pts), boolean chains 25, loops 2 (10 pts) (nesting depth added 405). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":11188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b3a6182b29b46893642eb0bd5e4a07bc441b723a9f77ed1c9bc36e8f09b7b6"}},{"ruleId":"D2","level":"warning","message":{"text":"FcsBridge.NugetMembers (cognitive 338): FcsBridge.NugetMembers has cognitive complexity 338 (threshold 15). Drivers by points: if/else 33 (120 pts), error handling 21 (119 pts), match/switch 11 (49 pts), loops 6 (36 pts), boolean chains 14 (nesting depth added 253). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":14369}}}],"partialFingerprints":{"codehealthFindingId/v1":"b451d2ded01b92e03c23175a3d08f8ed5f7c72e42a9a6284eca73bc2305635dc"}},{"ruleId":"D2","level":"warning","message":{"text":"FcsBridge.TestsForSymbol (cognitive 249): FcsBridge.TestsForSymbol has cognitive complexity 249 (threshold 15). Drivers by points: if/else 48 (154 pts), match/switch 10 (37 pts), loops 6 (31 pts), boolean chains 17, error handling 2 (10 pts) (nesting depth added 166). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":10112}}}],"partialFingerprints":{"codehealthFindingId/v1":"16da672a6cd355288a251c0d1aa58598b89a11cbdc51204b69fee0033f784892"}},{"ruleId":"D2","level":"warning","message":{"text":"FcsBridge.SignatureStatus (cognitive 229): FcsBridge.SignatureStatus has cognitive complexity 229 (threshold 15). Drivers by points: error handling 15 (90 pts), if/else 33 (89 pts), match/switch 10 (39 pts), boolean chains 11 (nesting depth added 160). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":15138}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2c27aff33ec05099c89eda78e3a68aa041444096517ab12889aa373a282cc6"}},{"ruleId":"D2","level":"warning","message":{"text":"FcsBridge.RefactorImpact (cognitive 221): FcsBridge.RefactorImpact has cognitive complexity 221 (threshold 15). Drivers by points: if/else 56 (129 pts), match/switch 20 (59 pts), boolean chains 13, loops 2 (11 pts), error handling 5 (9 pts) (nesting depth added 125). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":16207}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d18cfcb6971c9954f7cea27739fc834e24d614857b5de91fd27820c7be010d"}},{"ruleId":"D2","level":"warning","message":{"text":"FcsBridge.PublicApi (cognitive 212): FcsBridge.PublicApi has cognitive complexity 212 (threshold 15). Drivers by points: if/else 48 (102 pts), error handling 24 (83 pts), match/switch 5 (15 pts), boolean chains 12 (nesting depth added 123). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":14754}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3cf62a9f98967aee8d2a32f5c372e029a80505412c2f348d112c602d9275b28"}},{"ruleId":"D2","level":"warning","message":{"text":"FcsBridge.ProjectOutlineWithinDeadline (cognitive 163): FcsBridge.ProjectOutlineWithinDeadline has cognitive complexity 163 (threshold 15). Drivers by points: match/switch 29 (61 pts), if/else 44 (59 pts), error handling 10 (18 pts), boolean chains 15, loops 5 (10 pts) (nesting depth added 60). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":13295}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8842a1e22171cc70efdeb7e1fd9b71162e35acda7df9d6aafb16093d5cdc13a"}},{"ruleId":"D2","level":"warning","message":{"text":"FcsBridge.BuildFilePlan (cognitive 141): FcsBridge.BuildFilePlan has cognitive complexity 141 (threshold 15). Drivers by points: if/else 46 (85 pts), match/switch 15 (34 pts), boolean chains 9, loops 4 (9 pts), error handling 2 (4 pts) (nesting depth added 65). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":16920}}}],"partialFingerprints":{"codehealthFindingId/v1":"0969013478338c1d977d2c4e5616496f7979c228a3ba5d65ecf37d6b513ef0e4"}},{"ruleId":"D2","level":"warning","message":{"text":"FcsBridge.RecordFieldAudit (cognitive 137): FcsBridge.RecordFieldAudit has cognitive complexity 137 (threshold 15). Drivers by points: match/switch 17 (64 pts), if/else 15 (48 pts), error handling 3 (15 pts), boolean chains 5, loops 1 (5 pts) (nesting depth added 96). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":6364}}}],"partialFingerprints":{"codehealthFindingId/v1":"7309ca76017f9f935c8345d62a9ce4fec0daf68f9cdfa7fa4f46c71d365b0561"}},{"ruleId":"D2","level":"warning","message":{"text":"FcsBridge.SuggestOpen (cognitive 135): FcsBridge.SuggestOpen has cognitive complexity 135 (threshold 15). Drivers by points: error handling 16 (79 pts), if/else 10 (27 pts), loops 4 (18 pts), match/switch 4 (10 pts), boolean chains 1 (nesting depth added 100). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":15702}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7e4ae924af569e3676b34ebcc0f454a39cc40843b860cc15cd7108576b6273"}},{"ruleId":"D2","level":"warning","message":{"text":"FcsBridge.CheckCompileOrder (cognitive 134): FcsBridge.CheckCompileOrder has cognitive complexity 134 (threshold 15). Drivers by points: match/switch 9 (56 pts), if/else 16 (55 pts), loops 3 (11 pts), error handling 2 (8 pts), boolean chains 4 (nesting depth added 100). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":16005}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09616f6ce40fe320cfaf1d7c5e79f72c8e20c8a5741979fe40036e8e5edc56a"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectHealth.createReport (cognitive 133): ProjectHealth.createReport has cognitive complexity 133 (threshold 15). Drivers by points: if/else 41 (100 pts), match/switch 7 (22 pts), boolean chains 7, error handling 1 (4 pts) (nesting depth added 77). 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":"ProjectHealth.fs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab2c04404379b109395fbaa70044244e86d3a372b14854042bf79c79dd1b4e3"}},{"ruleId":"D2","level":"warning","message":{"text":"FsAutoCompleteBridge.SetProjectCore (cognitive 128): FsAutoCompleteBridge.SetProjectCore has cognitive complexity 128 (threshold 15). Drivers by points: if/else 25 (102 pts), match/switch 4 (12 pts), boolean chains 9, loops 1 (5 pts) (nesting depth added 89). 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":"LspBridge.fs"},"region":{"startLine":1951}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5749809ee0eedae6e3efaded306ae2ac31fa467917e27755fd61bd7829f127c"}},{"ruleId":"D2","level":"warning","message":{"text":"FcsBridge.ResolveFastCheckExpectation (cognitive 110): FcsBridge.ResolveFastCheckExpectation has cognitive complexity 110 (threshold 15). Drivers by points: if/else 29 (50 pts), match/switch 13 (32 pts), error handling 5 (19 pts), loops 2 (6 pts), boolean chains 3 (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":10858}}}],"partialFingerprints":{"codehealthFindingId/v1":"0049cf596918b6e4ca0fc19b36ca467a86fec0aa439e0dd10ad8ef34d8944ad6"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.mainCore (cognitive 103): Program.mainCore has cognitive complexity 103 (threshold 15). Drivers by points: match/switch 17 (58 pts), if/else 14 (36 pts), error handling 3 (7 pts), boolean chains 2 (nesting depth added 67). 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":"Program.fs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d937e669281a2f7d82637bb83df11f58a95c15fc3ef5f4ea34b9211075ad0f"}},{"ruleId":"D2","level":"warning","message":{"text":"FcsBridge.DeadCode (cognitive 98): FcsBridge.DeadCode has cognitive complexity 98 (threshold 15). Drivers by points: match/switch 8 (32 pts), if/else 10 (31 pts), error handling 7 (22 pts), loops 2 (7 pts), boolean chains 6 (nesting depth added 65). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":17441}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ad1be0780a88b24167343dc81eec04c4a935645793297399356147f83190f2"}},{"ruleId":"D2","level":"warning","message":{"text":"FcsBridge.SymbolAtWord (cognitive 86): FcsBridge.SymbolAtWord has cognitive complexity 86 (threshold 15). Drivers by points: match/switch 8 (46 pts), if/else 13 (38 pts), boolean chains 2 (nesting depth added 63). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":13146}}}],"partialFingerprints":{"codehealthFindingId/v1":"65adef540ea5aa618387ef06f5d404bfd8f71fdf922ff09ee3ceccfb9f93c350"}},{"ruleId":"D2","level":"warning","message":{"text":"FcsBridge.TypeAtPosition (cognitive 67): FcsBridge.TypeAtPosition has cognitive complexity 67 (threshold 15). Drivers by points: match/switch 10 (33 pts), if/else 8 (17 pts), loops 3 (13 pts), boolean chains 4 (nesting depth added 42). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":12720}}}],"partialFingerprints":{"codehealthFindingId/v1":"78efec7e4f542e417a19545c284dce17467afbc8da22e2c7f26fa6b371c23b1d"}},{"ruleId":"D2","level":"warning","message":{"text":"FcsBridge.FileOutlineCore (cognitive 65): FcsBridge.FileOutlineCore has cognitive complexity 65 (threshold 15). Drivers by points: if/else 21 (39 pts), match/switch 5 (12 pts), boolean chains 8, loops 2 (6 pts) (nesting depth added 29). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":5705}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b5114406b51eb5c5333280233e7a101ba4c0fa0d2238f906a71213ac9dd474"}},{"ruleId":"D2","level":"warning","message":{"text":"FcsBridge.FindPrivateSpan (cognitive 57): FcsBridge.FindPrivateSpan has cognitive complexity 57 (threshold 15). Drivers by points: if/else 12 (33 pts), loops 3 (11 pts), boolean chains 7, match/switch 1 (6 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":12978}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91c20ff3971a2285460c661042e8ed5f2334eb97f9fff77899aefe8e06ed864"}},{"ruleId":"D2","level":"warning","message":{"text":"NugetPackageMap.packageAssembliesFromAssets (cognitive 56): NugetPackageMap.packageAssembliesFromAssets has cognitive complexity 56 (threshold 15). Drivers by points: match/switch 6 (31 pts), loops 4 (24 pts), error handling 1 (nesting depth added 45). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":2686}}}],"partialFingerprints":{"codehealthFindingId/v1":"a192a914a274011c4441ef6962e7dd144332148a215d6603737440037ed33f8d"}},{"ruleId":"D2","level":"warning","message":{"text":"FcsBridge.ReviewScan (cognitive 55): FcsBridge.ReviewScan has cognitive complexity 55 (threshold 15). Drivers by points: if/else 12 (26 pts), match/switch 7 (17 pts), loops 2 (7 pts), error handling 1 (4 pts), boolean chains 1 (nesting depth added 32). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":17259}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08dc35e780bc0dde96c240451bb31ae17e3fa5018c3c4e595d19a0af48fd838"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckFsacSnapshotModule.ofDiagnosticsResponse (cognitive 54): CheckFsacSnapshotModule.ofDiagnosticsResponse has cognitive complexity 54 (threshold 15). Drivers by points: match/switch 18 (29 pts), if/else 12 (19 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (nesting depth added 19). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6070cb46fc7c4841c1f71294cd2b5ffae9ea0a767847b57da6c25a73b5aed29"}},{"ruleId":"D2","level":"warning","message":{"text":"FcsBridge.ReferencedSymbols (cognitive 54): FcsBridge.ReferencedSymbols has cognitive complexity 54 (threshold 15). Drivers by points: error handling 4 (17 pts), if/else 5 (14 pts), match/switch 4 (11 pts), loops 2 (9 pts), boolean chains 3 (nesting depth added 36). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":14163}}}],"partialFingerprints":{"codehealthFindingId/v1":"57597bd0e68e0d0531e2f731b59ba3b0d4a9c62e37e92a179b7c22512c58a452"}},{"ruleId":"D2","level":"warning","message":{"text":"FcsBridge.PositionIsUnsafe (cognitive 53): FcsBridge.PositionIsUnsafe has cognitive complexity 53 (threshold 15). Drivers by points: if/else 19 (34 pts), boolean chains 12, loops 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":12889}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6bc4e1f0d9277a5ebba9597bab68c52c7d2a2f411fef8ad945ae67959cf36f"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectHealth.analyzerSetupPreview (cognitive 52): ProjectHealth.analyzerSetupPreview has cognitive complexity 52 (threshold 15). Drivers by points: if/else 8 (24 pts), match/switch 7 (20 pts), error handling 1 (5 pts), loops 1 (3 pts) (nesting depth added 35). 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":"ProjectHealth.fs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54545f8ba93318ebfe813a0bd85b230aebde26483ce03dc14ffa79bfbaaf70b"}},{"ruleId":"D2","level":"warning","message":{"text":"FsAutoCompleteBridge.DiagnosticsForContext (cognitive 51): FsAutoCompleteBridge.DiagnosticsForContext has cognitive complexity 51 (threshold 15). Drivers by points: if/else 13 (20 pts), match/switch 4 (13 pts), loops 4 (10 pts), error handling 5, boolean chains 3 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LspBridge.fs"},"region":{"startLine":2709}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f55554ca03d384514e77de6d4e3a796d3000aaa8811766211ae59fa87e6cb06"}},{"ruleId":"D2","level":"warning","message":{"text":"FcsBridge.FindMemberUsages (cognitive 45): FcsBridge.FindMemberUsages has cognitive complexity 45 (threshold 15). Drivers by points: match/switch 9 (27 pts), if/else 6 (10 pts), boolean chains 4, error handling 1 (4 pts) (nesting depth added 25). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":6203}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5663fb6377ec1cf77f17df7d42cb3c56c3a468e2dfecb597d236f09a62e301"}},{"ruleId":"D2","level":"warning","message":{"text":"FcsBridge.ResolvePositionInFile (cognitive 45): FcsBridge.ResolvePositionInFile has cognitive complexity 45 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 5 (19 pts), error handling 1 (5 pts), boolean chains 2 (nesting depth added 29). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":6831}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f06625ca30e57724788041d6db2df6581bb191e709d70fd668b42a95277db7"}},{"ruleId":"D2","level":"warning","message":{"text":"SolutionParsing.discoverProjectsForFind (cognitive 45): SolutionParsing.discoverProjectsForFind has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 3 (8 pts), error handling 2 (6 pts), match/switch 1 (5 pts), boolean chains 1 (nesting depth added 26). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ProjectFiles.fs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"809fb2a6010821e52e4b4c0739d1ebe7200306d608147dbe72bb05b3cb9234fe"}},{"ruleId":"D2","level":"warning","message":{"text":"FcsBridge.NugetTypes (cognitive 44): FcsBridge.NugetTypes has cognitive complexity 44 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 4 (11 pts), loops 2 (9 pts), error handling 1 (4 pts), boolean chains 1 (nesting depth added 29). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":14260}}}],"partialFingerprints":{"codehealthFindingId/v1":"6afb12f1eb88cc4a10a525f5472e77f8281ac13a3c144368d209b2332178507a"}},{"ruleId":"D2","level":"warning","message":{"text":"FsAutoCompleteBridge.DiagnosticFixes (cognitive 41): FsAutoCompleteBridge.DiagnosticFixes has cognitive complexity 41 (threshold 15). Drivers by points: match/switch 10 (26 pts), if/else 7 (9 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 20). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LspBridge.fs"},"region":{"startLine":3251}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e6746f0a878101b9096fec3158de09b992ba45cd307078c285fd51e72423f2"}},{"ruleId":"D2","level":"warning","message":{"text":"FcsBridge.AnalyzerDiagnostics (cognitive 40): FcsBridge.AnalyzerDiagnostics has cognitive complexity 40 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 4 (15 pts), loops 1 (5 pts), boolean chains 1 (nesting depth added 27). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":17725}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bddff188fa1c540c6ea2a9a317c49bee38d6e74f1e32b3888227cc591b26bb0"}},{"ruleId":"D2","level":"warning","message":{"text":"FcsBridge.FreshProjectCheck (cognitive 40): FcsBridge.FreshProjectCheck has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 3 (11 pts), error handling 6, boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":10642}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f1d76ce7c04d714f59a7178e33d945ca1d6bfecfe105faad2516b09c8115da"}},{"ruleId":"D2","level":"warning","message":{"text":"Cursor.tryDecodeFind (cognitive 40): Cursor.tryDecodeFind has cognitive complexity 40 (threshold 15). Drivers by points: match/switch 5 (19 pts), if/else 6 (14 pts), error handling 2 (4 pts), boolean chains 3 (nesting depth added 24). 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":"Cursor.fs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c1db92b07b47ebb5089dbc1bdc24c70d06bee8ebcae27081eef7b99070e635"}},{"ruleId":"D2","level":"warning","message":{"text":"RenamePreviewShape.validateWorkspaceEdit (cognitive 39): RenamePreviewShape.validateWorkspaceEdit has cognitive complexity 39 (threshold 15). Drivers by points: match/switch 9 (37 pts), if/else 2 (nesting depth added 28). 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":"LspBridge.fs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2478c76dac26d4c06304484bee1b92c56c70e15bab25fdf5d03994443338ea"}},{"ruleId":"D2","level":"warning","message":{"text":"LspResponseShape.codeActionEdits (cognitive 36): LspResponseShape.codeActionEdits has cognitive complexity 36 (threshold 15). Drivers by points: match/switch 7 (27 pts), loops 2 (9 pts) (nesting depth added 27). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LspBridge.fs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"069ce875e7abaa92210e2dac1e025627ec26a6099a963dc6270c2c3ed794555d"}},{"ruleId":"D2","level":"warning","message":{"text":"MetadataAccessibility.tryCreateMemberResolver (cognitive 34): MetadataAccessibility.tryCreateMemberResolver has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (12 pts), match/switch 2 (6 pts), boolean chains 1, error handling 1 (nesting depth added 19). 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":"MetadataAccessibility.fs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed136c6e9518414ba288e964b5e96630e3668404adbf722bc09373e5d27ead5c"}},{"ruleId":"D2","level":"warning","message":{"text":"RenamePreviewShape.extractFileEdits (cognitive 33): RenamePreviewShape.extractFileEdits has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 7 (26 pts), loops 2 (7 pts) (nesting depth added 24). 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":"LspBridge.fs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"74939b1125bed6c9e5fda4b03cd4eefc83f6f9e388727c2b151bd210dc00cd76"}},{"ruleId":"D2","level":"warning","message":{"text":"FcsBridge.ValidateSnippet (cognitive 31): FcsBridge.ValidateSnippet has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 2 (7 pts), error handling 1 (4 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":5444}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff1df6c437451ad7c9be52c502956df19d171a8019d032e7159ed31c334b9a2"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectFiles.classifyFile (cognitive 31): ProjectFiles.classifyFile has cognitive complexity 31 (threshold 15). Drivers by points: if/else 21 (25 pts), boolean chains 6 (nesting depth added 4). 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":"ProjectFiles.fs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb99de4ee0f4e9c8717095eeaffdf8cd0f55eb32f77095f24b40b50e6364628"}},{"ruleId":"D2","level":"warning","message":{"text":"FindResponseBudget.planResponse (cognitive 31): FindResponseBudget.planResponse has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 4, match/switch 2 (4 pts), loops 2 (3 pts) (nesting depth added 7). 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":"Types.fs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca387aed6a6a5ca1f6753cbcdfdb1d3074fbbb10ba8bd5d0c16f899f545bee8"}},{"ruleId":"D2","level":"warning","message":{"text":"Runner.Check (cognitive 30): Runner.Check has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (12 pts), error handling 5 (10 pts), match/switch 3 (6 pts), boolean chains 2 (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":"ScriptChecking.fs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a325cd6ef3c223bb3a7a350140599c659c5a295b1a84a5254d58fdaf01c9497"}},{"ruleId":"D2","level":"warning","message":{"text":"FsAutoCompleteBridge.RenamePreview (cognitive 28): FsAutoCompleteBridge.RenamePreview has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (13 pts), error handling 6 (9 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LspBridge.fs"},"region":{"startLine":3393}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fc52471ed76f7b01c58c7578c7ad874cf615cb56f7ff2a2d0de9953a11ad84"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessContainment.Start (cognitive 28): ProcessContainment.Start has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (18 pts), match/switch 2 (9 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ProcessRunner.fs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d673c19ff5eca5feac6ba182490e4d555913c6086f4f54d1877d748503a025b"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceDirectoryDiscovery.filesBelowWithContinuation (cognitive 27): WorkspaceDirectoryDiscovery.filesBelowWithContinuation has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (8 pts), error handling 2 (5 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ProjectFiles.fs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a0174a9b075f12d1b23a2cacad91ee1217b19a6082650e859e8f27e3530e71"}},{"ruleId":"D2","level":"warning","message":{"text":"FsAutoCompleteBridge.Formatting (cognitive 25): FsAutoCompleteBridge.Formatting has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 4 (8 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 10). 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":"LspBridge.fs"},"region":{"startLine":3125}}}],"partialFingerprints":{"codehealthFindingId/v1":"c65af983233a1ea419fdb80ec4abd61dc353100256196bf94cd63b61d4fdf4e4"}},{"ruleId":"D2","level":"warning","message":{"text":"FcsBridge.FindSymbol (cognitive 24): FcsBridge.FindSymbol has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 5 (13 pts), if/else 4 (8 pts), boolean chains 3 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":6653}}}],"partialFingerprints":{"codehealthFindingId/v1":"111e410c64711c1eaba998b70475b973ad0353c955c613d6059d00764cfbda80"}},{"ruleId":"D2","level":"warning","message":{"text":"FcsBridge.ProjectSymbolUses (cognitive 24): FcsBridge.ProjectSymbolUses has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 5 (13 pts), if/else 4 (9 pts), boolean chains 2 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":6111}}}],"partialFingerprints":{"codehealthFindingId/v1":"155a9e1f5d1fd2763b3dabc060f8dfdc14ec8f4bb16df61b725517a6c67253b7"}},{"ruleId":"D2","level":"warning","message":{"text":"FcsBridge.ResolveProjectOptions (cognitive 24): FcsBridge.ResolveProjectOptions has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 6 (14 pts), error handling 4 (10 pts) (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":5199}}}],"partialFingerprints":{"codehealthFindingId/v1":"f082bf028d50910ef37ee4ea9512b8a24da4ac27915514c5ed47b40a8b4bbcb5"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector.ObserveUses (cognitive 24): Collector.ObserveUses has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 2 (6 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 10). 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":"FindInventory.fs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad233bcd58a6dad451eb12a394082c7172ea30edaa44b930e1c14bf6d02db3c"}},{"ruleId":"D2","level":"warning","message":{"text":"MetadataAccessibility.candidateAssemblyPaths (cognitive 23): MetadataAccessibility.candidateAssemblyPaths has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 4, error handling 2 (4 pts) (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"MetadataAccessibility.fs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df353014eeb4592baed946211f6377787f70995dde55fff7441d5cd0be1c688"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessRunner.unixProcessGroupHasLiveMembers (cognitive 23): ProcessRunner.unixProcessGroupHasLiveMembers has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), error handling 2 (5 pts), boolean chains 4 (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":"ProcessRunner.fs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a81c35ecadf374c9959c2b3d8d4b8656bd7286008140bb5893c7307e5b6297"}},{"ruleId":"D2","level":"warning","message":{"text":"LspResponseShape.globToRegex (cognitive 22): LspResponseShape.globToRegex has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 4, loops 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":"LspBridge.fs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f0e5bc8343c0d7ba625b9d0c989fcfd15f4f412d465e71c9a9d7d123b61460"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckDiagnostics.boundResponse (cognitive 21): CheckDiagnostics.boundResponse has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (8 pts), match/switch 1 (3 pts) (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":"CheckDiagnostics.fs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e0cf48eea0b1ef7eb1e7693097c0de7f6f97391e383e5d9765d83a2d31e0e1"}},{"ruleId":"D2","level":"warning","message":{"text":"DiagnosticsTarget.PublishDiagnostics (cognitive 21): DiagnosticsTarget.PublishDiagnostics has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 2 (7 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LspBridge.fs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a1c5c1282407763e8798a7a47985ed0e2c1189fda5a7098fed331b1476f995"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessRunner.runAsyncWithOutputLimitCore (cognitive 21): ProcessRunner.runAsyncWithOutputLimitCore has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 8 (11 pts), error handling 3 (4 pts), if/else 3, loops 2 (3 pts) (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":"ProcessRunner.fs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"13135e430d552951778be63ff099fced1edd25900972f1b6ffac0ab5f8ab0379"}},{"ruleId":"D2","level":"warning","message":{"text":"FcsBridge.CreateFilePlan (cognitive 20): FcsBridge.CreateFilePlan has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 1 (5 pts), loops 1 (4 pts), match/switch 1 (nesting depth added 11). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":16865}}}],"partialFingerprints":{"codehealthFindingId/v1":"86549b4259d63275d49ef4c276dda3306d05ab8ad0e1418cba45cf26cc064066"}},{"ruleId":"D2","level":"warning","message":{"text":"FindInput.prepare (cognitive 20): FindInput.prepare has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 3, match/switch 1 (nesting depth added 3). 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":"FindInput.fs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57368e3d7830c8221c06ae0a877bd03b03ac522f268e628f34ec5e1e5696e1c"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstructorDiagnostics.fromProjectResults (cognitive 19): ConstructorDiagnostics.fromProjectResults has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), error handling 2 (6 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 10). 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":"ConstructorDiagnostics.fs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2b5fa3315d30b633f7f558a3b38c518a78e5ac6280217606cfbb5ab92d4494"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.runLimitedWithFindDeadlineRetainedCore (cognitive 18): Program.runLimitedWithFindDeadlineRetainedCore has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 1 (3 pts), match/switch 1 (2 pts), boolean chains 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":"Program.fs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"6422f2537746f5c1c890c58fb6c2a5f6165a596f955502c23fa7e15035d4ab31"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.main (cognitive 18): Program.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 4). 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":"Program.fs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"390373ba71479bfefc2b60db3d6500982e6096ca298b6f21d03af62468879652"}},{"ruleId":"D2","level":"warning","message":{"text":"AnalysisSnapshotKey.create (cognitive 18): AnalysisSnapshotKey.create has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 3 (5 pts), loops 3 (nesting depth added 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":2016}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9758cd7c83d5efaf0270685379b84824963f39310be329c620b2f0007715836"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstructorDiagnostics.collect (cognitive 18): ConstructorDiagnostics.collect has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (7 pts), if/else 4, loops 2 (4 pts), error handling 1 (2 pts), boolean chains 1 (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":"ConstructorDiagnostics.fs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"e407dce42bc50bfd6621d2f806f042cc457a7be4230aa72eb58914ea177f00a9"}},{"ruleId":"D2","level":"warning","message":{"text":"FsAutoCompleteBridge.Diagnostics (cognitive 18): FsAutoCompleteBridge.Diagnostics has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 6 (10 pts), if/else 3 (6 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LspBridge.fs"},"region":{"startLine":3040}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25a25850f4c3b427ea487867635b22206f6d47df1e850418553cc837b43e058"}},{"ruleId":"D2","level":"warning","message":{"text":"FsAutoCompleteBridge.StartLspUnsafe (cognitive 18): FsAutoCompleteBridge.StartLspUnsafe has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), error handling 2, loops 2, match/switch 1 (nesting depth added 3). 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":"LspBridge.fs"},"region":{"startLine":2206}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b35897de36fdb874b46eeb831dcfbc7b39c3fc00211269dcf4c6b6634d77a9"}},{"ruleId":"D2","level":"warning","message":{"text":"AnalyzerDiagnostics.parseSarif (cognitive 18): AnalyzerDiagnostics.parseSarif has cognitive complexity 18 (threshold 15). Drivers by points: loops 2 (7 pts), match/switch 2 (7 pts), error handling 1 (2 pts), if/else 2 (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":"AnalyzerDiagnostics.fs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84b4301b467e17ddac243fd96b704e661c53836bc2244efae808275d3b59889"}},{"ruleId":"D2","level":"warning","message":{"text":"FindDeadlineResponse.beforeDiscovery (cognitive 17): FindDeadlineResponse.beforeDiscovery has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15 (16 pts), error handling 1 (nesting depth added 1). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"41cae853ac2c41f7ced39622032aa95e3e9901a737748e62b59278a08aaa7f8f"}},{"ruleId":"D2","level":"warning","message":{"text":"ReviewScanner.scan (cognitive 17): ReviewScanner.scan has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), match/switch 4 (6 pts), loops 2 (4 pts) (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":1738}}}],"partialFingerprints":{"codehealthFindingId/v1":"263098c74326b4684702c411f01cc19ae4ee4032fbde2fcdf50aa89fcc3aa10f"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.applyCliOverrides (cognitive 16): Program.applyCliOverrides has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 1 (2 pts) (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":"Program.fs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85a2ecd9661e41e2f3acd5dca244e449788cfed3b748b88ff99185222931abd"}},{"ruleId":"D2","level":"warning","message":{"text":"NugetPackageMap.candidates (cognitive 16): NugetPackageMap.candidates has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 1 (nesting depth added 3). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":2881}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ff9a6b9dec8d7289d6d6588ce36db75ba5b5924f0e2671007061b31d0bab24"}},{"ruleId":"D2","level":"warning","message":{"text":"FcsBridge.BuildSignatureHelpResult (cognitive 16): FcsBridge.BuildSignatureHelpResult has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), match/switch 3 (6 pts), error handling 1 (4 pts) (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: FcsBridge.fs holds 38 of the 76 methods over the threshold \u2014 including the worst \u2014 and 5926 of the 6657 points over it (89%), 21.1\u00D7 the next-largest file (LspBridge.fs at 281). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":15593}}}],"partialFingerprints":{"codehealthFindingId/v1":"24aa2c055409c7f4520fa310b0fe2c1f0dc99921a88458d01e85b7d09b2996e2"}},{"ruleId":"D2","level":"warning","message":{"text":"LspResponseShape.filterDiagnosticsBySeverity (cognitive 16): LspResponseShape.filterDiagnosticsBySeverity has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 1 (5 pts), loops 1 (2 pts), boolean chains 1 (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":"LspBridge.fs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9d281e73ffdf2203e46509420fee16fbc768c5aa1a0106525ba5e455189296"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectHealth.listSolutionProjects (cognitive 16): ProjectHealth.listSolutionProjects has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, 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":"ProjectHealth.fs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b734a208abe42b0919ce6664000d0547e0b2e612177d26da0e0c2b5d8d2c15a"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceDirectoryDiscovery.filesBelow (cognitive 16): WorkspaceDirectoryDiscovery.filesBelow has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (8 pts), error handling 2 (5 pts), if/else 1 (3 pts) (nesting depth added 9). 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":"ProjectFiles.fs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b540799c38699692fec51fb4e943c045f7f370c734b4bb7f133addc4f241d31"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./FcsBridge.fs: FileTooLong \u2014 13346 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 12846 over it, 26.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4959392ab9a86376c1b00ac3c50a0a94930dc85a1f4e70050619ec4d8ab718a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./LspBridge.fs: FileTooLong \u2014 2620 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2120 over it, 5.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LspBridge.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a308fd15b415f1cb78cab5d25762bf77db694d689f08626cdd525f1ec4da4996"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FcsBridge: TooManyMethods \u2014 68 methods. The bar is 30 methods; this is 38 over it, 2.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":2957}}}],"partialFingerprints":{"codehealthFindingId/v1":"da275c1f492fab56956798387b3236bb44eda5c2fba7a7dec24dd52883f7cc07"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./Program.fs: FileTooLong \u2014 1069 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 569 over it, 2.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Program.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab3e22f67df003113527b44009045d59c23d58f451a5fe4de9e9844b9abd414"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./ProjectHealth.fs: FileTooLong \u2014 1011 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 42 functions. The bar is 500 significant lines; this is 511 over it, 2.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ProjectHealth.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"336f2406db2dd8a919e9a3bd470c98ab951e10ac33ef8255049a8586075e58e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./ProcessRunner.fs: FileTooLong \u2014 758 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 38 functions. The bar is 500 significant lines; this is 258 over it, 1.52\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ProcessRunner.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a582c19c36a0bb575d2ec6ff84fc9ffd4181ffbd68ef0671e44c49db86cfc46c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./Types.fs: FileTooLong \u2014 621 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 121 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Types.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"062cc12025809c3984f180462e01502b23de94f20911d94124c39b9530fad428"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./ProjectFiles.fs: FileTooLong \u2014 618 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 118 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ProjectFiles.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5776724b3e77a0c529b4acffb3443e3abd2e3c6d6444c87f7ce50343e1f37656"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FsAutoCompleteBridge: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LspBridge.fs"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"189cc392a2e3b4d8253bc158c10924e124006e5c71a0ac86c5eeafa0776b09f1"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: Verify.Xunit: Verify.Xunit 31.12.5 \u2014 Legacy \u2014 the publisher\u0027s replacement is \u0060Verify.XunitV3\u0060; that is the next major line under a new package id, so the move is a breaking rename rather than a version bump \u2014 budget for API changes in the code that uses it, not only the reference swap."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/FsLangMcp.Tests/FsLangMcp.Tests.fsproj"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf99145017f5a240a4ba5d7c5c05d1cac881add7f172454bff7084cffedda576"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: xunit: xunit 2.9.3 \u2014 Legacy \u2014 the publisher\u0027s replacement is \u0060xunit.v3\u0060; that is the next major line under a new package id, so the move is a breaking rename rather than a version bump \u2014 budget for API changes in the code that uses it, not only the reference swap."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/FsLangMcp.Tests/FsLangMcp.Tests.fsproj"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37c8c0e8046c9e8358e976373216abfb78e9fdef63ed53d3edcaa7d2238edcd"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: xunit.assert: xunit.assert 2.9.3 \u2014 Legacy \u2014 the publisher\u0027s replacement is \u0060xunit.v3.assert\u0060; migrate the reference to it. It is resolved transitively in tests/FsLangMcp.Tests/packages.lock.json: no project of this repository references it directly, so the move is on the reference that pulls it in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/FsLangMcp.Tests/packages.lock.json"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a81b3415a95c91c8be45845dd30748533ede150bd93bf08cf359b82ffa9857c"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: xunit.core: xunit.core 2.9.3 \u2014 Legacy \u2014 the publisher\u0027s replacement is \u0060xunit.v3.core\u0060; migrate the reference to it. It is resolved transitively in tests/FsLangMcp.Tests/packages.lock.json: no project of this repository references it directly, so the move is on the reference that pulls it in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/FsLangMcp.Tests/packages.lock.json"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb47be325f8ee64ba4fcdc813253115fb33bef899fbfbf863a54048d7e0ff4b"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: xunit.extensibility.core: xunit.extensibility.core 2.9.3 \u2014 Legacy \u2014 the publisher\u0027s replacement is \u0060xunit.v3.extensibility.core\u0060; migrate the reference to it. It is resolved transitively in tests/FsLangMcp.Tests/packages.lock.json: no project of this repository references it directly, so the move is on the reference that pulls it in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/FsLangMcp.Tests/packages.lock.json"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b242802e94dfbf8d1c3eea673a183e679d3e51ea5f719956b4caa097b995125"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: xunit.extensibility.execution: xunit.extensibility.execution 2.9.3 \u2014 Legacy \u2014 the publisher\u0027s replacement is \u0060xunit.v3.extensibility.core\u0060; migrate the reference to it. It is resolved transitively in tests/FsLangMcp.Tests/packages.lock.json: no project of this repository references it directly, so the move is on the reference that pulls it in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/FsLangMcp.Tests/packages.lock.json"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"7400ed73f55bd25267fc24d24e7a16e41ddfd913238b94b72115076db04a47c8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: FcsBridge.fs: FcsBridge.fs changed 29 times in last 90 days, max cyclomatic complexity 519 in FcsBridge.FindCoreWithinDeadline at line 7124. 21 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 13:50:50 \u002B03:00\u0027 --until=\u00272026-11-12 13:50:50 \u002B03:00\u0027 --full-history --no-merges -- FcsBridge.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":7124}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5da9a7ee84d9c433ee548000d79dd779231c4ba965d4b1e2aadad3aeb3724d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Program.fs: Program.fs changed 21 times in last 90 days, max cyclomatic complexity 43 in Program.mainCore at line 621. 14 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 13:50:50 \u002B03:00\u0027 --until=\u00272026-11-12 13:50:50 \u002B03:00\u0027 --full-history --no-merges -- Program.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Program.fs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"592bd9d5a1a2ff83912b29dfd39837818d3dd4801ac0e878d728f570c3fc1a9e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Types.fs: Types.fs changed 13 times in last 90 days, max cyclomatic complexity 23 in FindResponseBudget.planResponse at line 967. 8 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 13:50:50 \u002B03:00\u0027 --until=\u00272026-11-12 13:50:50 \u002B03:00\u0027 --full-history --no-merges -- Types.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Types.fs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bf398c637cc404e71ae714fc32cecfa8c4d50b43833298b0ea01a18367e4ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ProjectHealth.fs: ProjectHealth.fs changed 5 times in last 90 days, max cyclomatic complexity 47 in ProjectHealth.createReport at line 639. 4 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 13:50:50 \u002B03:00\u0027 --until=\u00272026-11-12 13:50:50 \u002B03:00\u0027 --full-history --no-merges -- ProjectHealth.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ProjectHealth.fs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4619c470740c1c4dba8e886b6983d56de5f968f742d4609f062b4eadb12faf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: LspBridge.fs: LspBridge.fs changed 5 times in last 90 days, max cyclomatic complexity 38 in FsAutoCompleteBridge.SetProjectCore at line 1951. 4 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 13:50:50 \u002B03:00\u0027 --until=\u00272026-11-12 13:50:50 \u002B03:00\u0027 --full-history --no-merges -- LspBridge.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LspBridge.fs"},"region":{"startLine":1951}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba750f271fef2e7d7bbf67c674cc75d178a80d1a5c6d8b7c6e9c5bba73e518b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ProjectFiles.fs: ProjectFiles.fs changed 8 times in last 90 days, max cyclomatic complexity 23 in ProjectFiles.classifyFile at line 335. 7 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 13:50:50 \u002B03:00\u0027 --until=\u00272026-11-12 13:50:50 \u002B03:00\u0027 --full-history --no-merges -- ProjectFiles.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ProjectFiles.fs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ffb9e5bb1966bb974d1e7ccb019855d43a93b11f979bf4a62876e9ca43f9b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ProcessRunner.fs: ProcessRunner.fs changed 4 times in last 90 days, max cyclomatic complexity 27 in ProcessRunner.runAsyncWithOutputLimitCore at line 702. 4 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 13:50:50 \u002B03:00\u0027 --until=\u00272026-11-12 13:50:50 \u002B03:00\u0027 --full-history --no-merges -- ProcessRunner.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ProcessRunner.fs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7502b37e5a40b3066555088d00db45187d2694dc0ae464f8404f30d5619eca"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: Tools.fs: Tools.fs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is Tools.toolResultWithHealthCheck at line 36), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: address bounded agent UX failures (#232)\u201D; \u201Cfix: budget public_api and file_outline pages by rendered size; hint the narrowing in-band (#212)\u201D; \u201Cfix: return a typed sdk_not_found error instead of a lost transport on unsatisfiable SDK pins (#200)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 13:50:50 \u002B03:00\u0027 --until=\u00272026-11-12 13:50:50 \u002B03:00\u0027 --full-history --no-merges -- Tools.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tools.fs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1572b9a48debe9d95ab6fb34c2311a6b648f9ec66b148125055307c6b404d3"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060tryDecode returns Error for valid Base64 but not JSON\u0060 spells \u0060JSON\u0060 where 38 names in the project spell it \u0060Json\u0060: 38 of 40 names in project FsLangMcp spell the token \u0060Json\u0060 (38 of 40; unit: names in project FsLangMcp containing \u0060Json\u0060). Peers: AnalyzerDiagnostics.diagnosticToJson (AnalyzerDiagnostics.fs:178); AnalyzerDiagnostics.configuredNotRunResponse(packagesJson) (AnalyzerDiagnostics.fs:241); AnalyzerDiagnostics.runFailedResponse(packagesJson) (AnalyzerDiagnostics.fs:256); AnalyzerDiagnostics.okResponse(packagesJson) (AnalyzerDiagnostics.fs:268); Cursor.writeCanonicalJson (Cursor.fs:342). Rename to \u0060tryDecode returns Error for valid Base64 but not Json\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/FsLangMcp.Tests/OutlinePaginationTests.fs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b3d51e746a7fa0246dab618076a291104da82f035da892864cc71babed7148"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060jobj with null value produces null in JSON\u0060 spells \u0060JSON\u0060 where 38 names in the project spell it \u0060Json\u0060: 38 of 40 names in project FsLangMcp spell the token \u0060Json\u0060 (38 of 40; unit: names in project FsLangMcp containing \u0060Json\u0060). Peers: AnalyzerDiagnostics.diagnosticToJson (AnalyzerDiagnostics.fs:178); AnalyzerDiagnostics.configuredNotRunResponse(packagesJson) (AnalyzerDiagnostics.fs:241); AnalyzerDiagnostics.runFailedResponse(packagesJson) (AnalyzerDiagnostics.fs:256); AnalyzerDiagnostics.okResponse(packagesJson) (AnalyzerDiagnostics.fs:268); Cursor.writeCanonicalJson (Cursor.fs:342). Rename to \u0060jobj with null value produces null in Json\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/FsLangMcp.Tests/TypesToolsTests.fs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"b886bba281dd7edffd0925e087ec825fecd34c6b67ffd847a147c9c958cc2c8c"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 2 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is \u0060(repository root)\u0060 (28267 LoC, 175 module-visible types across 2 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D27","level":"note","message":{"text":"Scattered collaborators: 94 % of calls cross a namespace and only 45 % of collaborators are co-located \u2014 group each feature\u0027s code into a vertical slice so a call\u0027s collaborators sit together."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5aad4a4530bac3928d3a065a664be89d023ecfc865f9bf79ac05754b3bffe322"}},{"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":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"63bea608fd98974a5a312ed989a52706c988bfdbb0e401f0928bf7ee4f23d1b9"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-552","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"19d4cbb252a3e4997007fe629a8fde65a6a24e745494155b47ed43cbf523f1eb"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb304bfca793660f2a5eee9182f22e635edca03862cf56f54fce93b4fea01e78"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"M3","level":"note","message":{"text":"No src/ separation: Production code is mixed at the repository root with everything else the repository holds, so nothing marks which files are the product."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fdf7f5b24e313364d10170a5c2542959902fe0d26ed70edef3eaa10ec5bcdb1d"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 1/2 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060docs\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add \u0060semgrep --config=auto\u0060 plus gitleaks for committed secrets (F# is not a CodeQL language and has no language-specific SAST engine) as a CI step. What was searched, so you can tell an absence from a miss: the 5 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/ci.yml"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060RecordFieldAudit\u0060 is async and calls Async.RunSynchronously \u2014 a blocking call inside async code stalls the thread-pool thread the workflow runs on, and every continuation queued behind it for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":6547}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f271afa1fe550aeb3e1e74b6316d65dfcb40e3f32977481724baf90833b3a21"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060FindCoreWithinDeadline\u0060 is async and calls Async.RunSynchronously \u2014 a blocking call inside async code stalls the thread-pool thread the workflow runs on, and every continuation queued behind it for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"FcsBridge.fs"},"region":{"startLine":8128}}}],"partialFingerprints":{"codehealthFindingId/v1":"7216ca516232964eddf321fd360a2299f8cc2fab26f02c53ff8e38c10887b9f8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060String.Equals(ext, \u0022.fs\u0022, StringComparison.OrdinalIgnoreCase) || String.Equals(ext, \u0022.fsi\u0022, StringComparison.OrdinalIgnoreCase)\u0060 appears character-identically in 2 files \u2014 ProjectFiles.fs, ProjectHealth.fs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ProjectFiles.fs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72b3737e89d8b65a2a9b016d7c589cbc045e1c50d7138aa51b6d3dab845cd4c"}}],"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-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-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-552","guid":"3492436b-eca2-9c54-9ba3-5dade427c903","name":"Files or Directories Accessible to External Parties","shortDescription":{"text":"Files or Directories Accessible to External Parties"},"helpUri":"https://cwe.mitre.org/data/definitions/552.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":8,"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."]}]}