{"$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":"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":"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":"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":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"]}},{"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":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"]}},{"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":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AC7","name":"A11y enforcement","shortDescription":{"text":"A11y enforcement"},"helpUri":"https://codehealth.canine.dev/dimensions/AC7"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"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":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"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":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"Editor.updateCore (cyclomatic 218): Editor.updateCore has cyclomatic complexity 218 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/Fedit/Editor.fs holds 9 of the 43 methods over the threshold \u2014 including the worst \u2014 and 491 of the 1036 points over it (47%), 2.8\u00D7 the next-largest file (src/Fedit/Runtime.fs at 175). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Editor.fs"},"region":{"startLine":3717}}}],"partialFingerprints":{"codehealthFindingId/v1":"e405428a2574619f729dd3c7766f72bd2a34338d63d28a19dda598be240c286d"}},{"ruleId":"D1","level":"warning","message":{"text":"Runtime.run (cyclomatic 190): Runtime.run has cyclomatic complexity 190 (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/Fedit/Runtime.fs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3fc7b329f6d29b691ab700652d33e757d873d7b33a79795b642016ea32cdb50"}},{"ruleId":"D1","level":"warning","message":{"text":"Editor.runDefaultAction (cyclomatic 113): Editor.runDefaultAction has cyclomatic complexity 113 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/Fedit/Editor.fs holds 9 of the 43 methods over the threshold \u2014 including the worst \u2014 and 491 of the 1036 points over it (47%), 2.8\u00D7 the next-largest file (src/Fedit/Runtime.fs at 175). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Editor.fs"},"region":{"startLine":2657}}}],"partialFingerprints":{"codehealthFindingId/v1":"570805f7a9e3c73cb5be341b37e511392bbe2e01afdb08f1db15138c0576d322"}},{"ruleId":"D1","level":"warning","message":{"text":"KeymapModule.parseAction (cyclomatic 98): KeymapModule.parseAction has cyclomatic complexity 98 (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/Fedit/Keymap.fs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"7244f64b28e085af0374c80cd0147b71f90e3bbad4c957c456af49af431785be"}},{"ruleId":"D1","level":"warning","message":{"text":"Editor.executeCommand (cyclomatic 83): Editor.executeCommand has cyclomatic complexity 83 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/Fedit/Editor.fs holds 9 of the 43 methods over the threshold \u2014 including the worst \u2014 and 491 of the 1036 points over it (47%), 2.8\u00D7 the next-largest file (src/Fedit/Runtime.fs at 175). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Editor.fs"},"region":{"startLine":2359}}}],"partialFingerprints":{"codehealthFindingId/v1":"4657160945885f1402d4961cdb47de7839a55507349e2e2a1d584b847db36c13"}},{"ruleId":"D1","level":"warning","message":{"text":"Editor.runPrompt (cyclomatic 49): Editor.runPrompt has cyclomatic complexity 49 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/Fedit/Editor.fs holds 9 of the 43 methods over the threshold \u2014 including the worst \u2014 and 491 of the 1036 points over it (47%), 2.8\u00D7 the next-largest file (src/Fedit/Runtime.fs at 175). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Editor.fs"},"region":{"startLine":3438}}}],"partialFingerprints":{"codehealthFindingId/v1":"326cf270173c1e9c83898a927d79dcd7c4ac5978b02e868c023a5f7d37375109"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigIO.loadFrom (cyclomatic 46): ConfigIO.loadFrom has cyclomatic complexity 46 (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/Fedit/Config.fs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f3a4432683fc8ea2ed4d0a9318b9eccbb74156a446fe179b2ed06c83800ef0"}},{"ruleId":"D1","level":"warning","message":{"text":"Editor.applyPluginActions (cyclomatic 42): Editor.applyPluginActions 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/Fedit/Editor.fs holds 9 of the 43 methods over the threshold \u2014 including the worst \u2014 and 491 of the 1036 points over it (47%), 2.8\u00D7 the next-largest file (src/Fedit/Runtime.fs at 175). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Editor.fs"},"region":{"startLine":1889}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e548458b18bfa123af4c5be113718694701ec92d3e6f18ce7229f260ec3833"}},{"ruleId":"D1","level":"warning","message":{"text":"Editor.executePickerAction (cyclomatic 41): Editor.executePickerAction 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/Fedit/Editor.fs holds 9 of the 43 methods over the threshold \u2014 including the worst \u2014 and 491 of the 1036 points over it (47%), 2.8\u00D7 the next-largest file (src/Fedit/Runtime.fs at 175). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Editor.fs"},"region":{"startLine":2164}}}],"partialFingerprints":{"codehealthFindingId/v1":"701400e70c48a009a61966b9615bf39d19a4d14b5bd04000d7b0f9e93f90d888"}},{"ruleId":"D1","level":"warning","message":{"text":"Layout.renderTextEditor (cyclomatic 39): Layout.renderTextEditor has cyclomatic complexity 39 (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/Fedit/View.fs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7af1d62cf8a998c6d15f321c4ec8d3532c2bb7605debab808ba4cca76ab4ee"}},{"ruleId":"D1","level":"warning","message":{"text":"Input.tryMap (cyclomatic 37): Input.tryMap has cyclomatic complexity 37 (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/Fedit/Input.fs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba52b29214301a5a4560be4870666739e3c60f20fb5630069e940340db05006d"}},{"ruleId":"D1","level":"warning","message":{"text":"Editor.hexInterceptAction (cyclomatic 37): Editor.hexInterceptAction has cyclomatic complexity 37 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/Fedit/Editor.fs holds 9 of the 43 methods over the threshold \u2014 including the worst \u2014 and 491 of the 1036 points over it (47%), 2.8\u00D7 the next-largest file (src/Fedit/Runtime.fs at 175). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Editor.fs"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94e3a38a0a3722273d21950b542bd250fd55ea63503d2ccd37066d84bf49b66"}},{"ruleId":"D1","level":"warning","message":{"text":"Layout.renderHexEditor (cyclomatic 36): Layout.renderHexEditor has cyclomatic complexity 36 (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/Fedit/View.fs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"23358e8b1aa4b93b4c6e817b6bdd0039fa69cf98fa6456be7327dc1f8526ee95"}},{"ruleId":"D1","level":"warning","message":{"text":"Highlight.detectLanguageWith (cyclomatic 34): Highlight.detectLanguageWith has cyclomatic complexity 34 (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: Highlight.resolveCapture (cyclomatic 68) 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/Fedit/Highlight.fs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"daffc4326911bd66d1ed6cfa863e8cc87775c28ae0652a88ff97e6dfa359a379"}},{"ruleId":"D1","level":"warning","message":{"text":"PluginWire.readAction (cyclomatic 33): PluginWire.readAction 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/Fedit/PluginWire.fs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efab59fbb315c44e7d7c05c190eb35f5c626f3dd2c4964d01dc8ea4424a98d5"}},{"ruleId":"D1","level":"warning","message":{"text":"PluginWire.writeAction (cyclomatic 32): PluginWire.writeAction has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/PluginWire.fs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"54131a6960e877b609c88652edf89cc00a1bd7e5e1a923529f39163040f6b38d"}},{"ruleId":"D1","level":"warning","message":{"text":"Program.main (cyclomatic 31): Program.main has cyclomatic complexity 31 (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/Fedit/Program.fs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad2be253eec1e225f828ee906b5f106ed9d0f06f4111b6288aab2ad4740497e"}},{"ruleId":"D1","level":"warning","message":{"text":"Dock.panel (cyclomatic 31): Dock.panel 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/Fedit/Dock.fs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"05465126a906523a5aa8786030bb76e957876a66b33e639103d06bfaa64f7a0d"}},{"ruleId":"D1","level":"warning","message":{"text":"Input.tryParseAnsiSequence (cyclomatic 28): Input.tryParseAnsiSequence 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/Fedit/Input.fs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4dc536af4a96fefb78c923808e6824953ef2bd0f5ca84338bd5b4e5eaee2d54"}},{"ruleId":"D1","level":"warning","message":{"text":"Status.resolveToken (cyclomatic 28): Status.resolveToken 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/Fedit/Status.fs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0a82cd6d6017fd92801a87fff1ae16c91bb5b53b04756e81880102e67f72ab"}},{"ruleId":"D1","level":"warning","message":{"text":"Editor.runPromptListSession (cyclomatic 27): Editor.runPromptListSession has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/Fedit/Editor.fs holds 9 of the 43 methods over the threshold \u2014 including the worst \u2014 and 491 of the 1036 points over it (47%), 2.8\u00D7 the next-largest file (src/Fedit/Runtime.fs at 175). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Editor.fs"},"region":{"startLine":3376}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ecadccbb662a645b414b7c6fc34e08d1cd31661af663f474fd583d3cd4bbda"}},{"ruleId":"D1","level":"warning","message":{"text":"Layout.render (cyclomatic 25): Layout.render 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/Fedit/View.fs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"d413227a643672b6fb2f6e5ec92a93d326551490470777e956462ebf283d66b8"}},{"ruleId":"D1","level":"warning","message":{"text":"Plugins.scanAndLoadWith (cyclomatic 24): Plugins.scanAndLoadWith has cyclomatic complexity 24 (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/Fedit/Plugins.fs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc688790f0b27709f428f4ee3cfbdbb036a0816c26168e196977afda63d06e54"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.parse (cyclomatic 23): Parser.parse 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/Fedit/Cli.fs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f03c884a3ab62099feca91d52f6d2d86d24bb8a828c80e078a8c3d9dcd4b850"}},{"ruleId":"D1","level":"warning","message":{"text":"Layout.renderPicker (cyclomatic 23): Layout.renderPicker has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/View.fs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b5b646d1288e636bfb597543392439d382b02f66024a0da4f5103ea658c28e"}},{"ruleId":"D1","level":"warning","message":{"text":"Layout.renderCompletionOverlay (cyclomatic 22): Layout.renderCompletionOverlay has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/View.fs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee9bc64a5acf97f3fa5de5d4131b417d0e3b5dbcc37fd1e6c2d9a4f491650e7"}},{"ruleId":"D1","level":"warning","message":{"text":"Completions.emitNushell (cyclomatic 20): Completions.emitNushell 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/Fedit/Cli/Commands/Completions.fs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"33509ffb0e50ed044b6c45bb958bcc13981a3906265a61b58c00909365ea13b7"}},{"ruleId":"D1","level":"warning","message":{"text":"Completions.run (cyclomatic 20): Completions.run 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/Fedit/Cli/Commands/Completions.fs"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7ffb9a84084d5f6141b970ec13783bc4ff583b59a6b0975bc19563bb5b3d5c"}},{"ruleId":"D1","level":"warning","message":{"text":"Completions.emitPwsh (cyclomatic 19): Completions.emitPwsh has cyclomatic complexity 19 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Cli/Commands/Completions.fs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"970060f591669813fcd7e53cad8e9bb79db535fd0dcbe903cfd0e4c32ed68c32"}},{"ruleId":"D1","level":"warning","message":{"text":"TerminalCapabilitiesModule.fromEnv (cyclomatic 18): TerminalCapabilitiesModule.fromEnv has cyclomatic complexity 18 (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: TerminalCapabilitiesModule.toLogString (cyclomatic 20) 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/Fedit/TerminalCapabilities.fs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7dec202027794e4c2d37ed936eaf2a8587aa4344789bb87aa79bc524fb4fcfd"}},{"ruleId":"D1","level":"warning","message":{"text":"Completions.emitFishNode (cyclomatic 17): Completions.emitFishNode 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Cli/Commands/Completions.fs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"70fc1e77b085a42a7d978f3b7eec6b241ec50706a894aeb7e1093b521d6e3ed6"}},{"ruleId":"D1","level":"warning","message":{"text":"Completions.emitXonsh (cyclomatic 17): Completions.emitXonsh 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Cli/Commands/Completions.fs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97838ce210d1af396efe6724963a5f51e4e083828e9ed9da594fb16f26c3a58"}},{"ruleId":"D1","level":"warning","message":{"text":"Terminal.tryReadEvent (cyclomatic 17): Terminal.tryReadEvent 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/Fedit/Terminal.fs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acf37cdf7589894eca6d4714f798064d696b90683f7aceaa7de9401a2a481fc"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigIO.saveTo (cyclomatic 17): ConfigIO.saveTo 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Config.fs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bab93d59f4cf122aa439fa8e3daef632ea4136fa204f82b1c7baebdce06dcaf"}},{"ruleId":"D1","level":"warning","message":{"text":"Commands.completionsWith (cyclomatic 17): Commands.completionsWith has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Commands.fs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7a1a6f1aaa8a861663c74a9277b5188ec777487e23425d42692c9cff2363bd"}},{"ruleId":"D1","level":"warning","message":{"text":"HighlightRegistry.tryCreateWith (cyclomatic 17): HighlightRegistry.tryCreateWith has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: Highlight.resolveCapture (cyclomatic 68) 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/Fedit/Highlight.fs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"962dd3b49f0dcb973b96f2810d7df1ee8f6ef06eb21d7e4596ecc571a6584489"}},{"ruleId":"D1","level":"warning","message":{"text":"Completions.emitBash (cyclomatic 16): Completions.emitBash has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Cli/Commands/Completions.fs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d55a8f376f82ccf71913e3121bab30cbfb39fd8eac7efb2fbfe7f1532253606"}},{"ruleId":"D1","level":"warning","message":{"text":"Completions.emitElvish (cyclomatic 16): Completions.emitElvish 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/Fedit/Cli/Commands/Completions.fs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbdd53d58e0ce9e731e6b13d6d5f28087d13d6e974db23d83b1861ce64c15b5"}},{"ruleId":"D1","level":"warning","message":{"text":"Renderer.ansi16Of (cyclomatic 16): Renderer.ansi16Of 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/Fedit/Renderer.fs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"5561d29b1765e2223e648a1230d8e888bef534290c6d22e6a264d8d6648cd433"}},{"ruleId":"D1","level":"warning","message":{"text":"Status.layout (cyclomatic 16): Status.layout has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Status.fs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1908389cbc2f3bc94f927820d2a677c6526f4155d0a45fa6b205230cb34a32"}},{"ruleId":"D1","level":"warning","message":{"text":"Editor.refreshPrompt (cyclomatic 16): Editor.refreshPrompt has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/Fedit/Editor.fs holds 9 of the 43 methods over the threshold \u2014 including the worst \u2014 and 491 of the 1036 points over it (47%), 2.8\u00D7 the next-largest file (src/Fedit/Runtime.fs at 175). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Editor.fs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0710c6a44d744eda28755c2d2045c3d163b5a334ecfc3e9353c37ca4f6903b"}},{"ruleId":"D1","level":"warning","message":{"text":"Buffer.moveLines (cyclomatic 16): Buffer.moveLines has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Buffer.fs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ef62dbeb847679d04815af5d597adb63e44ec7bd1348810ba1323a0e3dafcc"}},{"ruleId":"D1","level":"warning","message":{"text":"TerminalCapabilitiesModule.fromQueries (cyclomatic 16): TerminalCapabilitiesModule.fromQueries 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: TerminalCapabilitiesModule.toLogString (cyclomatic 20) 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/Fedit/TerminalCapabilities.fs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c0ea0a2ff8a70b68e736be1ba45e025a2a6d7fb0549a15408984d7fca1df88"}},{"ruleId":"D2","level":"warning","message":{"text":"Editor.updateCore (cognitive 281): Editor.updateCore has cognitive complexity 281 (threshold 15). Drivers by points: match/switch 57 (175 pts), if/else 42 (82 pts), boolean chains 17, error handling 1 (4 pts), loops 1 (3 pts) (nesting depth added 163). 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/Fedit/Editor.fs"},"region":{"startLine":3717}}}],"partialFingerprints":{"codehealthFindingId/v1":"73aea07fb47236b6dbb4079421f07b899bd22ddd00746efc481ec16639362fb6"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.run (cognitive 268): Runtime.run has cognitive complexity 268 (threshold 15). Drivers by points: if/else 46 (103 pts), match/switch 45 (90 pts), error handling 19 (38 pts), loops 12 (26 pts), boolean chains 11 (nesting depth added 135). 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/Fedit/Runtime.fs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"0793cf7e3e5a57b1938e82ea0c04e4951061037d8ee6c9b2baa5227fff9328f1"}},{"ruleId":"D2","level":"warning","message":{"text":"Layout.renderTextEditor (cognitive 114): Layout.renderTextEditor has cognitive complexity 114 (threshold 15). Drivers by points: if/else 16 (48 pts), match/switch 9 (36 pts), loops 7 (24 pts), boolean chains 6 (nesting depth added 76). 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/Fedit/View.fs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb949e22cbeacfea95c8b8d9277bae7c1ccfa9009ba15827df852425a3863fc"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigIO.loadFrom (cognitive 80): ConfigIO.loadFrom has cognitive complexity 80 (threshold 15). Drivers by points: match/switch 19 (47 pts), if/else 11 (22 pts), loops 2 (8 pts), boolean chains 2, error handling 1 (nesting depth added 45). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Config.fs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c91e2d92cc19f24781b52585eb492fd9c9966f99424cef622c875197fdabdf"}},{"ruleId":"D2","level":"warning","message":{"text":"Layout.renderHexEditor (cognitive 75): Layout.renderHexEditor has cognitive complexity 75 (threshold 15). Drivers by points: if/else 25 (51 pts), match/switch 4 (11 pts), boolean chains 9, loops 2 (4 pts) (nesting depth added 35). 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/Fedit/View.fs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25f5abce90e8a8d5cc6ce6eea1b7fdf817684910fb59280c60811ad80e95f7a"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.main (cognitive 64): Program.main has cognitive complexity 64 (threshold 15). Drivers by points: if/else 14 (29 pts), match/switch 7 (24 pts), error handling 2 (7 pts), boolean chains 4 (nesting depth added 37). 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/Fedit/Program.fs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"9689daaafb41974d26feadbe23598cac0516dd0f6ee14641c62dafb33891d311"}},{"ruleId":"D2","level":"warning","message":{"text":"Layout.renderPicker (cognitive 63): Layout.renderPicker has cognitive complexity 63 (threshold 15). Drivers by points: if/else 17 (35 pts), match/switch 5 (19 pts), loops 2 (9 pts) (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/Fedit/View.fs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea519d0eb885759a1bf41d01b16ba34d52b6f2cf0e82bc906ed4604f3e0489a4"}},{"ruleId":"D2","level":"warning","message":{"text":"Editor.runDefaultAction (cognitive 62): Editor.runDefaultAction has cognitive complexity 62 (threshold 15). Drivers by points: if/else 18 (30 pts), match/switch 12 (28 pts), boolean chains 4 (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/Fedit/Editor.fs"},"region":{"startLine":2657}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc131b05bfd0c0d769c981e5796c71b8dbdf46435f8dc4b87ebb2be5e2f2f485"}},{"ruleId":"D2","level":"warning","message":{"text":"Editor.runPrompt (cognitive 61): Editor.runPrompt has cognitive complexity 61 (threshold 15). Drivers by points: match/switch 13 (47 pts), if/else 6 (13 pts), boolean chains 1 (nesting depth added 41). 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/Fedit/Editor.fs"},"region":{"startLine":3438}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1b31a205072f920b3c1d361d0bcdd8890ee3144a950bf5566a71d9ad4073a7"}},{"ruleId":"D2","level":"warning","message":{"text":"Editor.executeCommand (cognitive 60): Editor.executeCommand has cognitive complexity 60 (threshold 15). Drivers by points: match/switch 15 (32 pts), if/else 17 (28 pts) (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/Fedit/Editor.fs"},"region":{"startLine":2359}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc26bdc133bac43aacc8aeba7e1bf64015dfe8da6c682684a3b436a594ac7ef"}},{"ruleId":"D2","level":"warning","message":{"text":"Layout.renderCompletionOverlay (cognitive 51): Layout.renderCompletionOverlay has cognitive complexity 51 (threshold 15). Drivers by points: if/else 21 (44 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 25). 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/Fedit/View.fs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"4044f5589d084526d5b2f760360ef5a3781abd382e744192d53a4ebc0889237d"}},{"ruleId":"D2","level":"warning","message":{"text":"Layout.render (cognitive 50): Layout.render has cognitive complexity 50 (threshold 15). Drivers by points: if/else 19 (40 pts), match/switch 5 (7 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 24). 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/Fedit/View.fs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d3456e77669293e0813e18ceae79ffba7d3e5f6265dddb69229d0fe7298abf"}},{"ruleId":"D2","level":"warning","message":{"text":"Editor.applyPluginActions (cognitive 46): Editor.applyPluginActions has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (23 pts), match/switch 7 (22 pts), loops 1 (nesting depth added 28). 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/Fedit/Editor.fs"},"region":{"startLine":1889}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9861976f154d85c4f12b613fafd0aaf8043499f16b7af6d797a0858df3b596"}},{"ruleId":"D2","level":"warning","message":{"text":"Plugins.scanAndLoadWith (cognitive 44): Plugins.scanAndLoadWith has cognitive complexity 44 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 8 (14 pts), match/switch 3 (8 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Plugins.fs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ee6297377416c36219a254091733f294b410f616774a2249c2b5d6d8674eaf"}},{"ruleId":"D2","level":"warning","message":{"text":"Input.tryParseAnsiSequence (cognitive 42): Input.tryParseAnsiSequence has cognitive complexity 42 (threshold 15). Drivers by points: match/switch 7 (26 pts), if/else 9 (11 pts), boolean chains 5 (nesting depth added 21). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Input.fs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d416db1c9f3029e8fa86a443154c80952bd081989b2031f438441d766533ca"}},{"ruleId":"D2","level":"warning","message":{"text":"Buffer.moveLines (cognitive 42): Buffer.moveLines has cognitive complexity 42 (threshold 15). Drivers by points: if/else 20 (36 pts), match/switch 2 (5 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/Fedit/Buffer.fs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e19c50b48deb84e0de2938f05c633a78ade9f4e1f56593602b1855f0deba8da"}},{"ruleId":"D2","level":"warning","message":{"text":"Terminal.detectCapabilities (cognitive 40): Terminal.detectCapabilities has cognitive complexity 40 (threshold 15). Drivers by points: if/else 5 (17 pts), match/switch 2 (15 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 28). 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/Fedit/Terminal.fs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76a689ee7f79a94728c3b1a4703dd70a5ea903e7c3815311c9da888fdc3dfdd"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.scanNode (cognitive 39): Runtime.scanNode has cognitive complexity 39 (threshold 15). Drivers by points: error handling 4 (16 pts), if/else 6 (13 pts), loops 2 (6 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 25). 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/Fedit/Runtime.fs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"554330ce75ac40215e702b8414004128f37fe842ba70f4baf9690fe03f2b92a3"}},{"ruleId":"D2","level":"warning","message":{"text":"KeymapModule.parseAction (cognitive 37): KeymapModule.parseAction has cognitive complexity 37 (threshold 15). Drivers by points: match/switch 11 (24 pts), if/else 6 (11 pts), boolean chains 2 (nesting depth added 18). 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/Fedit/Keymap.fs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda96a0962dcb9522dc86264f8c1c5c3427eabcf6e8a7bd3e97313c39a2a2ae7"}},{"ruleId":"D2","level":"warning","message":{"text":"Plugins.list (cognitive 35): Plugins.list has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (12 pts), match/switch 2 (5 pts), error handling 1 (2 pts) (nesting depth added 21). 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/Fedit/Cli/Commands/Plugins.fs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e102bba22327b3a2614bc1e19a2606af244a47590f5d0ad2f2d76ddfacb10f"}},{"ruleId":"D2","level":"warning","message":{"text":"Highlight.spansFor (cognitive 31): Highlight.spansFor has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 4 (12 pts), loops 2 (11 pts), if/else 1 (5 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 22). 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/Fedit/Highlight.fs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ff499c864a299e83868fc05e71e5b7ec25c0814e99b04a05bc58ad7868cd56"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.parse (cognitive 30): Parser.parse has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 7 (22 pts), if/else 6 (8 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/Fedit/Cli.fs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb348378498ef15c92ddcc5b88cfb2499916945cf8a246b483e1841e2baa2db2"}},{"ruleId":"D2","level":"warning","message":{"text":"Dock.panel (cognitive 30): Dock.panel has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 6 (16 pts), if/else 7 (11 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/Fedit/Dock.fs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"491bae8cc88a98ee11027d89c39bb419b38219a01874a0dfc88b9424296d2c5d"}},{"ruleId":"D2","level":"warning","message":{"text":"Completions.emitPwsh (cognitive 29): Completions.emitPwsh has cognitive complexity 29 (threshold 15). Drivers by points: loops 8 (18 pts), match/switch 3 (8 pts), if/else 2 (3 pts) (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Cli/Commands/Completions.fs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd48c1538c0b3f5cf45a963cb8fa2a4436beb0428a5306bd9135070f28bdbd86"}},{"ruleId":"D2","level":"warning","message":{"text":"Completions.emitBash (cognitive 28): Completions.emitBash has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 6 (11 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Cli/Commands/Completions.fs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"173c2c43f50ac4f41e32f27c79cb404aff856207fdf1149dd630a472f36a564f"}},{"ruleId":"D2","level":"warning","message":{"text":"Editor.executePickerAction (cognitive 27): Editor.executePickerAction has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 14 (27 pts) (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Editor.fs"},"region":{"startLine":2164}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe00e20fb82ffd12ba3792a3c29123479ff438fe0183e23b03730f4d88bc08ba"}},{"ruleId":"D2","level":"warning","message":{"text":"LspWire.classifyMessage (cognitive 27): LspWire.classifyMessage has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 8 (25 pts), if/else 2 (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/Fedit/LspWire.fs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d12afc1ec96092844ad570478f330f8e084a82a897388f98262f2fbf2f242a"}},{"ruleId":"D2","level":"warning","message":{"text":"Completions.emitNushell (cognitive 26): Completions.emitNushell has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 6 (16 pts), loops 6 (10 pts) (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Cli/Commands/Completions.fs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"573d7a06b8e4ceca6cce76aab37134fc264b1bc2a777223ff440b004d054994a"}},{"ruleId":"D2","level":"warning","message":{"text":"Terminal.readPasteTail (cognitive 26): Terminal.readPasteTail has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 4, loops 1 (2 pts), match/switch 1 (nesting depth added 12). 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/Fedit/Terminal.fs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83ff7be6a8d3932e3ab93e424ef5ded08e8e9aeae4d194ac308b9874de3df0e"}},{"ruleId":"D2","level":"warning","message":{"text":"Input.tryMap (cognitive 26): Input.tryMap has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 6, match/switch 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Input.fs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f33594fc4ddc9091cfc0fa4328a91ad2d35c639a648deb5fe1d449cc4f57957"}},{"ruleId":"D2","level":"warning","message":{"text":"LspTransport.readContentLength (cognitive 26): LspTransport.readContentLength has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 3 (10 pts), boolean chains 1, loops 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/Fedit/LspTransport.fs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"3afabcaf96059784ed5a9fa493e2a2119c2f080b9107344aa6d861b15f2468be"}},{"ruleId":"D2","level":"warning","message":{"text":"PieceTableModule.deleteRange (cognitive 26): PieceTableModule.deleteRange has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 14). 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/Fedit/PieceTable.fs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0fc58706b05522c4406f7ac5994689f8eb0de3d9781463ff282fee6875ee05"}},{"ruleId":"D2","level":"warning","message":{"text":"Status.parseFormat (cognitive 24): Status.parseFormat has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 1 (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/Fedit/Status.fs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9e3f720ca6a3ca6efa78381e655cb43f43a48371314be7ef2db5df511629b4"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigIO.loadUserThemes (cognitive 24): ConfigIO.loadUserThemes has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 5 (16 pts), error handling 2 (4 pts), if/else 2, loops 1 (2 pts) (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Config.fs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2472df06825ffc3388cc42c780ff3f99f37afaf1326f6e831bdfa37299596d"}},{"ruleId":"D2","level":"warning","message":{"text":"Commands.completionsWith (cognitive 24): Commands.completionsWith has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 1 (3 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/Fedit/Commands.fs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"77acae0af5f4d3bae32ce6c3b5327f5d02b1384f2659700d95dcb43e765d5786"}},{"ruleId":"D2","level":"warning","message":{"text":"Completions.emitElvish (cognitive 23): Completions.emitElvish has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 3 (9 pts), loops 5 (8 pts), if/else 2 (5 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/Fedit/Cli/Commands/Completions.fs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6222ce77547f728474c4a5289d2586b913f07218f964ef9d789c3b4373b7eb3"}},{"ruleId":"D2","level":"warning","message":{"text":"KeymapModule.parseLine (cognitive 23): KeymapModule.parseLine has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 12). 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/Fedit/Keymap.fs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a989744f563a83864f38d9f98083dd5ee0e025fdbee6dde11857e025ef56a7"}},{"ruleId":"D2","level":"warning","message":{"text":"Completions.emitFishNode (cognitive 22): Completions.emitFishNode has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (12 pts), loops 4 (8 pts), if/else 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/Fedit/Cli/Commands/Completions.fs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd014a6044ae0f54f8267ea81cce1ffad87ca642caa4198cded05ef77c39d59"}},{"ruleId":"D2","level":"warning","message":{"text":"Completions.run (cognitive 22): Completions.run has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (17 pts), if/else 2 (5 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/Fedit/Cli/Commands/Completions.fs"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6cd9f04831dd117a7e995ebc73b3eeac4019a433e0b6920c11c626bef2e5bc2"}},{"ruleId":"D2","level":"warning","message":{"text":"Editor.refreshPrompt (cognitive 22): Editor.refreshPrompt has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 6 (9 pts), boolean chains 2 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Editor.fs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"737616e408dc941b8d17acd7912825c8dd76877b9b289e71857caca63a84d9f2"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer.appendDiffedCells (cognitive 21): Renderer.appendDiffedCells has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts), match/switch 2 (3 pts), boolean chains 2 (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/Fedit/Renderer.fs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8fc3fa8fd87220ee088ce38c898b0b68da25c7754a5f983835b263600d9f15"}},{"ruleId":"D2","level":"warning","message":{"text":"Editor.setLanguageServerDisabled (cognitive 21): Editor.setLanguageServerDisabled has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (18 pts), match/switch 1 (3 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/Fedit/Editor.fs"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee38853cb18be1a6591075e1c8a7b1396e5a388512793d4e44d1618a597ed9f"}},{"ruleId":"D2","level":"warning","message":{"text":"HighlightRegistry.tryCreateWith (cognitive 21): HighlightRegistry.tryCreateWith has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 5 (6 pts), error handling 3 (4 pts), loops 3 (nesting depth added 4). 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/Fedit/Highlight.fs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"4619e83ff75cf332955474f00548db84341e965fd8aa073b63b5831ddcd5ad46"}},{"ruleId":"D2","level":"warning","message":{"text":"TerminalCapabilitiesModule.fromEnv (cognitive 21): TerminalCapabilitiesModule.fromEnv has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 7, match/switch 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/Fedit/TerminalCapabilities.fs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4ce23235273b4558fd6b3bcdb60359442ab6f41d9bc486b7040eebfa84c01b"}},{"ruleId":"D2","level":"warning","message":{"text":"Status.resolveToken (cognitive 20): Status.resolveToken has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 5 (9 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/Fedit/Status.fs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"e862a082a0790b6dd6a55149b9c74eb3bb2b9bef259fa13470f56f6147a0e2c3"}},{"ruleId":"D2","level":"warning","message":{"text":"Status.layout (cognitive 20): Status.layout has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 3 (4 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Status.fs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"501ff0bd7b01c39a1e6eed2c057f30d59c1eba2a9dc8688bdade1bf2cc4ce196"}},{"ruleId":"D2","level":"warning","message":{"text":"Completions.emitXonsh (cognitive 19): Completions.emitXonsh has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (10 pts), loops 6 (9 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Cli/Commands/Completions.fs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"048801e5a327b8373a8d2b456b7b373937c901d1bf3ab780909a930b40cd9c89"}},{"ruleId":"D2","level":"warning","message":{"text":"Editor.hexInterceptAction (cognitive 19): Editor.hexInterceptAction has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 2 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Editor.fs"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26c803d92c9d4e19ff5c22bd19b1c1a507a6e784313d658d3449437f5680bb8"}},{"ruleId":"D2","level":"warning","message":{"text":"Editor.advanceReplay (cognitive 19): Editor.advanceReplay has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 3 (6 pts) (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/Fedit/Editor.fs"},"region":{"startLine":3071}}}],"partialFingerprints":{"codehealthFindingId/v1":"1795c78210ee0b9188f2cfa0308deda72bd6544445922bdc9826a2fd80148666"}},{"ruleId":"D2","level":"warning","message":{"text":"prototype-v2.html.themeDemo.treeMarker (cognitive 19): prototype-v2.html.themeDemo.treeMarker has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 2 (5 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":"docs/superpowers/plans/revised-theme-system/prototype-v2.html"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db91dfab494e3c832f38e85f199c3ffe2119d37530e925465413902444cf41a"}},{"ruleId":"D2","level":"warning","message":{"text":"prototype.html.themeDemo.treeMarker (cognitive 19): prototype.html.themeDemo.treeMarker has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 2 (5 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":"docs/superpowers/plans/revised-theme-system/prototype.html"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2de3c3a232c01d42e2b3988c30edce3e440f84ce9571c7a6654d5f26262d4f"}},{"ruleId":"D2","level":"warning","message":{"text":"Completions.emitZshNode (cognitive 18): Completions.emitZshNode has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (9 pts), loops 4 (7 pts), if/else 2 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Cli/Commands/Completions.fs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"431a2d6d63c5785e9e7599526461373dd9670fbb544aa733bf70774a23c06b1e"}},{"ruleId":"D2","level":"warning","message":{"text":"MacroFile.parseLine (cognitive 18): MacroFile.parseLine has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 3 (11 pts), if/else 4 (6 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/Fedit/MacroIO.fs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95a061c470b33326986f2ea7945b6628beece3105bdc846d153c316fff0573a"}},{"ruleId":"D2","level":"warning","message":{"text":"ManifestJson.parse (cognitive 18): ManifestJson.parse has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (13 pts), if/else 2 (4 pts), error handling 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/Fedit/Plugins.fs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae7852d3c7a2b67885b92ed2739570f67f7d137da55b4fb11c1cb4d431f75b8"}},{"ruleId":"D2","level":"warning","message":{"text":"Terminal.tryReadEvent (cognitive 17): Terminal.tryReadEvent has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Terminal.fs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51c2d1b17f0c8316eb66b0753532bdf869e0a2c45273877422de9688c8a0349"}},{"ruleId":"D2","level":"warning","message":{"text":"Layout.renderSidebar (cognitive 17): Layout.renderSidebar has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/View.fs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"b232c712f68499ed27b3ec566702cbccaf705fa322b9653c834a100c7178f729"}},{"ruleId":"D2","level":"warning","message":{"text":"Highlight.selectionLadder (cognitive 17): Highlight.selectionLadder has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (6 pts), if/else 1 (4 pts), loops 1 (3 pts), boolean chains 2, error handling 1 (2 pts) (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/Fedit/Highlight.fs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea9f774f494384a802c060b2e2ab14662a7a38a40a5000a7a9b073e32fe181f"}},{"ruleId":"D2","level":"warning","message":{"text":"Editor.setHexViewMode (cognitive 16): Editor.setHexViewMode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Editor.fs"},"region":{"startLine":1776}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1259f3a2a312dc9d20bace1c2d571afe33c4bc6d5a254b523fc862be3e84dd"}},{"ruleId":"D2","level":"warning","message":{"text":"Editor.runPromptListSession (cognitive 16): Editor.runPromptListSession has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 4 (7 pts), boolean chains 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/Fedit/Editor.fs"},"region":{"startLine":3376}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf57f5d20b2897d4710a4464d000ff4c6f5d379f1f6241ad175c7f4a2961bd1"}},{"ruleId":"D2","level":"warning","message":{"text":"Editor.highlightEffects (cognitive 16): Editor.highlightEffects has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Editor.fs"},"region":{"startLine":4707}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5495739912b6efcaeabaa1d239436c017b796be903264ccfaef73fc64775cf9"}},{"ruleId":"D2","level":"warning","message":{"text":"Editor.hookEffects (cognitive 16): Editor.hookEffects has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (6 pts), loops 2 (5 pts), match/switch 3 (5 pts) (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/Fedit/Editor.fs"},"region":{"startLine":4954}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b55601db148c61b8e1d81ee24c6b03ef3a31702b9e4aeb9bee01b7276c6a4cb"}},{"ruleId":"D2","level":"warning","message":{"text":"LspTransport.readLine (cognitive 16): LspTransport.readLine has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/LspTransport.fs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22f74ed0a67e20f71b099626ffc21a38ac0c242f6a4a3479721d88dd37e3633"}},{"ruleId":"D2","level":"warning","message":{"text":"ChordModule.parse (cognitive 16): ChordModule.parse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 2 (5 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/Fedit/Keys.fs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc332a994d2dea4cdbc44b244861fc48f6af01c9931c8baa6d73201b2d12654e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Fedit/Editor.fs: FileTooLong \u2014 3621 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 150 functions. The bar is 500 significant lines; this is 3121 over it, 7.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Editor.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"554a4cb9011eafd7081a22a4e9d377138d529eede4e96319016a242723b8bb72"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: prototype-v2.html.themeDemo: FunctionTooLong \u2014 themeDemo runs 473 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 373 over it, 4.73\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":"docs/superpowers/plans/revised-theme-system/prototype-v2.html"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f34b9edd778501985dd530c2dd3af77d6cedb44741b875d8c052bbbf61e1ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: prototype.html.themeDemo: FunctionTooLong \u2014 themeDemo runs 448 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 348 over it, 4.48\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":"docs/superpowers/plans/revised-theme-system/prototype.html"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"9815670b641de9338e76f7a9a224fd81f7a212fa92a9932c16e70b1672ca10ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Fedit/Runtime.fs: FileTooLong \u2014 1164 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 664 over it, 2.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Runtime.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b0d2bd0fb307c677bab09984431dc10b6cf2cd9480ae3a3dad1040e8740bce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Commands/Completions.fs: FileTooLong \u2014 846 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 41 functions. The bar is 500 significant lines; this is 346 over it, 1.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Cli/Commands/Completions.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b512e6cad63f9e15eee844d4460f242c0516bff057db08d3ae1c0e1ec5d34370"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: PluginProtocol: TooManyFunctions \u2014 48 functions. The bar is 30 functions; this is 18 over it, 1.60\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/PluginProtocol.fs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"332731251fd099ab2d900a155555758c2eebc47bbf73e5fe3c787c16b3033efd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Fedit/View.fs: FileTooLong \u2014 778 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 33 functions. The bar is 500 significant lines; this is 278 over it, 1.56\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/View.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4415d5424c147f223378f58666e35732ac85dc10af07b89cc6dbc17deb09e12"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Fedit/Plugins.fs: FileTooLong \u2014 597 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 97 over it, 1.19\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/Fedit/Plugins.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d367f1a25d8ce7b5b161de0d383640f54e633c9f522c7af1b472d93ec70d90b1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: LspWire: TooManyFunctions \u2014 33 functions. The bar is 30 functions; this is 3 over it, 1.10\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/LspWire.fs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75db7107c454f514e134e8717e5a59ec8ea44425b16c78306ce4d5177796753"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Fedit/Highlight.fs: FileTooLong \u2014 544 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 44 over it, 1.09\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/Fedit/Highlight.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"491c42e997fd4dd9a74ce9f24f2721522bda0094b0047ccac4c950145a1b5c26"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Fedit/Pickers.fs: FileTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 40 functions. The bar is 500 significant lines; this is 21 over it, 1.04\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/Fedit/Pickers.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde675409e4bc51fb1e3f080c5f217abb102360ed1a0c155920c873699b19291"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Fedit/Config.fs: FileTooLong \u2014 504 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 4 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Config.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49287e9f14a090c250ccf8a81caa0fd592e9112810ebc481005f06826d5e9a3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/Fedit/Cli/Commands/CommandReference.fs:7-120 | src/Fedit/Cli/Commands/Completions.fs:11-1250 | src/Fedit/Cli/Commands/Keybinds.fs:14-359 | src/Fedit/Cli/Commands/Plugins.fs:5-395 | src/Fedit/Cli/Commands/Themes.fs:8-173 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Cli/Commands/CommandReference.fs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5a237a2a5f614323395612a306d5f5e0d3552a46dba903b72d9b00bbba177f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201318 lines \u00D7 2): src/Fedit/Cli/Commands/Keybinds.fs:208-225 | src/Fedit/Cli/Commands/Themes.fs:14-26 \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. 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/Fedit/Cli/Commands/Keybinds.fs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb9592fa246dd7382ebe92273e05ae08d1d63274436c1ea746eb5c1d352933a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201317 lines \u00D7 3): src/Fedit/Themes.fs:312-328 | src/Fedit/Themes.fs:360-374 | src/Fedit/Themes.fs:423-433 \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/Fedit/Themes.fs:312\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. 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/Fedit/Themes.fs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e6f9692ff5d871ce5f5810596cfb4c6c47716599d129a2504dd4a02975568b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 4): src/Fedit/Themes.fs:174-189 | src/Fedit/Themes.fs:307-321 | src/Fedit/Themes.fs:355-369 | src/Fedit/Themes.fs:418-432 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Fedit/Themes.fs:174\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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/Fedit/Themes.fs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d30930735291d7d7c6323d20af46ad0b9c7440ae8d25eae6f533fddd3e8c27d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201315 lines \u00D7 2): src/Fedit/Buffer.fs:654-660 | src/Fedit/Hex.fs:208-222 \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. 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/Fedit/Buffer.fs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ca202869ae7e35957d5e0a9db131896f7ec373e7da92d9218c0124187fbb09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/Fedit/Cli/Commands/CommandReference.fs:104-115 | src/Fedit/Cli/Commands/Keybinds.fs:343-354 | src/Fedit/Cli/Commands/Themes.fs:157-168 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Fedit/Cli/Commands/CommandReference.fs:104\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/Fedit/Cli/Commands/CommandReference.fs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8d7e7ce017e6e20a4584b1ff22e7b41fdcc535d7f9af700fe25c5027c69e12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/Fedit/Cli/Commands/Completions.fs:1192-1200 | src/Fedit/Cli/Commands/Plugins.fs:195-203 | src/Fedit/Cli/Commands/Plugins.fs:220-228 | src/Fedit/Cli/Commands/Plugins.fs:341-349 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Cli/Commands/Completions.fs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee300ecf600d295eb769d438c90be6deec06da6e3f50bc53b7419846d282a12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Fedit/Buffer.fs:644-653 | src/Fedit/Hex.fs:199-207 \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/Fedit/Buffer.fs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"457ba5da7ef57398fdb4d0964e38cb8c7f696250027c5af091f94af3f3008291"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 8): src/Fedit/Cli/Commands/CommandReference.fs:107-114 | src/Fedit/Cli/Commands/Completions.fs:1191-1198 | src/Fedit/Cli/Commands/Keybinds.fs:346-353 | src/Fedit/Cli/Commands/Plugins.fs:194-201 | src/Fedit/Cli/Commands/Plugins.fs:219-226 | src/Fedit/Cli/Commands/Plugins.fs:271-278 | src/Fedit/Cli/Commands/Plugins.fs:340-347 | src/Fedit/Cli/Commands/Themes.fs:160-167 \u2014 there are 8 copies across 5 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 8 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Cli/Commands/CommandReference.fs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9f5b45cea42e2030505f8a4d6e7633ee34fcec926b50e103ef1d4af0cb6327"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Fedit/Editor.fs:2362-2369 | src/Fedit/Editor.fs:2407-2414 \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/Fedit/Editor.fs"},"region":{"startLine":2362}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a679655231d830f179e26a6ca63df16814170e99b5fbfd066d02d43e489546"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Fedit/Config.fs:61-67 | src/Fedit/Config.fs:96-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Config.fs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc42084d75529a1851def1c87a84cfe8eb201023b82b5f8cd576282495eebf4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): src/Fedit/Cli/Commands/CommandReference.fs:86-96 | src/Fedit/Cli/Commands/Completions.fs:1161-1171 | src/Fedit/Cli/Commands/Keybinds.fs:325-335 | src/Fedit/Cli/Commands/Themes.fs:139-149 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Fedit/Cli/Commands/CommandReference.fs:86\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/Fedit/Cli/Commands/CommandReference.fs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e698b15fe16ac686f7b92b3d9a08866c9dff6416280370fe51436d72223730"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Fedit/Commands.fs:279-288 | src/Fedit/Commands.fs:332-339 \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/Fedit/Commands.fs:279\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Commands.fs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8ab5555f7fadebc712bd2818d8a036466b1dcda6ca9c07be0838531c93db9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Fedit/Config.fs:117-122 | src/Fedit/Config.fs:148-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Fedit/Config.fs:117\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/Fedit/Config.fs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"777da59a3b3c0e0ea5bb31ea42f776f381c82f39c67119c06ca23cd44a45fdc1"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/Fedit/LspClient.fs: 0.0% line coverage (0/244)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/LspClient.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb7650f034778c2635c7d061b646ebfe9d0f71d954e6d8158c9dd7c1697c881"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/Fedit/Program.fs: 0.0% line coverage (0/169)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Program.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb90a60460e617f933ef29b80701c4dceb4a5119253a9d193cc2d863ab57667"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/Fedit/Cli/Commands/CommandReference.fs: 19.4% line coverage (14/72)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Cli/Commands/CommandReference.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"844fc6d7c9f2717c5a167f09bf9a790d9ec126350aac309c7f4e80cbd5390279"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/Fedit/Cli/Commands/Themes.fs: 47.7% line coverage (53/111)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Cli/Commands/Themes.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a750ad6b7d60fd725f0ecd01ae4e29dd4b1cfd8fcf1039b6a2a7c1aee49ac11"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/Fedit/Cli/Commands/Plugins.fs: 0.0% line coverage (0/259)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Cli/Commands/Plugins.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c714c667fd44da86add7bb8583eaf1f48a3468a9ff3ff98d25712a2cbdedfa"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/Fedit/Runtime.fs: 6.0% line coverage (67/1117)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Runtime.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c821e8dc9a1017364669ee7924e3655e0f348ec8eb596df54fa001deb5fbb5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/Fedit/KeymapIO.fs: 12.5% line coverage (1/8)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/KeymapIO.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3660c26fa30e6887f63eb68bb3c3b04fc26fea4bcf4097235ba74fb3e5e39fdd"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/Fedit/PluginProtocol.fs: 42.3% line coverage (164/388)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/PluginProtocol.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1762db71342ee83c67db16db12c4040a714934aaefa914ce4bfa45d5114ed03"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/Fedit/KittyImage.fs: 0.0% line coverage (0/88)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/KittyImage.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79446ff957a762fcb98595daa806d0928f1af7aaf31f22419c9ff9cd4dc33aab"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/Fedit/ImageProtocol.fs: 0.0% line coverage (0/5)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/ImageProtocol.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6939aa359e556194dd52916f7c1d1b1e423de30b5ce906315fcfc0c20a44fb"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/Fedit/MouseProtocol.fs: 47.4% line coverage (55/116)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/MouseProtocol.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1ccfc4d2a9aa0ad44ddbce75b2013cccc0f32a5ce1a90b8a369cc5e455a9d7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/Fedit/TerminalCapabilities.fs: 16.1% line coverage (24/149)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/TerminalCapabilities.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3bcdf51c5bf78e3c768b73d58bf99bc169ade10d958bb30ef0bdd1da6423c5"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: xunit: xunit 2.9.3 \u2014 Legacy \u2014 the publisher\u0027s replacement is \u0060xunit.v3\u0060; that is the next major line under a new package id, so the move is a breaking rename rather than a version bump \u2014 budget for API changes in the code that uses it, not only the reference swap."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d37c8c0e8046c9e8358e976373216abfb78e9fdef63ed53d3edcaa7d2238edcd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Fedit/Editor.fs: src/Fedit/Editor.fs changed 41 times in last 90 days, max cyclomatic complexity 218 in Editor.updateCore at line 3717. 7 of those changes were fix/bug commits, and the other 34 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-06-11..2026-09-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-11 17:16:22 \u002B02:00\u0027 --until=\u00272026-09-09 17:16:22 \u002B02:00\u0027 --full-history --no-merges -- src/Fedit/Editor.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/Fedit/Editor.fs"},"region":{"startLine":3717}}}],"partialFingerprints":{"codehealthFindingId/v1":"301e12cb75c88999e81ce084916128349b8e7de045a2ddc41784d30c9ece9c7e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Fedit/Runtime.fs: src/Fedit/Runtime.fs changed 34 times in last 90 days, max cyclomatic complexity 190 in Runtime.run at line 418. 8 of those changes were fix/bug commits, and the other 26 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-06-11..2026-09-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-11 17:16:22 \u002B02:00\u0027 --until=\u00272026-09-09 17:16:22 \u002B02:00\u0027 --full-history --no-merges -- src/Fedit/Runtime.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/Fedit/Runtime.fs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff8d4311dde4569df7568cddb507fee7c0c177cc42bed547bb31238b11f8d53"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Fedit/Keymap.fs: src/Fedit/Keymap.fs changed 16 times in last 90 days, max cyclomatic complexity 98 in KeymapModule.parseAction at line 446. 1 of those changes was a fix/bug commit, and the other 15 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-06-11..2026-09-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-11 17:16:22 \u002B02:00\u0027 --until=\u00272026-09-09 17:16:22 \u002B02:00\u0027 --full-history --no-merges -- src/Fedit/Keymap.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/Fedit/Keymap.fs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf05891e621da0b74815febfa8ddf2910a3974866e36ff32e6dfa30259f4456d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Fedit/Actions.fs: src/Fedit/Actions.fs changed 13 times in last 90 days, max cyclomatic complexity 82 in ActionModule.name at line 163. 1 of those changes was a fix/bug commit, and the other 12 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-06-11..2026-09-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-11 17:16:22 \u002B02:00\u0027 --until=\u00272026-09-09 17:16:22 \u002B02:00\u0027 --full-history --no-merges -- src/Fedit/Actions.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/Fedit/Actions.fs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ca627c6ec243dc472f2388b2d7cd1941bcbe5fa93805fdf99b884eae71606e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Fedit/Cli/Commands/Keybinds.fs: src/Fedit/Cli/Commands/Keybinds.fs changed 12 times in last 90 days, max cyclomatic complexity 82 in Keybinds.actionMeta at line 28. 1 of those changes was a fix/bug commit, and the other 11 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-06-11..2026-09-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-11 17:16:22 \u002B02:00\u0027 --until=\u00272026-09-09 17:16:22 \u002B02:00\u0027 --full-history --no-merges -- src/Fedit/Cli/Commands/Keybinds.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/Fedit/Cli/Commands/Keybinds.fs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"588e3720194bc2dd047389a4e319319fac48f2a1eb3111351023d996cf9b6b00"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Fedit/Highlight.fs: src/Fedit/Highlight.fs changed 9 times in last 90 days, max cyclomatic complexity 68 in Highlight.resolveCapture at line 292. 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-06-11..2026-09-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-11 17:16:22 \u002B02:00\u0027 --until=\u00272026-09-09 17:16:22 \u002B02:00\u0027 --full-history --no-merges -- src/Fedit/Highlight.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/Fedit/Highlight.fs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5540df1ce6f8cb01a528de0fa0f342a47708773f1682946da1e1f3f20a66b24"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Fedit/Config.fs: src/Fedit/Config.fs changed 11 times in last 90 days, max cyclomatic complexity 46 in ConfigIO.loadFrom at line 78. 1 of those changes was a fix/bug commit, and the other 10 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-06-11..2026-09-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-11 17:16:22 \u002B02:00\u0027 --until=\u00272026-09-09 17:16:22 \u002B02:00\u0027 --full-history --no-merges -- src/Fedit/Config.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/Fedit/Config.fs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6d4a0a450c9d0a8a1937dc77fc0c182e6b166b37f7ab009871f28e804ac0b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Fedit/View.fs: src/Fedit/View.fs changed 11 times in last 90 days, max cyclomatic complexity 39 in Layout.renderTextEditor at line 357. 1 of those changes was a fix/bug commit, and the other 10 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-06-11..2026-09-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-11 17:16:22 \u002B02:00\u0027 --until=\u00272026-09-09 17:16:22 \u002B02:00\u0027 --full-history --no-merges -- src/Fedit/View.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/Fedit/View.fs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"70916015ab769014371c4987dfd6ce1da1d38cd9455262335796751bf196e4c9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Fedit/Dock.fs: src/Fedit/Dock.fs changed 10 times in last 90 days, max cyclomatic complexity 31 in Dock.panel at line 75. 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-06-11..2026-09-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-11 17:16:22 \u002B02:00\u0027 --until=\u00272026-09-09 17:16:22 \u002B02:00\u0027 --full-history --no-merges -- src/Fedit/Dock.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/Fedit/Dock.fs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ea13673d63afa94ea0ec481a71c0809b52b0e685ca3a930dcec147e2fa7d15"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Fedit/PluginWire.fs: src/Fedit/PluginWire.fs changed 7 times in last 90 days, max cyclomatic complexity 33 in PluginWire.readAction at line 289. 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-06-11..2026-09-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-11 17:16:22 \u002B02:00\u0027 --until=\u00272026-09-09 17:16:22 \u002B02:00\u0027 --full-history --no-merges -- src/Fedit/PluginWire.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/Fedit/PluginWire.fs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8008daf48785f83f63d3861ba3acbbeac3d6e5821ab9462d899e651c0187f94"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Fedit/Status.fs: src/Fedit/Status.fs changed 7 times in last 90 days, max cyclomatic complexity 28 in Status.resolveToken at line 159. 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-06-11..2026-09-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-11 17:16:22 \u002B02:00\u0027 --until=\u00272026-09-09 17:16:22 \u002B02:00\u0027 --full-history --no-merges -- src/Fedit/Status.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/Fedit/Status.fs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"7649eb5034d5551143ea150382ed2efa516a52b6529a440d37eb50f2ecf0c49c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Fedit/Program.fs: src/Fedit/Program.fs changed 6 times in last 90 days, max cyclomatic complexity 31 in Program.main at line 114. 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-06-11..2026-09-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-11 17:16:22 \u002B02:00\u0027 --until=\u00272026-09-09 17:16:22 \u002B02:00\u0027 --full-history --no-merges -- src/Fedit/Program.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Fedit/Program.fs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dbafd5c6955acfdb5ecf1012b5d943d6b7b0535e41489e1d59c61fea9dd66c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Fedit/Plugins.fs: src/Fedit/Plugins.fs changed 7 times in last 90 days, max cyclomatic complexity 24 in Plugins.scanAndLoadWith at line 645. 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-06-11..2026-09-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-11 17:16:22 \u002B02:00\u0027 --until=\u00272026-09-09 17:16:22 \u002B02:00\u0027 --full-history --no-merges -- src/Fedit/Plugins.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/Fedit/Plugins.fs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"498fb3e88f1f28aec3b9e57f11d231f16bc07e274462855733362d89782a271f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Fedit/Commands.fs: src/Fedit/Commands.fs changed 8 times in last 90 days, max cyclomatic complexity 17 in Commands.completionsWith at line 472. 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-06-11..2026-09-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-11 17:16:22 \u002B02:00\u0027 --until=\u00272026-09-09 17:16:22 \u002B02:00\u0027 --full-history --no-merges -- src/Fedit/Commands.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/Fedit/Commands.fs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f4cd14cf2b97edefeb18e9e497fa8d7f94968ed7963f0d090b0b60ae116944"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Fedit/LspTypes.fs: src/Fedit/LspTypes.fs changed 3 times in last 90 days, max cyclomatic complexity 16 in LanguageServers.languageIdFor at line 190. 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-06-11..2026-09-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-11 17:16:22 \u002B02:00\u0027 --until=\u00272026-09-09 17:16:22 \u002B02:00\u0027 --full-history --no-merges -- src/Fedit/LspTypes.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/Fedit/LspTypes.fs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c42e8bac4df4bfd11bf2d286795cd9a84e3de5f0e28cd87f09aa0021d6e8c8a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Fedit/TerminalCapabilities.fs: src/Fedit/TerminalCapabilities.fs changed 2 times in last 90 days, max cyclomatic complexity 20 in TerminalCapabilitiesModule.toLogString at line 272. 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-06-11..2026-09-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-11 17:16:22 \u002B02:00\u0027 --until=\u00272026-09-09 17:16:22 \u002B02:00\u0027 --full-history --no-merges -- src/Fedit/TerminalCapabilities.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/Fedit/TerminalCapabilities.fs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ae71787d2913ecd61711f4161fbdee9ade730cc23fbd17558089b26c81a47e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Fedit/Cli/Commands/Completions.fs: src/Fedit/Cli/Commands/Completions.fs changed 2 times in last 90 days, max cyclomatic complexity 20 in Completions.emitNushell at line 647. 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-06-11..2026-09-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-11 17:16:22 \u002B02:00\u0027 --until=\u00272026-09-09 17:16:22 \u002B02:00\u0027 --full-history --no-merges -- src/Fedit/Cli/Commands/Completions.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/Fedit/Cli/Commands/Completions.fs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"785c9243b4b3832d6f2574bc20cb1d78783c55114c4ceae7057df3e62d916a62"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Fedit/Terminal.fs: src/Fedit/Terminal.fs changed 2 times in last 90 days, max cyclomatic complexity 17 in Terminal.tryReadEvent at line 305. 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-06-11..2026-09-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-11 17:16:22 \u002B02:00\u0027 --until=\u00272026-09-09 17:16:22 \u002B02:00\u0027 --full-history --no-merges -- src/Fedit/Terminal.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/Fedit/Terminal.fs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"5206cdc243fbd5d3327467ef089f9ca9c2f0bbff477e26c1b2b9e1f6dbf8e574"}},{"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":"D27","level":"note","message":{"text":"Scattered collaborators: 84 % of calls cross a namespace and only 27 % of collaborators are co-located \u2014 group each feature\u0027s code into a vertical slice so a call\u0027s collaborators sit together."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5aad4a4530bac3928d3a065a664be89d023ecfc865f9bf79ac05754b3bffe322"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"3f574bb23a2a4c82e87df8226324b7549c4bb2ceb01d3c07edcb406f753d844b"},"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":"6a4e44983630a4132a6130c1f06358b59cacc2296ceb4e04e4b4d91b6cdbdac6"},"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":"7acf2e5949d448c43de8f5c84268987991df74271ebeed111e9cecfb94fe2e48"},"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":"00d34303a1856ea33695024ce53522e0794f91bd57b69d042aa122e503afaac7"},"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":"a1f31e3fc38e806c632551480508ae27b2701acddad0a9d80c648ba1fc9463b3"},"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":"226db895c7b3766bf242894132360801c75576e950f0ab117654a1651cc5eacb"},"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":"9b549d9de0052cdcf3a0fd587b9baa6d0b3f93fe1c813085c4da28502a20e77b"},"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":"c1bb7814097052b3b9e49cf20adb5ffa3c94da3abc00863955683dc4725b2e91"},"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":"bb15bb14a512077b6a6dad0b7c45ff45773ed0ba5681f788af1359eef3a4f270"},"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":"8e507844d9e29fe4e32c427b050c7736a02e75f8a3d95373e2469a28c729e1b7"},"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":"c52164266fcb7e0daeb69466e90e70cf55f61b711dad3de792b478f4bd542aa2"},"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":"bf6e654aae86dc886c5a2e651d1be07a1252f28560ba57c82c6b15ac3d1f9c30"},"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":"96f88121b035a898a6759141862415469563ae4858d3bd2449d90d5e5ba04a57"},"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":"0d47ad1073f9d0cbc13605756a1961dd6caf7009e75d6249332fce34b2673de3"},"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":"9c37c2f4ff3ea4fb4b1de0caa23298222c6deab2f4a36a7ee5848a1a67b565a7"},"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":"31e8dd120c5d0e2edd506846a3a3dc96a16c6943561e05d2da731a5b5b30c30d"},"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":"b21ef51d97f04d1a8b921e635aca9ef4e877341aa2c3b0f6eaeabc61234774b6"},"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":"4998481edb5fd3544839d86593203250d4eb8236dba29de6c9f2757de74ab2a9"},"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":"6aa38dd3830a632b2838a3ec304370ad8fc5d8b7c44f366aa6950c92930145c2"},"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":"6819b36024d45f5f0e1d43e74427f1e72c7d8dae5d09101e0f966a51bf6829ab"},"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":"6504d8d1633fd2629c17cb911821ef9d4b240f323d5e1ebac2df01ac4726a04a"},"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":"23036461c40ba94af1633700555d58802ee960d6c72fdbd6c5fe7258e46919df"},"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":"d9d6b6034fcdb0188584ebc64f99d4bc058c7adf7e134db28071cfbc9373e5ac"},"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":"ae59d5e9dd2c30e110a21be3f2f3e4339df91ffb4154cfcf5f17bedb858ec684"},"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":"e7aea5ad354bb944fe749ff0e5f574830ccdd11e2edd1cb16678dd3d93b52205"},"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":"64aee044c1f4dd4bb7a77441c8cfb2ad1960dbe2c5bbb6dcc4a3af1fa08e7b62"},"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":"31e15292ee7781495cff3025f3779e23aded0d07be93120b45c65e1d6518c389"},"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":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0752d0df7434000fcabf1048e2de30a7a1a8b982b3db9a19898c4dec199856b4"}},{"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":"d068c977b62d9a977df1bb6f53e8b00b586c3abee955f91d715f92b8e019d624"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/modality-explorer.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"7319c109fdb5d084796038964cdaff0f560fba654d2d3c3ca98c35a66daa7408"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h2 to h4: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/modality-explorer.html"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da2cafbcbdadb4c7ced9f6a02de885ceef588ce87856f1049ad99bdbfe590ee"}},{"ruleId":"AC5","level":"error","message":{"text":"Invalid value \u0022sortAria(\u0027stroke\u0027)\u0022 for aria-sort: \u0022sortAria(\u0027stroke\u0027)\u0022 is not a valid value for aria-sort \u2014 allowed: ascending, descending, none, other."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/src/pages/docs/keybindings.astro"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35a05e056676cf1972cd2d9c7f183ac78cffdd421e94b8c191f86acef748db6"}},{"ruleId":"AC5","level":"error","message":{"text":"Invalid value \u0022sortAria(\u0027action\u0027)\u0022 for aria-sort: \u0022sortAria(\u0027action\u0027)\u0022 is not a valid value for aria-sort \u2014 allowed: ascending, descending, none, other."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/src/pages/docs/keybindings.astro"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f016d7654d15aa4c727ca672eea13972a51d3a9c4dbfb517e33ab44338aa41"}},{"ruleId":"AC5","level":"error","message":{"text":"Invalid value \u0022sortAria(\u0027context\u0027)\u0022 for aria-sort: \u0022sortAria(\u0027context\u0027)\u0022 is not a valid value for aria-sort \u2014 allowed: ascending, descending, none, other."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/src/pages/docs/keybindings.astro"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"7197697badb8f1a3431266001c1ab0b90947a951b49a01a64f99c29ada4bd08f"}},{"ruleId":"AC7","level":"warning","message":{"text":"Accessibility enforcement below the top rung: No accessibility enforcement found \u2014 no a11y linter (an accessibility check that can read your UI \u2014 no component framework was detected and your pages are rendered by server-side templates, which neither the JSX/Vue ESLint plugins nor the HTML-template linters can parse; run axe/pa11y over the rendered pages, or assert the accessibility invariants over that rendered HTML in the test suite you already have) and no axe/pa11y/Lighthouse in tests or CI. Start by running that check over your rendered pages in CI. What was searched, so you can tell an absence from a miss: the 26 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository\u0027s test and CI files \u2014 matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d46019b86eff5ddad9db289e6802ac158899e980df54c34f67722442787ead62"}},{"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":"P12","level":"warning","message":{"text":"Coverage collected but not gated: CI collects a coverage report but no step enforces a minimum \u2014 coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool\u0027s minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository\u0027s CI files AND its coverage configuration \u2014 the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited \u2014 matched against the threshold settings this check knows by name. A floor set in your coverage service\u0027s web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f63c06044cf998d9a0698692df30d8873e29bc9b0c98ee829255017c1193d33"}},{"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 30496 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":"S1","level":"note","message":{"text":"No security response headers detected: No Content-Security-Policy / X-Frame-Options / X-Content-Type-Options configuration found \u2014 defense in depth, even when a reverse proxy could set them. This is reported because \u0060vercel.json\u0060 configures this repository\u0027s static hosting, including its response headers, so the configuration that would carry these headers is in this repository and was read in full. (\u22122.0 on this card.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/vercel.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72817bdb3c3a9687cf507ff66689cb8d0d62aec47b76bb979232cf3bc6987b2e"}}],"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-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"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-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.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-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"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":34,"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."]}]}