{"$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":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"id":"D33","name":"JS/npm Dependency Vulnerabilities","shortDescription":{"text":"JS/npm Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D33","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D38","name":"OSV Dependency Vulnerabilities","shortDescription":{"text":"OSV Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D38","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}}]}},"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."},"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 51, match/switch 28, loops 13, 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 30, match/switch 23, loops 16 (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 22, match/switch 20, loops 8, 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 24, if/else 19, 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 24, if/else 16, loops 5, 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 25, if/else 16, 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 25, loops 16, match/switch 3, 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 20, if/else 17, 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 20, match/switch 14, 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 17, match/switch 12, loops 7, 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 23, if/else 13 (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 23, match/switch 8, 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 17, match/switch 12, 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 25, if/else 4 (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 8, if/else 7, loops 6, error handling 4 (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 14, match/switch 6, 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 17, 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 12, loops 5, match/switch 5 (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 11, loops 4, match/switch 3, error handling 2 (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 9, if/else 8, loops 2 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/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 13, if/else 5 (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 16 (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). 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). 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). 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). 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). 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":"TooManyMethods: Pivot: TooManyMethods \u2014 32 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type 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 (11 lines \u00D7 2): src/libraries/interactive.fs:871-881 | src/libraries/interactive.fs:960-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:871\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":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"f300fab0efea64f11e97153ce0fb2d15a5d1caa6ca0acf10bbd7204025a3f447"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/libraries/interactive.fs:573-581 | src/libraries/interactive.fs:752-760 | src/libraries/interactive.fs:868-876 | src/libraries/interactive.fs:1105-1113 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/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":"e45f943946dd64435ca09e94290c75e6ee56b3cafdcad44077b907cf3b8dc3e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/libraries/interactive.fs:1133-1141 | src/libraries/interactive.fs:1178-1186 \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 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":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a66e35e5c02ecc11e98fad0cdbb2c3fa6ab5419051c62d8af67b1f758981cd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/bindings/monaco.fs:227-234 | src/bindings/monaco.fs:516-523 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bindings/monaco.fs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"df78b9819df8918214cf0c459f459d7896bd0d9d10e339cb1f3f6dd44dcb06ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): src/bindings/monaco.fs:213-219 | src/bindings/monaco.fs:226-232 | src/bindings/monaco.fs:503-509 | src/bindings/monaco.fs:555-561 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bindings/monaco.fs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5cc69931ac333993e3b2f5ea1c180462b844a18fdd9c8f629892816822d48b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/bindings/monaco.fs:383-389 | src/bindings/monaco.fs:441-447 | src/bindings/monaco.fs:1574-1580 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bindings/monaco.fs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"26be47573d0061fce29e3572c3e4ba359c5c4dc9171a0bb1a3f77c7f709957cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/libraries/html.fs:130-136 | src/libraries/html.fs:153-159 \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/html.fs:130\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/html.fs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee2cd65711b05c80a8818d6d5f43611b6250d6f8f38483618f4311587b87665"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/libraries/interactive.fs:925-931 | 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:925\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/libraries/interactive.fs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e338ba947d36c63a5d07e534fc617cb55597ac3f1d387ec8c0f047293f0483"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/libraries/interactive.fs:1326-1332 | src/libraries/interactive.fs:1402-1408 \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:1326\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":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d7fa490eab24fed97cd9f9727b9c7e431df2e73a65087da7e21cfe22bbb4b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/thegamma/ast/astops.fs:277-283 | src/thegamma/ast/astops.fs:302-308 \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":"e845731ad242ea1906abc3d2a012733c9a9e217efc9807dff0b408a9ca994643"}},{"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":"b5a9f90b2d9becff62619f2b778c553b427079295c8f3d894c6a71767519345e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/bindings/monaco.fs:181-186 | src/bindings/monaco.fs:377-382 \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":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"399d45bdc17d13173a40436416e91fdd096f478f55086798735a6f495082e427"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/bindings/monaco.fs:398-403 | src/bindings/monaco.fs:1571-1576 \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":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"642143d0084ee9cfda0be5e22fca5a778f23dfdf0c141bc42bfb030c91f1d3d5"}},{"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":"ec0852f5e97a2c02fefd0ef3a56dc1aae4ed92b224f6c91af984d274eab02595"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/libraries/interactive.fs:836-840 | src/libraries/interactive.fs:903-907 \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":"9ca922671f8a47d5d7de15e8958e338517264ebeb85696c09a0c2891503978da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/libraries/interactive.fs:1151-1155 | src/libraries/interactive.fs:1196-1200 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/libraries/interactive.fs"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b230c208ba89ce4318d0c88ab29e79573e134bf11bb6e6aa7f04901b3ec51a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/libraries/interactive.fs:1211-1215 | src/libraries/interactive.fs:1262-1266 \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:1211\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/libraries/interactive.fs"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"03080b01785dfa413cbe179066028aa136f79f291f83e10930083b0893426117"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/thegamma/analyzer/interpreter.fs:40-44 | src/thegamma/main.fs:142-146 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thegamma/analyzer/interpreter.fs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3303b207414930af0568b3343b5e5de7909e039bdc4fd18052458adb0b01896"}},{"ruleId":"D16","level":"warning","message":{"text":"dormant codebase \u2014 no living knowledge left to concentrate: All 17 significant source file(s) were last meaningfully changed so long ago that no living knowledge remains \u2014 nothing since has been substantial enough to re-establish ownership (a broad, mechanical sweep that touches many files shallowly does not count, and neither does no activity at all). There is no concentration to measure, so the bus factor is not scored. This is not a clean bill: nobody currently holds working knowledge of this code (see D34 Knowledge Freshness)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"569d55ea5cb0330f13c125b289d07e5abdfcceac947a2c2645277937942e7d5f"}},{"ruleId":"D38","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":"71f9fc7383732b13293878241c4d91b8e4d85db72b2521db178cb53f3cb6263c"}},{"ruleId":"D38","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":"6a140f05842a15c294b696a0f4fd2425c71e54af4966a42f00a0229b69300514"}},{"ruleId":"D38","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":"63de6430fbc0d5f626386b24edb64811ed1e0dfd5b6689cee1c42884041ee238"}}],"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-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-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":3,"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."]}]}