{"$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":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"]}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"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":"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":"FsProj.previewAddCompileIncludeSnippet (cyclomatic 41): FsProj.previewAddCompileIncludeSnippet has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FsProj.fs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"87dab4aee9f01bc53c83a8276b68e8e8f17713b7b9534e7cd0290ed04790193d"}},{"ruleId":"D1","level":"warning","message":{"text":"FableOutput.detectLayoutMismatch (cyclomatic 37): FableOutput.detectLayoutMismatch has cyclomatic complexity 37 (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/FableOutput.fs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8da656334ba8bcacfecb7e02088450f7263f30f9f9bd7ef16da38119693eca"}},{"ruleId":"D1","level":"warning","message":{"text":"TemplateEngine.fileToRoute (cyclomatic 26): TemplateEngine.fileToRoute has cyclomatic complexity 26 (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/TemplateEngine.fs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7ed17334ea1fcbf80b90bb52012e06a9c192095243e1db724af8ac9780aba8"}},{"ruleId":"D1","level":"warning","message":{"text":"AddPage.addCompileIncludeToProject (cyclomatic 25): AddPage.addCompileIncludeToProject 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/Commands/AddPage.fs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"29fd12cae6cbe83bcace3f8f5dfd0d085336b8c4eec149423a21800501d8ccfa"}},{"ruleId":"D1","level":"warning","message":{"text":"AddLayout.addCompileIncludeToProject (cyclomatic 20): AddLayout.addCompileIncludeToProject has cyclomatic complexity 20 (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/Commands/AddLayout.fs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98fdb19f60e1895a4453c1c6af83f81d1e736e0cf897547a91bfa5e67970cf6"}},{"ruleId":"D1","level":"warning","message":{"text":"Server.fableWatch (cyclomatic 18): Server.fableWatch has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Commands/Server.fs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"03128422dcafdcf5daabc4788b83172a3ffff5a170a7675714039e9b7d3bf5a2"}},{"ruleId":"D1","level":"warning","message":{"text":"FableOutput.promptForAutoFix (cyclomatic 16): FableOutput.promptForAutoFix 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/FableOutput.fs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8dc812ac47b3f5c838f75d344a6d64547d84f9a468d2a26fa462edbebe6ed27"}},{"ruleId":"D2","level":"warning","message":{"text":"FsProj.previewAddCompileIncludeSnippet (cognitive 88): FsProj.previewAddCompileIncludeSnippet has cognitive complexity 88 (threshold 15). Drivers by points: if/else 26 (46 pts), match/switch 9 (33 pts), boolean chains 4, loops 2 (4 pts), error handling 1 (nesting depth added 46). 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/FsProj.fs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb6fb44d91b67b8067dd3c13df429fd8b40fd4c119f0143356e71e256e1008d"}},{"ruleId":"D2","level":"warning","message":{"text":"FableOutput.detectLayoutMismatch (cognitive 87): FableOutput.detectLayoutMismatch has cognitive complexity 87 (threshold 15). Drivers by points: if/else 31 (74 pts), boolean chains 13 (nesting depth added 43). 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/FableOutput.fs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fcdedc81a2cb3d7694ffb6763ffb979f798ebbfda0f126951a00bdd62868f78"}},{"ruleId":"D2","level":"warning","message":{"text":"FableOutput.promptForAutoFix (cognitive 52): FableOutput.promptForAutoFix has cognitive complexity 52 (threshold 15). Drivers by points: if/else 17 (41 pts), loops 2 (8 pts), boolean chains 3 (nesting depth added 30). 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/FableOutput.fs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c4028231c6a7e5ccf0e98db8f0eb704f88e2162206134553c497b7c63dd435"}},{"ruleId":"D2","level":"warning","message":{"text":"AddPage.addCompileIncludeToProject (cognitive 51): AddPage.addCompileIncludeToProject has cognitive complexity 51 (threshold 15). Drivers by points: if/else 18 (30 pts), match/switch 3 (10 pts), loops 2 (6 pts), boolean chains 4, error handling 1 (nesting depth added 23). 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/Commands/AddPage.fs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"554250202159da3076ff74f68138c2f51f65c4a91a842235e62aa94a62cc21d1"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateEngine.fileToRoute (cognitive 49): TemplateEngine.fileToRoute has cognitive complexity 49 (threshold 15). Drivers by points: if/else 40 (43 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/TemplateEngine.fs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"f742d536aa18ff55b7ce9d32d21f904535bfb279e541cba88df0b5badcd2c054"}},{"ruleId":"D2","level":"warning","message":{"text":"FsProj.previewPageFilesReordering (cognitive 45): FsProj.previewPageFilesReordering has cognitive complexity 45 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 4 (18 pts), boolean chains 2, error handling 1 (nesting depth added 30). 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/FsProj.fs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"344fb549acc778f33c24c88b6f4203173c8077e9761972c088b143bfb1b7d59d"}},{"ruleId":"D2","level":"warning","message":{"text":"AddLayout.addCompileIncludeToProject (cognitive 43): AddLayout.addCompileIncludeToProject has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (23 pts), match/switch 3 (10 pts), loops 2 (6 pts), boolean chains 3, error handling 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Commands/AddLayout.fs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7cd1b5af09aa31f729e86dcc3729bc3a6a8b28fd8b1eeee375dc9007b17cdf"}},{"ruleId":"D2","level":"warning","message":{"text":"Build.build (cognitive 36): Build.build has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (32 pts), match/switch 2 (4 pts) (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/Commands/Build.fs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c09c2fcccf2b1ac53b0dea9bab8fbd83921d4cf60172d6ea29aeeadfeb020e4"}},{"ruleId":"D2","level":"warning","message":{"text":"FsProj.ensurePageFilesLast (cognitive 25): FsProj.ensurePageFilesLast has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FsProj.fs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ebd55b23823e5b83acad5139b0c5c3a71b04f29de4db4d9625b7174724fd9cf"}},{"ruleId":"D2","level":"warning","message":{"text":"Server.fableWatch (cognitive 21): Server.fableWatch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (4 pts), boolean chains 3, 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/Commands/Server.fs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f998b00956f23adf34cffd28288b5b1f792a9d2c658c89b572eb35de075a433d"}},{"ruleId":"D2","level":"warning","message":{"text":"FableOutput.findPagesWithWrongLayout (cognitive 21): FableOutput.findPagesWithWrongLayout has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (13 pts), boolean chains 3, error handling 1 (3 pts), loops 1 (2 pts) (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/FableOutput.fs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a3e801a816b41fb185881fc631415fd2e1647f4fa8c51e042d0481c315cd7b"}},{"ruleId":"D2","level":"warning","message":{"text":"FableOutput.fixLayoutReference (cognitive 19): FableOutput.fixLayoutReference has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 4, error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FableOutput.fs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"58afc3cf8b3ebd2ffa8747f80ddb0e76a01982691b1da9f0baa64fc31583f12b"}},{"ruleId":"D2","level":"warning","message":{"text":"FableOutput.processOutput (cognitive 18): FableOutput.processOutput has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FableOutput.fs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65eaec9448530e83e33bb5fe3339ae52d784dd593084a4a2a615afdb3a28349"}},{"ruleId":"D2","level":"warning","message":{"text":"Process.runProcessInternal (cognitive 16): Process.runProcessInternal has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 1, error handling 1, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Process.fs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab126b3e89f4b8b6865fbbb1cf46abbc1613bda9b55c980e529d8dc97ffdb47"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (103 shared lines): src/Commands/AddLayout.fs:1-381 | src/Commands/AddPage.fs:1-261 \u2014 These two members are variants of one another: 103 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Commands/AddLayout.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25a2f7ea35bd0ae21c6b3162d82921ead09fc08cf3278186705d701b9426de9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): src/Commands/AddLayout.fs:269-292 | src/Commands/AddPage.fs:179-203 \u2014 before extracting anything, compare \u0060src/Commands/AddLayout.fs\u0060 and \u0060src/Commands/AddPage.fs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 107 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Commands/AddLayout.fs:269\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/Commands/AddLayout.fs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03d04c8c8c6adce926000a2188bc0dd66d1a96702960ab1919f29850c3707ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): src/Commands/AddLayout.fs:165-186 | src/Commands/AddPage.fs:51-73 \u2014 before extracting anything, compare \u0060src/Commands/AddLayout.fs\u0060 and \u0060src/Commands/AddPage.fs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 107 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Commands/AddLayout.fs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a148547744e01c33ecef10a8d9d2b69b2118e4fa731a81c479d87c638e7100"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/Commands/AddLayout.fs:192-208 | src/Commands/AddPage.fs:80-96 \u2014 before extracting anything, compare \u0060src/Commands/AddLayout.fs\u0060 and \u0060src/Commands/AddPage.fs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 107 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Commands/AddLayout.fs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8fc9727e56446e5c289a2def5a458e32ec61bbc43c58507570b0f0f5952cb75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/Commands/AddLayout.fs:127-138 | src/Commands/AddPage.fs:13-25 \u2014 before extracting anything, compare \u0060src/Commands/AddLayout.fs\u0060 and \u0060src/Commands/AddPage.fs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 107 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Commands/AddLayout.fs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cfc5b307b61d95a6e30d4807ab4e882d904ab8aa8605efab8fe0863a4500a4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/Commands/AddLayout.fs:154-164 | src/Commands/AddPage.fs:38-49 \u2014 before extracting anything, compare \u0060src/Commands/AddLayout.fs\u0060 and \u0060src/Commands/AddPage.fs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 107 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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/Commands/AddLayout.fs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"53adc19c68105c6cca15dd257272e3cfa02a672728a65ae44b8305a14d6d14cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Commands/AddLayout.fs:211-221 | src/Commands/AddPage.fs:99-109 \u2014 before extracting anything, compare \u0060src/Commands/AddLayout.fs\u0060 and \u0060src/Commands/AddPage.fs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 107 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Commands/AddLayout.fs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa56b562bc68d15798e61027b2d09c5a374976a1a568f9ddfa85951b9945716"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/Commands/Upgrade.fs:120-129 | src/Commands/Upgrade.fs:218-227 \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/Commands/Upgrade.fs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e94524f4eff6aaed1edc463f1faf620c2b869672b198e5653e7e1a9943316d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Base.fs:208-216 | src/Base.fs:239-247 \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/Base.fs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c47c03ce61daae96a112b1210e6f717b1991b6682e38ac44cdb28f53f1219c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/Commands/AddPage.fs:156-163 | src/Commands/AddPage.fs:166-174 \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/Commands/AddPage.fs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa06f9d2052c6c10ec3f24f002237c3020e26dad14b2000c30912dc41ba5d4e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FsProj.fs:228-236 | src/FsProj.fs:244-252 \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/FsProj.fs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"39592c5ccb742734149330e2fd29db6cffa542c1364fb3e2223e386fba988ea5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Commands/Upgrade.fs:258-264 | src/Commands/Upgrade.fs:291-297 \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/Commands/Upgrade.fs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d5b41f0ad80fa9ddca9ad94486bb8e005c58e78619df1a1902c8843f987692"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Commands/Upgrade.fs:114-119 | src/Commands/Upgrade.fs:212-217 \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/Commands/Upgrade.fs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7d39267974d6c30a51771634099476b1cab47e0cba5d3dc8775c5c4e69fa96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Commands/AddLayout.fs:293-298 | src/Commands/AddPage.fs:204-209 \u2014 before extracting anything, compare \u0060src/Commands/AddLayout.fs\u0060 and \u0060src/Commands/AddPage.fs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 107 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Commands/AddLayout.fs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a0bb0ca7c0da574e53b015052bdd1898d7102ea5391f3b39f91f7211d0479c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): integration-tests/backwards-compability-with-1-0-4/src/Pages/Layout.fs:1-24 | integration-tests/using-commands-from-shared-module-does-not-work-27/src/Pages/Layout.fs:1-24 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integration-tests/backwards-compability-with-1-0-4/src/Pages/Layout.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22f68d67ab952c162fa6c1b2553f19cf3d6232cfb77d91e035e701dbffca6ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): integration-tests/backwards-compability-with-1-0-4/src/Pages/Page.fs:1-20 | integration-tests/using-commands-from-shared-module-does-not-work-27/src/Pages/Page.fs:1-20 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integration-tests/backwards-compability-with-1-0-4/src/Pages/Page.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98cce56b36fa7313030265f6cd13dab1e215a6e669f9a6e8163baadbc1beb53b"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 no coverage collector is wired up: Coverage NOT MEASURED: \u0060--collect:\u0022XPlat Code Coverage\u0022\u0060 names a data collector that ships in the \u0060coverlet.collector\u0060 package, and this repository wires up none \u2014 no test project references it and no runsettings declares one. The absence of coverage here is therefore not evidence about the suite or about our analyzer environment: without a collector, \u0060--collect\u0060 produces nothing even from a suite that builds and passes. Add a \u0060coverlet.collector\u0060 PackageReference to the test project(s) (or commit the Cobertura/OpenCover/lcov report your CI produces) and real coverage will be measured. It is excluded from the score rather than counted as a near-zero defect."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: xunit: xunit 2.9.2 \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/TemplateEngine.fs: src/TemplateEngine.fs changed 4 times in last 90 days, max cyclomatic complexity 26 in TemplateEngine.fileToRoute at line 286. 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-04-29..2026-07-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-04-29 10:30:12 \u002B02:00\u0027 --until=\u00272026-07-28 10:30:12 \u002B02:00\u0027 --full-history --no-merges -- src/TemplateEngine.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/TemplateEngine.fs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"0caa7d7f929cb6f98ac9c510d6581c76b807b82aaca91338fc35f0ea8941b684"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Program.fs: src/Program.fs changed 2 times in last 90 days, max cyclomatic complexity 16 in Program.handleAppResult at line 82. 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-04-29..2026-07-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-04-29 10:30:12 \u002B02:00\u0027 --until=\u00272026-07-28 10:30:12 \u002B02:00\u0027 --full-history --no-merges -- src/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/Program.fs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8d42a765019f80a62ed6ecd5997d49856ceb63ca91be511f9fdddea1da4e09"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no architecture or design documentation: The Elmish Land CLI tool\u0027s documentation is a single page with no architecture or design description, unlike the 20 generated API reference docs that would be ideal for this tier. Add an architecture section describing how Elmish Land integrates with Fable projects and the elmish-land.json configuration."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/docs/api-reference/app-config.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a582783b04dc1e00e01dbaef5b1a573caf698729ce81a0f4f0ee6eae3c3aa0"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no architecture or design documentation: The CLI usage is documented but there is no architectural overview of the tool\u0027s components, routing model, or how it interacts with Elmish Land. Document the architecture of the Elmish Land CLI (tool structure, routing model) so new contributors can reason about it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/docs/api-reference/cli.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9881475cd7ec8b52cc804e6ff5237ec116059cfdf972040a39b2d57f92a04970"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"23a3c153922061d8b6a12cb06526c89608d55d517be1e8a1ebe36191f905cd33"},"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":"e3a6205ba21265a3805fa52fc2dc2d64df0d36e0621ef5f4745098ced7b87f37"},"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":"d302734be4e98bd324964484cae4242a57216790575642e1e2d89792a6546d2a"},"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":"3e9e9d938b2c8da22bea3ca1a54d8a9c4f22108683329559c9cdd3187495ca2c"},"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":"24e9c281411c3f7ef277e3ef49530ae8412b4c074596e6232150ed2897a28c93"},"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":"73fff3c6c9e2d9da7d4f738c40b8a223e17cfd14b0555814ffc82880faec5f41"},"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":"f6d629032dff8af67a8377dc92a11bc9f3174a637468e2db142a019acc12e4ab"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d1f7bc2692911ac08733f03ea8cc678a5d743ad3b36272df0ff589eea7ff7f28"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1329","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fc69203a157d516b1f6f82f5a83e08f09e514af73f88b09c9194a7fe5827552b"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1329","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":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"}},{"ruleId":"D44","level":"warning","message":{"text":"End-of-life runtime: .NET net9.0: integration-tests/using-commands-from-shared-module-does-not-work-27/using-commands-from-shared-module-does-not-work-27.fsproj declares .NET net9.0 as this project\u0027s target framework, and .NET 9 STS, support ended 2026-05-12. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2026-05-12 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cf833dd2e60d7abeaab60bf3ef76eff2806e8ec26408f1f9382eb19e6e5923da"}},{"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":"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 3186 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":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060String.Equals(response, \u0022y\u0022, StringComparison.OrdinalIgnoreCase) || String.Equals(response, \u0022yes\u0022, StringComparison.OrdinalIgnoreCase)\u0060 appears character-identically in 3 files \u2014 src/Commands/AddLayout.fs, src/Commands/AddPage.fs, src/FsProj.fs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Commands/AddLayout.fs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9147262ae8ae8c73c6993b24ce119ea8c1f59521e764b36c710341da97ac53"}}],"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-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"CWE-1104","shortDescription":{"text":"CWE-1104"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1329","guid":"f70f1c3f-4ccf-cb5e-bdd3-03ba4868d36d","name":"CWE-1329","shortDescription":{"text":"CWE-1329"},"helpUri":"https://cwe.mitre.org/data/definitions/1329.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-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-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":15,"secretScannerRunsExcluded":0}},"redactionTokens":["A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."]}]}