{"$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":"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":"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":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"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":"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":"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":"WorkStealingRuntime.InterpretAsync (cyclomatic 38): WorkStealingRuntime.InterpretAsync has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/Runtime/WorkStealingRuntime.fs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"99fb2ad09fd565bf56e99705ad55f6b2947dbdf838c5637c0b9c35cd3a6a13f5"}},{"ruleId":"D1","level":"warning","message":{"text":"SignalingRuntime.InterpretAsync (cyclomatic 34): SignalingRuntime.InterpretAsync has cyclomatic complexity 34 (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/FIO/Runtime/SignalingRuntime.fs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee75f56b59bb06bc8ef0e93a3e17ab39cbb8d2d522e10c01db9086d9249794c8"}},{"ruleId":"D1","level":"warning","message":{"text":"PollingRuntime.InterpretAsync (cyclomatic 28): PollingRuntime.InterpretAsync has cyclomatic complexity 28 (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/FIO/Runtime/PollingRuntime.fs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0f972b05567fd2c89b60ecc4c0ee299280217df16ca8050030411fe7cb7d80"}},{"ruleId":"D1","level":"warning","message":{"text":"DirectRuntime.InterpretAsync (cyclomatic 28): DirectRuntime.InterpretAsync has cyclomatic complexity 28 (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/FIO/Runtime/DirectRuntime.fs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfec8c67e277c4e59b3a00401f8f349416eb622a482ca0817e29c0d651ffc4e"}},{"ruleId":"D1","level":"warning","message":{"text":"InterpreterCore.processOutcome (cyclomatic 28): InterpreterCore.processOutcome 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/FIO/Runtime/InterpreterCore.fs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed36506b59e31b30c1cea3d7f2f9c1a7782ffb61886ce5315dd04bfe6305d38"}},{"ruleId":"D1","level":"warning","message":{"text":"KestrelBridge.writeResponseWithOptions (cyclomatic 28): KestrelBridge.writeResponseWithOptions 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/FIO.Http/KestrelBridge.fs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4bc8d0bbb1f683418b5183bd8a6ff1bba18d4c89d4cbc1a812bda3f5ffdfbd"}},{"ruleId":"D1","level":"warning","message":{"text":"InterpreterCore.handleSharedCase (cyclomatic 24): InterpreterCore.handleSharedCase has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/Runtime/InterpreterCore.fs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dafb5d65dd4069b07b0520cd17df9d8c44cd0eeb5a8374283c95b34ba8a4ae2"}},{"ruleId":"D1","level":"warning","message":{"text":"FIOApp\u00602.RunAsync (cyclomatic 21): FIOApp\u00602.RunAsync has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/App.fs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe2d0f83e700f90dac8097515382e835eb735cb3c102d71a949e98646f1c217"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkStealingRuntime.InterpretAsync (cognitive 110): WorkStealingRuntime.InterpretAsync has cognitive complexity 110 (threshold 15). Drivers by points: if/else 20 (74 pts), match/switch 6 (21 pts), loops 3 (13 pts), boolean chains 2 (nesting depth added 79). 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/FIO/Runtime/WorkStealingRuntime.fs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"2405dc53ea06752090dda763b6ada359ef0db3c5354abbb6af2b0890dc207704"}},{"ruleId":"D2","level":"warning","message":{"text":"SignalingRuntime.InterpretAsync (cognitive 93): SignalingRuntime.InterpretAsync has cognitive complexity 93 (threshold 15). Drivers by points: if/else 19 (54 pts), match/switch 7 (29 pts), error handling 1 (7 pts), boolean chains 2, loops 1 (nesting depth added 63). 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/FIO/Runtime/SignalingRuntime.fs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a67724bd219f3b3e331a3efd947c51a1d09cab07a32e056e1f19c50c2567d1"}},{"ruleId":"D2","level":"warning","message":{"text":"DirectRuntime.InterpretAsync (cognitive 85): DirectRuntime.InterpretAsync has cognitive complexity 85 (threshold 15). Drivers by points: error handling 6 (32 pts), if/else 9 (30 pts), match/switch 4 (15 pts), loops 2 (7 pts), boolean chains 1 (nesting depth added 63). 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/FIO/Runtime/DirectRuntime.fs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58a9152d48caa640114d5e8ecd036bc497bb5c7a2bb89e4e9de2f22b7ed50f3"}},{"ruleId":"D2","level":"warning","message":{"text":"PollingRuntime.InterpretAsync (cognitive 55): PollingRuntime.InterpretAsync has cognitive complexity 55 (threshold 15). Drivers by points: if/else 13 (32 pts), match/switch 6 (21 pts), boolean chains 1, loops 1 (nesting depth added 34). 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/FIO/Runtime/PollingRuntime.fs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"8393f9ea0a2c0863f85a76aec00cbe06b5adf750f2ca8487e4df137ca5ba48e6"}},{"ruleId":"D2","level":"warning","message":{"text":"InterpreterCore.processOutcome (cognitive 36): InterpreterCore.processOutcome has cognitive complexity 36 (threshold 15). Drivers by points: match/switch 7 (22 pts), error handling 2 (8 pts), if/else 2 (3 pts), loops 2 (3 pts) (nesting depth added 23). 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/FIO/Runtime/InterpreterCore.fs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61177a3a8aded8d9a36ab41997a907916012146b482ee0c2d9f1f1c97541033"}},{"ruleId":"D2","level":"warning","message":{"text":"KestrelBridge.writeResponseWithOptions (cognitive 30): KestrelBridge.writeResponseWithOptions has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 7 (11 pts), loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO.Http/KestrelBridge.fs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c868582bff014ed28e0e5e4ed941e25084ba9da975f2249615c36e978499f6"}},{"ruleId":"D2","level":"warning","message":{"text":"FIOApp\u00602.RunAsync (cognitive 23): FIOApp\u00602.RunAsync has cognitive complexity 23 (threshold 15). Drivers by points: error handling 8 (14 pts), if/else 3 (4 pts), match/switch 3 (4 pts), 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/FIO/App.fs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8788f14772f7341b6440dc2a19b1b8580b12161458b83bcd3c15e268a948a4f"}},{"ruleId":"D2","level":"warning","message":{"text":"KestrelBridge.readBodyAsync (cognitive 21): KestrelBridge.readBodyAsync has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (8 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO.Http/KestrelBridge.fs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"459d63675f9df3281ad437a52a3f7569f1752857279cc46472bc1c0e9dd37694"}},{"ruleId":"D2","level":"warning","message":{"text":"FIO.raceAll (cognitive 20): FIO.raceAll has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 4 (10 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/DSL/Factories.fs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"f161060221c48e4bc590c82ace67d547e23cc6243362a78ccd04930692694b70"}},{"ruleId":"D2","level":"warning","message":{"text":"KestrelBridge.convertRequestAsync (cognitive 20): KestrelBridge.convertRequestAsync has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO.Http/KestrelBridge.fs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6e2dddc393ca08d507ee32c9d6d44fab351586c6d32bb057e9ac45ff32127b"}},{"ruleId":"D2","level":"warning","message":{"text":"Routes.dispatch (cognitive 20): Routes.dispatch has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 6 (13 pts), if/else 4 (7 pts) (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/FIO.Http/Routes.fs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"6700371595491a269206f4d9d787599eb861f4c3446acef1dd91e40b0be74501"}},{"ruleId":"D2","level":"warning","message":{"text":"InterpreterCore.handleSharedCase (cognitive 18): InterpreterCore.handleSharedCase has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 3 (7 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/Runtime/InterpreterCore.fs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf9925bc8601f832c1e00bef4552451490e5b2c0e33824f971299b0fa2434f3"}},{"ruleId":"D2","level":"warning","message":{"text":"FIO.forEachPar (cognitive 17): FIO.forEachPar has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (5 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/FIO/DSL/Factories.fs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8946310e7336a57cb6380bd69b373e098160219f9f06756f531f10e920a75fe"}},{"ruleId":"D2","level":"warning","message":{"text":"WebSocket.ReceiveMessage (cognitive 17): WebSocket.ReceiveMessage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO.WebSockets/WebSocket.fs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e03de762ac02f579fa64e726b8045e1fb47accbc6c8551b488803acc72f0c02"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: Extensions: TooManyFunctions \u2014 74 functions. The bar is 30 functions; this is 44 over it, 2.47\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/FIO/DSL/Extensions.fs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90f2b4bb342f5d8b30f9f0efa073191d2a53fa8d21fb0b587f3a906e99cd101"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: FIO: TooManyFunctions \u2014 53 functions. The bar is 30 functions; this is 23 over it, 1.77\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/FIO/DSL/Factories.fs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0fc928c79301a0b581424b047057f98e1e40996a137b53f4d9de4a480cdb7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: DSL/Core.fs: FileTooLong \u2014 663 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 163 over it, 1.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/FIO/DSL/Core.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38cfd501114c9836e53b914da2a7a9b0ca8d84d7363419db59cfb65273672fc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (174 shared lines): src/FIO/Runtime/PollingRuntime.fs:1-476 | src/FIO/Runtime/SignalingRuntime.fs:1-292 \u2014 These two members are variants of one another: 174 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/FIO/Runtime/PollingRuntime.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11642cdf1f194dc523a46b05aed8391b0bdd9d9c7d48a3e1943144887d8f6e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (63\u201370 lines \u00D7 2): src/FIO/Runtime/PollingRuntime.fs:311-380 | src/FIO/Runtime/SignalingRuntime.fs:94-156 \u2014 before extracting anything, compare \u0060src/FIO/Runtime/PollingRuntime.fs\u0060 and \u0060src/FIO/Runtime/SignalingRuntime.fs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 243 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/FIO/Runtime/PollingRuntime.fs:311\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/FIO/Runtime/PollingRuntime.fs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6ad80cadec850bff7d95877506c354aeb97b9c06fdb8e048571aecbf1375b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (59\u201361 lines \u00D7 2): src/FIO/Runtime/PollingRuntime.fs:418-476 | src/FIO/Runtime/SignalingRuntime.fs:232-292 \u2014 before extracting anything, compare \u0060src/FIO/Runtime/PollingRuntime.fs\u0060 and \u0060src/FIO/Runtime/SignalingRuntime.fs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 243 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/FIO/Runtime/PollingRuntime.fs:418\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/Runtime/PollingRuntime.fs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a52338513504549653d0bbac1b20730e1bed931384d1f1532935871633c7dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/FIO.Http/RoutePattern.fs:72-92 | src/FIO.Http/RoutePattern.fs:103-123 \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/FIO.Http/RoutePattern.fs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"450102c9d0cacc0fd257ea4dacffadf74579e5cb7121dad2922e4f68bf6d6488"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): src/FIO/Runtime/PollingRuntime.fs:384-403 | src/FIO/Runtime/SignalingRuntime.fs:193-213 \u2014 before extracting anything, compare \u0060src/FIO/Runtime/PollingRuntime.fs\u0060 and \u0060src/FIO/Runtime/SignalingRuntime.fs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 243 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/FIO/Runtime/PollingRuntime.fs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"e569765ced7c3f7d46bdfaa7ede0983b27e9f58ffdb1a466ad06eef2fba0f052"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201320 lines \u00D7 2): src/FIO/Runtime/PollingRuntime.fs:61-80 | src/FIO/Runtime/SignalingRuntime.fs:26-42 \u2014 before extracting anything, compare \u0060src/FIO/Runtime/PollingRuntime.fs\u0060 and \u0060src/FIO/Runtime/SignalingRuntime.fs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 243 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/FIO/Runtime/PollingRuntime.fs:61\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/FIO/Runtime/PollingRuntime.fs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"9977fa9505f86286ce885c0891b3da5e4d1ec079d7bb06cf68ff16d46b8367f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 3): src/FIO/Runtime/PollingRuntime.fs:329-347 | src/FIO/Runtime/SignalingRuntime.fs:107-124 | src/FIO/Runtime/WorkStealingRuntime.fs:321-338 \u2014 before extracting anything, compare \u0060src/FIO/Runtime/PollingRuntime.fs\u0060 and \u0060src/FIO/Runtime/SignalingRuntime.fs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 243 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/FIO/Runtime/PollingRuntime.fs:329\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/FIO/Runtime/PollingRuntime.fs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b479a3ca2da356c0c2f78ba27d2c1de5920f44da99432a9ff50de19c2514cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): src/FIO/Runtime/PollingRuntime.fs:431-447 | src/FIO/Runtime/SignalingRuntime.fs:245-261 | src/FIO/Runtime/WorkStealingRuntime.fs:459-476 \u2014 before extracting anything, compare \u0060src/FIO/Runtime/PollingRuntime.fs\u0060 and \u0060src/FIO/Runtime/SignalingRuntime.fs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 243 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/FIO/Runtime/WorkStealingRuntime.fs:459\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/Runtime/PollingRuntime.fs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f543d9da027f200155f4e4036f2df4220b5bfd71d8a28c4ae47bd1df66598c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/FIO/DSL/Core.fs:744-757 | src/FIO/DSL/Core.fs:836-848 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/DSL/Core.fs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"795b2f0d30bc57d924205d4737cfcf195103020cca3c4ba153ed591f6a73b2fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/FIO/DSL/Core.fs:794-807 | src/FIO/DSL/Core.fs:840-853 \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/FIO/DSL/Core.fs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"1940f9a183319965f3d7f577aa3d854712143b9760be9a352c348036e05c9807"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): src/FIO/Runtime/PollingRuntime.fs:353-365 | src/FIO/Runtime/SignalingRuntime.fs:130-141 | src/FIO/Runtime/WorkStealingRuntime.fs:343-355 \u2014 before extracting anything, compare \u0060src/FIO/Runtime/PollingRuntime.fs\u0060 and \u0060src/FIO/Runtime/SignalingRuntime.fs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 243 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/FIO/Runtime/PollingRuntime.fs:353\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/FIO/Runtime/PollingRuntime.fs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8ad8205d744558faeb498bf53ef34d1b5b0e7b4597ac7001d5a2a88815e929"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/FIO/Runtime/PollingRuntime.fs:405-416 | src/FIO/Runtime/SignalingRuntime.fs:219-230 \u2014 before extracting anything, compare \u0060src/FIO/Runtime/PollingRuntime.fs\u0060 and \u0060src/FIO/Runtime/SignalingRuntime.fs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 243 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/FIO/Runtime/PollingRuntime.fs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"8585be7d23b00313ede3fa057fdbabf96fe3d65119e35a277a9afa21f79bd86e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/FIO/Runtime/PollingRuntime.fs:463-471 | src/FIO/Runtime/SignalingRuntime.fs:279-287 | src/FIO/Runtime/WorkStealingRuntime.fs:497-505 \u2014 before extracting anything, compare \u0060src/FIO/Runtime/PollingRuntime.fs\u0060 and \u0060src/FIO/Runtime/SignalingRuntime.fs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 243 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/FIO/Runtime/PollingRuntime.fs:463\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/FIO/Runtime/PollingRuntime.fs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22b10584b5f3880771acb938e52024374103a992b9a7a455c7a068ce6501956"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FIO.WebSockets/WebSocket.fs:185-192 | src/FIO.WebSockets/WebSocket.fs:281-288 \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/FIO.WebSockets/WebSocket.fs:185\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO.WebSockets/WebSocket.fs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"62466a03d3e85b84bf18888380879b8413fa056b44089cb275b9bcd611567ff5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FIO/DSL/Extensions.fs:251-258 | src/FIO/DSL/Extensions.fs:261-268 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/DSL/Extensions.fs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe51830ecadf5411b1aabb265aa47647d6d418d96a969b0e1217e595d1e02e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/FIO.WebSockets/WebSocket.fs:84-91 | src/FIO.WebSockets/WebSocket.fs:186-192 | src/FIO.WebSockets/WebSocket.fs:282-288 \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/FIO.WebSockets/WebSocket.fs:84\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO.WebSockets/WebSocket.fs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ece682625af116065ae02fe1201886e7b94ac3c4c856f8f76d831d875c4ff0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FIO/DSL/Factories.fs:338-344 | src/FIO/DSL/Factories.fs:345-351 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/DSL/Factories.fs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"abad9fa54cad8a0bc44676fe9c7c5760de959ca8222b8c15457618a4f1f6c953"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FIO/DSL/Extensions.fs:240-245 | src/FIO/DSL/Extensions.fs:272-277 \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/FIO/DSL/Extensions.fs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"41dfda832557a81c24fc35e4653bd32bf58f0a3730fa5ecd1ab835fffde924b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FIO/DSL/Extensions.fs:486-490 | src/FIO/DSL/Extensions.fs:501-505 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/FIO/DSL/Extensions.fs:506\u0060 calls \u0060Await\u0060 and \u0060src/FIO/DSL/Extensions.fs:491\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/DSL/Extensions.fs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24103af4a5807f65a4facd27522f2527958cafcb05ca4e22ceb922b11a0d36e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): examples/FIO.Examples.App/Program.fs:231-250 | examples/FIO.Examples.App/Program.fs:271-290 \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":"examples/FIO.Examples.App/Program.fs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb046044eec09f9ba98e0d9808989ba83381500a9adb3b8acc7c3fa7e9d29be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): examples/FIO.Examples.DSL/Program.fs:16-26 | examples/FIO.Examples.DSL/Program.fs:30-40 \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":"examples/FIO.Examples.DSL/Program.fs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ca4d6be6e7568a21047290c51b3e02b85871129d73ea315872592356f9abbe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/FIO/Runtime/WorkStealingRuntime.fs: src/FIO/Runtime/WorkStealingRuntime.fs changed 3 times in last 90 days, max cyclomatic complexity 38 in WorkStealingRuntime.InterpretAsync at line 304. 1 of those changes was a fix/bug commit, and the other 2 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-19..2026-09-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-19 14:38:42 \u002B02:00\u0027 --until=\u00272026-09-17 14:38:42 \u002B02:00\u0027 --full-history --no-merges -- src/FIO/Runtime/WorkStealingRuntime.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/FIO/Runtime/WorkStealingRuntime.fs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"91729cb2c5fad02316e576dff00508ea7b09451169eec353dfcd4225d4f651c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/FIO/Runtime/SignalingRuntime.fs: src/FIO/Runtime/SignalingRuntime.fs changed 3 times in last 90 days, max cyclomatic complexity 34 in SignalingRuntime.InterpretAsync at line 90. 1 of those changes was a fix/bug commit, and the other 2 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-19..2026-09-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-19 14:38:42 \u002B02:00\u0027 --until=\u00272026-09-17 14:38:42 \u002B02:00\u0027 --full-history --no-merges -- src/FIO/Runtime/SignalingRuntime.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/FIO/Runtime/SignalingRuntime.fs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"145eb0e6c1bef6dee5c4b3dc9c0354fdb4d7483341ffc8a7be88d8462df45f49"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/FIO/Runtime/DirectRuntime.fs: src/FIO/Runtime/DirectRuntime.fs changed 3 times in last 90 days, max cyclomatic complexity 28 in DirectRuntime.InterpretAsync at line 21. 1 of those changes was a fix/bug commit, and the other 2 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-19..2026-09-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-19 14:38:42 \u002B02:00\u0027 --until=\u00272026-09-17 14:38:42 \u002B02:00\u0027 --full-history --no-merges -- src/FIO/Runtime/DirectRuntime.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/FIO/Runtime/DirectRuntime.fs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f343c7c25af1cde6da0dd50fc60c12d1dae75b520d8d59764fa284af195cf7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/FIO/Runtime/InterpreterCore.fs: src/FIO/Runtime/InterpreterCore.fs changed 3 times in last 90 days, max cyclomatic complexity 28 in InterpreterCore.processOutcome at line 44. 1 of those changes was a fix/bug commit, and the other 2 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-19..2026-09-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-19 14:38:42 \u002B02:00\u0027 --until=\u00272026-09-17 14:38:42 \u002B02:00\u0027 --full-history --no-merges -- src/FIO/Runtime/InterpreterCore.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/FIO/Runtime/InterpreterCore.fs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22589c464a1b813b72a4ffa2aa2c6c999c5651f7eae544def95a93f57d39738"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/FIO/Runtime/PollingRuntime.fs: src/FIO/Runtime/PollingRuntime.fs changed 3 times in last 90 days, max cyclomatic complexity 28 in PollingRuntime.InterpretAsync at line 306. 1 of those changes was a fix/bug commit, and the other 2 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-19..2026-09-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-19 14:38:42 \u002B02:00\u0027 --until=\u00272026-09-17 14:38:42 \u002B02:00\u0027 --full-history --no-merges -- src/FIO/Runtime/PollingRuntime.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/FIO/Runtime/PollingRuntime.fs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9e222b4700801f35b5dd1e963be8e2ec83537d857e07ad23fbf7ad993d8b15"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/FIO/App.fs: src/FIO/App.fs changed 3 times in last 90 days, max cyclomatic complexity 21 in FIOApp\u00602.RunAsync at line 161. 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-19..2026-09-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-19 14:38:42 \u002B02:00\u0027 --until=\u00272026-09-17 14:38:42 \u002B02:00\u0027 --full-history --no-merges -- src/FIO/App.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/FIO/App.fs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d2905367f0a2a8d787e5e6c1507f7aa10710d10ff89d740ed5cf4522a261d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/FIO.Http/KestrelBridge.fs: src/FIO.Http/KestrelBridge.fs changed 2 times in last 90 days, max cyclomatic complexity 28 in KestrelBridge.writeResponseWithOptions at line 162. 1 of those changes was a fix/bug commit, and the other 1 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-19..2026-09-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-19 14:38:42 \u002B02:00\u0027 --until=\u00272026-09-17 14:38:42 \u002B02:00\u0027 --full-history --no-merges -- src/FIO.Http/KestrelBridge.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/FIO.Http/KestrelBridge.fs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92237e64b775b927eb799a41d49cf5bafd91bc39a01d9265b28fb85f7fd94fd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/FIO/DSL/Core.fs: src/FIO/DSL/Core.fs changed 3 times in last 90 days, max cyclomatic complexity 18 in FIO\u00602.UpcastBoth at line 826. 1 of those changes was a fix/bug commit, and the other 2 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-19..2026-09-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-19 14:38:42 \u002B02:00\u0027 --until=\u00272026-09-17 14:38:42 \u002B02:00\u0027 --full-history --no-merges -- src/FIO/DSL/Core.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/FIO/DSL/Core.fs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"7452dd4f011443b2c80ea5af9879cf79fd84de6d3119d449a98747dd1e5523e7"}},{"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":"ec400802252cf277af654e5f32a37baf458c878d480627a8d5d8b0ece5af494f"},"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":"eae226e08256f4755a4508b3c09c617c976ae699ef6d1b34c6a12d9c1ad41172"},"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":"9a52dfe642c2d072e082891a96edc2dc538b94dd72c48832b15bc0df6cccf490"},"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":"5910d17067f32b2db78e3d72f94fdb07988786c97917888c80d354c47b119710"},"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":"f10af0d4bae4d4eaef932b72c9ae623043fac4a1d4da96530d6ce7029c4a5512"},"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":"634c003445adc8685e9f2f293d9ab40f132187cb77f09c25dfc4e6d9bf24d1c8"},"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":"4fbc6df3d72864219648f8a5e2a3fe4857d204776cc76785ab693bf45ade35c2"},"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":"4605d90208aa912f686365b6f14debdbcc499c88d697f0cbfb5b0cc49f87e4d2"},"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":"1f857484c82a77b923d790c697e70d0c25700bc417afdd7512189095fb65bbee"},"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":"d89ff8be40979a750f71a1b1785d33a78ab956aa773c1a40e692751cfa2edca2"},"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":"0b62ce197510647945b7fbe1875541d7b00d620c55c36d5bca5013c0c1f72bee"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"565df8f8ef4075ae911cdf8c466e38818c244cf6e98a7e58bef8810c5ab7fab0"},"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":"51deb5f11d29da72484d112de68af7e38e0a51818f441a6e0dd487a6031a58d2"},"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":"a5ca04c0cb1b89928781b2af4d0cbb058a385aeba0b5535a0878e046c51b41cf"},"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":"3b05ba515a0129218f03788d09f94768f02609db43e2061d6ce787be3145aa87"},"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":"3fbadb2d6d12bd90e4b1f4767a80690b96e53a601539986f1e723999186ef13b"},"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":"0478cef7cd524860b0c5568926ca06445e13ec24f72cb29f69ff08d6497dd13b"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-552","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"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":"cdb83f6f4dfeb0658bcb049411c942aedc1ab0b9cf9df91a22f353597a02c60d"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-552","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"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":"759dca709f1a032fb6f624ce672e6afb5558fce53ecf01fb73618c4d33923164"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"}},{"ruleId":"D36","level":"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":"c5928b81075799790cb18fed2980a6b6e8aa5072772041c9951633efe8eb3542"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"35f64a0396611dfd8e0191313b0d7cdc759890497b52affaaa727cf6ce876cfd"}},{"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 10646 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":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}}],"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-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-214","guid":"b10ad120-fb22-1351-9348-aa23b453e815","name":"CWE-214","shortDescription":{"text":"CWE-214"},"helpUri":"https://cwe.mitre.org/data/definitions/214.html"},{"id":"CWE-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-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"CWE-522","shortDescription":{"text":"CWE-522"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-532","guid":"1cd8877a-76e8-ce54-b40b-779af23364a0","name":"CWE-532","shortDescription":{"text":"CWE-532"},"helpUri":"https://cwe.mitre.org/data/definitions/532.html"},{"id":"CWE-552","guid":"3492436b-eca2-9c54-9ba3-5dade427c903","name":"CWE-552","shortDescription":{"text":"CWE-552"},"helpUri":"https://cwe.mitre.org/data/definitions/552.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"CWE-829","shortDescription":{"text":"CWE-829"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":27,"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."]}]}