{"$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":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"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":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D22","name":"Internal API Consistency","shortDescription":{"text":"Internal API Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D22"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"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":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02: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":"D39","name":"IL Efficiency","shortDescription":{"text":"IL Efficiency"},"helpUri":"https://codehealth.canine.dev/dimensions/D39"},{"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":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"C2","name":"Access Controls","shortDescription":{"text":"Access Controls"},"helpUri":"https://codehealth.canine.dev/dimensions/C2"},{"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":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"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":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"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":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"Evaluator.applyFilter (cyclomatic 178): Evaluator.applyFilter has cyclomatic complexity 178 (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/Zest.Compiler/Zestucks/Evaluator.fs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb198b69269f78d666b651ea5e44aedc675058adaeaed97b2fc2c6fa1493d286"}},{"ruleId":"D1","level":"warning","message":{"text":"Renderer.renderRange (cyclomatic 165): Renderer.renderRange has cyclomatic complexity 165 (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/Zest.Compiler/Zestucks/Renderer.fs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5fde5357d615f4ea78ba8e015529ed5553d2741e0a6bf8aa27d7c80945b340b"}},{"ruleId":"D1","level":"warning","message":{"text":"IndentParser.parseIndentBlock (cyclomatic 104): IndentParser.parseIndentBlock has cyclomatic complexity 104 (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/Zest.Compiler/Zcss/IndentParser.fs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"6064bf3cf4c627656ba7ec789a6c6a0395275497712d94716d4fba8de609697f"}},{"ruleId":"D1","level":"warning","message":{"text":"CssWriter.compileCore (cyclomatic 79): CssWriter.compileCore has cyclomatic complexity 79 (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/Zest.Compiler/Zcss/CssWriter.fs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81343da987031a48ef860c58ce5c2651de45682a6553dbc9ff1610650dedea6"}},{"ruleId":"D1","level":"warning","message":{"text":"ZestucksFilters.registerAllFilters (cyclomatic 71): ZestucksFilters.registerAllFilters has cyclomatic complexity 71 (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/Zest.Compiler/Execution/ZestucksFilters.fs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6752bb8a6bb8acb9942d3b4429359b1643784b1691481801571daf837218b66"}},{"ruleId":"D1","level":"warning","message":{"text":"Formatting.format (cyclomatic 65): Formatting.format has cyclomatic complexity 65 (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/Zest.Compiler/Rendering/Formatting.fs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d2f5f0c5c83796a90885044f88ab7c9a4ec757ac6a87b84b8c11e58387d5d8"}},{"ruleId":"D1","level":"warning","message":{"text":"Evaluator.evalC (cyclomatic 62): Evaluator.evalC has cyclomatic complexity 62 (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/Zest.Compiler/Zestucks/Evaluator.fs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"c542473af67fad7de37b9bdd059fe67d89ba9fa01c24002241cd31da3094822c"}},{"ruleId":"D1","level":"warning","message":{"text":"BraceParser.parseBraceBlock (cyclomatic 61): BraceParser.parseBraceBlock has cyclomatic complexity 61 (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/Zest.Compiler/Zcss/BraceParser.fs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebfd5005d523a8a778f15db95fcc8f12f53cb3f12df73e2019cf6fd2e3c4ead"}},{"ruleId":"D1","level":"warning","message":{"text":"Formatting.formatJs (cyclomatic 55): Formatting.formatJs has cyclomatic complexity 55 (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/Zest.Compiler/Rendering/Formatting.fs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"27dbe601a5f6c5eaff50b757eb4f7f91264ad7b74bc9e3b62c4a6f464c56b168"}},{"ruleId":"D1","level":"warning","message":{"text":"Tokenizer.tokenize (cyclomatic 49): Tokenizer.tokenize has cyclomatic complexity 49 (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/Zest.Compiler/Zestucks/Tokenizer.fs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"094b0fa5dd7b1c5f485a1feae854204101a1ba2029242d5895cbb22f3248960e"}},{"ruleId":"D1","level":"warning","message":{"text":"BuiltinFunctions.resolve (cyclomatic 49): BuiltinFunctions.resolve has cyclomatic complexity 49 (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/Zest.Compiler/Zcss/BuiltinFunctions.fs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a09f7dc1031cbdd7aeaf0d346f60483b58a81fa510c31a5f5328359e18b0c98"}},{"ruleId":"D1","level":"warning","message":{"text":"BuildRunner.execute (cyclomatic 47): BuildRunner.execute has cyclomatic complexity 47 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Build/BuildRunner.fs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb76a6134265eb0bbfbb7d8da9f980950607c3f28020de042d91f82da9e50c5"}},{"ruleId":"D1","level":"warning","message":{"text":"Evaluator.applyIsTest (cyclomatic 43): Evaluator.applyIsTest has cyclomatic complexity 43 (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/Zest.Compiler/Zestucks/Evaluator.fs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"542422bfdda2a1b3153444e4b106ed0f8467574d6ec5a6703592218a6f1673f0"}},{"ruleId":"D1","level":"warning","message":{"text":"MathEvaluator.tokenize (cyclomatic 41): MathEvaluator.tokenize has cyclomatic complexity 41 (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/Zest.Compiler/Zcss/MathEvaluator.fs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"9855f551fadecf80e367b99cd2f357fa2d2e06a814360d5a2a06bbb28251c2e3"}},{"ruleId":"D1","level":"warning","message":{"text":"Evaluator.applyValueTest (cyclomatic 35): Evaluator.applyValueTest has cyclomatic complexity 35 (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/Zest.Compiler/Zestucks/Evaluator.fs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b13bf07de585f76047c29ac5116a9d2eeff29dca897ac3cf0664b9a3d3d73eb"}},{"ruleId":"D1","level":"warning","message":{"text":"PagePipeline.processContent (cyclomatic 33): PagePipeline.processContent has cyclomatic complexity 33 (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/Zest.Compiler/Build/PagePipeline.fs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"e407b0ebe9855d882f1268612893b43defb685184fa3f27535c15bc878c050ab"}},{"ruleId":"D1","level":"warning","message":{"text":"Markdown.toHtml (cyclomatic 31): Markdown.toHtml has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Rendering/Markdown.fs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da9d46defa9f2f156a1ec960868d54c7763f33d3809aa461acf440a3f2b49e0"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpressionCompiler.splitInlineIf (cyclomatic 31): ExpressionCompiler.splitInlineIf has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zestucks/ExpressionCompiler.fs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f1b5e7d4abd5326fbbb50c3ba4e02c89c515577cc03c81438a2cdada985678"}},{"ruleId":"D1","level":"warning","message":{"text":"Zcss.processTextWithBaseDirUncached (cyclomatic 31): Zcss.processTextWithBaseDirUncached 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/Zest.Compiler/Zcss/Engine.fs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b38615d815bc7e9fe8a91f441fc8f5c335c0d3f7f62c976a17702209b741399"}},{"ruleId":"D1","level":"warning","message":{"text":"MathEvaluator.eval (cyclomatic 29): MathEvaluator.eval has cyclomatic complexity 29 (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/Zest.Compiler/Zcss/MathEvaluator.fs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"971794d7f5c1200dcfefa06cc77695bb834af125593b1185cb111f4682758fd5"}},{"ruleId":"D1","level":"warning","message":{"text":"Formatting.formatCss (cyclomatic 28): Formatting.formatCss has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Rendering/Formatting.fs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbdbf538d6c383e84a8b119526c40648b641f6c5bf7542f4f63763db7609256c"}},{"ruleId":"D1","level":"warning","message":{"text":"CoreParser.parseDecl (cyclomatic 27): CoreParser.parseDecl 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/Zest.Compiler/Zcss/CoreParser.fs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d1a00bf66fca8d8f81ee4dc3cc34ed51518bdcac7dc565c36f40ec0f302ce1"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontMatterParser.metaFromTomlTable (cyclomatic 26): FrontMatterParser.metaFromTomlTable has cyclomatic complexity 26 (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/Zest.Compiler/Build/FrontMatterParser.fs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f632081335023eb05629b583dd7905c487f14495ea646a5ae9bd712acb1ab7"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpressionCompiler.findTopOp (cyclomatic 24): ExpressionCompiler.findTopOp 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/Zest.Compiler/Zestucks/ExpressionCompiler.fs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8f03dff7e32032f07451110e9d56e7d16b047aae2c5478e657d4ef5b6f1969"}},{"ruleId":"D1","level":"warning","message":{"text":"Evaluator.evalBool (cyclomatic 23): Evaluator.evalBool has cyclomatic complexity 23 (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/Zest.Compiler/Zcss/Evaluator.fs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"89314684dc388059f10fa2dbca076acff1374315147fc68ef9f236df750ca294"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpServerBase.HandleRequest (cyclomatic 22): HttpServerBase.HandleRequest has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/HttpServerBase.cs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"342fb11989910ef59058c63a0b5a5c103401b51ae2e7e458cf1337f95489504c"}},{"ruleId":"D1","level":"warning","message":{"text":"IncrementalCache.loadCache (cyclomatic 22): IncrementalCache.loadCache has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Build/IncrementalCache.fs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d8e12050be8da54d501ed4078d1aa48458e67feb808eecf565ba09006b913d"}},{"ruleId":"D1","level":"warning","message":{"text":"CleanCommand.Execute (cyclomatic 20): CleanCommand.Execute has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Command/CleanCommand.cs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"18dbf90c27c02bce4f4128853d43ce75498beddcfff36d9694075f65d0c4aed5"}},{"ruleId":"D1","level":"warning","message":{"text":"FsiRunner.evaluatePageScriptsBatchWithBindings (cyclomatic 19): FsiRunner.evaluatePageScriptsBatchWithBindings has cyclomatic complexity 19 (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. This is NOT this file\u0027s highest cyclomatic complexity: FsiRunner.isPageScript (cyclomatic 26) 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/Zest.Compiler/Execution/FsiRunner.fs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"85fb7650094309b2648a6f8ce3372bc67c8f51dfa1bd862dd01e826e329ed3a5"}},{"ruleId":"D1","level":"warning","message":{"text":"LogWriter.Log (cyclomatic 18): LogWriter.Log has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/LogWriter.cs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dda4867e5899abf4fd22d909e35b4b8ec66eea0a0d52b4bb25e6c457de9691c"}},{"ruleId":"D1","level":"warning","message":{"text":"AssetWriter.copyAssets (cyclomatic 18): AssetWriter.copyAssets has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Build/AssetWriter.fs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e23bb3b562ff44773029fb472b8ab0d2b027ae23389ce57497ee24a5b3fc766"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontMatterParser.applyPair (cyclomatic 18): FrontMatterParser.applyPair has cyclomatic complexity 18 (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/Zest.Compiler/Build/FrontMatterParser.fs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c30239fe7d6f156ab56c2b443e8a3cd1deb66a6acb540c41aa40df392beaebb"}},{"ruleId":"D1","level":"warning","message":{"text":"FsiRunner.evaluateLayoutScriptsBatch (cyclomatic 18): FsiRunner.evaluateLayoutScriptsBatch has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: FsiRunner.isPageScript (cyclomatic 26) 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/Zest.Compiler/Execution/FsiRunner.fs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"63665f6920b8de541a3a29e6833fb25fbd9063e8a0786f959c22ad607b241d95"}},{"ruleId":"D1","level":"warning","message":{"text":"CliParser.ParsePreview (cyclomatic 17): CliParser.ParsePreview has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Cli/CliParser.cs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"f183bcce4b69e2e96351799c25d3ae41ecaa049b64ed6e926fdb46fdcfaf9175"}},{"ruleId":"D1","level":"warning","message":{"text":"PaginationGenerator.generateCollection (cyclomatic 17): PaginationGenerator.generateCollection 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/Zest.Compiler/Build/PaginationGenerator.fs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"9862dfabd6520deb379ac97ffc816baeab18bf3cf14678856c85644f9701b205"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpressionCompiler.splitTopLevelPipes (cyclomatic 17): ExpressionCompiler.splitTopLevelPipes has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zestucks/ExpressionCompiler.fs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"1063b3fb4e56560baac42399671c65d948c23ca0b86a193d904b417a7432f43c"}},{"ruleId":"D1","level":"warning","message":{"text":"LiveReloadHub.PumpClientFramesAsync (cyclomatic 16): LiveReloadHub.PumpClientFramesAsync has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/LiveReloadHub.cs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"41076b9cb2dd9591931a541fe24212845a02c012f5e702d4943c1547477944b1"}},{"ruleId":"D1","level":"warning","message":{"text":"FsiSession.tryRunScript (cyclomatic 16): FsiSession.tryRunScript has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Execution/FsiSession.fs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ed1a7ec768c18baf02549460ef024c65f543fa82880521e52c9a5c2b2c5e5b"}},{"ruleId":"D1","level":"warning","message":{"text":"CssWriter.splitTopLevel (cyclomatic 16): CssWriter.splitTopLevel has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zcss/CssWriter.fs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd1e980c73e66ff25c431fc9e766b9af7e782e8a13bcb20949a594e1287da2c"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer.renderRange (cognitive 545): Renderer.renderRange has cognitive complexity 545 (threshold 15). Drivers by points: if/else 75 (255 pts), match/switch 44 (238 pts), loops 8 (43 pts), boolean chains 9 (nesting depth added 409). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zestucks/Renderer.fs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf9ffabafdd5ed4c9abae5f2fa0e873d6e289efc77c4013e161382295746269"}},{"ruleId":"D2","level":"warning","message":{"text":"IndentParser.parseIndentBlock (cognitive 309): IndentParser.parseIndentBlock has cognitive complexity 309 (threshold 15). Drivers by points: if/else 114 (283 pts), boolean chains 15, match/switch 2 (10 pts), loops 1 (nesting depth added 177). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zcss/IndentParser.fs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd941c8bdcc1c635b5a850bab63f3283a06589f05e2832f6dc6cce44f4a5092"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator.applyFilter (cognitive 283): Evaluator.applyFilter has cognitive complexity 283 (threshold 15). Drivers by points: if/else 94 (152 pts), match/switch 37 (83 pts), error handling 13 (34 pts), loops 3 (9 pts), boolean chains 5 (nesting depth added 131). 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/Zest.Compiler/Zestucks/Evaluator.fs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b16ca7e47d9f0b0d83c1aa2269cc44da7f8ec15cccdd813c539689005d7420"}},{"ruleId":"D2","level":"warning","message":{"text":"CssWriter.compileCore (cognitive 176): CssWriter.compileCore has cognitive complexity 176 (threshold 15). Drivers by points: if/else 30 (76 pts), loops 16 (62 pts), match/switch 11 (33 pts), boolean chains 5 (nesting depth added 114). 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/Zest.Compiler/Zcss/CssWriter.fs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a59b24cbdd8d8022b6020762cd07d6bc0a6bf0f72250d3cccdf2754efd9726"}},{"ruleId":"D2","level":"warning","message":{"text":"Tokenizer.tokenize (cognitive 161): Tokenizer.tokenize has cognitive complexity 161 (threshold 15). Drivers by points: if/else 49 (137 pts), boolean chains 11, loops 4 (11 pts), match/switch 1 (2 pts) (nesting depth added 96). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zestucks/Tokenizer.fs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f670491fc3a63931710c6dab5e01d2896c0baef9ff53ec5cce81101a259ffc9"}},{"ruleId":"D2","level":"warning","message":{"text":"BraceParser.parseBraceBlock (cognitive 158): BraceParser.parseBraceBlock has cognitive complexity 158 (threshold 15). Drivers by points: if/else 73 (147 pts), match/switch 2 (7 pts), boolean chains 3, loops 1 (nesting depth added 79). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zcss/BraceParser.fs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1933cc2f4bb6343f16907dcc0dc4057eb46c60e7996d14d250b1237ec53b95"}},{"ruleId":"D2","level":"warning","message":{"text":"Formatting.format (cognitive 154): Formatting.format has cognitive complexity 154 (threshold 15). Drivers by points: if/else 56 (140 pts), boolean chains 9, loops 2 (5 pts) (nesting depth added 87). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Rendering/Formatting.fs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7e12d0d499d9b1a523d21e87ce9ddc78a42ba45a80eeb28b0d628239065872"}},{"ruleId":"D2","level":"warning","message":{"text":"ZestucksFilters.registerAllFilters (cognitive 127): ZestucksFilters.registerAllFilters has cognitive complexity 127 (threshold 15). Drivers by points: if/else 50 (58 pts), match/switch 32 (55 pts), error handling 3 (7 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 36). 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/Zest.Compiler/Execution/ZestucksFilters.fs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"71813fc1fe8dc2e797c791c7ff47ee662b4c0ca2eb7a355199f192e9d39d82d8"}},{"ruleId":"D2","level":"warning","message":{"text":"BuiltinFunctions.resolve (cognitive 106): BuiltinFunctions.resolve has cognitive complexity 106 (threshold 15). Drivers by points: if/else 32 (83 pts), match/switch 4 (16 pts), boolean chains 6, loops 1 (nesting depth added 63). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zcss/BuiltinFunctions.fs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"a502c0c7050fcd7d56af39c762f01989360a05c8fa7d92d6c194fcdf4ed435b6"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator.evalC (cognitive 94): Evaluator.evalC has cognitive complexity 94 (threshold 15). Drivers by points: if/else 22 (43 pts), match/switch 12 (32 pts), loops 4 (12 pts), error handling 1 (5 pts), boolean chains 2 (nesting depth added 53). 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/Zest.Compiler/Zestucks/Evaluator.fs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"887af1b748f9b4afae8d321a9c6008dc0b3fea9efbec3b1ca1936d81b91af32e"}},{"ruleId":"D2","level":"warning","message":{"text":"BuildRunner.execute (cognitive 79): BuildRunner.execute has cognitive complexity 79 (threshold 15). Drivers by points: loops 20 (41 pts), if/else 15 (20 pts), match/switch 5 (11 pts), error handling 3 (5 pts), boolean chains 2 (nesting depth added 34). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Build/BuildRunner.fs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68fc41997b4776604444954f1295c89cc74a65128c159078e926825a530dc8c"}},{"ruleId":"D2","level":"warning","message":{"text":"Cache.load (cognitive 72): Cache.load has cognitive complexity 72 (threshold 15). Drivers by points: if/else 11 (40 pts), match/switch 2 (13 pts), loops 2 (11 pts), error handling 2 (8 pts) (nesting depth added 55). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zcss/Cache.fs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b786c574de9b4d588aac7deeb288d9dba8992e94cb2e7253d808b540a8ed3d9"}},{"ruleId":"D2","level":"warning","message":{"text":"Formatting.formatJs (cognitive 68): Formatting.formatJs has cognitive complexity 68 (threshold 15). Drivers by points: if/else 26 (48 pts), boolean chains 16, loops 2 (4 pts) (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/Zest.Compiler/Rendering/Formatting.fs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc713e33736604782a9eed9e67eae214d53c2e0bfd03e3412d084753e97adc0d"}},{"ruleId":"D2","level":"warning","message":{"text":"MathEvaluator.eval (cognitive 66): MathEvaluator.eval has cognitive complexity 66 (threshold 15). Drivers by points: if/else 15 (34 pts), match/switch 8 (26 pts), boolean chains 3, error handling 1 (3 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zcss/MathEvaluator.fs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"813cfc291fcc6a0695579b1b7122a342f5c1caf2f51491d549acab9083901ab6"}},{"ruleId":"D2","level":"warning","message":{"text":"Markdown.toHtml (cognitive 62): Markdown.toHtml has cognitive complexity 62 (threshold 15). Drivers by points: if/else 20 (33 pts), loops 7 (23 pts), boolean chains 6 (nesting depth added 29). 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/Zest.Compiler/Rendering/Markdown.fs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f687f4cabfa9a4f571933c829a2b3c9577abcdeb74e3a4bff7fa9f24e3b425"}},{"ruleId":"D2","level":"warning","message":{"text":"MathEvaluator.tokenize (cognitive 58): MathEvaluator.tokenize has cognitive complexity 58 (threshold 15). Drivers by points: loops 6 (18 pts), boolean chains 16, if/else 11 (14 pts), match/switch 3 (10 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zcss/MathEvaluator.fs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a947302ca014ff953bcdf54dd87f38b53013d078518320af585a4e0e418c94a"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreParser.parseDecl (cognitive 57): CoreParser.parseDecl has cognitive complexity 57 (threshold 15). Drivers by points: if/else 21 (49 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zcss/CoreParser.fs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"c767ef94545e91a8b2095fc110cb6581f00cc52ee92588125527dc4f4dfba27b"}},{"ruleId":"D2","level":"warning","message":{"text":"PagePipeline.processContent (cognitive 53): PagePipeline.processContent has cognitive complexity 53 (threshold 15). Drivers by points: if/else 23 (27 pts), error handling 6 (11 pts), loops 2 (6 pts), match/switch 3 (6 pts), boolean chains 3 (nesting depth added 16). 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/Zest.Compiler/Build/PagePipeline.fs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"775de9ceea268ab901aa80d9b1ff8a88bfa48f97f9ebfdddbbd3fe3ee4b9f5cb"}},{"ruleId":"D2","level":"warning","message":{"text":"FsiSession.tryRunScript (cognitive 49): FsiSession.tryRunScript has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (39 pts), loops 1 (5 pts), boolean chains 2, match/switch 2, error handling 1 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Execution/FsiSession.fs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"a099b82b08f801b90c6a29906d784fc98ae32b07eb2ec83d1e81f358f1ee919e"}},{"ruleId":"D2","level":"warning","message":{"text":"IncrementalCache.loadCache (cognitive 46): IncrementalCache.loadCache has cognitive complexity 46 (threshold 15). Drivers by points: if/else 14 (27 pts), match/switch 3 (9 pts), error handling 2 (6 pts), loops 2 (3 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/Zest.Compiler/Build/IncrementalCache.fs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a11f8598a31c37496254996d6d0c6d426c96b7f4b4e90b2706da19c0f6f05a"}},{"ruleId":"D2","level":"warning","message":{"text":"FsiRunner.evaluateLayoutScriptsBatch (cognitive 43): FsiRunner.evaluateLayoutScriptsBatch has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 3 (8 pts), match/switch 2 (6 pts), boolean chains 2, error handling 1 (2 pts) (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/Zest.Compiler/Execution/FsiRunner.fs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f98cd28e76e5ec4771821a51cfcc26142405dbd121ccdb596bed9e438935ed7"}},{"ruleId":"D2","level":"warning","message":{"text":"PaginationGenerator.generate (cognitive 41): PaginationGenerator.generate has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 2 (7 pts), error handling 1 (4 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 26). 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/Zest.Compiler/Build/PaginationGenerator.fs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"98bfc523df9bcd03c1789f53eebda3718f4f3945b201cc2798cf1812926945e5"}},{"ruleId":"D2","level":"warning","message":{"text":"FsiRunner.evaluatePageScriptsBatchWithBindings (cognitive 41): FsiRunner.evaluatePageScriptsBatchWithBindings has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 3 (8 pts), match/switch 2 (6 pts), boolean chains 2, error handling 1 (2 pts) (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/Zest.Compiler/Execution/FsiRunner.fs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"924636bb83e5795a14505f3c83e3b23490c02390680b9bea73d48723877fc08b"}},{"ruleId":"D2","level":"warning","message":{"text":"AssetWriter.copyAssets (cognitive 40): AssetWriter.copyAssets has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (24 pts), error handling 3 (9 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Build/AssetWriter.fs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f95248f0a4d775a61a2bcc299bbf9d91662886d07615ef52793fc33f23b3e15"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator.applyIsTest (cognitive 39): Evaluator.applyIsTest has cognitive complexity 39 (threshold 15). Drivers by points: match/switch 15 (31 pts), error handling 1 (4 pts), boolean chains 2, if/else 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/Zest.Compiler/Zestucks/Evaluator.fs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"444d694759a2c40d505f798de58f96ead4b5cbfd0a6b422b0365e64857c64685"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionCompiler.splitInlineIf (cognitive 38): ExpressionCompiler.splitInlineIf has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 12, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zestucks/ExpressionCompiler.fs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94ce146e1caf009638a96a7803758f76dfe7d2ba6223a61c8d5a53cf1851f1d"}},{"ruleId":"D2","level":"warning","message":{"text":"Formatting.formatCss (cognitive 37): Formatting.formatCss has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 7, loops 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Rendering/Formatting.fs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c7271554d8e3fa9a0d809ea1557f1439c6514824e7987927eba12ac05ff692"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator.resolvePath (cognitive 37): Evaluator.resolvePath has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 3 (13 pts), loops 2, boolean chains 1 (nesting depth added 20). 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/Zest.Compiler/Zestucks/Evaluator.fs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ebdba27a912d3265951bc506f50c1155c23f520fcde5d0a1cbdf2f2d253119f"}},{"ruleId":"D2","level":"warning","message":{"text":"DslAssembly.findDslDll (cognitive 35): DslAssembly.findDslDll has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (27 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Execution/DslAssembly.fs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8fa41542798288936da93e5aadb92907e89ccc590a6782c8b229e91cb18a10a"}},{"ruleId":"D2","level":"warning","message":{"text":"PageEvaluator.evaluateWithText (cognitive 33): PageEvaluator.evaluateWithText has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 7 (18 pts), if/else 8 (13 pts), boolean chains 1, error handling 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/Zest.Compiler/Execution/PageEvaluator.fs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c5ccfb822d987a2174783752ddf3b375dde45612183ec376d5022d702ae3c9"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockCollector.collectMacroDefs (cognitive 31): BlockCollector.collectMacroDefs has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (28 pts), match/switch 1 (2 pts), loops 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/Zest.Compiler/Zestucks/BlockCollector.fs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81a7a33b7a1ee5ea244763316094cf82565089c2a8fece30d9e8be445d3076e"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator.evalBool (cognitive 31): Evaluator.evalBool has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 3 (11 pts), boolean chains 4, loops 1 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zcss/Evaluator.fs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b50577affd930aa208fb56e72d57e4636febda98712def256491a105261642"}},{"ruleId":"D2","level":"warning","message":{"text":"LiveReloadHub.PumpClientFramesAsync (cognitive 30): LiveReloadHub.PumpClientFramesAsync has cognitive complexity 30 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/LiveReloadHub.cs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5c77d5c3b06dfd24b63ff451c103c7df32b78ef825beb116e729b27a02cf05"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionCompiler.findTopOp (cognitive 29): ExpressionCompiler.findTopOp has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 10, match/switch 1 (3 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zestucks/ExpressionCompiler.fs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92e76316d23498ee55ee4dc61d60b7406364d5cf16bd90dc1d62af0b3c35625"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpServerBase.HandleRequest (cognitive 28): HttpServerBase.HandleRequest has cognitive complexity 28 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/HttpServerBase.cs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36526734bd4d76d340530f2b3358856e363d4bfbbbb6050ad2b581920f35d10"}},{"ruleId":"D2","level":"warning","message":{"text":"TaxonomyGenerator.generate (cognitive 28): TaxonomyGenerator.generate has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 2 (7 pts), loops 2 (4 pts) (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/Zest.Compiler/Build/TaxonomyGenerator.fs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1b0525dcae28119ec347b2c5e23fe9876433d9088997ec2bbd7b24fe64bf68"}},{"ruleId":"D2","level":"warning","message":{"text":"PaginationGenerator.generateCollection (cognitive 26): PaginationGenerator.generateCollection has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (20 pts), match/switch 3 (5 pts), loops 1 (nesting depth added 6). 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/Zest.Compiler/Build/PaginationGenerator.fs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa10bb37360844805a8cd8fddccd77da81705501ca138035c30fd4a53cb5872"}},{"ruleId":"D2","level":"warning","message":{"text":"PagePipeline.processHtmlFiles (cognitive 26): PagePipeline.processHtmlFiles has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 5 (7 pts), loops 2 (7 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 14). 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/Zest.Compiler/Build/PagePipeline.fs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b06eb97c53add2787b6dfa370d91842ef786c23dc31891aea2f323f6795b83a"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineStyle.criticalCss (cognitive 26): InlineStyle.criticalCss has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 14). 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/Zest.Markup/Css/InlineStyle.fs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad52518f619210e125757c5ef58577f9ff9d4a283672a21c6706ac91927d841"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutChain.applyLayoutsBatched (cognitive 25): LayoutChain.applyLayoutsBatched has cognitive complexity 25 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 5 (9 pts), match/switch 1 (5 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Build/LayoutChain.fs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78eb0dd79ea464ea3c5f9ae70e3130eb1935cdfc02172fb14a4677b0b90fdfc"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator.applyValueTest (cognitive 25): Evaluator.applyValueTest has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 11 (21 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 12). 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/Zest.Compiler/Zestucks/Evaluator.fs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"c383e251812740b3e1b77a3d1700549a9f848ecff2c66de944e4de537f14d85b"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionCompiler.splitTopLevelPipes (cognitive 25): ExpressionCompiler.splitTopLevelPipes has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zestucks/ExpressionCompiler.fs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3cb3c726637cac86007ab75d0dede26984b2936178972b15112209ad890bcdd"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontMatterParser.metaFromTomlTable (cognitive 24): FrontMatterParser.metaFromTomlTable has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 15 (20 pts), if/else 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 6). 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/Zest.Compiler/Build/FrontMatterParser.fs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab3206dae91adf6d17fcc0fa8326ed7c682dd7330742fd25a25b1a150fea73c"}},{"ruleId":"D2","level":"warning","message":{"text":"Values.parseYaml (cognitive 23): Values.parseYaml has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Markup/Primitives/Values.fs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0246bbd6f0c8cf0b3319e89359d0ec08b846ba6fe7e631c3c446e26d801e80"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator.checkBalanced (cognitive 22): Evaluator.checkBalanced has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zestucks/Evaluator.fs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"80115715fed054c9549ac6b6624c97a9f3451ac26ef1f075c0311ce24440d75f"}},{"ruleId":"D2","level":"warning","message":{"text":"IncrementalCache.loadDependencyFile (cognitive 21): IncrementalCache.loadDependencyFile has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Build/IncrementalCache.fs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"e810d06838623cbbddbb6ece496dc09f2c05b9b00129e0a5c03a4c3d346e596d"}},{"ruleId":"D2","level":"warning","message":{"text":"Zcss.processTextWithBaseDirUncached (cognitive 21): Zcss.processTextWithBaseDirUncached has cognitive complexity 21 (threshold 15). Drivers by points: loops 8 (9 pts), match/switch 4 (6 pts), if/else 4 (5 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zcss/Engine.fs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"443590b0b65a59eb41b50c8c31b9c98af6d93b2d947f226af2bc727f0ac41ee3"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutChain.nestedLayoutOf (cognitive 20): LayoutChain.nestedLayoutOf has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Build/LayoutChain.fs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cefedc4edd3338fd0de6c9c733356d20dc7ee7a42761b1017d07ab8742e2a46"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionCompiler.splitTopLevelArgs (cognitive 20): ExpressionCompiler.splitTopLevelArgs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zestucks/ExpressionCompiler.fs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e277207e4621b95bbd550d05b4d884ccfb2f696549894e912c3c8e2899ac1232"}},{"ruleId":"D2","level":"warning","message":{"text":"ColorPipeline.adjustHue (cognitive 20): ColorPipeline.adjustHue has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (19 pts), match/switch 1 (nesting depth added 4). 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/Zest.Compiler/Zcss/ColorPipeline.fs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"f899a0347842b4d0461a4455d4a005e583f92b490a508a8a9825e477aab9bc44"}},{"ruleId":"D2","level":"warning","message":{"text":"BuildAnimator.PrintSummary (cognitive 19): BuildAnimator.PrintSummary has cognitive complexity 19 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/BuildAnimator.cs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c7f8e10d9bfa6e198bfb54cbab61fdbcfe8afb5f34af8fc6d7004591676fe64"}},{"ruleId":"D2","level":"warning","message":{"text":"LocaleLoader.formatText (cognitive 19): LocaleLoader.formatText has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 1 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Build/LocaleLoader.fs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe9a068ace183063c5ba19749f9a6a60bb5842ac022d421f1c61131cace81e0"}},{"ruleId":"D2","level":"warning","message":{"text":"CssWriter.splitTopLevel (cognitive 19): CssWriter.splitTopLevel has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zcss/CssWriter.fs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d574eb66d06cd34ff693be130005a8464cb0249c3a701f1c1d4900366c04dbb"}},{"ruleId":"D2","level":"warning","message":{"text":"Modules.buildNamespacedVars (cognitive 19): Modules.buildNamespacedVars has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (11 pts), if/else 1 (4 pts), loops 2 (4 pts) (nesting depth added 12). 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/Zest.Compiler/Zcss/Modules.fs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"868b4b867cd6584e940efdf73e3deac89608a096c602c4f6df7f79fafff3997d"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator.resolvePipes (cognitive 19): Evaluator.resolvePipes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 1 (3 pts) (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/Zest.Compiler/Zcss/Evaluator.fs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9c02f1d668c702ddf149840d225d9c1725f8dceae16dc60bf38af012e11785"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreParser.resolvePipes (cognitive 19): CoreParser.resolvePipes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 1 (3 pts) (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/Zest.Compiler/Zcss/CoreParser.fs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d67afbb79e855fa551f83efd2ac1f0b50acfabc401ee62392605e0f9dca6226"}},{"ruleId":"D2","level":"warning","message":{"text":"Values.dedent (cognitive 19): Values.dedent has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Markup/Primitives/Values.fs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e7e2cf8308ab93193732ea1c72f8a22025d2bb9cd98f036b6156b471fa4060"}},{"ruleId":"D2","level":"warning","message":{"text":"LiveReloadHub.AcceptClients (cognitive 18): LiveReloadHub.AcceptClients has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/LiveReloadHub.cs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4fe06e56c74969d84aab9f8a8226e63e4d933fb39b8ac1dc8a560a165189ea"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutChain.loadLayouts (cognitive 18): LayoutChain.loadLayouts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Build/LayoutChain.fs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"420f45f988d34e0e4591960e954d762e0d70a841c9e574d488b24f074cc358ca"}},{"ruleId":"D2","level":"warning","message":{"text":"Scoper.splitSelectors (cognitive 18): Scoper.splitSelectors has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Markup/Css/Scoper.fs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a690b9b82fe704d9d021908d891234e66c71143d1e370041689d5881ef2a9fe0"}},{"ruleId":"D2","level":"warning","message":{"text":"Validator.checkDeclarationFormat (cognitive 18): Validator.checkDeclarationFormat has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Markup/Css/Validator.fs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"00aa0e28241e5dac5fc7a278ded60815d995e2d9c71539ae9ef922e91c5c9bef"}},{"ruleId":"D2","level":"warning","message":{"text":"CleanCommand.Execute (cognitive 17): CleanCommand.Execute has cognitive complexity 17 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Command/CleanCommand.cs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71fb289e3aefb165e3bc4fbff1ff43e9106a32c4af5a22931b681164f5c8d54"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalData.loadGlobalData (cognitive 17): GlobalData.loadGlobalData has cognitive complexity 17 (threshold 15). Drivers by points: error handling 2 (8 pts), loops 2 (6 pts), if/else 1 (2 pts), match/switch 1 (nesting depth added 11). 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/Zest.Compiler/Build/GlobalData.fs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"00044fb402e71c0837187283102e0e682e4bf60e596ec98fc1e3571a8768e831"}},{"ruleId":"D2","level":"warning","message":{"text":"IncrementalCache.reconcileTemplates (cognitive 17): IncrementalCache.reconcileTemplates has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (7 pts), if/else 4 (5 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Build/IncrementalCache.fs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a9388c037430c9dd38814c3e93a8b7f6346ccfc523e75a999bf68f5e68c7c3"}},{"ruleId":"D2","level":"warning","message":{"text":"IncrementalCache.loadPageCache (cognitive 17): IncrementalCache.loadPageCache has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 1 (5 pts), error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Build/IncrementalCache.fs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"edeb6a99aeecb3e3931d209c1b128e6486aa8118c878d1b69df5681389640928"}},{"ruleId":"D2","level":"warning","message":{"text":"PermalinkRouter.defaultRoute (cognitive 17): PermalinkRouter.defaultRoute has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Build/PermalinkRouter.fs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"82108e0c1f4a0120fafcac90bc49598c90c32577c9d5ddb4feccae511be4c5a2"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigLoader.ParseMenus (cognitive 16): ConfigLoader.ParseMenus has cognitive complexity 16 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Config/ConfigLoader.cs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"3958a4d87b0056c1cc04f41f778b554b11b84ef55d25f06764f329c8883b3b88"}},{"ruleId":"D2","level":"warning","message":{"text":"LogWriter.Log (cognitive 16): LogWriter.Log has cognitive complexity 16 (threshold 15). 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/Zest.App/Runtime/LogWriter.cs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"04bdd3315eff282652f8a441545e80f60da2804908802acac129e587485e0c63"}},{"ruleId":"D2","level":"warning","message":{"text":"IncrementalCache.saveCache (cognitive 16): IncrementalCache.saveCache has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Build/IncrementalCache.fs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5db3198c08e4552e050fd12ef3f32db7e72dfd18be26d8fbeadb8f2725b8fa1"}},{"ruleId":"D2","level":"warning","message":{"text":"PageStore.getCollectionsForZestucks (cognitive 16): PageStore.getCollectionsForZestucks has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 2 (4 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Execution/PageStore.fs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77ce200467cd91530d682f00f53de64244673ce174dec5df571e5ff991b00c1"}},{"ruleId":"D2","level":"warning","message":{"text":"CssWriter.expandMixin (cognitive 16): CssWriter.expandMixin has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 2 (4 pts), loops 2 (4 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/Zest.Compiler/Zcss/CssWriter.fs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ba17b18312481d50c095970d81cf86d4528d8d683d2e5d190ac03da5a5402b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: Dsl: TooManyFunctions \u2014 295 functions. The bar is 30 functions; this is 265 over it, 9.83\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/Zest.Markup/Dsl/Dsl.fs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"457676c374cd31b90f96d81f855378b4d0c8253fa0b1a1bc0f5afacd3e59d1e4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: Stylesheet: TooManyFunctions \u2014 187 functions. The bar is 30 functions; this is 157 over it, 6.23\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/Zest.Markup/Css/Stylesheet.fs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a91cbb34465e93a9de444950949a6a0740e364ab736ac4ccd4a4dac7d2edfe6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: Selectors: TooManyFunctions \u2014 129 functions. The bar is 30 functions; this is 99 over it, 4.30\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/Zest.Markup/Css/Stylesheet.fs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"26dff1b9b7b9f74b4c63bc9f4923e32adc48eced73735c6eadd278dff9f902c2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: Elements: TooManyFunctions \u2014 123 functions. The bar is 30 functions; this is 93 over it, 4.10\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Rendering/Elements.fs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b109097e030fb355da2e3756ae9dc432d095c47a9b8a9e4f08c332da79d441ab"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: Modifiers: TooManyFunctions \u2014 103 functions. The bar is 30 functions; this is 73 over it, 3.43\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/Zest.Compiler/Rendering/Modifiers.fs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11c16803a6be423674144f8b26f6ca0c841d1fb9b916eae5e8877035ea86719"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: DslSugar: TooManyFunctions \u2014 88 functions. The bar is 30 functions; this is 58 over it, 2.93\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/Zest.Markup/Dsl/DslSugar.fs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d9469b5fefcacabd54f3b93bf76d9543ff5df2bc10bb0ff8d53e5c0b71bf4d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: Attributes: TooManyFunctions \u2014 65 functions. The bar is 30 functions; this is 35 over it, 2.17\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/Zest.Compiler/Rendering/Attributes.fs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf63879bd972f11a69c592a5993ce94324042a5d8549ac63a87c6436384eadd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: Components: TooManyFunctions \u2014 62 functions. The bar is 30 functions; this is 32 over it, 2.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/Zest.Markup/Component/Components.fs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f222c205f4c246263d67a0b6e3d7d199d844a6ee4e31c1a5854ca150df4e5fbe"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: Components: TooManyFunctions \u2014 47 functions. The bar is 30 functions; this is 17 over it, 1.57\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/Zest.Compiler/Rendering/Components.fs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30ef7082100640333da0d362096cf003e36080631cfa3e574e7d4bd08640b71"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PageBuilder: TooManyMethods \u2014 47 methods. The bar is 30 methods; this is 17 over it, 1.57\u00D7 the bar. 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/Zest.Compiler/Rendering/PageBuilder.fs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f93e4bff9f7fc599b59e9216fe92c6adf796b7606b0b007624e221a07b96100"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Zestucks/Evaluator.fs: FileTooLong \u2014 618 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 118 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zestucks/Evaluator.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02be645e930111f8804a4917dbddc188ad0ab1d913437b17df82018631bc81f8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HttpServerBase: TooManyMethods \u2014 435 significant lines (blank, comment-only and punctuation-only lines excluded), 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. 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/Zest.App/Runtime/HttpServerBase.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23cebb347a9b13822a299bb5b1d58672394a71dc7956d13ac5f18f662aa7c36"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: Collections: TooManyFunctions \u2014 36 functions. The bar is 30 functions; this is 6 over it, 1.20\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/Zest.Markup/Query/Collections.fs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"5845d96b7203825186bb8b9696f96c6a306e34a646c2ab29d374a2e42adcdb1b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Rendering/Formatting.fs: FileTooLong \u2014 568 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 68 over it, 1.14\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/Zest.Compiler/Rendering/Formatting.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"816cccea88dd35f94ec01e15b65fd797a9792b382fecdd8597ca6000cca85769"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: Values: TooManyFunctions \u2014 33 functions. The bar is 30 functions; this is 3 over it, 1.10\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Markup/Primitives/Values.fs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"616082c82e84827915fe244ba1d4e6d44afa44447dbf42ee25cfda1e1954c166"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 2): src/Zest.App/Runtime/DevServer.cs:100-127 | src/Zest.App/Runtime/PreviewServer.cs:143-169 \u2014 before extracting anything, compare \u0060src/Zest.App/Runtime/DevServer.cs\u0060 and \u0060src/Zest.App/Runtime/PreviewServer.cs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Zest.App/Runtime/DevServer.cs:100\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/Zest.App/Runtime/DevServer.cs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"482de281979a35b86063d03cbe412812b6d45709f3735ad74e5dabfbf4cd07e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201326 lines \u00D7 2): src/Zest.Compiler/Execution/FsiRunner.fs:96-117 | src/Zest.Compiler/Execution/FsiRunner.fs:258-283 \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/Zest.Compiler/Execution/FsiRunner.fs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"af646b1cc1b6be3bf4d0149d3a5abdcefd9afc871581b85323841cd1a526d7a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): src/Zest.Compiler/Execution/PageEvaluator.fs:313-332 | src/Zest.Compiler/Execution/PageEvaluator.fs:349-369 \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/Zest.Compiler/Execution/PageEvaluator.fs:313\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/Zest.Compiler/Execution/PageEvaluator.fs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"561c9f03ba398799844c3c17dc4f4df6b323ff2356e7d5382ebdb5c05d744deb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201320 lines \u00D7 3): src/Zest.Markup/Css/Stylesheet.fs:567-577 | src/Zest.Markup/Css/Stylesheet.fs:592-611 | src/Zest.Markup/Css/Stylesheet.fs:663-677 \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. 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/Zest.Markup/Css/Stylesheet.fs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"36467f6f5d9e8dfc81115f0c2ff8c51e2684c71999100c2c2ac57df9b078cd88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/Zest.App/Cli/CliParser.cs:57-75 | src/Zest.App/Cli/CliParser.cs:104-122 \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/Zest.App/Cli/CliParser.cs:57\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Cli/CliParser.cs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"8575a61f6f8a4edf47c1e06d50051cbeb9141f06fd3078a4fae1127cda4453fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/Zest.App/Runtime/DevServer.cs:168-182 | src/Zest.App/Runtime/PreviewServer.cs:102-116 \u2014 before extracting anything, compare \u0060src/Zest.App/Runtime/DevServer.cs\u0060 and \u0060src/Zest.App/Runtime/PreviewServer.cs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/DevServer.cs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b86424ceb7e1896cd15eda3420fc23a4262291f1cb0452e3735233e47a645dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 4): src/Zest.App/Cli/CliParser.cs:20-31 | src/Zest.App/Cli/CliParser.cs:56-67 | src/Zest.App/Cli/CliParser.cs:103-114 | src/Zest.App/Cli/CliParser.cs:159-171 \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/Zest.App/Cli/CliParser.cs:20\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/Zest.App/Cli/CliParser.cs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"456c5c711fe368a33025cba02f5b7677dc68c3e6d1955e0ad1372daa872e3d0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Zest.Compiler/Execution/ZestucksFilters.fs:331-341 | src/Zest.Compiler/Execution/ZestucksFilters.fs:350-360 \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/Zest.Compiler/Execution/ZestucksFilters.fs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08360e3083ae393dad3baac663dd2cd856cb18c36e253e2cd2d29c9485b80fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Zest.Compiler/Zcss/BraceParser.fs:120-130 | src/Zest.Compiler/Zcss/IndentParser.fs:131-141 \u2014 before extracting anything, compare \u0060src/Zest.Compiler/Zcss/BraceParser.fs\u0060 and \u0060src/Zest.Compiler/Zcss/IndentParser.fs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zcss/BraceParser.fs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f192c58d46314ed0d7fcb88d7fe9fb2b55b8218cd7b768b448620285da63a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Zest.Compiler/Zcss/Engine.fs:84-94 | src/Zest.Compiler/Zcss/Engine.fs:153-163 \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/Zest.Compiler/Zcss/Engine.fs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"66db6330c256c6b332e494d47d99f8df6531f21912b38202eef08968a6ad2950"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Zest.Compiler/Zestucks/ExpressionCompiler.fs:53-61 | src/Zest.Compiler/Zestucks/ExpressionCompiler.fs:78-86 \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/Zest.Compiler/Zestucks/ExpressionCompiler.fs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d67c752fabbef74c389c150051a9181d9a00aa1832da3ea6fa0e3430d81559"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Zest.Compiler/Zestucks/ExpressionCompiler.fs:69-77 | src/Zest.Compiler/Zestucks/ExpressionCompiler.fs:99-108 \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/Zest.Compiler/Zestucks/ExpressionCompiler.fs:69\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/Zest.Compiler/Zestucks/ExpressionCompiler.fs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8868fdbd9a67e943c6d897169d4a207252f6168b6547a4722373ea21f58df25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Zest.Compiler/Zestucks/Renderer.fs:553-561 | src/Zest.Compiler/Zestucks/Renderer.fs:571-579 \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/Zest.Compiler/Zestucks/Renderer.fs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"a061b2db87a936a38511aaab4b7e4c90c77ab64149c43bc73bd81da275278c31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/Zest.Compiler/Build/PagePipeline.fs:254-260 | src/Zest.Compiler/Build/PagePipeline.fs:286-293 \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/Zest.Compiler/Build/PagePipeline.fs:254\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/Zest.Compiler/Build/PagePipeline.fs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69c1cf37929d68e65c5127cf524f7c1f6fda9aa2964645f6266c3e3d1bb2909"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Zest.Compiler/Execution/PageEvaluator.fs:165-172 | src/Zest.Compiler/Execution/PageEvaluator.fs:260-267 \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/Zest.Compiler/Execution/PageEvaluator.fs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b4bd0085b982a81d5a9bd725f8b0862cbc035b5dabe9e9b6e6676e5f8d7a95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Zest.Compiler/Execution/PageEvaluator.fs:172-179 | src/Zest.Compiler/Execution/PageEvaluator.fs:343-350 \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/Zest.Compiler/Execution/PageEvaluator.fs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f69250c8ee2eda020289dcce00dfaefcb27eccc15304fcf5414a443c5dad5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Zest.Compiler/Zcss/BraceParser.fs:111-118 | src/Zest.Compiler/Zcss/IndentParser.fs:122-129 \u2014 before extracting anything, compare \u0060src/Zest.Compiler/Zcss/BraceParser.fs\u0060 and \u0060src/Zest.Compiler/Zcss/IndentParser.fs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zcss/BraceParser.fs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f08ccbaf823fcf8992095327d134d95a281024d88aca8e332294a5a840551f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Zest.Compiler/Zcss/BraceParser.fs:144-151 | src/Zest.Compiler/Zcss/IndentParser.fs:161-168 \u2014 before extracting anything, compare \u0060src/Zest.Compiler/Zcss/BraceParser.fs\u0060 and \u0060src/Zest.Compiler/Zcss/IndentParser.fs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Zest.Compiler/Zcss/BraceParser.fs:144\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/Zest.Compiler/Zcss/BraceParser.fs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35739ad3c69da972641cf9e56af66ff5cc43f9120516a380567ede91eb9fc94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Zest.Compiler/Zcss/IndentParser.fs:317-324 | src/Zest.Compiler/Zcss/IndentParser.fs:337-344 \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/Zest.Compiler/Zcss/IndentParser.fs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0b6e0c1f7b5dde99b490b901bcd090f49d9750003fea99bf0462565ef12dcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Zest.Compiler/Zcss/BraceParser.fs:42-48 | src/Zest.Compiler/Zcss/IndentParser.fs:53-59 \u2014 before extracting anything, compare \u0060src/Zest.Compiler/Zcss/BraceParser.fs\u0060 and \u0060src/Zest.Compiler/Zcss/IndentParser.fs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zcss/BraceParser.fs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b696efbc1e1b755550f33406bf74a4eb200dd2bd22cf67e31210c7eb33909ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Zest.Compiler/Zcss/BraceParser.fs:103-109 | src/Zest.Compiler/Zcss/IndentParser.fs:114-120 \u2014 before extracting anything, compare \u0060src/Zest.Compiler/Zcss/BraceParser.fs\u0060 and \u0060src/Zest.Compiler/Zcss/IndentParser.fs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zcss/BraceParser.fs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"16193f7a29cedd0ce0e9b7a8fc19b9e8d33c53d61f7e360bfc5089d2ffed637a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Zest.Compiler/Rendering/Formatting.fs:283-289 | src/Zest.Compiler/Rendering/Formatting.fs:326-331 \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/Zest.Compiler/Rendering/Formatting.fs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c0c22b5d9f972e1dac16e409d023f58c143680117b3c3993775784a8e3019d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): src/Zest.Compiler/Zcss/BraceParser.fs:15-19 | src/Zest.Compiler/Zcss/IndentParser.fs:15-20 \u2014 before extracting anything, compare \u0060src/Zest.Compiler/Zcss/BraceParser.fs\u0060 and \u0060src/Zest.Compiler/Zcss/IndentParser.fs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zcss/BraceParser.fs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a2d149ff8ead72b313adc5d58fb90da6833b27d21f83d3e0cfdc60c2d9e9a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Zest.Compiler/Zcss/BraceParser.fs:89-94 | src/Zest.Compiler/Zcss/IndentParser.fs:100-105 \u2014 before extracting anything, compare \u0060src/Zest.Compiler/Zcss/BraceParser.fs\u0060 and \u0060src/Zest.Compiler/Zcss/IndentParser.fs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zcss/BraceParser.fs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b6276c493d4ab842f49e8578c6eb1d826aa2685fd8c496e37e5627be3c9afb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Zest.Compiler/Zcss/CssWriter.fs:552-557 | src/Zest.Compiler/Zcss/CssWriter.fs:573-578 \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/Zest.Compiler/Zcss/CssWriter.fs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42d30335a1fc1962d9b625714b60a8bd7909876ef3aa27618eaaa3f6bf6f245"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Zest.Compiler/Build/ArchiveSupport.fs:61-65 | src/Zest.Compiler/Execution/PageEvaluator.fs:59-63 \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/Zest.Compiler/Build/ArchiveSupport.fs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"014e1f317bccaadced02073e75298e4131952e1e1b925b0cfaaa8e498951aabe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Zest.Compiler/Build/FrontMatterParser.fs:69-73 | src/Zest.Compiler/Build/FrontMatterParser.fs:78-82 \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/Zest.Compiler/Build/FrontMatterParser.fs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82d9cf07f66ec7120de5a186fcecdc87b0d71efb4063075d5169cdb57f91302"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Zest.Compiler/Build/TaxonomyGenerator.fs:69-73 | src/Zest.Compiler/Execution/PageStore.fs:214-218 \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/Zest.Compiler/Build/TaxonomyGenerator.fs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeff9e313bcc5466571fa51c959701c19351767f76778012f8f4e962baca59af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Zest.Compiler/Zcss/BraceParser.fs:33-37 | src/Zest.Compiler/Zcss/IndentParser.fs:44-48 \u2014 before extracting anything, compare \u0060src/Zest.Compiler/Zcss/BraceParser.fs\u0060 and \u0060src/Zest.Compiler/Zcss/IndentParser.fs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zcss/BraceParser.fs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"199fe24fdd5eb6fd4250b2ef94cd133fede27647040d19c6ad0249251865773c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Zest.Compiler/Zcss/BraceParser.fs:186-190 | src/Zest.Compiler/Zcss/IndentParser.fs:210-214 \u2014 before extracting anything, compare \u0060src/Zest.Compiler/Zcss/BraceParser.fs\u0060 and \u0060src/Zest.Compiler/Zcss/IndentParser.fs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zcss/BraceParser.fs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4f6123b09e7283945badb57f281cc5d06c00aa39a5803616792243545ed6ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Zest.Compiler/Zcss/CssWriter.fs:490-494 | src/Zest.Compiler/Zcss/CssWriter.fs:566-570 \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/Zest.Compiler/Zcss/CssWriter.fs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea76215b018b1a1643034906392a96a9502ae341f7f2d3556e927989afc2291"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Zest.Compiler/Zcss/IndentParser.fs:142-146 | src/Zest.Compiler/Zcss/IndentParser.fs:170-174 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zcss/IndentParser.fs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cc04f7109de31edd3e90f2ca24945ed0bf92727afe807c73fb87aa233671ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Zest.Compiler/Zestucks/Evaluator.fs:616-620 | src/Zest.Compiler/Zestucks/Evaluator.fs:660-664 \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/Zest.Compiler/Zestucks/Evaluator.fs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6d630773930e0669deb6a64b25392be433f4c6fc44c72cf3f56c7006601e91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Zest.Markup/Query/Collections.fs:126-130 | src/Zest.Markup/Query/Collections.fs:339-343 \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/Zest.Markup/Query/Collections.fs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff7f5c9132604460d3a3649b0068ebe90550ceea3a83b5f998d6a68f32c8995"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Zest.App/Runtime/DevServer.cs:44-48 | src/Zest.App/Runtime/PreviewServer.cs:55-59 \u2014 before extracting anything, compare \u0060src/Zest.App/Runtime/DevServer.cs\u0060 and \u0060src/Zest.App/Runtime/PreviewServer.cs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/DevServer.cs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f481c4c4c04979c4abe3b5fe2850d93caf49a093d2bbd4cc4df721198737e85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): src/Zest.Compiler/Rendering/PageBuilder.fs:150-156 | src/Zest.Compiler/Rendering/PageBuilder.fs:158-164 | src/Zest.Compiler/Rendering/PageBuilder.fs:166-172 | src/Zest.Compiler/Rendering/PageBuilder.fs:174-187 \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/Zest.Compiler/Rendering/PageBuilder.fs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bcefc8ebe885437e59a11945e6dad550343920b87420af2238af2f1d5c6ee39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Zest.Compiler/Execution/FsiRunner.fs:384-389 | src/Zest.Compiler/Execution/FsiRunner.fs:519-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/Zest.Compiler/Execution/FsiRunner.fs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4a832a7987f90749259addbe14b47f9d510ff6b839033c269cedc3fb00ed9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Zest.Compiler/Zestucks/Tokenizer.fs:76-80 | src/Zest.Compiler/Zestucks/Tokenizer.fs:92-96 \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/Zest.Compiler/Zestucks/Tokenizer.fs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9c282ccc791d850967eacb3be766195dbc7d9b875695428a8b19184ce7505a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Zest.Compiler/Zcss/BuiltinFunctions.fs:85-89 | src/Zest.Compiler/Zcss/BuiltinFunctions.fs:93-97 \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/Zest.Compiler/Zcss/BuiltinFunctions.fs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"507aa98150103502caa13438d76b175fe5c206ad07102fa6a10a5243f269d193"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Zest.Compiler/Zcss/MathEvaluator.fs:57-65 | src/Zest.Compiler/Zcss/MathEvaluator.fs:71-79 \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/Zest.Compiler/Zcss/MathEvaluator.fs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"278ac6646df1c8acbe02b38e989ee8df13c63a1023b9de2e15ce6f8479ab28b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Zest.Compiler/Zestucks/BlockCollector.fs:78-82 | src/Zest.Compiler/Zestucks/Renderer.fs:408-412 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Zest.Compiler/Zestucks/BlockCollector.fs:78\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/Zest.Compiler/Zestucks/BlockCollector.fs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1e998dff83a4c4e90659d54104b3a188a345705e4c5a3a3eb631eb1f72b8c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/Zest.Compiler/Zestucks/Evaluator.fs:131-135 | src/Zest.Compiler/Zestucks/ExpressionCompiler.fs:32-36 | src/Zest.Compiler/Zestucks/ExpressionCompiler.fs:123-127 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zestucks/Evaluator.fs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85bb274417c527ed4c533077633bf21726bba2e523c96c09ae992a6e56bd5c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Zest.Compiler/Zestucks/Tokenizer.fs:82-86 | src/Zest.Compiler/Zestucks/Tokenizer.fs:98-102 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zestucks/Tokenizer.fs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a723a6f2fb302b18d1a37cfcc65ba679afda966f6c113c9260b4610f6c801eb"}},{"ruleId":"D8","level":"error","message":{"text":"No automated tests: No automated tests \u2014 no test code was found in this repository. Untested code is the largest single risk to changing it safely. Start with the code you change most often: add a suite in a framework a runner can collect (Expecto, or xUnit/NUnit through FsUnit or Unquote), and run it in CI so the gap cannot reopen."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3132564c6310e5d01a231f252a02d5d2f5a542c0a8fa29a14c89693f1e3df871"}},{"ruleId":"D9","level":"note","message":{"text":"No tests found: No test suite could be collected \u2014 no discoverable tests to count. If this repository does test, wiring the suite to a framework a runner can collect (Expecto, or xUnit/NUnit through FsUnit or Unquote) is what makes it countable here; a pipeline step that invokes a runner is not evidence on its own, because a runner over an empty suite passes. Tests written as plain executables or shell/PowerShell harnesses are not collectible this way and are not scored here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c9bf64cbb5a4ae13d6bcd01fa3bc8d2879d860c73bc67f176ee3c2cecb8adce3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Zest.Compiler/Build/BuildRunner.fs: src/Zest.Compiler/Build/BuildRunner.fs changed 29 times in last 90 days, max cyclomatic complexity 47 in BuildRunner.execute at line 38. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 18:25:27 \u002B08:00\u0027 --until=\u00272026-10-06 18:25:27 \u002B08:00\u0027 --full-history --no-merges -- src/Zest.Compiler/Build/BuildRunner.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Build/BuildRunner.fs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"8faadb70d6db38b5b3dd0a68c3a996f674929b852ff9a124ba09fd0ea210cb5d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Zest.Compiler/Zestucks/Evaluator.fs: src/Zest.Compiler/Zestucks/Evaluator.fs changed 6 times in last 90 days, max cyclomatic complexity 178 in Evaluator.applyFilter at line 277. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 18:25:27 \u002B08:00\u0027 --until=\u00272026-10-06 18:25:27 \u002B08:00\u0027 --full-history --no-merges -- src/Zest.Compiler/Zestucks/Evaluator.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zestucks/Evaluator.fs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1bc4194f0fb00bd642297bf0bf9815093751e19d5b5bc548ac87a5dc030038"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Zest.Compiler/Zestucks/Renderer.fs: src/Zest.Compiler/Zestucks/Renderer.fs changed 6 times in last 90 days, max cyclomatic complexity 165 in Renderer.renderRange at line 69. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 18:25:27 \u002B08:00\u0027 --until=\u00272026-10-06 18:25:27 \u002B08:00\u0027 --full-history --no-merges -- src/Zest.Compiler/Zestucks/Renderer.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zestucks/Renderer.fs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e09404f168d754e882f5a8cfe6fd492274b2e29bea9880ea153af8f3ad49ae8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Zest.Compiler/Zcss/CssWriter.fs: src/Zest.Compiler/Zcss/CssWriter.fs changed 12 times in last 90 days, max cyclomatic complexity 79 in CssWriter.compileCore at line 337. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 18:25:27 \u002B08:00\u0027 --until=\u00272026-10-06 18:25:27 \u002B08:00\u0027 --full-history --no-merges -- src/Zest.Compiler/Zcss/CssWriter.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zcss/CssWriter.fs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bfaf2d2baf1ebb0d3bdf80017c19ed88067468cd8ec33326d252edad1fab1ea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Zest.Compiler/Execution/ZestucksFilters.fs: src/Zest.Compiler/Execution/ZestucksFilters.fs changed 13 times in last 90 days, max cyclomatic complexity 71 in ZestucksFilters.registerAllFilters at line 102. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 18:25:27 \u002B08:00\u0027 --until=\u00272026-10-06 18:25:27 \u002B08:00\u0027 --full-history --no-merges -- src/Zest.Compiler/Execution/ZestucksFilters.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Execution/ZestucksFilters.fs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c7976dc45ff6cac56f5a940ea806963feba770bfc1bf5f7274033d56bd3e74"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Zest.Compiler/Zcss/IndentParser.fs: src/Zest.Compiler/Zcss/IndentParser.fs changed 8 times in last 90 days, max cyclomatic complexity 104 in IndentParser.parseIndentBlock at line 14. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 18:25:27 \u002B08:00\u0027 --until=\u00272026-10-06 18:25:27 \u002B08:00\u0027 --full-history --no-merges -- src/Zest.Compiler/Zcss/IndentParser.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zcss/IndentParser.fs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e12e7adeedb38d44a5d257ba23f984053236ffaf496c17084ba026898be409"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Zest.Compiler/Execution/FsiRunner.fs: src/Zest.Compiler/Execution/FsiRunner.fs changed 31 times in last 90 days, max cyclomatic complexity 26 in FsiRunner.isPageScript at line 221. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 18:25:27 \u002B08:00\u0027 --until=\u00272026-10-06 18:25:27 \u002B08:00\u0027 --full-history --no-merges -- src/Zest.Compiler/Execution/FsiRunner.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Execution/FsiRunner.fs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"d327cdd767ad94b05d4db00eb0a930f32bfc3657f7ef1706e507f148ee5768af"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Zest.Compiler/Build/PagePipeline.fs: src/Zest.Compiler/Build/PagePipeline.fs changed 20 times in last 90 days, max cyclomatic complexity 33 in PagePipeline.processContent at line 157. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 18:25:27 \u002B08:00\u0027 --until=\u00272026-10-06 18:25:27 \u002B08:00\u0027 --full-history --no-merges -- src/Zest.Compiler/Build/PagePipeline.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Build/PagePipeline.fs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9835a6f5defd047e12f401bc43f481b9844285a46c071effe4cf705c082450"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Zest.Compiler/Zcss/CoreParser.fs: src/Zest.Compiler/Zcss/CoreParser.fs changed 15 times in last 90 days, max cyclomatic complexity 27 in CoreParser.parseDecl at line 270. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 18:25:27 \u002B08:00\u0027 --until=\u00272026-10-06 18:25:27 \u002B08:00\u0027 --full-history --no-merges -- src/Zest.Compiler/Zcss/CoreParser.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zcss/CoreParser.fs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0af68f94d5e7dfc762ed7771a6ca79e24a0c46bf87f761068e62da4e8b58a3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Zest.Compiler/Zcss/BraceParser.fs: src/Zest.Compiler/Zcss/BraceParser.fs changed 6 times in last 90 days, max cyclomatic complexity 61 in BraceParser.parseBraceBlock at line 14. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 18:25:27 \u002B08:00\u0027 --until=\u00272026-10-06 18:25:27 \u002B08:00\u0027 --full-history --no-merges -- src/Zest.Compiler/Zcss/BraceParser.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zcss/BraceParser.fs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a7ad8109fd3d3b8cc9ba57620fcb38f0456207871fc9ff0881330c14251c69"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Zest.Compiler/Zcss/Evaluator.fs: src/Zest.Compiler/Zcss/Evaluator.fs changed 15 times in last 90 days, max cyclomatic complexity 23 in Evaluator.evalBool at line 203. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 18:25:27 \u002B08:00\u0027 --until=\u00272026-10-06 18:25:27 \u002B08:00\u0027 --full-history --no-merges -- src/Zest.Compiler/Zcss/Evaluator.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zcss/Evaluator.fs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"1240c4d51fcb16e71201442df9ac8a0ca0302627fe64ea60c63899cbc3e5dbba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Zest.Compiler/Build/FrontMatterParser.fs: src/Zest.Compiler/Build/FrontMatterParser.fs changed 13 times in last 90 days, max cyclomatic complexity 26 in FrontMatterParser.metaFromTomlTable at line 147. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 18:25:27 \u002B08:00\u0027 --until=\u00272026-10-06 18:25:27 \u002B08:00\u0027 --full-history --no-merges -- src/Zest.Compiler/Build/FrontMatterParser.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Build/FrontMatterParser.fs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"1162df8b0e92d9aedf7b336f983c7f3fd49af0daf67ce8a11c61c6f42d6043c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Zest.Compiler/Execution/PageEvaluator.fs: src/Zest.Compiler/Execution/PageEvaluator.fs changed 22 times in last 90 days, max cyclomatic complexity 15 in PageEvaluator.evaluateWithText at line 253. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 18:25:27 \u002B08:00\u0027 --until=\u00272026-10-06 18:25:27 \u002B08:00\u0027 --full-history --no-merges -- src/Zest.Compiler/Execution/PageEvaluator.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Execution/PageEvaluator.fs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb580b66b1c0ff4761cb4e13d3200498f574006deb9bbab34d8115a8f6f1c66b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Zest.Markup/Css/Stylesheet.fs: src/Zest.Markup/Css/Stylesheet.fs changed 8 times in last 90 days, max cyclomatic complexity 41 in Stylesheet.validateValue at line 104. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 18:25:27 \u002B08:00\u0027 --until=\u00272026-10-06 18:25:27 \u002B08:00\u0027 --full-history --no-merges -- src/Zest.Markup/Css/Stylesheet.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Markup/Css/Stylesheet.fs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"9557998cdac3fb810b587adc038049542546fc04f024b5d588d8c53b0ed82191"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Zest.Compiler/Zcss/Engine.fs: src/Zest.Compiler/Zcss/Engine.fs changed 10 times in last 90 days, max cyclomatic complexity 31 in Zcss.processTextWithBaseDirUncached at line 52. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 18:25:27 \u002B08:00\u0027 --until=\u00272026-10-06 18:25:27 \u002B08:00\u0027 --full-history --no-merges -- src/Zest.Compiler/Zcss/Engine.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zcss/Engine.fs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c4a09d7fadd43c33fea4a9ad4dbd572213f65182a619318df06fb8c7b2584b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Zest.Compiler/Build/IncrementalCache.fs: src/Zest.Compiler/Build/IncrementalCache.fs changed 12 times in last 90 days, max cyclomatic complexity 22 in IncrementalCache.loadCache at line 384. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 18:25:27 \u002B08:00\u0027 --until=\u00272026-10-06 18:25:27 \u002B08:00\u0027 --full-history --no-merges -- src/Zest.Compiler/Build/IncrementalCache.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Build/IncrementalCache.fs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"747992809b4045cd8ae41de79caf806929723d4797be516020ea62501aaaac58"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Zest.Compiler/Rendering/Formatting.fs: src/Zest.Compiler/Rendering/Formatting.fs changed 4 times in last 90 days, max cyclomatic complexity 65 in Formatting.format at line 235. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 18:25:27 \u002B08:00\u0027 --until=\u00272026-10-06 18:25:27 \u002B08:00\u0027 --full-history --no-merges -- src/Zest.Compiler/Rendering/Formatting.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Rendering/Formatting.fs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c06abf9341ddff21c4503f7075d6d21b34081798b77523c703d8d114e125ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Zest.Compiler/Zcss/MathEvaluator.fs: src/Zest.Compiler/Zcss/MathEvaluator.fs changed 6 times in last 90 days, max cyclomatic complexity 41 in MathEvaluator.tokenize at line 34. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 18:25:27 \u002B08:00\u0027 --until=\u00272026-10-06 18:25:27 \u002B08:00\u0027 --full-history --no-merges -- src/Zest.Compiler/Zcss/MathEvaluator.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zcss/MathEvaluator.fs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7062af59f2e58eeada4996e9dcf6b5b9006e863b0d320b1ded555ba499c37a94"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Zest.Compiler/Build/PaginationGenerator.fs: src/Zest.Compiler/Build/PaginationGenerator.fs changed 12 times in last 90 days, max cyclomatic complexity 17 in PaginationGenerator.generateCollection at line 155. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 18:25:27 \u002B08:00\u0027 --until=\u00272026-10-06 18:25:27 \u002B08:00\u0027 --full-history --no-merges -- src/Zest.Compiler/Build/PaginationGenerator.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Build/PaginationGenerator.fs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"d433b5e666b26532507add610c9d57bde24e2528b4b7d7106cf8e8c2e6a60eee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Zest.App/Runtime/HttpServerBase.cs: src/Zest.App/Runtime/HttpServerBase.cs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in HttpServerBase.HandleRequest at line 309. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 18:25:27 \u002B08:00\u0027 --until=\u00272026-10-06 18:25:27 \u002B08:00\u0027 --full-history --no-merges -- src/Zest.App/Runtime/HttpServerBase.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/HttpServerBase.cs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee55cbb9ff0a93af285cd83d66f1a53b44d245b40f455382c05b45e0b9cf331"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Zest.Compiler/Zcss/BuiltinFunctions.fs: src/Zest.Compiler/Zcss/BuiltinFunctions.fs changed 4 times in last 90 days, max cyclomatic complexity 49 in BuiltinFunctions.resolve at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 18:25:27 \u002B08:00\u0027 --until=\u00272026-10-06 18:25:27 \u002B08:00\u0027 --full-history --no-merges -- src/Zest.Compiler/Zcss/BuiltinFunctions.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zcss/BuiltinFunctions.fs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"198d9ef53846908a2e3476000b3abe5d6c95da403841baa0367926a6d089626c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Zest.Compiler/Zestucks/Tokenizer.fs: src/Zest.Compiler/Zestucks/Tokenizer.fs changed 4 times in last 90 days, max cyclomatic complexity 49 in Tokenizer.tokenize at line 22. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 18:25:27 \u002B08:00\u0027 --until=\u00272026-10-06 18:25:27 \u002B08:00\u0027 --full-history --no-merges -- src/Zest.Compiler/Zestucks/Tokenizer.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zestucks/Tokenizer.fs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a596fd49f90fc94005a4a47120d0a6e1624414d4d3ee99e4e518052a3a9119c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Zest.Compiler/Rendering/Markdown.fs: src/Zest.Compiler/Rendering/Markdown.fs changed 6 times in last 90 days, max cyclomatic complexity 31 in Markdown.toHtml at line 60. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 18:25:27 \u002B08:00\u0027 --until=\u00272026-10-06 18:25:27 \u002B08:00\u0027 --full-history --no-merges -- src/Zest.Compiler/Rendering/Markdown.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Rendering/Markdown.fs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23a5214b0e6f1f1b275be89d879c67a3f7da91d87e9d8c3e32c5aa578cf4355"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Zest.Compiler/Zestucks/ExpressionCompiler.fs: src/Zest.Compiler/Zestucks/ExpressionCompiler.fs changed 6 times in last 90 days, max cyclomatic complexity 31 in ExpressionCompiler.splitInlineIf at line 108. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 18:25:27 \u002B08:00\u0027 --until=\u00272026-10-06 18:25:27 \u002B08:00\u0027 --full-history --no-merges -- src/Zest.Compiler/Zestucks/ExpressionCompiler.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zestucks/ExpressionCompiler.fs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d91d381ce6038cbdee63126f5d1d5aead82617bb00591f9ce8aee78e0fb27f7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Zest.App/Runtime/LogWriter.cs: src/Zest.App/Runtime/LogWriter.cs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in LogWriter.Log at line 298. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 18:25:27 \u002B08:00\u0027 --until=\u00272026-10-06 18:25:27 \u002B08:00\u0027 --full-history --no-merges -- src/Zest.App/Runtime/LogWriter.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/LogWriter.cs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"3128373a019656a05782e01d27b6c3044545a970b616a2d76bae32fcb013e154"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Zest.Compiler/Build/AssetWriter.fs: src/Zest.Compiler/Build/AssetWriter.fs changed 8 times in last 90 days, max cyclomatic complexity 18 in AssetWriter.copyAssets at line 12. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 18:25:27 \u002B08:00\u0027 --until=\u00272026-10-06 18:25:27 \u002B08:00\u0027 --full-history --no-merges -- src/Zest.Compiler/Build/AssetWriter.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Build/AssetWriter.fs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"70bb03d932689caff539032f86287cc063dbca1e8a39bcf67be18f427aea89ea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Zest.Compiler/Execution/FsiSession.fs: src/Zest.Compiler/Execution/FsiSession.fs changed 7 times in last 90 days, max cyclomatic complexity 16 in FsiSession.tryRunScript at line 148. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 18:25:27 \u002B08:00\u0027 --until=\u00272026-10-06 18:25:27 \u002B08:00\u0027 --full-history --no-merges -- src/Zest.Compiler/Execution/FsiSession.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Execution/FsiSession.fs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"afffdce6e73042485724d71708db176c983c0bf40572795832569feaedb0d147"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Zest.App/Cli/CliParser.cs: src/Zest.App/Cli/CliParser.cs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in CliParser.ParsePreview at line 101. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 18:25:27 \u002B08:00\u0027 --until=\u00272026-10-06 18:25:27 \u002B08:00\u0027 --full-history --no-merges -- src/Zest.App/Cli/CliParser.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Cli/CliParser.cs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc51a582cf9ee1f1307ff9a81e7be798cc6763fa6ba7a395de54f6bf923f8672"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Zest.Markup/Css/Validator.fs: src/Zest.Markup/Css/Validator.fs changed 4 times in last 90 days, max cyclomatic complexity 15 in Validator.isColorProperty at line 180. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 18:25:27 \u002B08:00\u0027 --until=\u00272026-10-06 18:25:27 \u002B08:00\u0027 --full-history --no-merges -- src/Zest.Markup/Css/Validator.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Markup/Css/Validator.fs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"189f7ab532450e251314b59fd9db12584cbfdaca54a05391163f683f339d75b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Zest.Compiler/Zcss/Cache.fs: src/Zest.Compiler/Zcss/Cache.fs changed 3 times in last 90 days, max cyclomatic complexity 15 in Cache.load at line 163. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 18:25:27 \u002B08:00\u0027 --until=\u00272026-10-06 18:25:27 \u002B08:00\u0027 --full-history --no-merges -- src/Zest.Compiler/Zcss/Cache.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Compiler/Zcss/Cache.fs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b2253ea0e53053277a033e02b7c4df1cceec2bf32e5c4bc006e92541b38c3e"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or \u2014 where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/HttpServerBase.cs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5eecb5dd24d17681a8ef79cc1c5352e68db2b99691e4730814e02bb50f5954"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or \u2014 where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/HttpServerBase.cs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d9afc23b2bc050967929ef155141b70b1253142727e1c36c5752f8794b2d32e"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or \u2014 where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/HttpServerBase.cs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0f7a3dfa95a452452bed12a312274a5f4ab21e8362cb9f9819acb89a577061"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or \u2014 where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/HttpServerBase.cs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5a829ab373296fa0f68be80ee8bb2e44eb2425882bccce521fe01ed67cac3b"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or \u2014 where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/LiveReloadHub.cs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"07688e717e1f41c3d3dbf461ff1b93368b70d05b24f6dc0efcffa72c5febe8df"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or \u2014 where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/LiveReloadHub.cs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"e533a01ae5b7791880ba68af5fd4e5dacb516ef36d3c367dee12e509f4f774ab"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"D22","level":"warning","message":{"text":"Duplicate intent: Cache clearing is exposed on both the configuration loader and the build driver. It is unclear if these clear the same underlying cache or different ones. If they are the same, it should be centralized. If different, the naming should reflect the scope (e.g., ConfigCache vs BuildCache).: If they share a cache, expose a single \u0060CacheManager.Clear()\u0060 or ensure \u0060ConfigLoader\u0060 delegates to the driver/cache manager. If distinct, rename to \u0060ClearConfigCache\u0060 and \u0060ClearBuildCache\u0060. (signatures: void ConfigLoader.ClearCache() | void BuildDriver.ClearCache())"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"70747e9573fa3f4efc04d5844230dd5a3a2241301244042ea31f8a52e5136d8a"}},{"ruleId":"D22","level":"warning","message":{"text":"Inconsistent lifecycle management: \u0060BuildWatcher\u0060 has a \u0060StartWatcher\u0060 method but no explicit \u0060Stop\u0060 or \u0060Dispose\u0060 in the signature list, while \u0060ContentWatcher\u0060 has \u0060ResetCssOnlyFlag\u0060 and \u0060Dispose\u0060. This suggests inconsistent resource management patterns between watcher types.: Ensure all watcher types implement a consistent lifecycle interface (e.g., \u0060IDisposable\u0060 or explicit \u0060Start\u0060/\u0060Stop\u0060 methods). (signatures: void BuildWatcher.StartWatcher(SiteConfig config) | void ContentWatcher.ResetCssOnlyFlag())"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bba798bb8855736dd62295ab44c1a6b7263bbd41655362efc869721892b1cbab"}},{"ruleId":"D22","level":"warning","message":{"text":"Redundant configuration methods: \u0060SetVerbose\u0060 and \u0060SetQuiet\u0060 are likely subsets of \u0060Configure\u0060. Having both granular setters and a comprehensive configurator creates API surface bloat and potential state inconsistency if not handled carefully.: Remove \u0060SetVerbose\u0060 and \u0060SetQuiet\u0060 if \u0060Configure\u0060 is the primary entry point, or document them as convenience wrappers that are strictly equivalent to specific \u0060Configure\u0060 calls. (signatures: void LogWriter.SetVerbose(bool enabled) | void LogWriter.SetQuiet(bool enabled) | void LogWriter.Configure(string level, bool toFile, bool timestamps, bool verbose = false, bool quiet = false))"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cb80c101d77992e838e54fdfca4a3c974b405478befef140efaf34f316211830"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1a4cba461b2514b3e62ec5de57bb69080886fd613c18d48f725946482ed72dbb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"832519959d5fb5b6fa6aa6b1856b09c2c6462779723793b15015c8521ae77155"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"17cab627f00fa7f58bfa0437c27e8b7d1e1d2a4f567153e5d4d23eb1a8d24fc5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"95f7b6e20db576905502799f064b3d0622f0ef2e29dad853dfb575fcdf2f53ce"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d9cf6962dc297ec9ff1b24845eef7bdf1f43bdd75e0b1ab85ceb24263d4d5f1d"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e10dd1c37af22b497f72f89b2c46e91ef5c8fc9d8d3b51a11f187eb59b3d5d0b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"63971014418d75eef7a8e55f7f272933c4622a893210d5a7fcc7a42b6eb9ba96"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5e401afa6a447a35cf952f0428a4343546bec62dc313242530374f17bb002c85"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"15ad88b38fff2e6e26a2e5c51db46b5d95f5a0ab9ae8764a426454804472d49b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f2072197baebeed29f75b81493d93207cafebaa947ff28224c11397ab3cf460c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9dab14571f2b5a8f14efc3075a1a7094996ca2c12e168f7011aed240df20104e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2ca69c839a165a4e214869678bbf27dd51d5551b38d5c1cb78d29c86aadfe6ec"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-552","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","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":"3adeb5ca433f8377e0513466abe226661632e2c7a65ab03d48b79033987746ab"}},{"ruleId":"D31","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":"3b1568673c97a5ce9b1ec5a08dba083d705b7ca92047378b6f33333438b27491"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"759dca709f1a032fb6f624ce672e6afb5558fce53ecf01fb73618c4d33923164"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1ae293ce5d00c64f9fe36fad06531a59d9923eca1c6f5991b41ebe62d4e553d0"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"35f64a0396611dfd8e0191313b0d7cdc759890497b52affaaa727cf6ce876cfd"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"D39","level":"note","message":{"text":"IL efficiency: 26 authored method(s) exceed the IL budget: 26 of 3676 first-party methods compile to oversized IL bodies (\u003E 250 instructions); worst: Zest.Compiler.Zestucks.Renderer.renderRange, 3082 IL instructions; that pulled this dimension to 9.9/10. These bodies are far past the JIT\u0027s inline budget, so splitting them does not make them inlinable \u2014 what moves the number is emitting less: collapsing LINQ chains and closures on hot paths, and interpolation built eagerly where it is only sometimes used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2e0a38f673fc45b8a924e9d7e94f4ca1bdb747046d6078f7880260ab7000c81d"}},{"ruleId":"C2","level":"note","message":{"text":"No named authorization policies: Authorization IS enforced here (by imperative guard methods that throw on violation) \u2014 this is NOT a claim that the code is unprotected. What\u0027s missing is a NAMED rule set: the guards encode the access rules inline, so the rules can\u0027t be listed, reviewed or tested apart from the call sites that apply them. Recommendation, not a defect."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b048fdf3fa524ac68c7874fdfcdb4c49d5f010013f2cb22a0bd84cb12ceb951f"}},{"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":"M4","level":"note","message":{"text":"README/code drift: README advertises a RAG / ML engine, but no ML/RAG code or dependency exists \u2014 searched for: \u0060rag\u0060, \u0060langchain\u0060, \u0060llamaindex\u0060, \u0060pinecone\u0060, \u0060weaviate\u0060, \u0060qdrant\u0060, \u0060embeddings\u0060. Each was matched case- and separator-insensitively against file and directory NAMES anywhere in the tree, and against the CONTENTS of manifest files (package.json, *.csproj, *.props, *.slnx, *.yml, Dockerfile); the README\u0027s own prose never counts, so a claim is never refuted by merely being made. Nothing outside that search was read \u2014 a footprint living only in a submodule, in a file type not listed here, or under a name none of those terms matches is not seen, and this row is then wrong."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"343bbbd51ceb8de7a9ff88d79f7c797abf9b5921f8727b67b4d0f4f8a22c5e49"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"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: \u0060t.StartsWith(\u0022@\u0022) \u0026\u0026 rspBpMap.ContainsKey(t.TrimEnd(\u0027{\u0027, \u0027 \u0027).Trim().TrimStart(\u0027@\u0027))\u0060 appears character-identically in 2 files \u2014 src/Zest.Compiler/Zcss/BraceParser.fs, src/Zest.Compiler/Zcss/IndentParser.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/Zest.Compiler/Zcss/BraceParser.fs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"f751850a9192b3ab4590f9798d153f48bc60dbf79d946d83b3e8d783b4a0789b"}},{"ruleId":"X18","level":"warning","message":{"text":"Disposable created and abandoned in the method that made it: \u0060evt\u0060 is a \u0060ManualResetEventSlim\u0060, which implements \u0060IDisposable\u0060, and it is created here (line 133). Every use of it in \u0060WaitForShutdown\u0060 reads a member through it \u2014 it is never returned, never stored, never handed to anything else, and never disposed \u2014 so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with \u0060using\u0060 (\u0060using var evt = \u2026;\u0060), which releases it at the end of the scope on every path including a throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Command/ServeCommand.cs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ca586ea720b2e4c6b8b619d198c741bff9e1ab19d16f4776d6a592f6d559b4"}},{"ruleId":"X18","level":"warning","message":{"text":"Disposable created and abandoned in the method that made it: \u0060evt\u0060 is a \u0060ManualResetEventSlim\u0060, which implements \u0060IDisposable\u0060, and it is created here (line 84). Every use of it in \u0060StartWatcher\u0060 reads a member through it \u2014 it is never returned, never stored, never handed to anything else, and never disposed \u2014 so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with \u0060using\u0060 (\u0060using var evt = \u2026;\u0060), which releases it at the end of the scope on every path including a throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/BuildWatcher.cs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c6074ad493cc4211af3caa71d8a32d0fc482f5a4a0bd893e15218bf48e727a"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async methods take a CancellationToken: Only 5/20 async methods accept a CancellationToken, so in-flight work can\u0027t be stopped early when the caller gives up \u2014 whatever ends it in your host (shutdown signal, timeout, abandoned request, user cancel). Thread a token through the call chain and honour it at each await and loop; where a method genuinely cannot be interrupted, omitting it is a deliberate choice \u2014 judge against your hosting model."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bf623a92fb752b336427856888a9b386c434e686662a2cdc1bba21832c0a048c"}},{"ruleId":"X2","level":"warning","message":{"text":"Async method without CancellationToken: ServeZcssFile: No CancellationToken parameter \u2014 this work can\u0027t be stopped early once started."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/DevServer.cs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c6f4923f40c22233b12327047cd13ea4a01d6b18b055ffae3e35136bf7debb"}},{"ruleId":"X2","level":"warning","message":{"text":"Async method without CancellationToken: WriteNotFound: No CancellationToken parameter \u2014 this work can\u0027t be stopped early once started."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/ErrorPage.cs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc041417232f81952f11423c0a6994ac62c248b5ca30096eb456819d868af72"}},{"ruleId":"X2","level":"warning","message":{"text":"Async method without CancellationToken: WriteStringResponse: No CancellationToken parameter \u2014 this work can\u0027t be stopped early once started."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/HttpResponses.cs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"74eb45fe0560d7559a0e168b1740ddc8e13934ca35bb7c54d68aa6e69c1ea44d"}},{"ruleId":"X2","level":"warning","message":{"text":"Async method without CancellationToken: WriteFileResponseAsync: No CancellationToken parameter \u2014 this work can\u0027t be stopped early once started."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/HttpResponses.cs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d82c97ecf8f841ac7710e18370deacd4fcb81593c2629381255bd2bf2d61f20"}},{"ruleId":"X2","level":"warning","message":{"text":"Async method without CancellationToken: HandleStatusEndpoint: No CancellationToken parameter \u2014 this work can\u0027t be stopped early once started."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/HttpServerBase.cs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd8a07d758069f3f98ef59276f4508769550d51e2230340d70f6f06e61163bc"}},{"ruleId":"X2","level":"warning","message":{"text":"Async method without CancellationToken: HandleRequest: No CancellationToken parameter \u2014 this work can\u0027t be stopped early once started."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/HttpServerBase.cs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc477be5c7189a9501bf2a3ccddeece3ed8a515a42e5257e079c6f6f17ea98d"}},{"ruleId":"X2","level":"warning","message":{"text":"Async method without CancellationToken: ServeFile: No CancellationToken parameter \u2014 this work can\u0027t be stopped early once started."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/HttpServerBase.cs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e7c0cb5f6907d8421dc3e807675fd5df8b78c2451b6ad96ee8a3f2fbf916088"}},{"ruleId":"X2","level":"warning","message":{"text":"Async method without CancellationToken: ReadAllTextWithDeleteShareAsync: No CancellationToken parameter \u2014 this work can\u0027t be stopped early once started."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/HttpServerBase.cs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab5cc09da05a327b0337dd3809f350a96956cde8551272159c762fab440223f"}},{"ruleId":"X2","level":"warning","message":{"text":"Async method without CancellationToken: ReadAllBytesWithDeleteShareAsync: No CancellationToken parameter \u2014 this work can\u0027t be stopped early once started."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/HttpServerBase.cs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"05480fd131a401761712e97fdf36e3ef3c30f896730227f02b0323d8ad5d6efc"}},{"ruleId":"X2","level":"warning","message":{"text":"Async method without CancellationToken: WriteCompressedOrRaw: No CancellationToken parameter \u2014 this work can\u0027t be stopped early once started."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/HttpServerBase.cs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc77ef0089ce19f1bb1816abf8ea5bab9c4a9bada8f6887676ed1186278c2ad5"}},{"ruleId":"X2","level":"warning","message":{"text":"Async method without CancellationToken: WriteTextResponse: No CancellationToken parameter \u2014 this work can\u0027t be stopped early once started."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/HttpServerBase.cs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e6b11360392bc51601dd88781cac3deaf53cbcd5ad44370ed7f70460192621"}},{"ruleId":"X2","level":"warning","message":{"text":"Async method without CancellationToken: WriteHtmlResponse: No CancellationToken parameter \u2014 this work can\u0027t be stopped early once started."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/HttpServerBase.cs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d592cd1bdd5f35fa221a790a401ce903a97da3b8aa5af35c02e3f402708bc9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/HttpServerBase.cs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"9586d9524205b92a1ad2e752321db34414c47e246da8d593197fb3cf2cb3aa62"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/HttpServerBase.cs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"401913c691c44c48a98d125d2bcf4970c768fb3604bce8c7ec696bf5c117370b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/HttpServerBase.cs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"746e5e82dcd9e26e677ad719abf4bdbef93fb66d21f16fdbfa38e121dfaaa903"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/HttpServerBase.cs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6a6f282a819bf797217df48cf238207b96aafcdae07fc997379241e1e67a21"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/HttpServerBase.cs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccbb0edeadac0bd44e68a54f176d1fb4f3d9d9e8bf0c88eaf5349ca74f4ee160"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/LiveReloadHub.cs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8084a4018a4201e5eb67b1e573f358a597b960b067970529ffef0efc9d6c4b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/LiveReloadHub.cs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdbe242867a1ac82fe6f616a449e335e92834dafa9ba113c3fba92a6ab93d45e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.App/Runtime/LiveReloadHub.cs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f3a3286b63a3da6d39fb24964f78dc39b7064db5aee92ed3777ba058f29ce5"}},{"ruleId":"X5","level":"note","message":{"text":"Null-forgiving operator (\u0060!\u0060) suppressions reduce the NRT score: ~0.6 \u0060!\u0060 suppressions per 1k syntax nodes \u2014 14 suppression(s) across the 23477 syntax node(s) in code where nullable warnings are ENABLED, which is the only code a \u0060!\u0060 can suppress anything in (a \u0060!\u0060 under \u0060#nullable disable\u0060 is inert and is not counted, and its file\u0027s nodes are not in the denominator). Each one tells the compiler to trust you about null, suppressing the very safety NRTs provide."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"93cfe05d4ad8c8c171267603b23dfe289b74842e38edd1b7bfed59cc32bda337"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060lower.EndsWith(\u0022rem\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060lower.EndsWith(\u0022rem\u0022)\u0060 also satisfies \u0060lower.EndsWith(\u0022em\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Markup/Css/Stylesheet.fs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"60dc44b257d15775c5ef8f8e1474ee4938141b13f6e62ecbaecda86845700b92"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060lower.EndsWith(\u0022vmin\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060lower.EndsWith(\u0022vmin\u0022)\u0060 also satisfies \u0060lower.EndsWith(\u0022in\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Zest.Markup/Css/Stylesheet.fs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"de63c5739f0ee3cb6afbabe718fcb420cc312f0115ee1bfb1ef3c6f0c1aa79b9"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-552","guid":"3492436b-eca2-9c54-9ba3-5dade427c903","name":"Files or Directories Accessible to External Parties","shortDescription":{"text":"Files or Directories Accessible to External Parties"},"helpUri":"https://cwe.mitre.org/data/definitions/552.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"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-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.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":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"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":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"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/"}]},{"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"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"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":22,"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."]}]}