{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}},{"id":"D39","name":"IL Efficiency","shortDescription":{"text":"IL Efficiency"},"helpUri":"https://codehealth.canine.dev/dimensions/D39"},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"]}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"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":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"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":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"Parser.parseProgramWithSourceName (cyclomatic 418): Parser.parseProgramWithSourceName has cyclomatic complexity 418 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/Parser.fs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b567513ce5cc12b6f48622ed7aa90354c86f81ff2ffe72739fb822d686e58e"}},{"ruleId":"D1","level":"warning","message":{"text":"Eval.evalExpr (cyclomatic 125): Eval.evalExpr has cyclomatic complexity 125 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/Eval.fs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d2b0078cfcd83caaa64893a9b46ab1970f95137d0bd2aefc20685424fefce4"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInfer.inferExpr (cyclomatic 115): TypeInfer.inferExpr has cyclomatic complexity 115 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/TypeInfer.fs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"f80c8e3004b96b290eb531264da9e8f666af9718babc86965b62a8bf629ab698"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.tokenizeWithSourceName (cyclomatic 103): Lexer.tokenizeWithSourceName has cyclomatic complexity 103 (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":"src/FScript.Language/Lexer.fs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"272de9ceca244579a83ced1917f2fae82ee8d3e97528e4254153a4044856d6a2"}},{"ruleId":"D1","level":"warning","message":{"text":"LspHandlers.handleDefinition (cyclomatic 82): LspHandlers.handleDefinition has cyclomatic complexity 82 (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":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a297011c003198bef316af0fef353c310d9d6ba49f43fe64b76f98e8a043c07"}},{"ruleId":"D1","level":"warning","message":{"text":"Eval.patternMatch (cyclomatic 63): Eval.patternMatch has cyclomatic complexity 63 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/Eval.fs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"7191442465e782aa5d2f2c738a5e62530e1dffceaf2328fe127cc78128b9b25f"}},{"ruleId":"D1","level":"warning","message":{"text":"LspHandlers.handleReferences (cyclomatic 63): LspHandlers.handleReferences has cyclomatic complexity 63 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a3b0e8a38b7e2bbedcb8e55fbb0ddcadd25c9ccdb8efee823403b2c07cf660"}},{"ruleId":"D1","level":"warning","message":{"text":"LspHandlers.handleSignatureHelp (cyclomatic 55): LspHandlers.handleSignatureHelp has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"575a78640328f9b323c06ee57374cdebcb48abe59eff6616760e92ba115595ba"}},{"ruleId":"D1","level":"warning","message":{"text":"Eval.valueMatchesTypeRef (cyclomatic 51): Eval.valueMatchesTypeRef has cyclomatic complexity 51 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/Eval.fs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4981858beec0cb3a47a657d80caeb61e05035187f067524942c8d6d7ae7115"}},{"ruleId":"D1","level":"warning","message":{"text":"IncludeResolver.rewriteModuleScopedStatements (cyclomatic 50): IncludeResolver.rewriteModuleScopedStatements has cyclomatic complexity 50 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/IncludeResolver.fs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ee8eb20fb496e5c20a5d86aa6c10892cf56063e07a07455e0ced85cff54e69"}},{"ruleId":"D1","level":"warning","message":{"text":"LspSymbols.buildSymbolsFromProgram (cyclomatic 44): LspSymbols.buildSymbolsFromProgram has cyclomatic complexity 44 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"3040794af5c6b9e65c7d7e2b6438651d7444c219f9d91b50598f8842d53b6829"}},{"ruleId":"D1","level":"warning","message":{"text":"LspSymbols.buildResolvedLocalDefinitions (cyclomatic 44): LspSymbols.buildResolvedLocalDefinitions has cyclomatic complexity 44 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f689aec97c77c59e86bc403dd68cbe2498dbe57f4f2b00b5ec5faa409ffbda6"}},{"ruleId":"D1","level":"warning","message":{"text":"LspSymbols.collectPatternVariableSpans (cyclomatic 42): LspSymbols.collectPatternVariableSpans has cyclomatic complexity 42 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":1939}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a3cda2cea3cb30957227e8bd258b38882d0dbcdc173989b2f13bb7cb41d818"}},{"ruleId":"D1","level":"warning","message":{"text":"LspSymbols.buildLocalBindings (cyclomatic 41): LspSymbols.buildLocalBindings has cyclomatic complexity 41 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":1661}}}],"partialFingerprints":{"codehealthFindingId/v1":"19179867787caa59f72a632187aeefa2a5eac7ce53d6c394cb25a2131ee4db7d"}},{"ruleId":"D1","level":"warning","message":{"text":"LspSymbols.buildCallArgumentHints (cyclomatic 40): LspSymbols.buildCallArgumentHints has cyclomatic complexity 40 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":2074}}}],"partialFingerprints":{"codehealthFindingId/v1":"a388af142cbb3d5b07250b79add722a0ba595ee3d27ebcbb300fa78ab73a13b8"}},{"ruleId":"D1","level":"warning","message":{"text":"LspServer.HandleRequest (cyclomatic 38): LspServer.HandleRequest 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":"src/FScript.LanguageServer/LspServer.cs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"af505424c57f93682c6eb005ba72d60fa237d03faf92c95bf4f5235842210004"}},{"ruleId":"D1","level":"warning","message":{"text":"LspSymbols.inferLocalTypesFromReturnedRecordFields (cyclomatic 36): LspSymbols.inferLocalTypesFromReturnedRecordFields has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: LspSymbols.collectVariableOccurrences (cyclomatic 39) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9424cade77a4bd641f7bd229f727a7250fcc7b284ad6e1a672d2f5a0c75768"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInfer.inferProgramWithExternsRawAndLocals (cyclomatic 33): TypeInfer.inferProgramWithExternsRawAndLocals has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/TypeInfer.fs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f1aaf4b8e6021b1e5140561cb3516d6516d4d9fffa0c787c6936441c9d2381"}},{"ruleId":"D1","level":"warning","message":{"text":"LspSymbols.tryResolveTypeTargetAtPosition (cyclomatic 33): LspSymbols.tryResolveTypeTargetAtPosition has cyclomatic complexity 33 (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 is NOT this file\u0027s highest cyclomatic complexity: LspSymbols.collectVariableOccurrences (cyclomatic 39) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":2779}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3fc840b50e03f093d76dd128725d84b243147bb310ee3ec040cf0a30b28248"}},{"ruleId":"D1","level":"warning","message":{"text":"LspSymbols.inferBestEffort (cyclomatic 31): LspSymbols.inferBestEffort has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: LspSymbols.collectVariableOccurrences (cyclomatic 39) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"301550e71442d76f92ed3fdb11b7c5cef71495cd78a02910743a69b3d228a411"}},{"ruleId":"D1","level":"warning","message":{"text":"JavaScript.valueFromJs (cyclomatic 31): JavaScript.valueFromJs has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.JavaScript/Library.fs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"000a6f586933dfd7dbd8c3f7108fe8c09a97212d0ac3c780c26f58a6c63c8950"}},{"ruleId":"D1","level":"warning","message":{"text":"Program.resolveExternalFunctions (cyclomatic 30): Program.resolveExternalFunctions has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript/Program.fs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c36add170ba0615585c7e66838ad0ad4077386ebc32db61b7d6fa34eb6e5f35"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInfer.inferPattern (cyclomatic 29): TypeInfer.inferPattern has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/TypeInfer.fs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9780b529ac1e1f29cae5caba9ef768d05d9edccc01ea7a0cab3cea1e4ff0ee0"}},{"ruleId":"D1","level":"warning","message":{"text":"Eval.evalProgramWithExternsState (cyclomatic 28): Eval.evalProgramWithExternsState has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/Eval.fs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"a152eb06070bd51c9b0604ee6c5e47c30e52a2c7d7564bfef350a853822fafe2"}},{"ruleId":"D1","level":"warning","message":{"text":"HostDecode.decodeJson (cyclomatic 28): HostDecode.decodeJson has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Runtime/Decode.fs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8aa4c7d5609b48744c1e32bc220efc880cba6208debe5e857c7ac17ccfe4a7d"}},{"ruleId":"D1","level":"warning","message":{"text":"LspSymbols.tryResolveLocalBindingFromRecordFieldAssignmentAtPosition (cyclomatic 27): LspSymbols.tryResolveLocalBindingFromRecordFieldAssignmentAtPosition has cyclomatic complexity 27 (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 is NOT this file\u0027s highest cyclomatic complexity: LspSymbols.collectVariableOccurrences (cyclomatic 39) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":1245}}}],"partialFingerprints":{"codehealthFindingId/v1":"45dfcdb3b9ec999a47b2948eb6e896a4b437fae70ddea9d8c320b99e88880ff4"}},{"ruleId":"D1","level":"warning","message":{"text":"LspHandlers.handleTypeDefinition (cyclomatic 26): LspHandlers.handleTypeDefinition 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"104a07daf88e58d429c5dd76f294e9a67d5f49a853a9f2e848c269a346fe79ed"}},{"ruleId":"D1","level":"warning","message":{"text":"LspSymbols.makeCompletionItems (cyclomatic 26): LspSymbols.makeCompletionItems has cyclomatic complexity 26 (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 is NOT this file\u0027s highest cyclomatic complexity: LspSymbols.collectVariableOccurrences (cyclomatic 39) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":3055}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8985a6896ac83ec30e8cd5e17c0e6f40839bd5871431797797c4be220c0108"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeTypeBridge.toValue (cyclomatic 26): RuntimeTypeBridge.toValue 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.TypeProvider/ScriptRuntime.fs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"516cad34f8f3af7c8e4986fc620d51af097dae8c75c79a12f63777793e76812d"}},{"ruleId":"D1","level":"warning","message":{"text":"AstJson.toJsonNodeInternal (cyclomatic 25): AstJson.toJsonNodeInternal has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/AstJson.fs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7672547181f61ea2e40a3bc6c4931e902eb95ad985de2397f77507ca9bac0a3a"}},{"ruleId":"D1","level":"warning","message":{"text":"HostDecode.decodeXmlValue (cyclomatic 25): HostDecode.decodeXmlValue has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Runtime/Decode.fs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec331e1f8b8ae30ed7747cfab1d4b2f1881c14859af760ca4206e5681f0dc7e"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInfer.unify (cyclomatic 24): TypeInfer.unify 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":"src/FScript.Language/TypeInfer.fs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d31588866eb554c44ff182dd9c02c2e7e04dc444c4e7bd582121a8e8f9029c9"}},{"ruleId":"D1","level":"warning","message":{"text":"LspHandlers.scanSemanticTokens (cyclomatic 24): LspHandlers.scanSemanticTokens has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c7d1e4db85844786a5fdcc4d21dc150ff1e624454675ef7924e248aeb1562e"}},{"ruleId":"D1","level":"warning","message":{"text":"sandbox.Sandbox (cyclomatic 24): sandbox.Sandbox has cyclomatic complexity 24 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. 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":"website/src/pages/sandbox.tsx"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"093d57fa208de259b1855bf89d3868beb33a6b3ec0ea3fd0226fdadd81c6415f"}},{"ruleId":"D1","level":"warning","message":{"text":"Pretty.valueToString (cyclomatic 23): Pretty.valueToString has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/Pretty.fs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d614b224190605ac543a933faf81c0967a94096a9d7b71d26e22e00f6d66d54"}},{"ruleId":"D1","level":"warning","message":{"text":"LspSymbols.tryResolveTypeNameForQualifier (cyclomatic 23): LspSymbols.tryResolveTypeNameForQualifier has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: LspSymbols.collectVariableOccurrences (cyclomatic 39) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":2527}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c0c92bfb9fa17616ec80a664d96291dffb22871595a815d70101ecb7e26efd"}},{"ruleId":"D1","level":"warning","message":{"text":"Program.runRepl (cyclomatic 23): Program.runRepl has cyclomatic complexity 23 (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":"src/FScript/Program.fs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"11973bfc206377fffa7eea1e83fa02a118c23f35a74decf413197f394942d9a1"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.readInterpolatedRaw (cyclomatic 22): Lexer.readInterpolatedRaw 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 is NOT this file\u0027s highest cyclomatic complexity: Lexer.keywordToken (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/Lexer.fs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31b8276f984a19a780a7744d4c45e0688f28bbe5440624d9fb8d98979807372"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeInfer.typeFromRef (cyclomatic 20): TypeInfer.typeFromRef has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/TypeInfer.fs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4d58745ec9eafa72b40786d98017a53d794616f3275c1b8e7245794757c648"}},{"ruleId":"D1","level":"warning","message":{"text":"LspHandlers.handleInlayHints (cyclomatic 19): LspHandlers.handleInlayHints has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"8159fc3165e2c099a88941951c4ecada95ae26fa5571f82eb96fc17b7e84f8b8"}},{"ruleId":"D1","level":"warning","message":{"text":"LspSymbols.tryResolveLocalBindingAtPosition (cyclomatic 19): LspSymbols.tryResolveLocalBindingAtPosition has cyclomatic complexity 19 (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. This is NOT this file\u0027s highest cyclomatic complexity: LspSymbols.collectVariableOccurrences (cyclomatic 39) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":2894}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb632423165a129e19c98ebfdc08c9bb3a42a7b509614e84f41e276099e684cf"}},{"ruleId":"D1","level":"warning","message":{"text":"HostEncode.encodeJsonValue (cyclomatic 19): HostEncode.encodeJsonValue has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Runtime/Decode.fs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef169d43c132443fe17d278dd715848306d911c5bd2ed9a2701aa1f71aa7351"}},{"ruleId":"D1","level":"warning","message":{"text":"HostEncode.populateXmlElement (cyclomatic 19): HostEncode.populateXmlElement has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Runtime/Decode.fs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89ef857f4dc15f4f050a1271735e67495d41114aefc28f79ca751398f080745"}},{"ruleId":"D1","level":"warning","message":{"text":"LspSymbols.analyzeDocument (cyclomatic 18): LspSymbols.analyzeDocument has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: LspSymbols.collectVariableOccurrences (cyclomatic 39) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":2202}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1542efdfd92ddd668c1abd2978c9918158eda1e7965addac51e2007e19ee02"}},{"ruleId":"D1","level":"warning","message":{"text":"LspSymbols.buildParameterTypeHints (cyclomatic 17): LspSymbols.buildParameterTypeHints has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: LspSymbols.collectVariableOccurrences (cyclomatic 39) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":1807}}}],"partialFingerprints":{"codehealthFindingId/v1":"b099b4d5f1341684f66bc5d333991049c675d646dc4f23b38219f2d1306105a8"}},{"ruleId":"D1","level":"warning","message":{"text":"LspSymbols.buildFunctionReturnTypeHints (cyclomatic 17): LspSymbols.buildFunctionReturnTypeHints has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: LspSymbols.collectVariableOccurrences (cyclomatic 39) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"289a61881a4c4cc36edaf1f78dc2a45686bed6c962a285646adaec2c9911e875"}},{"ruleId":"D1","level":"warning","message":{"text":"LspSymbols.splitTopLevelSemicolons (cyclomatic 17): LspSymbols.splitTopLevelSemicolons 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. This is NOT this file\u0027s highest cyclomatic complexity: LspSymbols.collectVariableOccurrences (cyclomatic 39) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":2430}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeca193e8aa36ee8863669a8a47b624feaf8361ef186b70e2594c10ee56b2e01"}},{"ruleId":"D1","level":"warning","message":{"text":"Program.main (cyclomatic 17): Program.main 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":"src/FScript/Program.fs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7a14a24b4ede6c219fb32ca8a59e48c5801ac6b2fe49cb755c7c4705c4b80b"}},{"ruleId":"D1","level":"warning","message":{"text":"activate (cyclomatic 17): activate has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 10 function literals inside it that branch (lines 662, 597, 619, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vscode-fscript/extension.js"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"5007992d2abe6dcdb0b49b6c866e7ac39ac2ec94acdb30e07e21ff14c3f1cfc9"}},{"ruleId":"D1","level":"warning","message":{"text":"LspHandlers.classifyToken (cyclomatic 16): LspHandlers.classifyToken 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":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"003bc1a59383325dcb20d5cdc233810f17296365150a7b1aadfb07d0c0fa1be8"}},{"ruleId":"D1","level":"warning","message":{"text":"LspHandlers.splitTopLevelArrows (cyclomatic 16): LspHandlers.splitTopLevelArrows 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":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82be7d018b064a10423e90719ec98d92b62bc17cad368f5e952be2ff38a14ae"}},{"ruleId":"D1","level":"warning","message":{"text":"LspSymbols.tryResolveRecordLiteralFunctionReturnTypeTarget (cyclomatic 16): LspSymbols.tryResolveRecordLiteralFunctionReturnTypeTarget 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. This is NOT this file\u0027s highest cyclomatic complexity: LspSymbols.collectVariableOccurrences (cyclomatic 39) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":2722}}}],"partialFingerprints":{"codehealthFindingId/v1":"749e136bd1172987d8ab8d9e6a272ec97230fd73a1227327a168ae1506109218"}},{"ruleId":"D1","level":"warning","message":{"text":"LspSymbols.tryGetLocalVariableHoverInfo (cyclomatic 16): LspSymbols.tryGetLocalVariableHoverInfo 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. This is NOT this file\u0027s highest cyclomatic complexity: LspSymbols.collectVariableOccurrences (cyclomatic 39) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":2961}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55f51ab8532c99efe32fc3e67a278a3f896a0dad3c1b2cde31c9549c3517fa9"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeTypeBridge.fromValue (cyclomatic 16): RuntimeTypeBridge.fromValue 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":"src/FScript.TypeProvider/ScriptRuntime.fs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa2f1244d52436b4d82ec994ec7d0fe20fcfa075194f1adc862b5aa7db69532"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.parseProgramWithSourceName (cognitive 849): Parser.parseProgramWithSourceName has cognitive complexity 849 (threshold 15). Drivers by points: if/else 221 (503 pts), match/switch 75 (181 pts), loops 57 (128 pts), boolean chains 34, error handling 1 (3 pts) (nesting depth added 461). 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":"src/FScript.Language/Parser.fs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"620a0c904f78be9be616a7125d5512fbe06c25f2a8255116e19a60abd70d990d"}},{"ruleId":"D2","level":"warning","message":{"text":"LspHandlers.handleDefinition (cognitive 290): LspHandlers.handleDefinition has cognitive complexity 290 (threshold 15). Drivers by points: match/switch 22 (153 pts), if/else 23 (76 pts), loops 7 (42 pts), boolean chains 19 (nesting depth added 219). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3f91ef79d5b9742e89f82e1f76e7eef6d0f3f04554406cb2e5d568000e584b"}},{"ruleId":"D2","level":"warning","message":{"text":"Eval.evalExpr (cognitive 161): Eval.evalExpr has cognitive complexity 161 (threshold 15). Drivers by points: match/switch 40 (110 pts), if/else 21 (41 pts), boolean chains 5, loops 2 (5 pts) (nesting depth added 93). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/Eval.fs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2df5a38a58cb60f44468be903ba27da3d9a8de363535608347333ddc41ba5b"}},{"ruleId":"D2","level":"warning","message":{"text":"LspHandlers.handleReferences (cognitive 158): LspHandlers.handleReferences has cognitive complexity 158 (threshold 15). Drivers by points: if/else 25 (73 pts), match/switch 18 (73 pts), boolean chains 7, error handling 1 (5 pts) (nesting depth added 107). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee519505ee9a28b6d0234696c7904f8216605a670347200aa9058a00f4da2f1a"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInfer.inferExpr (cognitive 129): TypeInfer.inferExpr has cognitive complexity 129 (threshold 15). Drivers by points: match/switch 33 (92 pts), loops 11 (22 pts), if/else 9 (15 pts) (nesting depth added 76). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/TypeInfer.fs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27e79e9ef2ac48d0f5a2fa98d28dcdcb0f34c8574764b87cc7231f2688bcd2f"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.tokenizeWithSourceName (cognitive 123): Lexer.tokenizeWithSourceName has cognitive complexity 123 (threshold 15). Drivers by points: if/else 24 (58 pts), boolean chains 30, loops 8 (23 pts), match/switch 3 (12 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/Lexer.fs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc83eff9ad69a73d5361eec39e83bb027c6f218eb0182a0a58a85e5d8074ae6"}},{"ruleId":"D2","level":"warning","message":{"text":"LspHandlers.handleSignatureHelp (cognitive 122): LspHandlers.handleSignatureHelp has cognitive complexity 122 (threshold 15). Drivers by points: if/else 20 (60 pts), match/switch 13 (38 pts), loops 5 (18 pts), boolean chains 6 (nesting depth added 78). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5462aac5894493337ea5ebb1885dddf52e63b66f786172966fc28a6f7cb3a3"}},{"ruleId":"D2","level":"warning","message":{"text":"Eval.patternMatch (cognitive 100): Eval.patternMatch has cognitive complexity 100 (threshold 15). Drivers by points: match/switch 23 (74 pts), if/else 14 (23 pts), boolean chains 2, loops 1 (nesting depth added 60). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/Eval.fs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e31b3bc8a8f175700ac50cee6c21c347dbf232f2f90a2b60c47022062a8483"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.resolveExternalFunctions (cognitive 95): Program.resolveExternalFunctions has cognitive complexity 95 (threshold 15). Drivers by points: if/else 21 (46 pts), match/switch 7 (32 pts), error handling 4 (15 pts), boolean chains 2 (nesting depth added 61). 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":"src/FScript/Program.fs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b2aa2e97db972be06955729dc18579bfb1e100bbb27fd2d77579d7a7007252"}},{"ruleId":"D2","level":"warning","message":{"text":"LspHandlers.tryResolveIncludeLocation (cognitive 68): LspHandlers.tryResolveIncludeLocation has cognitive complexity 68 (threshold 15). Drivers by points: if/else 16 (50 pts), match/switch 2 (10 pts), error handling 1 (7 pts), boolean chains 1 (nesting depth added 48). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76482b78d7a1df1abbab48f1fa7b883a4346590648eb0cb9de4c103159a7ef1"}},{"ruleId":"D2","level":"warning","message":{"text":"LspHandlers.handleCodeAction (cognitive 63): LspHandlers.handleCodeAction has cognitive complexity 63 (threshold 15). Drivers by points: match/switch 8 (41 pts), if/else 2 (9 pts), error handling 1 (7 pts), loops 2 (6 pts) (nesting depth added 50). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":1871}}}],"partialFingerprints":{"codehealthFindingId/v1":"614c6809854b563488055266edd065522e15bf13d1f84324361e0e14caf63eb0"}},{"ruleId":"D2","level":"warning","message":{"text":"LspSymbols.tryResolveTypeTargetAtPosition (cognitive 61): LspSymbols.tryResolveTypeTargetAtPosition has cognitive complexity 61 (threshold 15). Drivers by points: if/else 10 (21 pts), match/switch 8 (20 pts), loops 4 (14 pts), boolean chains 6 (nesting depth added 33). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":2779}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72d961ba32e56d45e39e85f825ebcbfd8ff3836b588e6d43a1c44fb383f74ed"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.runRepl (cognitive 59): Program.runRepl has cognitive complexity 59 (threshold 15). Drivers by points: error handling 9 (36 pts), if/else 6 (14 pts), match/switch 4 (8 pts), loops 1 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript/Program.fs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"e821e4af2a4bd7b95439d7a5ba8f12518e1638fb59e263681b37756ba7d0f087"}},{"ruleId":"D2","level":"warning","message":{"text":"LspSymbols.makeCompletionItems (cognitive 57): LspSymbols.makeCompletionItems has cognitive complexity 57 (threshold 15). Drivers by points: if/else 13 (26 pts), match/switch 11 (23 pts), error handling 1 (4 pts), loops 2 (4 pts) (nesting depth added 30). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":3055}}}],"partialFingerprints":{"codehealthFindingId/v1":"d929b832b9e30fa89370d8aa7dc29115d845ad179644eec3d36d6df028ecc49a"}},{"ruleId":"D2","level":"warning","message":{"text":"LspServer.HandleRequest (cognitive 54): LspServer.HandleRequest has cognitive complexity 54 (threshold 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.LanguageServer/LspServer.cs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb04b8d01ebdfbbe6b07832322fa56ba5cc6e2597d5c0d8b47047781e9765e0"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInfer.inferProgramWithExternsRawAndLocals (cognitive 51): TypeInfer.inferProgramWithExternsRawAndLocals has cognitive complexity 51 (threshold 15). Drivers by points: match/switch 10 (28 pts), if/else 9 (15 pts), loops 3 (7 pts), error handling 1 (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":"src/FScript.Language/TypeInfer.fs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"883f63199f8fa0cca04d55c863de937f1a41f4d8ed175bac3781f709c0a54681"}},{"ruleId":"D2","level":"warning","message":{"text":"LspSymbols.buildSymbolsFromProgram (cognitive 51): LspSymbols.buildSymbolsFromProgram has cognitive complexity 51 (threshold 15). Drivers by points: match/switch 13 (20 pts), if/else 7 (13 pts), loops 5 (12 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"6055f9f8ab76821f58cfe9a9cf871df11ac2099c8397f06ad26da35ab2658708"}},{"ruleId":"D2","level":"warning","message":{"text":"LspHandlers.scanSemanticTokens (cognitive 49): LspHandlers.scanSemanticTokens has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (27 pts), loops 5 (15 pts), boolean chains 7 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a9c3459504ee6828d433f553bca9e86f150bdfec27d2243600749e7d0ac7f9"}},{"ruleId":"D2","level":"warning","message":{"text":"LspHandlers.handleTypeDefinition (cognitive 47): LspHandlers.handleTypeDefinition has cognitive complexity 47 (threshold 15). Drivers by points: match/switch 11 (33 pts), if/else 4 (12 pts), boolean chains 2 (nesting depth added 30). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"90cc119e3a7b6ec361aacb939516ce52919b079a32838d149e81dcaacad20b61"}},{"ruleId":"D2","level":"warning","message":{"text":"LspSymbols.tryResolveRecordLiteralBindingTypeTarget (cognitive 47): LspSymbols.tryResolveRecordLiteralBindingTypeTarget has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (36 pts), loops 1 (7 pts), boolean chains 3, match/switch 1 (nesting depth added 28). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":2684}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff44ffb214b05cdfc657837f35b1311465e61fa56367b6437aff5fc542b0561"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.readInterpolatedRaw (cognitive 39): Lexer.readInterpolatedRaw has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 3 (12 pts), boolean chains 2, loops 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":"src/FScript.Language/Lexer.fs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d392e0a63ed4bf5cd627e16fa02d6017c2d0c5b93a0752c7bdd41d10af1ad3"}},{"ruleId":"D2","level":"warning","message":{"text":"AstJson.toJsonNodeInternal (cognitive 39): AstJson.toJsonNodeInternal has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 5 (15 pts), match/switch 1 (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/AstJson.fs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3a1452052434c1f69b739653c7d2fbb13aa7c5c8631bc00de9a6dd11af76a5"}},{"ruleId":"D2","level":"warning","message":{"text":"LspHandlers.handleInlayHints (cognitive 37): LspHandlers.handleInlayHints has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 3 (9 pts), boolean chains 6 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"854d42af23a7af8b7aac4309683f14f2eeb6abfae2c0b3a359436419a355e266"}},{"ruleId":"D2","level":"warning","message":{"text":"LspHandlers.handleHover (cognitive 37): LspHandlers.handleHover has cognitive complexity 37 (threshold 15). Drivers by points: match/switch 6 (27 pts), if/else 4 (10 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":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"888af2214ae64c553d0b4ce62b3891b35098b14887919be295001e92b7f76e92"}},{"ruleId":"D2","level":"warning","message":{"text":"HostDecode.decodeJson (cognitive 37): HostDecode.decodeJson has cognitive complexity 37 (threshold 15). Drivers by points: match/switch 7 (19 pts), if/else 8 (13 pts), loops 2 (4 pts), boolean chains 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Runtime/Decode.fs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"bafbc4f92f96240983d36617efe68c7b0165d67a751ba3dc73ee21ba09390c0c"}},{"ruleId":"D2","level":"warning","message":{"text":"LspSymbols.tryResolveLocalBindingFromRecordFieldAssignmentAtPosition (cognitive 36): LspSymbols.tryResolveLocalBindingFromRecordFieldAssignmentAtPosition has cognitive complexity 36 (threshold 15). Drivers by points: boolean chains 15, if/else 9 (15 pts), loops 1 (3 pts), match/switch 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":1245}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c87e4c1fd56198d5a1f23dc5e83cc8191e8216d16e36de1cb0d2d6e5da9b15e"}},{"ruleId":"D2","level":"warning","message":{"text":"LspSymbols.tryResolveRecordLiteralCallArgTypeTarget (cognitive 36): LspSymbols.tryResolveRecordLiteralCallArgTypeTarget has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 2 (10 pts), boolean chains 4, match/switch 1 (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":2651}}}],"partialFingerprints":{"codehealthFindingId/v1":"e677c2c296b4dd80abced347cd190627cf1951ae7f3dc594ab8ce84c502987dd"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeTypeBridge.toValue (cognitive 35): RuntimeTypeBridge.toValue has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 9 (20 pts), if/else 9 (15 pts) (nesting depth added 17). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.TypeProvider/ScriptRuntime.fs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9d64f9caf6ce1a1d47cf8dd4dbb120d745b3ee7ffab0b07a09fbc0f5b937d2"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInfer.unify (cognitive 34): TypeInfer.unify has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 5 (16 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/TypeInfer.fs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c4ecb3ebb03983bf02c8aa71109accc3e57d566cb4e861a037646329581c2c"}},{"ruleId":"D2","level":"warning","message":{"text":"LspSymbols.tryResolveTypeNameForQualifier (cognitive 33): LspSymbols.tryResolveTypeNameForQualifier has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 6 (13 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":2527}}}],"partialFingerprints":{"codehealthFindingId/v1":"828a2b441dafaa224f7b75b28d985cf7129f4765538c1bc91ab76e912e73de08"}},{"ruleId":"D2","level":"warning","message":{"text":"LspSymbols.inferBestEffort (cognitive 32): LspSymbols.inferBestEffort has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 8 (17 pts), loops 3 (9 pts), if/else 3 (5 pts), error handling 1 (nesting depth added 17). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"633676686c1e31f5e0c4d2ed57cd04a0166295d0fde4c9fbe99fa819f9b15089"}},{"ruleId":"D2","level":"warning","message":{"text":"JavaScript.valueFromJs (cognitive 32): JavaScript.valueFromJs has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 6 (24 pts), if/else 5 (7 pts), boolean chains 1 (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":"src/FScript.JavaScript/Library.fs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc237bb3590135c6d63c9a4044fc37626a4d403dfdc57e71614305b9d5a2b84"}},{"ruleId":"D2","level":"warning","message":{"text":"HostDecode.decodeXmlValue (cognitive 30): HostDecode.decodeXmlValue has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 9 (20 pts), if/else 4 (6 pts), loops 2 (4 pts) (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Runtime/Decode.fs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc258cbbddde4fe8ef96e7d29abaf6c2c664220ab63c96954386ce7ae22fe37"}},{"ruleId":"D2","level":"warning","message":{"text":"LspHandlers.isLikelyLetDeclarationContext (cognitive 29): LspHandlers.isLikelyLetDeclarationContext has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (11 pts), boolean chains 5, match/switch 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc79c113ab242fca61908385ff1902f0bd4a1c7349851910fd0aea334813247"}},{"ruleId":"D2","level":"warning","message":{"text":"HostEncode.populateXmlElement (cognitive 29): HostEncode.populateXmlElement has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 2 (5 pts), loops 2 (4 pts) (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Runtime/Decode.fs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a002908cc80d62efabdf9feec70b91c73a7cffaa556c4a4f39320fc9f7bf64c"}},{"ruleId":"D2","level":"warning","message":{"text":"LspSymbols.buildResolvedLocalDefinitions (cognitive 27): LspSymbols.buildResolvedLocalDefinitions has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 10 (17 pts), if/else 6 (9 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":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"066f3d7f31e30dacc936cba1a6954177301f66a7d0f35f53692fdd3f666ec6f5"}},{"ruleId":"D2","level":"warning","message":{"text":"LspSymbols.buildFunctionReturnTypeHints (cognitive 27): LspSymbols.buildFunctionReturnTypeHints has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 7 (11 pts), if/else 8 (10 pts), loops 2 (6 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":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2123eb2f5f2eab4bd559c460d3cacd5efd7d669838c21ba1773ae79e6c0fc00"}},{"ruleId":"D2","level":"warning","message":{"text":"LspSymbols.buildParameterTypeHints (cognitive 26): LspSymbols.buildParameterTypeHints has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 6 (9 pts), loops 2 (6 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":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":1807}}}],"partialFingerprints":{"codehealthFindingId/v1":"830db781dbcaea7adaee4f5434d05b552a0845f144fe80ac323421b701a0ec5e"}},{"ruleId":"D2","level":"warning","message":{"text":"LspSymbols.buildCallArgumentHints (cognitive 26): LspSymbols.buildCallArgumentHints has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 11 (20 pts), if/else 4 (5 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":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":2074}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0add295b86699e1e3cf1ba9f7dfb14af727d3a71aa9a110b937f413eae43931"}},{"ruleId":"D2","level":"warning","message":{"text":"LspProtocol.tryReadMessage (cognitive 26): LspProtocol.tryReadMessage has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspProtocol.fs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c29fbc7f83bb5af3fba27f1adedc8971e85e65c37fcacf90d185a9a055337f2"}},{"ruleId":"D2","level":"warning","message":{"text":"Eval.valueMatchesTypeRef (cognitive 25): Eval.valueMatchesTypeRef has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 14 (24 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":"src/FScript.Language/Eval.fs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"15cb095eb64e285d6f7dc567f110c93e475c0b55904ff32e779c8f11f5c8f6b9"}},{"ruleId":"D2","level":"warning","message":{"text":"Eval.evaluateStatements (cognitive 25): Eval.evaluateStatements has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 4 (13 pts), if/else 6 (11 pts), loops 1 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/Eval.fs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"772ffb70314e57b18572f1deed09f9840e142329c51142c9b92d01418ae3be80"}},{"ruleId":"D2","level":"warning","message":{"text":"LspHandlers.handleInitialize (cognitive 25): LspHandlers.handleInitialize has cognitive complexity 25 (threshold 15). Drivers by points: error handling 3 (12 pts), match/switch 5 (12 pts), if/else 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc966242faf6e66b4c433ba6073fc1a9bce7006494a5c2fa6fc998de1255e8e3"}},{"ruleId":"D2","level":"warning","message":{"text":"LspSymbols.tryGetLocalVariableHoverInfo (cognitive 25): LspSymbols.tryGetLocalVariableHoverInfo has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 4 (10 pts), boolean chains 3 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":2961}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5cdb52cfee17fb2731a2379535a78805bc4d654039109303645c9cb6d78cb65"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.main (cognitive 25): Program.main has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 4 (10 pts), error handling 4 (7 pts), if/else 4 (7 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript/Program.fs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"b619a83e060c4f5e84d6209f91e33707b684a2c3188fde8434e029378215c319"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInfer.typeFromRef (cognitive 24): TypeInfer.typeFromRef has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 5 (12 pts) (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/TypeInfer.fs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"907665368de856324ae08e11b5e22d64190fdb62ea4a4ff31581d3ab738e100b"}},{"ruleId":"D2","level":"warning","message":{"text":"XmlExterns.parseQuery (cognitive 24): XmlExterns.parseQuery has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Runtime/XmlExterns.fs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"957f2a6cbb8759fc0912fd59802261aba6776a659ee751a4570f8f6d5e589551"}},{"ruleId":"D2","level":"warning","message":{"text":"sandbox.Sandbox (cognitive 24): sandbox.Sandbox has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 9, error handling 3, boolean chains 2 (nesting depth added 1). Of this number, 20 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/src/pages/sandbox.tsx"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda3f99513c5d8c3709ac5700fce0563578a30e6c529749b1db72e945840eaa9"}},{"ruleId":"D2","level":"warning","message":{"text":"LspHandlers.isLikelyMatchPatternDeclarationContext (cognitive 23): LspHandlers.isLikelyMatchPatternDeclarationContext has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (6 pts), boolean chains 4, match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"09da1a7ef6e16682950e411e66725595672fe6a6bf6bdacad6e9b30708198221"}},{"ruleId":"D2","level":"warning","message":{"text":"LspSymbols.tryResolveRecordLiteralFunctionReturnTypeTarget (cognitive 23): LspSymbols.tryResolveRecordLiteralFunctionReturnTypeTarget has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 8, match/switch 2 (5 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":2722}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d4b72c0c89f47bdcf1996fe626e83dec87b53374b8b217e4cfaaff5bbe10d6"}},{"ruleId":"D2","level":"warning","message":{"text":"Eval.evalProgramWithExternsState (cognitive 22): Eval.evalProgramWithExternsState has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 5 (8 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/Eval.fs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bcd51940e57f2c06ea9a9ffbbd96c3dec8bb0c8630176cc7aeb266c30d058ee"}},{"ruleId":"D2","level":"warning","message":{"text":"LspSymbols.analyzeDocument (cognitive 22): LspSymbols.analyzeDocument has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 6, loops 2 (4 pts), error handling 2 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":2202}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fe1b74d5e1217b6d6156328fa7b20e27b1008a8e130d0f81c0d5bbf60201a7"}},{"ruleId":"D2","level":"warning","message":{"text":"LspSymbols.tryResolveLocalBindingAtPosition (cognitive 22): LspSymbols.tryResolveLocalBindingAtPosition has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 7, match/switch 2 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":2894}}}],"partialFingerprints":{"codehealthFindingId/v1":"523b149a87519853f98816d53bfcc8a81979e66f084fed5a288da00280ae1f97"}},{"ruleId":"D2","level":"warning","message":{"text":"LspSymbols.tryGetCallTargetPrefixAtPosition (cognitive 22): LspSymbols.tryGetCallTargetPrefixAtPosition has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (7 pts), boolean chains 2, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":3162}}}],"partialFingerprints":{"codehealthFindingId/v1":"75395f5193c7dcd4b564cbb68895883aac73b804946d6d03622601081efdc902"}},{"ruleId":"D2","level":"warning","message":{"text":"LspModel.tryGetWordAtPosition (cognitive 21): LspModel.tryGetWordAtPosition has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (6 pts), boolean chains 2, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspModel.fs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"541112ce410e1abd405aee93a7712feab1c2c94593d8be807ec6023631cc7c78"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.readString (cognitive 20): Lexer.readString has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (4 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/Lexer.fs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c580d8ed52381083ea1add5a9cfed3078ae1c9f695af09d0b90ea1709e719274"}},{"ruleId":"D2","level":"warning","message":{"text":"LspSymbols.tryResolveSymbol (cognitive 20): LspSymbols.tryResolveSymbol has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":2387}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c5e905997e980523d13d92b5e43264c875f6fa648ef9e32d53db592c28f17d"}},{"ruleId":"D2","level":"warning","message":{"text":"LspSymbols.tryParseRecordFields (cognitive 20): LspSymbols.tryParseRecordFields has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":2459}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa804cccfefa393d0dc77c77db9ce6a8eecfe0668c17fc67efd4ca315fcc80a"}},{"ruleId":"D2","level":"warning","message":{"text":"IncludeResolver.rewriteModuleScopedStatements (cognitive 19): IncludeResolver.rewriteModuleScopedStatements has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 8 (11 pts), if/else 6 (8 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":"src/FScript.Language/IncludeResolver.fs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a09e8b0fa63ad5a206288758582732a2b003fc05edb480cdcd2980269c18f62"}},{"ruleId":"D2","level":"warning","message":{"text":"LspHandlers.formatFunctionSignature (cognitive 19): LspHandlers.formatFunctionSignature has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d6d914cf1bcd94f9f1146a3c3c4b6719c7ef8f0180cbc30b32a78c5a329d6f"}},{"ruleId":"D2","level":"warning","message":{"text":"LspSymbols.splitTopLevelSemicolons (cognitive 19): LspSymbols.splitTopLevelSemicolons has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 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":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":2430}}}],"partialFingerprints":{"codehealthFindingId/v1":"a878f80b3869d0c6679109a41ef4b9fc0c397573de5282023f5c39ed724c5d9f"}},{"ruleId":"D2","level":"warning","message":{"text":"LspServer.Run (cognitive 18): LspServer.Run has cognitive complexity 18 (threshold 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":"src/FScript.LanguageServer/LspServer.cs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53c64cf3ebc57da03b4dff35a726328a134ac7d0fa62a64adb5fb89c4d73a0b"}},{"ruleId":"D2","level":"warning","message":{"text":"LspHandlers.trimOuterParens (cognitive 18): LspHandlers.trimOuterParens has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, loops 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":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccbf6fb1ea648b2f86b1e984d8e3cf3ffec85eda62dfe9f2429357fc20e5388e"}},{"ruleId":"D2","level":"warning","message":{"text":"LspHandlers.handleDidChange (cognitive 18): LspHandlers.handleDidChange has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (15 pts), loops 1 (3 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"497020dbbc090fdd918d6d8cd9362bf3a37567154c984bc40ebd56edc04ada8d"}},{"ruleId":"D2","level":"warning","message":{"text":"LspSymbols.inferLocalTypesFromReturnedRecordFields (cognitive 18): LspSymbols.inferLocalTypesFromReturnedRecordFields has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 9 (14 pts), if/else 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e863857695722e0fa5aaec70144d47b9d45e46c73cfd6dd6fb06328058b602e"}},{"ruleId":"D2","level":"warning","message":{"text":"IncludeResolver.parseProgramFromSourceWithIncludesCore (cognitive 17): IncludeResolver.parseProgramFromSourceWithIncludesCore has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 3 (8 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/IncludeResolver.fs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee41bab1897e6abbee275c79acb5863371999dba7489475b5a289cc13492379"}},{"ruleId":"D2","level":"warning","message":{"text":"LspHandlers.classifyToken (cognitive 17): LspHandlers.classifyToken has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 5, loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d9c745d433c1d3c1f9361e8856814964245ddcd123e4752bf74fa6c06a8669"}},{"ruleId":"D2","level":"warning","message":{"text":"LspModel.tryGetWordPrefixAtPosition (cognitive 17): LspModel.tryGetWordPrefixAtPosition has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 1 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspModel.fs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5dc7a23adab3834869b01a8d41ce877656d8a357be40f1e819521202cbeb2ab"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeInfer.inferPattern (cognitive 16): TypeInfer.inferPattern has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 7 (14 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":"src/FScript.Language/TypeInfer.fs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52cb94224d363e6ec8340f19aef8cb51a6a2093008a6a154014db61167c4b49"}},{"ruleId":"D2","level":"warning","message":{"text":"LspSymbols.tryMemberCompletionItems (cognitive 16): LspSymbols.tryMemberCompletionItems has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":3019}}}],"partialFingerprints":{"codehealthFindingId/v1":"8becc324dcee441288ca57b31abc85b7373ab55f35fe99da2c0d8c630c6b93df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: LanguageServer/LspSymbols.fs: FileTooLong \u2014 2855 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 62 functions. The bar is 500 significant lines; this is 2355 over it, 5.71\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"733de2761c114c23143818046ac391276975ad87f467983fbdeff1bea5e04aed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: LanguageServer/LspHandlers.fs: FileTooLong \u2014 1777 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 46 functions. The bar is 500 significant lines; this is 1277 over it, 3.55\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0f20db4372bf97463a870aa86a75259a48ee9b41baf77620a1cede8ae17128"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FScript.Language/Parser.fs: FileTooLong \u2014 1578 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1078 over it, 3.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/Parser.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c19d88fc15d898cc5199e1c1d31539aa0e87e3ba1e630807a1123296035378"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FScript.Language/TypeInfer.fs: FileTooLong \u2014 1304 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 35 functions. The bar is 500 significant lines; this is 804 over it, 2.61\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/TypeInfer.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e6a1d9e7fbcd7a568f94da21051961a0a3956c34c7b257ae8419bcaa6de63d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FScript.Language/Eval.fs: FileTooLong \u2014 921 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 421 over it, 1.84\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/Eval.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22f10e526fde492049753a27a9882cc3f4cd4fef0a6596e6bc6e77721e27103"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sandbox.Sandbox: FunctionTooLong \u2014 Sandbox runs 171 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 71 over it, 1.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/src/pages/sandbox.tsx"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"8124c9daf582eaf47642baef0e50d9b0bd51834256b2607a9529daef5893b529"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FScript.Language/IncludeResolver.fs: FileTooLong \u2014 677 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 33 functions. The bar is 500 significant lines; this is 177 over it, 1.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/IncludeResolver.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"188471e9367988d3f07a936b38d980b931342ea33a27a800c83ecd56082d8020"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FScript.Language/BuiltinFunctions.fs: FileTooLong \u2014 668 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 168 over it, 1.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/BuiltinFunctions.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b6d79a691e1692faee426f430fee3c04368e4d795fbe638478ed44560bb86f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: index.Home: FunctionTooLong \u2014 Home runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/src/pages/index.tsx"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f08e80472c5b99827c3ea3add3bd13fc95da8516faee6895ffdeb5daf1d0283"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FScript.JavaScript/Library.fs: FileTooLong \u2014 501 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 47 functions. The bar is 500 significant lines; this is 1 over it, 1.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.JavaScript/Library.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd15e9d4afa6ced0f948e408d8d78cad3a435e11c4f0c1cc538dfc95aa335592"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2): src/FScript.Language/Parser.fs:1296-1340 | src/FScript.Language/Parser.fs:1498-1542 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/FScript.Language/Parser.fs:1497\u0060 calls \u0060raise\u0060, \u0060Peek\u0060 and \u0060src/FScript.Language/Parser.fs:1295\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/Parser.fs"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"01cd58f1503854e3b37aacd5cfa62c0e8f8567f2104f12b3977b303e4fdd1d3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201329 lines \u00D7 2): src/FScript.Language/BuiltinFunctions.fs:82-110 | src/FScript.Language/Eval.fs:86-113 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/BuiltinFunctions.fs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"536d65e90d29ac4ec8eba0b873529698a264c7c5e1b87e9157f1e39b97a7afea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:783-810 | src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:1256-1283 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5e636e5ac5dff490fb2a1d7aa4cbf7feea985b613306498e8f6e084d0e275d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:1807-1831 | src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:1870-1894 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":1807}}}],"partialFingerprints":{"codehealthFindingId/v1":"86140237344b2dc7455f158017c3f797f6af39e0738c3bdd0a04efeb53f3e101"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/FScript.LanguageServer/LspHandlers.cs:38-61 | src/FScript.LanguageServer/LspHandlers.cs:79-102 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FScript.LanguageServer/LspHandlers.cs:38\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.LanguageServer/LspHandlers.cs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b3f3627da57e0fd541c0e2ae03d9628703bd9963818dcb5e10cd615c39be75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:1112-1133 | src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:1135-1155 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b10644285ab431bff8f00cf70e48e0f6eff4bef95ec17335dbe1836a4d26e43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:552-572 | src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:819-839 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb172f51e5687f3861807705767a7c7b4ea8016f532bcf94e287d640421e85a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/FScript.Language/Parser.fs:1275-1295 | src/FScript.Language/Parser.fs:1475-1495 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/FScript.Language/Parser.fs:1497\u0060 calls \u0060raise\u0060, \u0060Peek\u0060 and \u0060src/FScript.Language/Parser.fs:1296\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/Parser.fs"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cace232c8c5d0652c154d19683f75176706854e0d5a6e035cb7caeb8d6f7b5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): src/FScript.Language/IncludeResolver.fs:641-657 | src/FScript.Language/IncludeResolver.fs:688-706 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FScript.Language/IncludeResolver.fs:688\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/FScript.Language/IncludeResolver.fs:659\u0060 calls \u0060loadFile\u0060 and \u0060src/FScript.Language/IncludeResolver.fs:708\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/IncludeResolver.fs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"1689a23d3963d627b198fa9cd35b19ab275a0ba65e625e744e82f6a16ec6de21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:1343-1360 | src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:1389-1406 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe279c9f8fad84dc935304603259a9b4594c4b98dffd14a53da8c034e0df4bd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:813-829 | src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:1286-1302 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:830\u0060 calls \u0060Substring\u0060 and \u0060src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:1303\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"445016d9af222b4c8809f88e512a6f509de1ad0682d36f7e653998046a1634a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:773-789 | src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:1360-1376 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1003fae6e0df871021e41e6f6dad3a7a48ab6e523a44122454ff011cf29def6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): src/FScript.Language/IncludeResolver.fs:659-673 | src/FScript.Language/IncludeResolver.fs:713-729 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/IncludeResolver.fs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db0def0c997dcdbd438383f428412c74083e92a19f41b50caca68387470723b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/FScript.Language/TypeInfer.fs:723-739 | src/FScript.Language/TypeInfer.fs:1290-1306 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/FScript.Language/TypeInfer.fs:741\u0060 calls \u0060recursiveNames\u0060, \u0060fun\u0060 and \u0060src/FScript.Language/TypeInfer.fs:1307\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/TypeInfer.fs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f726ea86b0d6ccefdda5574af1c5b9b8969b7a5a6f960ea455908058c76cd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 3): src/FScript.Language/IncludeResolver.fs:611-625 | src/FScript.Language/IncludeResolver.fs:642-656 | src/FScript.Language/IncludeResolver.fs:690-705 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/FScript.Language/IncludeResolver.fs:659\u0060 calls \u0060loadFile\u0060 and \u0060src/FScript.Language/IncludeResolver.fs:708\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/IncludeResolver.fs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ea7482135e877f954c3c943f24c01afc9eff7eb4eef788707602919c58a6dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:548-563 | src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:575-589 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4a94cea6cb88f924849743ccde36d2951ce6466c277270f256425fca3cbf12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:1586-1601 | src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:1620-1635 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0fb143a2cc5f9a309df8a1e1b0a822d424f4bee4154cc63ba87528c0d022250"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:303-318 | src/FScript.Language/Types.fs:67-82 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"3728a3a9598e86180bd8400ba41f5df4db4c27a088fe5468d2ca47f5eb40aded"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201316 lines \u00D7 2): src/FScript.JavaScript/Library.fs:373-383 | src/FScript.Runtime/ScriptHost.fs:50-65 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FScript.Runtime/ScriptHost.fs:50\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.JavaScript/Library.fs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23ee7ca9e44d536e78658a060eec3402944187847696fbe76afab6896bcf9f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/FScript.Language/TypeInfer.fs:662-677 | src/FScript.Language/TypeInfer.fs:685-700 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/TypeInfer.fs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b244b16bc870a58f3d48107f7b2679f518f1cbf01d16f1027daa03a1d1e501"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:1138-1151 | src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:1590-1604 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6aa89d62613f59bc4d67d138f47bc0252425da73eb887c7a110a779e3e2040"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/FScript.CSharpInterop/LanguageServer/LspModel.fs:165-178 | src/FScript.CSharpInterop/LanguageServer/LspModel.fs:192-205 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspModel.fs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"8030d8f84aab23e26c24031b8565df756427e7eb01614be92e3aa9a57e3632d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:1414-1425 | src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:1436-1449 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":1414}}}],"partialFingerprints":{"codehealthFindingId/v1":"14834ce299107a0818d4a208efce1ccdc369db3761662dbb94c3d7ec021a8359"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:417-429 | src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:434-446 | src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:451-463 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:417\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9e543c00332b02a77c54bf53b3da50bc4377a1597d61ed89661353fd6769a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:1449-1461 | src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:1552-1564 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"a130f7542409aed1b301d3f7a64a525a28a029bb8ea120465d559f08b4bd6580"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/FScript.Language/Eval.fs:56-68 | src/FScript.Language/Pretty.fs:28-40 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/Eval.fs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"88aca035fe3e2dd1c14e161e2f2c5a4943f4effd184d622600a6d2a355804528"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FScript.Language/Eval.fs:70-81 | src/FScript.Language/Pretty.fs:42-53 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/Eval.fs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"5804a9d8d03f89df538faa62887b0ab21e39596c9d710958be4179e6ccc9676c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FScript.Language/IncludeResolver.fs:156-167 | src/FScript.Runtime/Common.fs:25-36 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/IncludeResolver.fs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"20290c46294c29e3682eacd012886c4e99fc367d2fcbd0ba107cebbb98b573fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:861-871 | src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:962-972 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4cfcb6c09210faa18f15ec22284463d8ea49fb9b24a5f971062b51380562bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:1008-1019 | src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:1111-1121 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b7a85483fee099179a038e8c5328743dc25a6611f65d63ce5a7538f2eea9fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FScript.Language/IncludeResolver.fs:278-288 | src/FScript.Language/TypeInfer.fs:1136-1146 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/IncludeResolver.fs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"6adc32531fb690768c7d2f0922b1d95574d07ae712e5c15e73068c2a24b3d8cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FScript.Language/Parser.fs:811-821 | src/FScript.Language/Parser.fs:924-934 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/Parser.fs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"e772881cadcbf616cd287730a4c474873251f312e1d2dc3764f131695bafbdb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FScript.Language/Parser.fs:844-854 | src/FScript.Language/Parser.fs:956-966 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/Parser.fs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e23061e72e805d2a25ffaad446a6003271510e3c93c3829c11980a5bb66a984"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/FScript.Language/Parser.fs:1341-1350 | src/FScript.Language/Parser.fs:1357-1367 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/Parser.fs"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c50c6ca299feab8a0e0d1b8d5401165d9c1dcd572134d6d6021969359321272"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FScript.Language/TypeInfer.fs:1368-1378 | src/FScript.Language/TypeInfer.fs:1383-1393 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/TypeInfer.fs"},"region":{"startLine":1368}}}],"partialFingerprints":{"codehealthFindingId/v1":"9386a8e4fc8a17516c3449d70cfed18c3084385ececc14866b1e3e5abcea0d7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:160-169 | src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:192-200 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f4380493b848b6e1b3297f841a88ce14b150e83a68fb8cfea8876a80fa76bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:1042-1051 | src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:1098-1107 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d13370023ed0f0e98cb2531c3dc9392a9e9a7413341bdd643849aa99694062"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:1118-1127 | src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:1184-1193 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:1118\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"07bf8ffbfbcf684a0004f68333180b647cc64f2e0cce7720fdc66f8f93bc0519"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/FScript.JavaScript/Library.fs:386-394 | src/FScript.Runtime/ScriptHost.fs:75-84 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FScript.Runtime/ScriptHost.fs:75\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.JavaScript/Library.fs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb734fe1d0e4ee1ef71a7fe6b6d54039b608f47882e917200177eec12d3472e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FScript.Language/IncludeResolver.fs:175-184 | src/FScript.Runtime/Common.fs:61-70 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/IncludeResolver.fs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea745572aaa7e7ffc6218561b4769222050ea20a28ce85e6d38217e84130707a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/FScript.Language/Parser.fs:794-803 | src/FScript.Language/Parser.fs:908-916 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/Parser.fs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5d0bf41ba1514819f47441a380de91f97f14567b39d38ec1123a36ca3ec805"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/FScript.Language/TypeInfer.fs:461-469 | src/FScript.Language/TypeInfer.fs:883-892 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/TypeInfer.fs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85922b0695a938c26e8667cc6dd48ec82c003c95a6d62fff111aacb182627f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:420-428 | src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:437-445 | src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:454-462 | src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:470-478 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"64dc2b3369f3a31327a70bf0b87e18c549ca8a1c0a1afc6227f7f7f869549da8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:1212-1220 | src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:1247-1255 | src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:2738-2746 | src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:2868-2876 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"697c0b2fbb15ca15915af6beca5464d0c923ca67480c34b6585c94304c18ce7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:2656-2664 | src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:2689-2697 | src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:2728-2736 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":2656}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ed46499d68f0f7789ca9244a90c6d778af892b272be056a31411c23423e9dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:1693-1700 | src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:1720-1728 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":1693}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb439259281f1b2d5a96eed96d8c737954241c15c080fe83c612d61d5c19da7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FScript.Language/TypeInfer.fs:661-669 | src/FScript.Language/TypeInfer.fs:1229-1237 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/TypeInfer.fs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"247238185e16a0c58c58afb771c269494d1a0241840e6476e2074e17066d1c00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:873-880 | src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:921-928 | src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:933-940 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab55c757aae0eb4284874308d467abfdb94810c5b3867cbc92d5a0de0d44a59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:782-789 | src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:1369-1376 | src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:1460-1467 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:782\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"c802dde34fa5e787f538323268d11c1a5ffdf43c9425ec7e01832de4889e3f28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:1956-1964 | src/FScript.Language/IncludeResolver.fs:282-289 | src/FScript.Language/TypeInfer.fs:1140-1147 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":1956}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d2fd43a143b84dce1484d87577721f456b6796b0c1eb65b901770a96f1804e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:844-850 | src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:1315-1322 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:844\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7e98d2908bc7d9e03612db2dd192c1124a2e73fcfeae4787c2dee14f132044"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:962-969 | src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:974-981 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc20684b8e15802ac305a2286259c4bdcda3071a6e1deaaf9f7da1f1c987cc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:1536-1543 | src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:1575-1582 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d497395c7bc1230613d11fff1a57cc39619b3f64ef09bb619f683edd25de12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/FScript.Language/TypeInfer.fs:749-756 | src/FScript.Language/TypeInfer.fs:1315-1321 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/TypeInfer.fs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"8261bee645898095396c12f9b1b4fa29ccddcf8fd7cbc42fd724b0dc3ef9957d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FScript.Language/TypeInfer.fs:783-790 | src/FScript.Language/TypeInfer.fs:794-801 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/TypeInfer.fs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b510944516603a1ec6b6cf12ceea70d6424a3e01f0f1a6ac28fb3e3fd75a96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:334-340 | src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:356-362 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"89583676bf8a383937f91a6f40b54326f8bdec59b5942edd6617fd1adefb1c47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:1257-1263 | src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:2918-2924 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"4873ded21bdf9a305f4499cd76f0663b59fc5ca6d57ce20b63f27717cbbf3b4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): src/FScript.Language/TypeInfer.fs:703-709 | src/FScript.Language/TypeInfer.fs:1269-1274 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/TypeInfer.fs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4115f7c294b964a2a039e048aad5698bcc8ac224b1318534541a49c0b64859c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FScript.Language/TypeInfer.fs:919-925 | src/FScript.Language/TypeInfer.fs:943-949 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/TypeInfer.fs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0cb0e2f1a8a3bd08272f6a30863245dd4aa74a37308fe57daafb7f65b68b26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:403-408 | src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:421-426 | src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:438-443 | src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:455-460 | src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:471-476 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48b968bdc4efa028d1e8536f7e3f12709868a7cc20ab0ccf6dd9e577f462cbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:2655-2660 | src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:2688-2693 | src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:2727-2732 | src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:2768-2773 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":2655}}}],"partialFingerprints":{"codehealthFindingId/v1":"193f4beea2687e561a771a786c76e4658e2415867cdc77d22b4ac526070e8614"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:1431-1436 | src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:1504-1509 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:1431\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":1431}}}],"partialFingerprints":{"codehealthFindingId/v1":"15999751fe4f8b22238576445bf3b639002812a00772ce0d08750a6d6d763c5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FScript.JavaScript/Library.fs:356-362 | src/FScript.Runtime/ScriptHost.fs:30-35 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FScript.JavaScript/Library.fs:356\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.JavaScript/Library.fs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"1871ba5ee80378d223811e9949cbc1549eb25770475e000e547c3f13c0b1bd5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FScript.Language/Eval.fs:610-615 | src/FScript.Language/Eval.fs:617-622 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/Eval.fs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"518364ebdc1e93cdc7e55dbd19ea326be89282d355c895e9e8396b7186c590ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FScript.Language/Lexer.fs:67-72 | src/FScript.Language/Parser.fs:134-139 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/Lexer.fs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"be54302975efa78c439eb5e83b9b61a4080e7413e25d21d1148173eeeaabbf46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FScript.Language/TypeInfer.fs:124-129 | src/FScript.Language/TypeInfer.fs:131-136 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/TypeInfer.fs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab0eb2b50335f9b05196707596b7e90e0518ce516fea54df23313ce7c497526"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FScript.Language/TypeInfer.fs:1060-1065 | src/FScript.Language/TypeInfer.fs:1103-1108 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/TypeInfer.fs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"742f9edd70349e03a7db6065d5c6600180c84f6a847ad324d2ac0664ce049c0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FScript.Language/TypeInfer.fs:1238-1243 | src/FScript.Language/TypeInfer.fs:1255-1260 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/TypeInfer.fs"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f48eac2f2589804d1f3c332f2f11224ccb72f2c9632f78715aeebb6c1b19556"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FScript.Runtime/Decode.fs:36-41 | src/FScript.Runtime/Decode.fs:109-114 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Runtime/Decode.fs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf3595565b7c2803a6a540010fa326ac8f399a2718b0c0bf1745ab4aea951f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:301-305 | src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:334-338 | src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:356-360 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3fcdc53dc2588fda140c5ad4b489ac760db9164ec772548fb0fc36d2a2adddd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:1946-1952 | src/FScript.Language/IncludeResolver.fs:276-280 | src/FScript.Language/TypeInfer.fs:1134-1138 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":1946}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3841fc1e5eec84bb2866c2613ba2c1b1dfda60a93cd5c67a896953fd2375b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FScript.CSharpInterop/LanguageServer/LspModel.fs:158-162 | src/FScript.Language/IncludeResolver.fs:252-256 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspModel.fs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccd1949b9273e857a8dbe1252987cc17c1c5e29a1b0018cdca78f584fa01540"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FScript.Language/Parser.fs:832-836 | src/FScript.Language/Parser.fs:944-948 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/Parser.fs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"83df102249f8107765f2abca7be83abbeb4de46c2dceedee5a3ed81cfd762400"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FScript.Language/Pretty.fs:7-11 | src/FScript/Program.fs:242-246 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/Pretty.fs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"2570ca203a0e86c0a2c344b9fe93f347693a83a36c2a00308e5e19b322bd7d14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FScript.Language/TypeInfer.fs:861-865 | src/FScript.Language/TypeInfer.fs:874-878 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/TypeInfer.fs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93c4220f90e5ddc345cdb7616f7c7a0ded3ebcb8f85ce79c80b000f4abab698"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FScript.Language/Parser.fs:632-639 | src/FScript.Language/Parser.fs:657-664 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/Parser.fs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"198260927d43fcb52f22748bea64437e695e3220de2f3eb17a5fb7dd58a6e42b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FScript.Language/Parser.fs:229-235 | src/FScript.Language/Parser.fs:549-555 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/Parser.fs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f51393b3c1fae19296805995e4af1bd2640289086c7c38cc3f31b3bead4897"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FScript.Runtime/FsExterns.fs:67-73 | src/FScript.Runtime/FsExterns.fs:100-106 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FScript.Runtime/FsExterns.fs:67\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Runtime/FsExterns.fs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7520764d83fd47bcefd535dda450942a62adcdfc4a1a707ef86781a6959b42f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:628-633 | src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs:637-642 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspHandlers.fs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ef9ac03720555360125c0ea2b7d19b02e6342eedeb5876e4cb431513179d4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:2264-2268 | src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs:2292-2296 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.CSharpInterop/LanguageServer/LspSymbols.fs"},"region":{"startLine":2264}}}],"partialFingerprints":{"codehealthFindingId/v1":"3862f923a6753ae098116950591bf64c7ea6b9ffd58ff723a7843c6ce30862e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FScript.Language/Eval.fs:500-505 | src/FScript.Language/Eval.fs:833-838 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FScript.Language/Eval.fs:500\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/Eval.fs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96d4ced15ac3206151e42d06b4e8919bf1d4b234c23e7788fe42b8bfeeb94b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FScript.Language/TypeInfer.fs:20-26 | src/FScript.Language/TypeInfer.fs:147-153 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/TypeInfer.fs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0e44d8c5b55652b7dafb11ab6d3a8900ed3840e2e43a896d44190fcf726a54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FScript.Language/TypeInfer.fs:1067-1075 | src/FScript.Language/TypeInfer.fs:1110-1118 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Language/TypeInfer.fs"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0ccf58776cb3f97349fd7004d845197d2b43ffad33d2c0d24a78ccba23bdd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FScript.Runtime/Decode.fs:177-181 | src/FScript.Runtime/Decode.fs:189-193 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.Runtime/Decode.fs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"89811d8813572f077bb96001b389fdf365ad926f7fa7d5f187978ff14bf44607"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 JavaScript/TypeScript suite: Coverage NOT MEASURED: the .NET half measured 45.8%; the JavaScript/TypeScript half could not be measured \u2014 the node:test suite in src/FScript.JavaScript/ ran and not one test passed (throw new ERR_MODULE_NOT_FOUND(), so the coverage would describe the failed run, not the code. This repository\u0027s production source spans both ecosystems, and no partial figure is published as if it were the whole: coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository\u0027s maintainers can perform; once it passes, the real number is measured on the next scan. Alternatively, commit the lcov/Cobertura report your CI produces and it is read without a re-run."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/FScript.Language/Eval.fs: src/FScript.Language/Eval.fs changed 2 times in last 90 days, max cyclomatic complexity 125 in Eval.evalExpr at line 433. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-31..2026-08-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-31 14:13:33 \u002B02:00\u0027 --until=\u00272026-08-29 14:13:33 \u002B02:00\u0027 --full-history --no-merges -- src/FScript.Language/Eval.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":"src/FScript.Language/Eval.fs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bedb4fe70778ef7eade0e3643dfa03b09dec9a2fc81b23c92b6ac61a005b6f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/FScript.Language/TypeInfer.fs: src/FScript.Language/TypeInfer.fs changed 2 times in last 90 days, max cyclomatic complexity 115 in TypeInfer.inferExpr at line 559. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-31..2026-08-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-31 14:13:33 \u002B02:00\u0027 --until=\u00272026-08-29 14:13:33 \u002B02:00\u0027 --full-history --no-merges -- src/FScript.Language/TypeInfer.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":"src/FScript.Language/TypeInfer.fs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"f650ec2d6e5df008ae0b08850a88d07ae3970faf2a0c19f0a75805fd0a8e0b13"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/FScript.Language/IncludeResolver.fs: src/FScript.Language/IncludeResolver.fs changed 2 times in last 90 days, max cyclomatic complexity 50 in IncludeResolver.rewriteModuleScopedStatements at line 381. 1 of those changes was a fix/bug commit, and the other 1 changed it for other reasons \u2014 this file is under both repair and feature pressure. 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-05-31..2026-08-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-31 14:13:33 \u002B02:00\u0027 --until=\u00272026-08-29 14:13:33 \u002B02:00\u0027 --full-history --no-merges -- src/FScript.Language/IncludeResolver.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":"src/FScript.Language/IncludeResolver.fs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75e5b0bae1d0ccaa86e71632086d9f9de32a8370ecfe633a577fdb37d201ec3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/FScript.Language/Types.fs: src/FScript.Language/Types.fs changed 2 times in last 90 days, max cyclomatic complexity 20 in Types.typeToString at line 66. 1 of those changes was a fix/bug commit, and the other 1 changed it for other reasons \u2014 this file is under both repair and feature pressure. 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-05-31..2026-08-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-31 14:13:33 \u002B02:00\u0027 --until=\u00272026-08-29 14:13:33 \u002B02:00\u0027 --full-history --no-merges -- src/FScript.Language/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":"src/FScript.Language/Types.fs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c91beff42b0f3522433417e74ef53928f48f006cf70cdcb284d5494233564d"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"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":"ce9e5ed25edf135677cf0402d2b314310e56f5bdfab3f62ecdea9509e523b6cd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0b9a007ff43b6e76964b6652cdc4ca677c0bde6d1bb89599f4b9390f1cf41df4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f7c9091dcde3ece51d0064d1f25d02492947b983359247defaa2c702c57bba17"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"867a415d90be67972c9afe81932a4befbf72b0f45b8db7d8fdda460d7b586f69"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1e5ba38608c2bcf136fcaf147254f798871f377487960f84754013e10c688ce1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e4c35cca60eb214a52d951ff4c62d0fb2e43d48b8049a45c3a3467e0209b6e1f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c372dc50925d19d061bd43b58ad54c005c602dffb79753563b8cad819f1a6293"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"610e847964dc4e06d26ba467f8c5c7f579dad6e585babf34cec2f375c8c61d4a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ef9fea39800d37e2d3a5627016d8782339e38c1dffc5e5028b5868dd47a53079"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"468083af32378992dc2a7eb297029342a4ef51c237329d859fa9d6b79aac2db0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7e714a018d34849be071f4bbccc4c09ee30e9ec9a670a50f7a294f59f63c6601"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a52e8429c410aec67e460f601b38333ef55290f06c8fb885eb362fe772145af0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"64ab032c8296a9ec92871860928faec5cc8d181fac89a8f64125745f57b2eed0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c5bedf1314195b974a2b4390d618b764c30ded373934fc07b7e06fedf6d4d9d5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eeaa58617ea3552944be536f4d1714c693df5e2f8c631612b60e1c0d530335ff"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ac768619301caa7ee0c72ae8a0df772760039c98873927645a5997aed78fd0de"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"34425e15e72f37e9dd6f6eee60494f36700e4de164f08a32edbeda0760a01ce3"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7a3e2c950430f1c166b6e2afd1a66988a912f97bb45a2f832f06e101890f034f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7d06a7d4340bc5efcfc5dd5ce653750f45f74711b9052285836c3ecf759bb7d0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1f7d806b9fd8a63545b7199ba5388659f26986f6205d6e5ea296108ba7bef106"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"419543a40dfb2014593b239a1701ccb1a38fe66cb48fbccc2de907fb3be32f16"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e897b0c1f3507780d2e8d727f31b333c39f0fa53e76dec0971bedf8d579b1d4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d53af326db458b37875fe128225b75fd62bc4ff2ede5a57329e8adfcdbdc00e0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e5bb6d95fa8b535cd18b1e860da532cbbf0a1ef982faf4835cd58a4eb96524e0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"19ae8a5edd9103228d7b29d98a0882721a2c42b7bffc6cd49b147660870e258e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"91ddd76e5a95679ab3367d11154bd77745b206903ad4939b81bad01cb2b96a57"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"df09dabc555276ca2eb926b0de6cc9ddc65d8c6834155f6171f75775fa2adfe4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"221a42621929a3fe845e9512fb79a5271f7e2e0bca9c9fd6062a235a0f33e3ed"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"94c0f02d65f51a6ed837cbb7da5bde94e8395c58c9f5195921ecf2d92bc5e611"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc2c7a66edb75e7a8f37054bdea0668d41442c617078751e07142ec39f95e57e"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"535fe8c1739ebf92ffc0b21184bfdf4bbdda480c7fba836fb81b7e00f04436dc"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"265ac427fdb839611f5b9506e239755fccf6b3f73dbb778a2e1614f4e2cfdb4e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"df64661ceedd342c9c03120f43ddb767cb4c7705fb1d1cc74ba70d59bc886229"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3a850ee92b49be6163d5cf3bfb43693ed51ca3abf5f529963e7ce3b3aa4fe3de"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"40ab490b30d322c4d610d01b72b68f641c6a9d44de5f8b4fce17d8e74293ffd6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5fff90ad4b7bdbc78778b503b44488c74b5615e351c5d0f8f5bf61af527331bc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"63c72642b751110871378ce4f182b794bdeb6ff679eaeaef8d7c2f2c09b8733b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2570184e33f6a643db81ff26709b628253bd04d7cd0dc2f2d9727e19abba50c8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ea1cab268eecf699969725f0f68e37f364e7fecff4ef70d93564a77383d050b3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0ddb3fce3c70fa76366786e2063502995c21a662f4e9c355385b60c910f2acb1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9e33277427a6f0f0a72e79ab9f4c5f0bd16ed8b409543ea6d04ee474b1ef9064"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"344875ded25cfc4b4fd6834d28999644c4449fc21c67996b3edb989ea53424e7"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8d0c0cbc6d8ba28baee6ef7c6903c5a94df1727251b72278d3757b82d72c8f97"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"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":"ac215348d9751828e899c83b199b172a9dfb3133d6cac7d571f17097228eaabb"},"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"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9d19b10d711774025c0f2f8cae7016a5eb15abdaf85290b63bd0baeff4bd822c"},"properties":{"dependency":{"package":"linkify-it","version":"5.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"638b0e96c4b14ec7437af25af8cbec07cccb57b6b4a37b9a4220ec994494f7c7"},"properties":{"dependency":{"package":"minimatch","version":"10.2.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e785dc12b08525ee49aa1730684c600b34a62175c32868ed1da06f9f39b2ece7"},"properties":{"dependency":{"package":"minimatch","version":"3.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d19f0608cf4fd0ddaa0aaa0608fcd6e7a5b5f8d8d42ec8aa9d5331ea6578d5a6"},"properties":{"dependency":{"package":"minimatch","version":"5.1.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a4891479148a9036fb499913f29ca929898a13f5c2ba361576a735c6d06f5132"},"properties":{"dependency":{"package":"js-yaml","version":"4.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5779378be9cec5e7ffe34c7a0cdc033213d00cc6c2a6389ead9380e9e511a59d"},"properties":{"dependency":{"package":"brace-expansion","version":"1.1.12","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"690130b86eb71c576b4b20b2eb8b8893cf057a7bd847994fd40506fb41a6519e"},"properties":{"dependency":{"package":"brace-expansion","version":"2.0.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"edc3b06037d19e4692df1a13b81a19ee0b2807199a4f848463fb9cc25a91cdd0"},"properties":{"dependency":{"package":"brace-expansion","version":"5.0.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8a0a025c001ce515ac970494e14669aa920938efc537e07d41d83bf0fe647d44"},"properties":{"dependency":{"package":"fast-uri","version":"3.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"75704030fa472a6113ea01ff06be6e744e5531f41bb927096e27c920e293c6e1"},"properties":{"dependency":{"package":"undici","version":"7.21.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c3c8108f4d2ba6301c4bd37b74619f42369a57c8fa5505fa9c5efa23394f7eec"},"properties":{"dependency":{"package":"picomatch","version":"2.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"72cd9a70afe1df7a852dc26c2a1751eb9bb389fe1e825a2b02f8e9207b6bd894"},"properties":{"dependency":{"package":"form-data","version":"4.0.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bcb377643072568af9beb1ff0280fa5667f6a3358ef259310547a9a0426f6f07"},"properties":{"dependency":{"package":"tmp","version":"0.2.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8c795726bff4cf25aa8a6afd9f438708bb713389c1a7e117903135a25bf0f549"},"properties":{"dependency":{"package":"underscore","version":"1.13.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1a16a0c5b7ded56fba97b3b86a8eb72220c751b06df5909fd5c371ec4dc70666"},"properties":{"dependency":{"package":"lodash","version":"4.17.23","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9d6a9cbc5e00f2674b4b20f0215819bcefd92489ad72f44353f9f5ec91aa3839"},"properties":{"dependency":{"package":"braces","version":"3.0.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"da6cb233ae3bb572282e9d0961129b3acf240dfba11ab9f42c8ac6ebcfdfa276"},"properties":{"dependency":{"package":"ajv","version":"8.17.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"552935c2d1a1a4baa623c28ab26c33c6fd6dfaa218f963f54b6162836d2fe3ab"},"properties":{"dependency":{"package":"qs","version":"6.14.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"6a74425d6b9a36ae97ae65aa5ffe65f71bbc822c14741773bea7246962e06343"},"properties":{"dependency":{"package":"uuid","version":"8.3.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"83bd581f12bdc9af19576083abbffad95bee4b17ddcb545d56da3c5860161378"},"properties":{"dependency":{"package":"markdown-it","version":"14.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"759dca709f1a032fb6f624ce672e6afb5558fce53ecf01fb73618c4d33923164"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"}},{"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":"01617c8618e3c4e3878dbf35ba9ff053ccec9d7cd1ea559a8db623472c13a49c"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"}},{"ruleId":"D39","level":"note","message":{"text":"IL efficiency: 1 authored method(s) exceed the IL budget: 1 of 17 first-party methods compile to oversized IL bodies (\u003E 250 instructions); worst: FScript.LanguageServer.CSharp.LspServer.HandleRequest @ src/FScript.LanguageServer/LspServer.cs:109, 321 IL instructions; that pulled this dimension to 8.8/10. These bodies are far past the JIT\u0027s inline budget, so splitting them does not make them inlinable \u2014 what moves the number is emitting less: collapsing LINQ chains and closures on hot paths, and interpolation built eagerly where it is only sometimes used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.LanguageServer/LspServer.cs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30473090f456f4b690c9bb9a1164f3ac8d2fead8d8fcad314ac205a45869bee"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: README advertises Docker containerisation, but no Dockerfile/compose file exists \u2014 searched for: \u0060dockerfile\u0060, \u0060docker-compose\u0060, \u0060compose.yaml\u0060, \u0060compose.yml\u0060. Each was matched case- and separator-insensitively against file and directory NAMES anywhere in the tree, and against the CONTENTS of manifest files (package.json, *.csproj, *.props, *.slnx, *.yml, Dockerfile); the README\u0027s own prose never counts, so a claim is never refuted by merely being made. Nothing outside that search was read \u2014 a footprint living only in a submodule, in a file type not listed here, or under a name none of those terms matches is not seen, and this row is then wrong."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"343bbbd51ceb8de7a9ff88d79f7c797abf9b5921f8727b67b4d0f4f8a22c5e49"}},{"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 20075 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"SC1","level":"warning","message":{"text":"NuGet dependencies are not locked: No packages.lock.json and no central package management \u2014 restores aren\u0027t reproducible or pinned (SSDF PW.4.4). Enable \u003CRestorePackagesWithLockFile\u003Etrue\u003C/RestorePackagesWithLockFile\u003E (commit the lockfile) or adopt Directory.Packages.props. Advisory \u2014 never scored."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0a97b4f69ccac509400ece7eedefb06d3ede0522cd4d8bcb5c068bea719545a6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FScript.LanguageServer/LspServer.cs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4452f5dfc299bbe5bafb4f222801192fe7ade3ce7c24df866c9c13c7b54c693"}},{"ruleId":"X5","level":"note","message":{"text":"Null-forgiving operator (\u0060!\u0060) suppressions reduce the NRT score: ~0.9 \u0060!\u0060 suppressions per 1k syntax nodes \u2014 2 suppression(s) across the 2341 syntax node(s) in code where nullable warnings are ENABLED, which is the only code a \u0060!\u0060 can suppress anything in (a \u0060!\u0060 under \u0060#nullable disable\u0060 is inert and is not counted, and its file\u0027s nodes are not in the denominator). Each one tells the compiler to trust you about null, suppressing the very safety NRTs provide."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"93cfe05d4ad8c8c171267603b23dfe289b74842e38edd1b7bfed59cc32bda337"}}],"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-214","guid":"b10ad120-fb22-1351-9348-aa23b453e815","name":"CWE-214","shortDescription":{"text":"CWE-214"},"helpUri":"https://cwe.mitre.org/data/definitions/214.html"},{"id":"CWE-250","guid":"52ee12e8-390a-7351-b1e6-388afa694e54","name":"CWE-250","shortDescription":{"text":"CWE-250"},"helpUri":"https://cwe.mitre.org/data/definitions/250.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"CWE-353","shortDescription":{"text":"CWE-353"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"CWE-506","shortDescription":{"text":"CWE-506"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"CWE-522","shortDescription":{"text":"CWE-522"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-532","guid":"1cd8877a-76e8-ce54-b40b-779af23364a0","name":"CWE-532","shortDescription":{"text":"CWE-532"},"helpUri":"https://cwe.mitre.org/data/definitions/532.html"},{"id":"CWE-552","guid":"3492436b-eca2-9c54-9ba3-5dade427c903","name":"CWE-552","shortDescription":{"text":"CWE-552"},"helpUri":"https://cwe.mitre.org/data/definitions/552.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"CWE-829","shortDescription":{"text":"CWE-829"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":70,"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."]}]}