{"$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":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"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"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"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":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"Scales.calculateScales (cyclomatic 45): Scales.calculateScales has cyclomatic complexity 45 (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/libraries/compost.fs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"7346252094c493b6b0ec5cfcc4fc28c501d7c153f8cf0e48e04272bd18ca2697"}},{"ruleId":"D1","level":"warning","message":{"text":"Pivot.renderSection (cyclomatic 45): Pivot.renderSection has cyclomatic complexity 45 (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/thegamma/live/pivot.fs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"713c5c4621a60e50473811eea2da24948650fc5db2570eda35c56984510c1542"}},{"ruleId":"D1","level":"warning","message":{"text":"Interpreter.evaluateEntity (cyclomatic 41): Interpreter.evaluateEntity has cyclomatic complexity 41 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/analyzer/interpreter.fs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94c3aba03f65b1b838de77f069274396808485a45fd67fae75b234469184cab"}},{"ruleId":"D1","level":"warning","message":{"text":"Pivot.updatePivotState (cyclomatic 40): Pivot.updatePivotState has cyclomatic complexity 40 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/live/pivot.fs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddaaa25d626e79a9e9cfa97c06a6d49ac0b706f40c60c1ef8454a2b9667c43a1"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeChecker.typeCheckEntity (cyclomatic 37): TypeChecker.typeCheckEntity has cyclomatic complexity 37 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/analyzer/typechecker.fs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"308d25fa453d6c89882233fcd90b023598aab9d4c3baef6308af228ea5aba567"}},{"ruleId":"D1","level":"warning","message":{"text":"FSharpProvider.importProvidedType (cyclomatic 34): FSharpProvider.importProvidedType has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/providers/fsharp.fs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b10ca4230071a18242863afe3e1d29e95f454f8c51f28bd3dd91c77905e4331"}},{"ruleId":"D1","level":"warning","message":{"text":"Tokenizer.tokenizeInput (cyclomatic 31): Tokenizer.tokenizeInput has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/parser/tokenizer.fs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"5973d3e1e2b306244d703fe07bc0a8e2422be47677c3aea982b83f4660307ad1"}},{"ruleId":"D1","level":"warning","message":{"text":"YouGuessColsHelpers.renderBars (cyclomatic 30): YouGuessColsHelpers.renderBars has cyclomatic complexity 30 (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/libraries/interactive.fs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5bc035964a9867cda98932bbf8003dbf6314ea313db7bda027e0b1978434f33"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeGenerator.compileExpression (cyclomatic 30): CodeGenerator.compileExpression has cyclomatic complexity 30 (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/thegamma/codegen/codegen.fs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"39db1bf2ad03cd91cd4f479b33d32d4a02c0ac9f5f6efc55b695f23c2657ccab"}},{"ruleId":"D1","level":"warning","message":{"text":"YouGuessColsHelpers.renderCols (cyclomatic 29): YouGuessColsHelpers.renderCols has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/libraries/interactive.fs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"63fde26691051852b7cc401e35ca39d1301a5c8b506cbc038c098a8cb94f0940"}},{"ruleId":"D1","level":"warning","message":{"text":"YouGuessLineHelpers.render (cyclomatic 28): YouGuessLineHelpers.render 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/libraries/interactive.fs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb3724c94da8a111305d0afd862087fe312221ada52e53d0ced39885a0a6eb7"}},{"ruleId":"D1","level":"warning","message":{"text":"YouGuessSortHelpers.renderBars (cyclomatic 27): YouGuessSortHelpers.renderBars has cyclomatic complexity 27 (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/libraries/interactive.fs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f42d25fd7bddb58ae16227df6a55ac331cd66b9de6044ebbb30c301f951462"}},{"ruleId":"D1","level":"warning","message":{"text":"YouGeussLineOffsetHelpers.render (cyclomatic 24): YouGeussLineOffsetHelpers.render has cyclomatic complexity 24 (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/libraries/interactive.fs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"2037f9681b39a1e8c880d4bc32762af4ca752718488384ca82dea5b08c5f6041"}},{"ruleId":"D1","level":"warning","message":{"text":"table\u00602.render (cyclomatic 24): table\u00602.render has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/libraries/tables.fs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9c792c3fb8339b63a674dff123a7e00169bb160a719dbb3ddd4720ae47636a"}},{"ruleId":"D1","level":"warning","message":{"text":"Drawing.drawShape (cyclomatic 23): Drawing.drawShape has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/libraries/compost.fs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2586678d49118fd05332bc3ae1b2a301e4a3fb5bd1ccecd6eb264cfa49f199a"}},{"ruleId":"D1","level":"warning","message":{"text":"Pivot.renderPivot (cyclomatic 23): Pivot.renderPivot has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/live/pivot.fs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e71d2fc5d3cc923609e00e091e5134b0e3861987fc443c87e3651434503e53"}},{"ruleId":"D1","level":"warning","message":{"text":"Transform.singleTransformFields (cyclomatic 23): Transform.singleTransformFields has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/providers/pivot.fs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"743cb7a6eb7e91c0e5fb3db6989576cb2239c9cb3bc626088a2a484944cbde1c"}},{"ruleId":"D1","level":"warning","message":{"text":"Pivot.makePivotTypeImmediate (cyclomatic 20): Pivot.makePivotTypeImmediate has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/providers/pivot.fs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1214bbb86f7a6ca8ae3e24ab674ab67ab86b1de453b2e39fde0d5353fa30847"}},{"ruleId":"D1","level":"warning","message":{"text":"Transform.toUrl (cyclomatic 20): Transform.toUrl has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/providers/pivot.fs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"787c66f4a4ce5e38abd9e73b0b99997cf263c21e8cb02adc3a5d113b4835d951"}},{"ruleId":"D1","level":"warning","message":{"text":"Binder.bindExpression (cyclomatic 20): Binder.bindExpression has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/analyzer/binder.fs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6224f203e05971ce22ebe0e86fa05ff6d86ac55fe068ce73914a9b5513e487"}},{"ruleId":"D1","level":"warning","message":{"text":"Compost.createSvg (cyclomatic 19): Compost.createSvg has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/libraries/compost.fs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd637b3d125cf1c44237701d4aeed2f130deba96d2ab10a9407e2271822057b"}},{"ruleId":"D1","level":"warning","message":{"text":"Ast.formatType (cyclomatic 18): Ast.formatType has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: Ast.formatTokenInfo (cyclomatic 34) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/ast/astops.fs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c711fb6afb0b3d5e3f777026a362a5e13140a22db7eb254502532b853ba112"}},{"ruleId":"D1","level":"warning","message":{"text":"Charts.renderColsBars (cyclomatic 17): Charts.renderColsBars has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/libraries/interactive.fs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"045b38b29ee5798c2f9dec340c91de2ec13cf9afe481fb97c93902a198b1d8df"}},{"ruleId":"D1","level":"warning","message":{"text":"Monaco.createCompletionProvider (cyclomatic 17): Monaco.createCompletionProvider has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/monaco.fs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"426d9861e45ea63ef7902759e54287ffaf6aa199875e440421c26be88f56536c"}},{"ruleId":"D2","level":"warning","message":{"text":"Pivot.renderSection (cognitive 95): Pivot.renderSection has cognitive complexity 95 (threshold 15). Drivers by points: if/else 15 (51 pts), match/switch 13 (28 pts), loops 5 (13 pts), boolean chains 3 (nesting depth added 59). 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/thegamma/live/pivot.fs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"7865a78c2a129f518d0ffd3af6e6f4092459323833c9e2b13d4f250bf4495f00"}},{"ruleId":"D2","level":"warning","message":{"text":"Scales.calculateScales (cognitive 69): Scales.calculateScales has cognitive complexity 69 (threshold 15). Drivers by points: if/else 16 (30 pts), match/switch 12 (23 pts), loops 6 (16 pts) (nesting depth added 35). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/libraries/compost.fs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a6d44a7000c31d0c4308340a5404a932ce824773262b800acf7a092113d988"}},{"ruleId":"D2","level":"warning","message":{"text":"FSharpProvider.importProvidedType (cognitive 51): FSharpProvider.importProvidedType has cognitive complexity 51 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 10 (20 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/providers/fsharp.fs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3d99983ee1f9d7696a8c2aca412d8f117806e67de45c9ac45cc71f61ec7985"}},{"ruleId":"D2","level":"warning","message":{"text":"YouGuessLineHelpers.render (cognitive 49): YouGuessLineHelpers.render has cognitive complexity 49 (threshold 15). Drivers by points: match/switch 11 (24 pts), if/else 12 (19 pts), loops 5, boolean chains 1 (nesting depth added 20). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/libraries/interactive.fs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c43db715bbe88970712974cf6b0231ee5454e71d30491e7d7e91287c8f27624"}},{"ruleId":"D2","level":"warning","message":{"text":"YouGuessColsHelpers.renderBars (cognitive 48): YouGuessColsHelpers.renderBars has cognitive complexity 48 (threshold 15). Drivers by points: match/switch 10 (24 pts), if/else 12 (16 pts), loops 4 (5 pts), boolean chains 3 (nesting depth added 19). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/libraries/interactive.fs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e82bca084553761f00b4cd12789af0a5fe030d6c0c4d3445db4548074da160f"}},{"ruleId":"D2","level":"warning","message":{"text":"YouGuessColsHelpers.renderCols (cognitive 46): YouGuessColsHelpers.renderCols has cognitive complexity 46 (threshold 15). Drivers by points: match/switch 11 (25 pts), if/else 11 (16 pts), loops 3, boolean chains 2 (nesting depth added 19). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/libraries/interactive.fs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a00935cf2df29dcd18507a7cf85c1f364bee2e66e9ad79cd520179f2e867fc8"}},{"ruleId":"D2","level":"warning","message":{"text":"table\u00602.render (cognitive 45): table\u00602.render has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (25 pts), loops 7 (16 pts), match/switch 2 (3 pts), error handling 1 (nesting depth added 17). 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/libraries/tables.fs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"562ed451bc4cf63e03951f11212d7c46a9de119f5236bf84a9133d8be1111237"}},{"ruleId":"D2","level":"warning","message":{"text":"YouGeussLineOffsetHelpers.render (cognitive 41): YouGeussLineOffsetHelpers.render has cognitive complexity 41 (threshold 15). Drivers by points: match/switch 8 (20 pts), if/else 13 (17 pts), boolean chains 3, loops 1 (nesting depth added 16). 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/libraries/interactive.fs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6744480c65fbdef116852079fa358a210e038579a9da457cde90ae847b270ff"}},{"ruleId":"D2","level":"warning","message":{"text":"YouGuessSortHelpers.renderBars (cognitive 40): YouGuessSortHelpers.renderBars has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (20 pts), match/switch 7 (14 pts), boolean chains 4, loops 2 (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/libraries/interactive.fs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a35f676ac4887e6e2923794ee80e34a2d7496038cf439dbb109f54bbc5313ec"}},{"ruleId":"D2","level":"warning","message":{"text":"Monaco.createCompletionProvider (cognitive 38): Monaco.createCompletionProvider has cognitive complexity 38 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 6 (12 pts), loops 3 (7 pts), boolean chains 1, 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/thegamma/monaco.fs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3114b235443e0a89672f11f1a57fa82bc6431861cc0427eb2da275038cb0af2"}},{"ruleId":"D2","level":"warning","message":{"text":"Pivot.updatePivotState (cognitive 36): Pivot.updatePivotState has cognitive complexity 36 (threshold 15). Drivers by points: match/switch 8 (23 pts), if/else 7 (13 pts) (nesting depth added 21). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/live/pivot.fs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c34e5360020d8afd00121f8c66389f723eda600b421c3c3a25446cf74f85ba0"}},{"ruleId":"D2","level":"warning","message":{"text":"Compost.createSvg (cognitive 33): Compost.createSvg has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (23 pts), match/switch 3 (8 pts), boolean chains 2 (nesting depth added 10). 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/libraries/compost.fs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c007e171756275b9b09f120c46bbf9cf3b97ec95fb763892687646e08987378"}},{"ruleId":"D2","level":"warning","message":{"text":"Pivot.renderPivot (cognitive 33): Pivot.renderPivot has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 6 (12 pts), boolean chains 3, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/live/pivot.fs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"df916aa6b80b9688f297fd1b524663ad1c032a66d75ca4c8e854343b2c2f369f"}},{"ruleId":"D2","level":"warning","message":{"text":"Interpreter.evaluateEntity (cognitive 29): Interpreter.evaluateEntity has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 12 (25 pts), if/else 3 (4 pts) (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/analyzer/interpreter.fs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"8364a1ba5c176461773817807d9c3ee356a9fc3b277f48ce85a7b72d1c572cb8"}},{"ruleId":"D2","level":"warning","message":{"text":"RestProvider.createRestType (cognitive 25): RestProvider.createRestType has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 4 (8 pts), if/else 5 (7 pts), loops 2 (6 pts), error handling 2 (4 pts) (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/thegamma/providers/rest.fs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef9c9faa22b6957e342ec49963692ff44e96836a57fa168959e8156459e21ca"}},{"ruleId":"D2","level":"warning","message":{"text":"Charts.renderBubbles (cognitive 24): Charts.renderBubbles has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 4 (6 pts), boolean chains 2, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/libraries/interactive.fs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bfc21a86fa810d52c107a54d764a9645ad823a6fcf9800012075cc2be02af4"}},{"ruleId":"D2","level":"warning","message":{"text":"Charts.renderColsBars (cognitive 23): Charts.renderColsBars has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 4, loops 2 (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/libraries/interactive.fs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e1f1743fe79d326b0488d29c1ec8f4dd1f5ec47dc44a36c67738c0c20af400"}},{"ruleId":"D2","level":"warning","message":{"text":"Events.triggerEvent (cognitive 22): Events.triggerEvent has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 2 (5 pts), match/switch 2 (5 pts) (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/libraries/compost.fs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c30905de7ed9f9560a97ce4cf2ec191b2e6d34881865b2d916e841bc1c1f34"}},{"ruleId":"D2","level":"warning","message":{"text":"Ast.formatType (cognitive 20): Ast.formatType has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 pts), match/switch 2 (3 pts), error handling 1 (2 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/ast/astops.fs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"4263ad023d7f415075f6d6ffc4fd5dd97c3ca4ef8b057d45cf0e559132762cae"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeChecker.typeCheckEntity (cognitive 19): TypeChecker.typeCheckEntity has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 4 (8 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/analyzer/typechecker.fs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fcb0f7d6fa1b6ac1b705d66fffc4249f723dd9dfa75aa6ccef94dca169d839"}},{"ruleId":"D2","level":"warning","message":{"text":"Showable.updateBody (cognitive 18): Showable.updateBody has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (13 pts), if/else 2 (5 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/live/showable.fs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb48dfe783b7b60a1609f2c32c2c4a0b2eb61e5ac6cb773d6bf6efab6e7e028f"}},{"ruleId":"D2","level":"warning","message":{"text":"Binder.bindExpression (cognitive 16): Binder.bindExpression has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 7 (16 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/analyzer/binder.fs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a1a9dba642bf53c1de709a4fb0e5bbb2a668b57e53fb0b2818698727762bcf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bindings/monaco.fs: FileTooLong \u2014 1418 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 918 over it, 2.84\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bindings/monaco.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e783c23f8f5f2e4c5f2a3f9f102a2b6381321b61fa3ad2925587ac34492d6a86"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: libraries/interactive.fs: FileTooLong \u2014 1260 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 760 over it, 2.52\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/libraries/interactive.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a602c3eb30e5ac8ec217d7d8cc81afceb6126c5c4c24a6dcbba256b098e71255"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: libraries/compost.fs: FileTooLong \u2014 733 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 233 over it, 1.47\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/libraries/compost.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5892b06ac2c824493b41514e687af5968ad5bc2b0f21849b4199aa21f7a3a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: common/babel.fs: FileTooLong \u2014 611 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 111 over it, 1.22\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/thegamma/common/babel.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb6594ce60d04b3985dda2c61278ad331dd035956080f03b68bf3a3fee567de"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: live/pivot.fs: FileTooLong \u2014 585 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 85 over it, 1.17\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/thegamma/live/pivot.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b2ba04a5e380548f92ac7cc8e58f1d6e800cc80e582464e810a7618564bd1a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: Pivot: TooManyFunctions \u2014 32 functions. The bar is 30 functions; this is 2 over it, 1.07\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/thegamma/providers/pivot.fs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"65de2a09d597c45a1be91a71e822e3b59e8e787bf3d1ef15d41209b712e86c81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/libraries/interactive.fs:870-881 | src/libraries/interactive.fs:959-970 \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/libraries/interactive.fs:870\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/libraries/interactive.fs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f581f7b29d976c2de9f2f7629bf764cce59b376fc98c65eb470cefc15bae6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): src/libraries/interactive.fs:573-581 | src/libraries/interactive.fs:752-760 | src/libraries/interactive.fs:868-876 | src/libraries/interactive.fs:957-965 | src/libraries/interactive.fs:1105-1113 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/libraries/interactive.fs:573\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/libraries/interactive.fs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2d79d8c4ae360b2c2db893eeb899a2b65daed3b941b0db6d0d7db2c954601b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/libraries/html.fs:127-134 | src/libraries/html.fs:150-157 \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/libraries/html.fs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f03cfbd13072d98d82cf3c1cae4d66c49be4b0a867ac6e93d38a46a5487724a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/libraries/interactive.fs:1133-1140 | src/libraries/interactive.fs:1178-1185 \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/libraries/interactive.fs:1133\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/libraries/interactive.fs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ee8e22cf8787f32ab68e09147597bfcfc17734714b2b6b74f9f22b47c7505f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): src/libraries/interactive.fs:1135-1141 | src/libraries/interactive.fs:1180-1186 | src/libraries/interactive.fs:1236-1242 | src/libraries/interactive.fs:1326-1332 | src/libraries/interactive.fs:1402-1408 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/libraries/interactive.fs:1135\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/libraries/interactive.fs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45567ec62706f87c70f60e5a703e34b660c862a8fbaf6b670c7a51602dbc7c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/libraries/interactive.fs:924-930 | src/libraries/interactive.fs:1062-1068 \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/libraries/interactive.fs:924\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/libraries/interactive.fs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e892f9e3a75f844c850c4d271f18bbaf6bd0b7a162dc5af00bdcafe075ec1e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/thegamma/providers/fsharp.fs:113-119 | src/thegamma/providers/fsharp.fs:124-130 \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/thegamma/providers/fsharp.fs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12a9e31b93c56d989c35d209d1961dc7e91a1b21e48e9526241be6624d73d4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/thegamma/ast/astops.fs:277-282 | src/thegamma/ast/astops.fs:302-307 \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/thegamma/ast/astops.fs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"a693db401ab238361860033c3004d61d6d7b94c24a6f8c7395b0bbc0dac40dde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 7): src/libraries/interactive.fs:1138-1146 | src/libraries/interactive.fs:1183-1191 | src/libraries/interactive.fs:1239-1247 | src/libraries/interactive.fs:1329-1337 | src/libraries/interactive.fs:1372-1380 | src/libraries/interactive.fs:1405-1413 | src/libraries/interactive.fs:1436-1444 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/libraries/interactive.fs"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"2699e7d7fcd0fb44e30bb42f93bdd2f5d05fa132d70cb179c1c7b062eab19adf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/bindings/monaco.fs:185-189 | src/bindings/monaco.fs:579-583 \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/bindings/monaco.fs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c131ddf190a4e9bcdb7dd434a11b20551ce7d0e4b3be9fe2c2a46f9ef51ba6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/thegamma/live/pivot.fs:488-493 | src/thegamma/live/pivot.fs:504-509 | src/thegamma/live/pivot.fs:527-532 \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/thegamma/live/pivot.fs:488\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/thegamma/live/pivot.fs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"5369fb1b3cfb339f825f0f8e4b30e6428b4925a381e3b8335b125c2b564e6858"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/libraries/compost.fs:434-438 | src/libraries/compost.fs:446-450 \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/libraries/compost.fs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5d0f66bf4285aa0543ff1c994a8210c7705dded24346c274cd69d2c1d17a0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/libraries/interactive.fs:253-257 | src/libraries/interactive.fs:270-274 \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/libraries/interactive.fs:253\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/libraries/interactive.fs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32c0fa5c3ae8663ab834fbe06a9eb922b0c716caf09a5e4a749b67eeed7e5f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/libraries/interactive.fs:836-841 | src/libraries/interactive.fs:903-908 \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/libraries/interactive.fs:836\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/libraries/interactive.fs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6d4cdb88c0e1a30853021d2f061cc370dd5c8e12383a4c55558c6c9c6255f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/libraries/interactive.fs:1207-1214 | src/libraries/interactive.fs:1258-1265 \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/libraries/interactive.fs:1207\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/libraries/interactive.fs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e00fce141f591c581e15dded53cf1406913765bd099f0a5f49ee1e0d9fb8d86"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 .NET and JavaScript/TypeScript suite: Coverage NOT MEASURED: the .NET half could not be measured \u2014 the repository wires up no coverage collector for \u0060--collect:\u0022XPlat Code Coverage\u0022\u0060 to use; the JavaScript/TypeScript half could not be measured \u2014 the repository root runs mocha but declares no coverage provider, so the suite can run and still produce no lcov \u2014 add \u0060c8\u0060 (or \u0060nyc\u0060) as a devDependency so the suite can be wrapped for coverage. This repository\u0027s production source spans both ecosystems, and no partial figure is published as if it were the whole: coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository\u0027s maintainers can perform; once it passes, the real number is measured on the next scan."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"56d7c0542bcbbd8d8c61f07327aa2080292f8d213e8f982f1a0933ffecde0a9c"},"properties":{"dependency":{"package":"brace-expansion","version":"2.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5a31a0b5364830f542d37385755d27dd90f97746286a80cb6c17836bc6e14179"},"properties":{"dependency":{"package":"js-yaml","version":"4.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"87839f7289af0999d94a99db6eefa4a0c9cb8f6ea36e8599abd5bd35ced532c8"},"properties":{"dependency":{"package":"serialize-javascript","version":"6.0.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"72184faccb7de6624805e93fee49208d11f474b184536ab6e002ee0e3a3c1b0c"},"properties":{"dependency":{"package":"serialize-javascript","version":"7.0.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"e48ac159ff7e45e7e8caf46fd08634e372e75c9d630e99e5dd84a5fa49a5f3b3"},"properties":{"dependency":{"package":"deepmerge","version":"4.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D34","level":"note","message":{"text":"Dormant codebase: 30 of 30 significant files have no living knowledge \u2014 the codebase as a whole is dormant, not 30 separate risks. Counted over 30 of the 37 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over. Re-engage owners or document before change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4c69f1e54b7dd6fe9029dd02df6ba8f8145b789f2f18dbdaa086c40ded49dba6"}},{"ruleId":"D34","level":"note","message":{"text":"Most significant orphaned file: One of the orphaned files carrying the most lost knowledge \u2014 ranked by size weighted by the file\u0027s role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bindings/monaco.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce72af9c624e5fecd3b5b817d6b0ac3ad67f7c694356da64c2745dbcc119a3f"}},{"ruleId":"D34","level":"note","message":{"text":"Most significant orphaned file: One of the orphaned files carrying the most lost knowledge \u2014 ranked by size weighted by the file\u0027s role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/libraries/interactive.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad27c42ac7b12cc900a963f11c2f680b74a51844f2bd8377af6446a9338954ed"}},{"ruleId":"D34","level":"note","message":{"text":"Most significant orphaned file: One of the orphaned files carrying the most lost knowledge \u2014 ranked by size weighted by the file\u0027s role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/libraries/compost.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9715bdf72fd394ed2df056e70e46e2510f22882e8ced2a017e4537769c183b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/common/babel.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f497bbf0ef132c916ecf8e5425216450ca56a6f7fd62f52116d6b42a2c7eb820"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/live/pivot.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0dc366a73395b53e7400072bec275c250b828573636a568900195dea785447"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/parser/parser.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbffc38662297fc768a5acb2cebf9da1be9e9ad05d284249d236ce7857814ad"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/providers/pivot.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1df99d8a4b3c67c844d5d2df2141f8cbe1226aad9a3a88f13c8704e5c6c796"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/ast/astops.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4dab4e5b6ccaddcfa76069123d47699d7e41367de5be799426d9b4c95939614"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/providers/fsharp.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a119a8e4fb735d4945eccd5ed57abccdc1aaa0320979cd6d6916c1914b918065"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/main.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a44a7422328433b92ca7a84f85b8d0419261c11bc991cc472c617f2dddc444"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/libraries/google/options.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52116cc9393f1093c5734801a465b709fc87dc38efa7740c7fcd830700f3c010"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/analyzer/typechecker.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"237b9733c730008c3dc5c21fdccd12fd2e03ecfae6f731d68014c1b995bd3fae"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/services.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9eb6b5807796f6741f0aa82b816116c4f415e44fdb671ea4bcd36669fbe9e56"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/libraries/common.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadf3c00e95feafc511de907f85b3df6ee4cbbf150cddeac7761157690fb45c4"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/libraries/series.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2096e31813d7f30ae2c0ef71e34e0303f2f5a52ce4b58396326074a45ea753"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/analyzer/interpreter.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"164bb1ed46dd420ba4580494abee71a0fd04235859531b790a7cd43841509242"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/providers/rest.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfcbd880d137faee3565c90698bdc32bd0db41af6875eb5867fde8da29d5d1ab"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/analyzer/binder.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f47debb3534ca83f77fdd7a43b5026571ad5fe1818b9afbd8986396e8b5821"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/codegen/codegen.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d196758b76270ac14c9286f5fb700ffd608264e83e73af99f49b8ab77432c49"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/ast/errors.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3939f0400a9a1089db28f83ba94373e8fa23e025b1f4c9e9c1f8ca318845413e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/monaco.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6f404934f75cf7be38999e00d2f69b2e10d172cbd673af345c2472804000da"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/parser/tokenizer.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14eca575af0123c480e2e8407074d9decd5cf18aac4c8a70fc52868c5e1be9cb"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/ast/ast.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5639e5e8513bfd086b2df11ce9ed041d28c92b1a6784047e9849251331dce272"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/libraries/html.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2813bce47be5dcec5a091a26c92bb653bc4035656328f9b81f98f88b7021f4c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/libraries/google/core.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"081d62813e8a9d84116eefe9b58d05398c830fa4ec04df6f699304b03e9e43e4"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/blocks.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a9517be61e95f4cf9715b4ef5b83f6e4fa1a0cc4b9fcc294a9835de24e83ce"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/libraries/tables.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f5beb1b360faefdcdf7d6e3912d28d649eb1c432ac141cd1fcadf66ee34885"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/live/showable.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"620fb8416fc0c9d7d2ad2cd408d8968254890b13e9f30667e7282abd16f46b80"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/libraries/google/charts.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc3a73f5e1f16820d33ef5cfe873659637783c4c732926e7f667f888a0ec762"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/live/live.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6164ae08808007d542ff68f7bfef9dc67dc5dfa7615e0a475daa882d95a0f06d"}},{"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"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"P1","level":"warning","message":{"text":"CI pipeline targets a decommissioned service: The pipeline is well-formed, but the only CI definition is \u0060.travis.yml\u0060, and its \u0060README.md\u0060 build badge still points at \u0060travis-ci.org\u0060 \u2014 a service shut down in June 2021. No other CI is configured in this repository, so nothing has been building or testing changes here since that shutdown \u2014 the steps below describe a gate that is not running. Porting it is mostly mechanical: the build and test commands already written here are what a replacement pipeline would run."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"94fa49939f4e75dfcbfaabad72be66184852fe80bd9db87538e6e15223919a47"}},{"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 1 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":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060src/bindings/bindings.fsproj\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bindings/bindings.fsproj"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c306e4c20e0c37b2e26271701035a793c4961451ca4f4685f522d5f354f8a401"}},{"ruleId":"SC1","level":"warning","message":{"text":"NuGet dependencies are not locked: No packages.lock.json and no central package management \u2014 restores aren\u0027t reproducible or pinned (SSDF PW.4.4). Enable \u003CRestorePackagesWithLockFile\u003Etrue\u003C/RestorePackagesWithLockFile\u003E (commit the lockfile) or adopt Directory.Packages.props. Advisory \u2014 never scored."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0a97b4f69ccac509400ece7eedefb06d3ede0522cd4d8bcb5c068bea719545a6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cmd.Range.Start \u003C= loc \u0026\u0026 cmd.Range.End \u002B 1 \u003E= loc\u0060 appears character-identically in 2 files \u2014 src/thegamma/live/pivot.fs, src/thegamma/live/showable.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/thegamma/live/pivot.fs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bac96c1eaf562acc5ab3c35acdb23d60d832201d2006220cb4b499d9b9576e4"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060trace\u0060 at line 129 is called with an argument built by \u0060Array.ofSeq completion\u0060 (line 129), whose cost grows with the collection it walks. F# evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 and then the level check inside the logger discards the string it produced, because trace is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no \u0060IsEnabled\u0060 test, no debug flag, no \u0060#if DEBUG\u0060 region, no \u0060fun\u0060 or \u0060lazy\u0060 the logger runs only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/monaco.fs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84fd13501f231f22c6f5a40e0cf97a999a3591c9c27d6618258e84d08c7acd2"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060trace\u0060 at line 258 is called with an argument built by \u0060Array.ofList tys\u0060 (line 258), whose cost grows with the collection it walks. F# evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 and then the level check inside the logger discards the string it produced, because trace is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no \u0060IsEnabled\u0060 test, no debug flag, no \u0060#if DEBUG\u0060 region, no \u0060fun\u0060 or \u0060lazy\u0060 the logger runs only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/providers/fsharp.fs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc12bc3c49014c34d648b66028c8798a4123a8a4b38e83571e3766790e78de60"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060trace\u0060 at line 367 is called with an argument built by \u0060Array.ofSeq chain\u0060 (line 367), whose cost grows with the collection it walks. F# evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 and then the level check inside the logger discards the string it produced, because trace is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no \u0060IsEnabled\u0060 test, no debug flag, no \u0060#if DEBUG\u0060 region, no \u0060fun\u0060 or \u0060lazy\u0060 the logger runs only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/live/pivot.fs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a200ea15aee12cef8ee11fb9da94bae4d8033991d99f68c12842f020cd2b335"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060trace\u0060 at line 368 is called with an argument built by \u0060Array.ofSeq sections\u0060 (line 368), whose cost grows with the collection it walks. F# evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 and then the level check inside the logger discards the string it produced, because trace is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no \u0060IsEnabled\u0060 test, no debug flag, no \u0060#if DEBUG\u0060 region, no \u0060fun\u0060 or \u0060lazy\u0060 the logger runs only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/live/pivot.fs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee365608c7df3db91baa826bf2640467abae805f00b3a883558c50aafd31a3a"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060trace\u0060 at line 418 is called with an argument built by \u0060Array.ofSeq newSections\u0060 (line 418), whose cost grows with the collection it walks. F# evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 and then the level check inside the logger discards the string it produced, because trace is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no \u0060IsEnabled\u0060 test, no debug flag, no \u0060#if DEBUG\u0060 region, no \u0060fun\u0060 or \u0060lazy\u0060 the logger runs only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/live/pivot.fs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"1676d5d8412b0447eac4778d99841e456f2198c31d419091b5297f3239f914d7"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060trace\u0060 at line 85 is called with an argument built by \u0060Seq.choose snd matchedArguments -\u003E e.Value |\u0060 (line 85), whose cost grows with the collection it walks. F# evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 and then the level check inside the logger discards the string it produced, because trace is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no \u0060IsEnabled\u0060 test, no debug flag, no \u0060#if DEBUG\u0060 region, no \u0060fun\u0060 or \u0060lazy\u0060 the logger runs only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/analyzer/typechecker.fs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"40083f2de18410ea91052bfd2183755782a67199de6bf7ecaaaad351e39550b6"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060trace\u0060 at line 91 is called with an argument built by \u0060Array.ofList (List.map (fst \u003E\u003E Ast.formatType) matchedArguments)\u0060 (line 92), whose cost grows with the collection it walks. F# evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 and then the level check inside the logger discards the string it produced, because trace is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no \u0060IsEnabled\u0060 test, no debug flag, no \u0060#if DEBUG\u0060 region, no \u0060fun\u0060 or \u0060lazy\u0060 the logger runs only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/analyzer/typechecker.fs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab365b49e5f5497c513aa35f15b0afbe9de84b79bc43f9a538af641ed155478"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"}]}],"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":6,"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."]}]}