{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"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":"InstructionModule.tryReadFrom (cyclomatic 641): InstructionModule.tryReadFrom has cyclomatic complexity 641 (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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/Libs/FShade.SpirV/Core/SpirVInstructions.fs holds 2 of the 64 methods over the threshold \u2014 including the worst \u2014 and 958 of the 2471 points over it (39%), 2.7\u00D7 the next-largest file (src/Libs/FShade.Core/Optimizer.fs at 361). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.SpirV/Core/SpirVInstructions.fs"},"region":{"startLine":3518}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56b2d4a25a385b4cfd366dc95aff18c87815b4402237915c071a69eb6f5cf0b"}},{"ruleId":"D1","level":"warning","message":{"text":"InstructionModule.writeTo (cyclomatic 347): InstructionModule.writeTo has cyclomatic complexity 347 (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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/Libs/FShade.SpirV/Core/SpirVInstructions.fs holds 2 of the 64 methods over the threshold \u2014 including the worst \u2014 and 958 of the 2471 points over it (39%), 2.7\u00D7 the next-largest file (src/Libs/FShade.Core/Optimizer.fs at 361). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.SpirV/Core/SpirVInstructions.fs"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"08dce31e2f340ca3c3a122e5c9a341e04f1d81fc149f549ca3cec003c653e60d"}},{"ruleId":"D1","level":"warning","message":{"text":"HelpersModule.tryGetBuiltInMethod (cyclomatic 148): HelpersModule.tryGetBuiltInMethod has cyclomatic complexity 148 (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/Libs/FShade.Imperative/Compiler.fs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a807e311539974bc59621a161d469476323116408308c095424422df283741"}},{"ruleId":"D1","level":"warning","message":{"text":"Preprocessor.preprocessNormalS (cyclomatic 126): Preprocessor.preprocessNormalS has cyclomatic complexity 126 (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/Libs/FShade.Core/Shader.fs"},"region":{"startLine":1865}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e5437f2f78fe600e93b333d98217de20c174a35d8f1058ccc32e54785ab6cc"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstantFolding.evaluateConstantsS (cyclomatic 123): ConstantFolding.evaluateConstantsS has cyclomatic complexity 123 (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/Libs/FShade.Core/Optimizer.fs"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cef1630e4cde9180dea37a4b15d428dede54662ae58bd511a53cd44736e4070"}},{"ruleId":"D1","level":"warning","message":{"text":"Assembler.assembleExpr (cyclomatic 109): Assembler.assembleExpr has cyclomatic complexity 109 (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/Libs/FShade.SpirV/Assembler.fs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0bb02ed31d85003090ed33bc371f680221073464bfb4c0260a39797e4b6aa79"}},{"ruleId":"D1","level":"warning","message":{"text":"Assembler.assembleExprS (cyclomatic 95): Assembler.assembleExprS has cyclomatic complexity 95 (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/Libs/FShade.GLSL/Assembler.fs"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"859a744d418022c9bec6fa9465c9063683306fb0125244cad4fad412c721ccd5"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr.serializeInternal (cyclomatic 88): Expr.serializeInternal has cyclomatic complexity 88 (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/Libs/FShade.Core/Serializer.fs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd02c3cb2a69d987b2ae45de2da831a6c3a581caa85d1683dc295b31e9145b6"}},{"ruleId":"D1","level":"warning","message":{"text":"DeadCodeElimination.eliminateDeadCodeS (cyclomatic 82): DeadCodeElimination.eliminateDeadCodeS has cyclomatic complexity 82 (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/Libs/FShade.Core/Optimizer.fs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ae7aabf22adf00de767fef052dd5908a970bc875b9ad5190158f24687fe947"}},{"ruleId":"D1","level":"warning","message":{"text":"Inlining.inlineS (cyclomatic 78): Inlining.inlineS has cyclomatic complexity 78 (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/Libs/FShade.Core/Optimizer.fs"},"region":{"startLine":2728}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc473a8b68f5f893ed3721514d54745bc7402aa4962d5de90cc1c6ebc425ae6d"}},{"ruleId":"D1","level":"warning","message":{"text":"CompilerModule.toCExprS (cyclomatic 74): CompilerModule.toCExprS has cyclomatic complexity 74 (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/Libs/FShade.Imperative/Compiler.fs"},"region":{"startLine":1436}}}],"partialFingerprints":{"codehealthFindingId/v1":"f617a6d2fa56734cd8975fa20dd8b7034790f35759b362084d68e35bedc4d328"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr.deserializeInternal (cyclomatic 64): Expr.deserializeInternal has cyclomatic complexity 64 (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/Libs/FShade.Core/Serializer.fs"},"region":{"startLine":1330}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d021a41ec64e1cf44cf8c0fea1fd912f749411dff96cf3ceaa2e942738b98d4"}},{"ruleId":"D1","level":"warning","message":{"text":"CompilerModule.toCStatementS (cyclomatic 63): CompilerModule.toCStatementS has cyclomatic complexity 63 (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/Libs/FShade.Imperative/Compiler.fs"},"region":{"startLine":1837}}}],"partialFingerprints":{"codehealthFindingId/v1":"59031ab42d4a3a8f8f287c016dca46234cb4023615c21855b09ca2d736ffd1aa"}},{"ruleId":"D1","level":"warning","message":{"text":"Value.serialize (cyclomatic 60): Value.serialize has cyclomatic complexity 60 (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/Libs/FShade.Core/Serializer.fs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd292eecb7ef86d4ab96ff7b0a662e4f84798344665bd86dc306e5b8b478c59"}},{"ruleId":"D1","level":"warning","message":{"text":"IntrinsicFunctions.|TextureLookup|_| (cyclomatic 60): IntrinsicFunctions.|TextureLookup|_| has cyclomatic complexity 60 (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/Libs/FShade.GLSL/IntrinsicFunctions.fs"},"region":{"startLine":2170}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9a024ba236e83a0d68a8e60d60f09b187189d401d04ad6960676bfde463fa0"}},{"ruleId":"D1","level":"warning","message":{"text":"Preprocessor.preprocessRaytracingS (cyclomatic 51): Preprocessor.preprocessRaytracingS has cyclomatic complexity 51 (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/Libs/FShade.Core/Shader.fs"},"region":{"startLine":1512}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5cacb65694b8b0e30a014d953e088b1e960b98bd598a91b1aa9f7db94478acb"}},{"ruleId":"D1","level":"warning","message":{"text":"InputLifting.liftInputsS (cyclomatic 50): InputLifting.liftInputsS has cyclomatic complexity 50 (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/Libs/FShade.Core/Optimizer.fs"},"region":{"startLine":2171}}}],"partialFingerprints":{"codehealthFindingId/v1":"a352da087eb3f08a83bef54e450b876b25e0127d123fbb9ea627323df526d625"}},{"ruleId":"D1","level":"warning","message":{"text":"DeadCodeElimination.withoutValueS (cyclomatic 49): DeadCodeElimination.withoutValueS has cyclomatic complexity 49 (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/Libs/FShade.Core/Optimizer.fs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f019120385399fde4edef31d3b2f999d9f5ce7aaa458ff0d1714ab96b7e4ba"}},{"ruleId":"D1","level":"warning","message":{"text":"PrettyPrinter.print (cyclomatic 48): PrettyPrinter.print has cyclomatic complexity 48 (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/Libs/FShade.Core/Optimizer.fs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca99a4fd2208e0e65a6fc094dbcea94b5744d2af0a215426c0f8ffb99958b0c"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprExtensions.Expr.TryEval.Static (cyclomatic 38): ExprExtensions.Expr.TryEval.Static has cyclomatic complexity 38 (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/Libs/FShade.Imperative/Utilities.fs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fbe2f45ed840241876ccdf18d7738519cc527403213dc960004daff4b56bf0"}},{"ruleId":"D1","level":"warning","message":{"text":"Shader.serializeInternal (cyclomatic 37): Shader.serializeInternal has cyclomatic complexity 37 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Serializer.fs"},"region":{"startLine":1961}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed1a3cd14d152c7e7c97bee6518b1c90af031da1876ab48ce9d4ca7559a8195"}},{"ruleId":"D1","level":"warning","message":{"text":"Assembler.assembleEntryS (cyclomatic 37): Assembler.assembleEntryS has cyclomatic complexity 37 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: CExpr.splitTexturesAndSamplers (cyclomatic 64) 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/Libs/FShade.GLSL/Assembler.fs"},"region":{"startLine":2596}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c13a1deeba25aab8c5864fdd479a96b07b38c2ba809640cfbfeb9854a9967a"}},{"ruleId":"D1","level":"warning","message":{"text":"Assembler.assembleEntryParameterS (cyclomatic 36): Assembler.assembleEntryParameterS has cyclomatic complexity 36 (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. This is NOT this file\u0027s highest cyclomatic complexity: CExpr.splitTexturesAndSamplers (cyclomatic 64) 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/Libs/FShade.GLSL/Assembler.fs"},"region":{"startLine":2475}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a1e4df22feeb01180da320ae1560e5ddcfb292f6fdd17ced76fa7193f65f13"}},{"ruleId":"D1","level":"warning","message":{"text":"GLSLShaderInterfaceModule.serializeInternal (cyclomatic 36): GLSLShaderInterfaceModule.serializeInternal has cyclomatic complexity 36 (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/Libs/FShade.GLSL/UniformBufferLayout.fs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9efe724fc5b5269b31417cff8452307f34626fdd35015162472cc2fddc5fbb3"}},{"ruleId":"D1","level":"warning","message":{"text":"Value.deserialize (cyclomatic 35): Value.deserialize 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/Libs/FShade.Core/Serializer.fs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f4efc8f125e6416b52dee9f9f19777b5a31e5adee6bf030f25e1f734a831fa"}},{"ruleId":"D1","level":"warning","message":{"text":"TextureFunctions.|TextureLookup|_| (cyclomatic 35): TextureFunctions.|TextureLookup|_| 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/Libs/FShade.SpirV/Assembler.fs"},"region":{"startLine":1677}}}],"partialFingerprints":{"codehealthFindingId/v1":"9446dc92dca271b8700b53338e080ea6bf0a7cab260e600610651a63ca798d43"}},{"ruleId":"D1","level":"warning","message":{"text":"Assembler.assembleStatementS (cyclomatic 33): Assembler.assembleStatementS has cyclomatic complexity 33 (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. This is NOT this file\u0027s highest cyclomatic complexity: CExpr.splitTexturesAndSamplers (cyclomatic 64) 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/Libs/FShade.GLSL/Assembler.fs"},"region":{"startLine":2010}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eaba5a62bf8276a0f8b802683f1155cb57316bd4b7aad8f43d33c818b6a5bfb"}},{"ruleId":"D1","level":"warning","message":{"text":"BasicQuotationPatterns.|Uniform|_| (cyclomatic 32): BasicQuotationPatterns.|Uniform|_| has cyclomatic complexity 32 (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/Libs/FShade.Core/Reflection.fs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1c602af1250080324a3a6523af38b01285216dd9575799b5773c6ca5fc45d9"}},{"ruleId":"D1","level":"warning","message":{"text":"GLSLProgramInterfaceModule.serializeInternal (cyclomatic 31): GLSLProgramInterfaceModule.serializeInternal has cyclomatic complexity 31 (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/Libs/FShade.GLSL/UniformBufferLayout.fs"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"91cdc7a41da2c42d2e544299c8df7059743bda602643d092084fb88f949c931d"}},{"ruleId":"D1","level":"warning","message":{"text":"ShaderModule.withOutputs (cyclomatic 29): ShaderModule.withOutputs 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/Libs/FShade.Core/Shader.fs"},"region":{"startLine":4121}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d735812cbc284cd38538b82197764257640b94573eaf1443db7508c168397c5"}},{"ruleId":"D1","level":"warning","message":{"text":"CExprModule.visit (cyclomatic 29): CExprModule.visit has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Imperative/Ast.fs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d511705ff51fd42216fb2b0d420aeb52a40d49958a30d2615fa5f3beeba0c85"}},{"ruleId":"D1","level":"warning","message":{"text":"Composition.gsgs (cyclomatic 27): Composition.gsgs has cyclomatic complexity 27 (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/Libs/FShade.Core/Shader.fs"},"region":{"startLine":4956}}}],"partialFingerprints":{"codehealthFindingId/v1":"260d19b128fed6adc4f5217075e37ffa106c2bf2ce724de633c3943f999f1ca1"}},{"ruleId":"D1","level":"warning","message":{"text":"Assembler.assembleLiteralS (cyclomatic 27): Assembler.assembleLiteralS has cyclomatic complexity 27 (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. This is NOT this file\u0027s highest cyclomatic complexity: CExpr.splitTexturesAndSamplers (cyclomatic 64) 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/Libs/FShade.GLSL/Assembler.fs"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db677fba4ccc4b9ed342febac054722931ad08f81cce47635d4a345e0e75685"}},{"ruleId":"D1","level":"warning","message":{"text":"Assembler.assembleUniformsS (cyclomatic 27): Assembler.assembleUniformsS has cyclomatic complexity 27 (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. This is NOT this file\u0027s highest cyclomatic complexity: CExpr.splitTexturesAndSamplers (cyclomatic 64) 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/Libs/FShade.GLSL/Assembler.fs"},"region":{"startLine":2202}}}],"partialFingerprints":{"codehealthFindingId/v1":"34cbdd4363fabf4d34cb877bd2aa6e82a8b714fcc1d15f7740407a543bbfe726"}},{"ruleId":"D1","level":"warning","message":{"text":"Helpers.flatten (cyclomatic 26): Helpers.flatten has cyclomatic complexity 26 (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/Libs/FShade.Imperative/ModuleCompiler.fs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7e05f0701fa1689645b289fce62e80be5ee16399966b23aac220fbe1a71579"}},{"ruleId":"D1","level":"warning","message":{"text":"Assembler.assembleStatement (cyclomatic 25): Assembler.assembleStatement has cyclomatic complexity 25 (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/Libs/FShade.SpirV/Assembler.fs"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e52e085f51f10f1a293522dd6baec8030a77f8efd63ccb2aac395c24f8c4a0"}},{"ruleId":"D1","level":"warning","message":{"text":"Type.serializeInternal (cyclomatic 24): Type.serializeInternal has cyclomatic complexity 24 (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/Libs/FShade.Core/Serializer.fs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9393025836ec91f264884b86e01686f603717f4e640bbd241a9c8fd8e1605c"}},{"ruleId":"D1","level":"warning","message":{"text":"Assembler.assembleTypeS (cyclomatic 24): Assembler.assembleTypeS has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: CExpr.splitTexturesAndSamplers (cyclomatic 64) 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/Libs/FShade.GLSL/Assembler.fs"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"172f4f664a7ae4b9de4fbc1ccb3960b8b4988e936954fbe0b0fbaf9fa06d7124"}},{"ruleId":"D1","level":"warning","message":{"text":"SamplerState.serialize (cyclomatic 23): SamplerState.serialize has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Serializer.fs"},"region":{"startLine":1788}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a9d71d8aa130a8c391d15143674f4d8497a438d108a0b8b6094ad7772e54b8"}},{"ruleId":"D1","level":"warning","message":{"text":"Backend.TryGetIntrinsicType (cyclomatic 23): Backend.TryGetIntrinsicType has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: CExpr.splitTexturesAndSamplers (cyclomatic 64) 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/Libs/FShade.GLSL/Assembler.fs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd902b8a40d9d2fad35d0fe19a4865f628fafad6dd62c164a18628390b134b6b"}},{"ruleId":"D1","level":"warning","message":{"text":"SamplerState.serialize (cyclomatic 23): SamplerState.serialize has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: GLSLType.toString (cyclomatic 28) 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/Libs/FShade.GLSL/UniformBufferLayout.fs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f45474cf0ccebe8620cf38d540d64517c24dad418d1482754508506f283272"}},{"ruleId":"D1","level":"warning","message":{"text":"ComputeShaderModule.ofExprInternal (cyclomatic 22): ComputeShaderModule.ofExprInternal has cyclomatic complexity 22 (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/Libs/FShade.Core/ComputeShader.fs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f24758f47caa6624a2d5dd5ffe42652f7f7691e388848ef5e652d79a91ccaf"}},{"ruleId":"D1","level":"warning","message":{"text":"StatementHoisting.processStatement (cyclomatic 22): StatementHoisting.processStatement has cyclomatic complexity 22 (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. This is NOT this file\u0027s highest cyclomatic complexity: StatementHoisting.processExpression (cyclomatic 37) 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/Libs/FShade.Core/Optimizer.fs"},"region":{"startLine":3271}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9096861f744012be3d314da74e6085afc1a2d4f7c55e591ce1167dec6303e9b"}},{"ruleId":"D1","level":"warning","message":{"text":"CSE.findIndexedCommonSubExpressions (cyclomatic 22): CSE.findIndexedCommonSubExpressions has cyclomatic complexity 22 (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. This is NOT this file\u0027s highest cyclomatic complexity: StatementHoisting.processExpression (cyclomatic 37) 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/Libs/FShade.Core/Optimizer.fs"},"region":{"startLine":3434}}}],"partialFingerprints":{"codehealthFindingId/v1":"b018ab2ae488837498bbd61d795c73730a288de880e2c865f65d216d24918305"}},{"ruleId":"D1","level":"warning","message":{"text":"Inlining.isMutated (cyclomatic 21): Inlining.isMutated has cyclomatic complexity 21 (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. This is NOT this file\u0027s highest cyclomatic complexity: StatementHoisting.processExpression (cyclomatic 37) 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/Libs/FShade.Core/Optimizer.fs"},"region":{"startLine":2623}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac6a6100c4e543aba9997c997e54556449e48ccdccc759715a1333377a65b2f"}},{"ruleId":"D1","level":"warning","message":{"text":"GLSLProgramInterface.GetUniformStages (cyclomatic 21): GLSLProgramInterface.GetUniformStages has cyclomatic complexity 21 (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. This is NOT this file\u0027s highest cyclomatic complexity: GLSLType.toString (cyclomatic 28) 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/Libs/FShade.GLSL/UniformBufferLayout.fs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c278a0d07e21dc88ee3806f8fd069610cf1259a8505b9e0a1d5fa49148f687"}},{"ruleId":"D1","level":"warning","message":{"text":"ShaderDebugger.attach (cyclomatic 20): ShaderDebugger.attach has cyclomatic complexity 20 (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/Libs/FShade.Debug/Debugger.fs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a7987f491e1360ab57685b6a9c9cfd76310fbcebd3320f9df2417f2e631bd6"}},{"ruleId":"D1","level":"warning","message":{"text":"Preprocessor.computeStorageAccessS (cyclomatic 18): Preprocessor.computeStorageAccessS has cyclomatic complexity 18 (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/Libs/FShade.Core/Shader.fs"},"region":{"startLine":2641}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e841ca2661fc02e09c67815f098b7e7a344c1fbb5eee0338a4ce7f3aa5454f"}},{"ruleId":"D1","level":"warning","message":{"text":"GeometryInfo.tryGetUpperBound (cyclomatic 18): GeometryInfo.tryGetUpperBound 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. This shape REPEATS in the file: one other method here (GeometryInfo.tryGetLowerBound) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Shader.fs"},"region":{"startLine":3000}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3a9809775dc7f78e3a93f77618e8a990748d09c4a0f35d1e8daf6ca2edd776"}},{"ruleId":"D1","level":"warning","message":{"text":"GeometryInfo.tryGetLowerBound (cyclomatic 18): GeometryInfo.tryGetLowerBound 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. This shape REPEATS in the file: one other method here (GeometryInfo.tryGetUpperBound) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Shader.fs"},"region":{"startLine":3045}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4c1f67fc2df00dc0ba5e62f8d14479000a3ed1171e732d9f5df67e15f1a8f5"}},{"ruleId":"D1","level":"warning","message":{"text":"Composition.vsgs (cyclomatic 18): Composition.vsgs 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/Libs/FShade.Core/Shader.fs"},"region":{"startLine":5115}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ecb474c6fb687fbaa8b26188e2019cb7fa393fbb544f0bda7a52479b0417213"}},{"ruleId":"D1","level":"warning","message":{"text":"EffectModule.tryReplaceGeometry (cyclomatic 17): EffectModule.tryReplaceGeometry 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/Libs/FShade.Core/Effect.fs"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"7347e84d2c271652b239718981e054c3579238de64f1260f6e9d4ce7d78213fc"}},{"ruleId":"D1","level":"warning","message":{"text":"Shader.deserializeInternal (cyclomatic 17): Shader.deserializeInternal 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/Libs/FShade.Core/Serializer.fs"},"region":{"startLine":2086}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f33196f169d0d1e606eaf2cdb91e16dc0947b38e1dfaf7ed337b96f6e7a1bf"}},{"ruleId":"D1","level":"warning","message":{"text":"Preprocessor.preprocessComputeS (cyclomatic 17): Preprocessor.preprocessComputeS 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/Libs/FShade.Core/Shader.fs"},"region":{"startLine":1782}}}],"partialFingerprints":{"codehealthFindingId/v1":"2940d8556c272f55d32509ba82dfd0f4fc48bdc9b6b4213fda8f3d9b84aef5d9"}},{"ruleId":"D1","level":"warning","message":{"text":"GeometryInfo.geometryStats (cyclomatic 17): GeometryInfo.geometryStats 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/Libs/FShade.Core/Shader.fs"},"region":{"startLine":3091}}}],"partialFingerprints":{"codehealthFindingId/v1":"911561f9318efbac786c5ca78637b50a6b36a569d0b9e706a197126db8b584e1"}},{"ruleId":"D1","level":"warning","message":{"text":"ShaderModule.toEntryPoint (cyclomatic 17): ShaderModule.toEntryPoint 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/Libs/FShade.Core/Shader.fs"},"region":{"startLine":4271}}}],"partialFingerprints":{"codehealthFindingId/v1":"7103fa5cba40583d6edbdda5ece046b0cf1cffd3786562e39d641d9fd78f78ba"}},{"ruleId":"D1","level":"warning","message":{"text":"CompilerModule.asExternalS (cyclomatic 17): CompilerModule.asExternalS 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. This is NOT this file\u0027s highest cyclomatic complexity: HelpersModule.tryGetBuiltInField (cyclomatic 25) 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/Libs/FShade.Imperative/Compiler.fs"},"region":{"startLine":1327}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d05209296d3700bfd7c6a79c62abe2386665fe9be36483a1ec86a070aa1ace"}},{"ruleId":"D1","level":"warning","message":{"text":"CStatementModule.visit (cyclomatic 17): CStatementModule.visit 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. This is NOT this file\u0027s highest cyclomatic complexity: CLiteralModule.tryCreate (cyclomatic 19) 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/Libs/FShade.Imperative/Ast.fs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6fe02f0814b2ec0ad60e262b02f71f7b003a4d432b777337fa4c7ef2739f12"}},{"ruleId":"D1","level":"warning","message":{"text":"GLSLTypeModule.ofCType (cyclomatic 17): GLSLTypeModule.ofCType 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. This is NOT this file\u0027s highest cyclomatic complexity: GLSLType.toString (cyclomatic 28) 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/Libs/FShade.GLSL/UniformBufferLayout.fs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8070d4da01855ec923a4350551b4dd1e71320ea665f0b9d2ce8db51e8feb86"}},{"ruleId":"D1","level":"warning","message":{"text":"GLSLShaderInterface.ToString (cyclomatic 17): GLSLShaderInterface.ToString 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. This is NOT this file\u0027s highest cyclomatic complexity: GLSLType.toString (cyclomatic 28) 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/Libs/FShade.GLSL/UniformBufferLayout.fs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"21cc3cecd496510c2513bb3cffb867e84c0fed28c27c1b1f6417031e4a63a993"}},{"ruleId":"D1","level":"warning","message":{"text":"GLSLShaderInterfaceModule.deserializeInternal (cyclomatic 17): GLSLShaderInterfaceModule.deserializeInternal 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. This is NOT this file\u0027s highest cyclomatic complexity: GLSLType.toString (cyclomatic 28) 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/Libs/FShade.GLSL/UniformBufferLayout.fs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a20683c39ad8b3be9cf772f14494eee53a445ddcf4c4e680178121e65b090f0"}},{"ruleId":"D1","level":"warning","message":{"text":"Inlining.canInline (cyclomatic 16): Inlining.canInline has cyclomatic complexity 16 (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. This is NOT this file\u0027s highest cyclomatic complexity: StatementHoisting.processExpression (cyclomatic 37) 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/Libs/FShade.Core/Optimizer.fs"},"region":{"startLine":2671}}}],"partialFingerprints":{"codehealthFindingId/v1":"5703db9c5685182e3d20724eee492f323377de40b2bf83c1213c40c3d8b3b110"}},{"ruleId":"D1","level":"warning","message":{"text":"UtilityFunctionModule.tryCreate\u0027 (cyclomatic 16): UtilityFunctionModule.tryCreate\u0027 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/Libs/FShade.Imperative/UtilityFunction.fs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96262fc5a70f4ae997048db5360b039fe0cc5c44fe568e2d10934f3644d5bdc"}},{"ruleId":"D1","level":"warning","message":{"text":"Assembler.assembleEntryDef (cyclomatic 16): Assembler.assembleEntryDef has cyclomatic complexity 16 (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/Libs/FShade.SpirV/Assembler.fs"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"343f22afcce8831d2f64967d7b9661e18dcf2dc29cd81ccdbfef6d2275d2c6d7"}},{"ruleId":"D2","level":"warning","message":{"text":"InstructionModule.tryReadFrom (cognitive 961): InstructionModule.tryReadFrom has cognitive complexity 961 (threshold 15). Drivers by points: if/else 640 (960 pts), match/switch 1 (nesting depth added 320). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/Libs/FShade.SpirV/Core/SpirVInstructions.fs holds 2 of the 67 methods over the threshold \u2014 including the worst \u2014 and 1006 of the 2538 points over it (40%), 3.2\u00D7 the next-largest file (src/Libs/FShade.Core/Optimizer.fs at 316). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.SpirV/Core/SpirVInstructions.fs"},"region":{"startLine":3518}}}],"partialFingerprints":{"codehealthFindingId/v1":"5529b8f0dd9571e4b4def453e55bc119b949f9526cf6f61c773ab0ef74e01a6e"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstantFolding.evaluateConstantsS (cognitive 154): ConstantFolding.evaluateConstantsS has cognitive complexity 154 (threshold 15). Drivers by points: match/switch 39 (98 pts), error handling 6 (24 pts), if/else 15 (23 pts), boolean chains 6, loops 1 (3 pts) (nesting depth added 87). 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/Libs/FShade.Core/Optimizer.fs"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"23419880c410b36008050970550efbe51506e7e32bdcb365d0f3d13bdf97971f"}},{"ruleId":"D2","level":"warning","message":{"text":"Preprocessor.preprocessNormalS (cognitive 134): Preprocessor.preprocessNormalS has cognitive complexity 134 (threshold 15). Drivers by points: if/else 57 (88 pts), match/switch 19 (42 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 55). 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/Libs/FShade.Core/Shader.fs"},"region":{"startLine":1865}}}],"partialFingerprints":{"codehealthFindingId/v1":"33146c6e54757440da462cc508e2df717d9179f451720ac6fc72055a9436c206"}},{"ruleId":"D2","level":"warning","message":{"text":"DeadCodeElimination.eliminateDeadCodeS (cognitive 85): DeadCodeElimination.eliminateDeadCodeS has cognitive complexity 85 (threshold 15). Drivers by points: if/else 28 (45 pts), match/switch 17 (40 pts) (nesting depth added 40). 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/Libs/FShade.Core/Optimizer.fs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"91415df2b797be5691a501f8b2a7fa3e537ab342462d9e79469014e58e62ce88"}},{"ruleId":"D2","level":"warning","message":{"text":"Assembler.assembleExprS (cognitive 84): Assembler.assembleExprS has cognitive complexity 84 (threshold 15). Drivers by points: if/else 27 (47 pts), match/switch 11 (21 pts), loops 2 (9 pts), boolean chains 4, error handling 1 (3 pts) (nesting depth added 39). 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/Libs/FShade.GLSL/Assembler.fs"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"021bff19986229cef34cd8bc2f12c9f61e9b482d888e053c8bb4aaf468fc1c9a"}},{"ruleId":"D2","level":"warning","message":{"text":"Expr.serializeInternal (cognitive 77): Expr.serializeInternal has cognitive complexity 77 (threshold 15). Drivers by points: loops 20 (40 pts), match/switch 11 (23 pts), if/else 6 (12 pts), boolean chains 2 (nesting depth added 38). 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/Libs/FShade.Core/Serializer.fs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"2573f009e04328d50a6ad473755c6a0c0059904a0273b4eac83b314297806407"}},{"ruleId":"D2","level":"warning","message":{"text":"InstructionModule.writeTo (cognitive 75): InstructionModule.writeTo has cognitive complexity 75 (threshold 15). Drivers by points: if/else 48 (72 pts), match/switch 2 (3 pts) (nesting depth added 25). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/Libs/FShade.SpirV/Core/SpirVInstructions.fs holds 2 of the 67 methods over the threshold \u2014 including the worst \u2014 and 1006 of the 2538 points over it (40%), 3.2\u00D7 the next-largest file (src/Libs/FShade.Core/Optimizer.fs at 316). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.SpirV/Core/SpirVInstructions.fs"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"442605217c12b351464604d35c88dd389cb9643c08422303d1856280a1dbd91a"}},{"ruleId":"D2","level":"warning","message":{"text":"Inlining.inlineS (cognitive 71): Inlining.inlineS has cognitive complexity 71 (threshold 15). Drivers by points: if/else 16 (35 pts), match/switch 11 (31 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 40). 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/Libs/FShade.Core/Optimizer.fs"},"region":{"startLine":2728}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a44a28fff01b05db4dfabf7af273db35de062b6849e926b3c2ceb53cea45de"}},{"ruleId":"D2","level":"warning","message":{"text":"CompilerModule.toCExprS (cognitive 68): CompilerModule.toCExprS has cognitive complexity 68 (threshold 15). Drivers by points: match/switch 21 (54 pts), if/else 9 (14 pts) (nesting depth added 38). 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/Libs/FShade.Imperative/Compiler.fs"},"region":{"startLine":1436}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56781b0362d4580ee24dec974ae9342198648030ee0b1c8db6ed80779889ac2"}},{"ruleId":"D2","level":"warning","message":{"text":"Value.serialize (cognitive 65): Value.serialize has cognitive complexity 65 (threshold 15). Drivers by points: if/else 21 (32 pts), loops 6 (21 pts), match/switch 4 (10 pts), boolean chains 2 (nesting depth added 32). 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/Libs/FShade.Core/Serializer.fs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a77f8c345ba2feb9975a85fdab6265ffa824bee24f32103b5849fa20347d0e4"}},{"ruleId":"D2","level":"warning","message":{"text":"CompilerModule.toCStatementS (cognitive 65): CompilerModule.toCStatementS has cognitive complexity 65 (threshold 15). Drivers by points: match/switch 18 (44 pts), if/else 8 (20 pts), boolean chains 1 (nesting depth added 38). 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/Libs/FShade.Imperative/Compiler.fs"},"region":{"startLine":1837}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd091f780ab380fde7d52ace4fbc1e1ebba9bef691c3a8e6a00df4a42d94b2b6"}},{"ruleId":"D2","level":"warning","message":{"text":"ShaderModule.withOutputs (cognitive 64): ShaderModule.withOutputs has cognitive complexity 64 (threshold 15). Drivers by points: match/switch 9 (35 pts), if/else 15 (29 pts) (nesting depth added 40). 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/Libs/FShade.Core/Shader.fs"},"region":{"startLine":4121}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ffe586e513fc0238f9369b780e7ec4470fb471496a47df9986c934ddf901c1c"}},{"ruleId":"D2","level":"warning","message":{"text":"HelpersModule.tryGetBuiltInMethod (cognitive 64): HelpersModule.tryGetBuiltInMethod has cognitive complexity 64 (threshold 15). Drivers by points: match/switch 31 (62 pts), boolean chains 2 (nesting depth added 31). 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/Libs/FShade.Imperative/Compiler.fs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3524005a7ff3e29ccde9a58a8b32181ba44f12f4e4f752777dc1c14e1c86f5"}},{"ruleId":"D2","level":"warning","message":{"text":"IntrinsicFunctions.|TextureLookup|_| (cognitive 57): IntrinsicFunctions.|TextureLookup|_| has cognitive complexity 57 (threshold 15). Drivers by points: if/else 16 (30 pts), match/switch 13 (25 pts), boolean chains 2 (nesting depth added 26). 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/Libs/FShade.GLSL/IntrinsicFunctions.fs"},"region":{"startLine":2170}}}],"partialFingerprints":{"codehealthFindingId/v1":"27857248ff806efb566ff76498ebdda482504024c2989a4f4af738a85cfa835e"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprExtensions.Expr.TryEval.Static (cognitive 56): ExprExtensions.Expr.TryEval.Static has cognitive complexity 56 (threshold 15). Drivers by points: match/switch 17 (40 pts), error handling 2 (8 pts), if/else 4 (8 pts) (nesting depth added 33). 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/Libs/FShade.Imperative/Utilities.fs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"200d1f21acf4702387e9961bbe93f783b94b047785e5ea3f7d70161e14a8acd5"}},{"ruleId":"D2","level":"warning","message":{"text":"Value.deserialize (cognitive 55): Value.deserialize has cognitive complexity 55 (threshold 15). Drivers by points: match/switch 9 (27 pts), if/else 12 (18 pts), loops 2 (8 pts), boolean chains 2 (nesting depth added 30). 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/Libs/FShade.Core/Serializer.fs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"98df335909b7704f0017ebca999191acca18380e8dc49fd505d9c9bf63b66669"}},{"ruleId":"D2","level":"warning","message":{"text":"BasicQuotationPatterns.|Uniform|_| (cognitive 54): BasicQuotationPatterns.|Uniform|_| has cognitive complexity 54 (threshold 15). Drivers by points: match/switch 15 (42 pts), if/else 4 (10 pts), boolean chains 2 (nesting depth added 33). 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/Libs/FShade.Core/Reflection.fs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"299d9f934146acacd010fc71aa4bb4db1cd09d4ef9158a5b49d08395f55904cd"}},{"ruleId":"D2","level":"warning","message":{"text":"Assembler.assembleExpr (cognitive 53): Assembler.assembleExpr has cognitive complexity 53 (threshold 15). Drivers by points: match/switch 20 (41 pts), if/else 6 (12 pts) (nesting depth added 27). 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/Libs/FShade.SpirV/Assembler.fs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7df901ab2fbd83b7c49beb1bf23d51b5a970b8320d05ea7acb39b104d35bbe"}},{"ruleId":"D2","level":"warning","message":{"text":"Assembly.tryGetMethodName (cognitive 52): Assembly.tryGetMethodName has cognitive complexity 52 (threshold 15). Drivers by points: if/else 16 (42 pts), error handling 3 (7 pts), boolean chains 2, match/switch 1 (nesting depth added 30). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Debug/Assembly.fs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a84cef49f7db14fe7c89808ecc463ddf131fbd981169fb5dd1ece285e24840"}},{"ruleId":"D2","level":"warning","message":{"text":"Type.serializeInternal (cognitive 50): Type.serializeInternal has cognitive complexity 50 (threshold 15). Drivers by points: loops 7 (24 pts), if/else 12 (17 pts), match/switch 3 (7 pts), boolean chains 2 (nesting depth added 26). 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/Libs/FShade.Core/Serializer.fs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"66dcb27301d2bca3ca739032c1fa3ba82e0c7a2e6bb0f2157658eef340621c74"}},{"ruleId":"D2","level":"warning","message":{"text":"Assembler.assembleEntryParameterS (cognitive 48): Assembler.assembleEntryParameterS has cognitive complexity 48 (threshold 15). Drivers by points: match/switch 12 (25 pts), if/else 8 (14 pts), boolean chains 9 (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/Libs/FShade.GLSL/Assembler.fs"},"region":{"startLine":2475}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d85ffbc981b0d85c8bf5102bdd1c398e680964b57119462a6079d7f6bd9896a"}},{"ruleId":"D2","level":"warning","message":{"text":"GLSLProgramInterfaceModule.serializeInternal (cognitive 46): GLSLProgramInterfaceModule.serializeInternal has cognitive complexity 46 (threshold 15). Drivers by points: loops 18 (28 pts), match/switch 5 (15 pts), if/else 2 (3 pts) (nesting depth added 21). 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/Libs/FShade.GLSL/UniformBufferLayout.fs"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"788eb30997322a41810128d1043fbe75acec3c2a1b4010faaeee05abde2e7383"}},{"ruleId":"D2","level":"warning","message":{"text":"Expr.deserializeInternal (cognitive 41): Expr.deserializeInternal has cognitive complexity 41 (threshold 15). Drivers by points: match/switch 11 (21 pts), if/else 8 (12 pts), loops 4 (8 pts) (nesting depth added 18). 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/Libs/FShade.Core/Serializer.fs"},"region":{"startLine":1330}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d93b27e5bc4c54247baf9845086173346bc0b2f7e9898d9134d10721bf9d9d"}},{"ruleId":"D2","level":"warning","message":{"text":"Helpers.flatten (cognitive 40): Helpers.flatten has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 7 (14 pts), loops 7 (10 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/Libs/FShade.Imperative/ModuleCompiler.fs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60cd85256e900224f9085eb71e9680bc853caa4bdfbe14d9c5ae47936236d49"}},{"ruleId":"D2","level":"warning","message":{"text":"UtilityFunctionModule.tryCreate\u0027 (cognitive 39): UtilityFunctionModule.tryCreate\u0027 has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 5 (18 pts), boolean chains 2 (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/Libs/FShade.Imperative/UtilityFunction.fs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ceb45ec048d296490073290f7adf8f4bc2d7449a12cfcc88e6daaba459f0bcc"}},{"ruleId":"D2","level":"warning","message":{"text":"ShaderDebugger.attach (cognitive 39): ShaderDebugger.attach has cognitive complexity 39 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 6 (13 pts), match/switch 2 (6 pts), boolean chains 3, error handling 1 (3 pts) (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/Libs/FShade.Debug/Debugger.fs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b4247467f0816ceed94d939fcbecb5d5fe1657ad9625d982cf632e87617c32"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectDataModule.tryLoad (cognitive 36): ProjectDataModule.tryLoad has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 5 (16 pts), error handling 1 (3 pts) (nesting depth added 22). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Debug/ProjectData.fs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d353e225adcf0c9352725dd229b720a56239478b3915801c9d307df73005f4"}},{"ruleId":"D2","level":"warning","message":{"text":"Assembler.assembleUniformsS (cognitive 33): Assembler.assembleUniformsS has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 9 (15 pts), boolean chains 1 (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/Libs/FShade.GLSL/Assembler.fs"},"region":{"startLine":2202}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef0996c67ff719e62aca38ab14d64646a5c586b7768ad8da44c624228636c72"}},{"ruleId":"D2","level":"warning","message":{"text":"Composition.gsgs (cognitive 32): Composition.gsgs has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 10 (22 pts), loops 3 (6 pts), if/else 2 (4 pts) (nesting depth added 17). 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/Libs/FShade.Core/Shader.fs"},"region":{"startLine":4956}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db3dc63d999f8a380aa9c3ff97bd0dc768a01ac8e2223d2f54cf4a4b935794e"}},{"ruleId":"D2","level":"warning","message":{"text":"DeadCodeElimination.withoutValueS (cognitive 32): DeadCodeElimination.withoutValueS has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 8 (20 pts), if/else 8 (12 pts) (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/Libs/FShade.Core/Optimizer.fs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfeeffff36b9ed98ecd0e586997c527ba2d75b055fd34190f9a77087eb00b2e"}},{"ruleId":"D2","level":"warning","message":{"text":"Assembler.assembleEntryS (cognitive 32): Assembler.assembleEntryS has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 15 (27 pts), if/else 3 (5 pts) (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.GLSL/Assembler.fs"},"region":{"startLine":2596}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef668206ea39b47b25e727a3dd13b762b3efee45dacdac1d1cc3d692fa51bdb"}},{"ruleId":"D2","level":"warning","message":{"text":"CSE.findIndexedCommonSubExpressions (cognitive 31): CSE.findIndexedCommonSubExpressions has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 10 (20 pts), if/else 3 (7 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 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. 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/Libs/FShade.Core/Optimizer.fs"},"region":{"startLine":3434}}}],"partialFingerprints":{"codehealthFindingId/v1":"899899ccac1b5206e1a3a63894d72f74772c58f5e875854fbbf59204796761db"}},{"ruleId":"D2","level":"warning","message":{"text":"PrettyPrinter.print (cognitive 30): PrettyPrinter.print has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 9 (18 pts), if/else 6 (9 pts), boolean chains 3 (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/Libs/FShade.Core/Optimizer.fs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"35802aa8c47ccb4e06ddb7142a1a7b512b83703b7e144c6fb4ba521220b23ade"}},{"ruleId":"D2","level":"warning","message":{"text":"Assembler.assembleLiteralS (cognitive 30): Assembler.assembleLiteralS has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 7 (17 pts), if/else 8 (12 pts), boolean chains 1 (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.GLSL/Assembler.fs"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"182340fa6013e5451163572e091c16f602e0b4e7dfa67134bfc03d68e528b9a9"}},{"ruleId":"D2","level":"warning","message":{"text":"GLSLShaderInterfaceModule.serializeInternal (cognitive 30): GLSLShaderInterfaceModule.serializeInternal has cognitive complexity 30 (threshold 15). Drivers by points: loops 14 (16 pts), match/switch 5 (14 pts) (nesting depth added 11). 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/Libs/FShade.GLSL/UniformBufferLayout.fs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"6febd8a3e4f104890dca6c0f35ec28ef7409e3d85e73e0065b6440eaea89dca1"}},{"ruleId":"D2","level":"warning","message":{"text":"Preprocessor.computeStorageAccessS (cognitive 27): Preprocessor.computeStorageAccessS has cognitive complexity 27 (threshold 15). Drivers by points: loops 7 (18 pts), match/switch 4 (9 pts) (nesting depth added 16). 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/Libs/FShade.Core/Shader.fs"},"region":{"startLine":2641}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2598ace611c965f88d7ebe5bd46a26e5f88889595e204cbe5e89926af01a771"}},{"ruleId":"D2","level":"warning","message":{"text":"Compiler.build (cognitive 27): Compiler.build has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 4 (9 pts), error handling 1 (3 pts), match/switch 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Debug/Compiler.fs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5a22d728c71ca3f5ddae165cb9edb3ac589bc9e8bef5996f87f4351fa3bb00"}},{"ruleId":"D2","level":"warning","message":{"text":"ComputeShaderModule.ofExprInternal (cognitive 26): ComputeShaderModule.ofExprInternal has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 8 (13 pts), if/else 4 (6 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/ComputeShader.fs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a6a6d4c363895fe9779640d3ba27dd10de6efeb7e4fbb69a4b6be770b5f28a"}},{"ruleId":"D2","level":"warning","message":{"text":"EffectModule.unpickleResource (cognitive 26): EffectModule.unpickleResource has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 2 (5 pts), error handling 1 (2 pts), boolean chains 1 (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. This shape REPEATS in the file: one other method here (EffectModule.unpickleInternal) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Effect.fs"},"region":{"startLine":1431}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7a766f04583eec343c477ed4d15a16be2b139ba7bb0cbaabf20c70e083b52d"}},{"ruleId":"D2","level":"warning","message":{"text":"EffectModule.unpickleInternal (cognitive 26): EffectModule.unpickleInternal has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 2 (5 pts), error handling 1 (2 pts), boolean chains 1 (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. This shape REPEATS in the file: one other method here (EffectModule.unpickleResource) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Effect.fs"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2f3f7ee7c2fba0529fef5e355ed297e03816bc12e86604843efc6baa503492"}},{"ruleId":"D2","level":"warning","message":{"text":"Preprocessor.preprocessRaytracingS (cognitive 26): Preprocessor.preprocessRaytracingS has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 13 (25 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/Libs/FShade.Core/Shader.fs"},"region":{"startLine":1512}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a30b908eca8b6c328b7441c94ebe327070c8e3d6b5d3671d65e267eb88a49e"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend.TryGetIntrinsicType (cognitive 24): Backend.TryGetIntrinsicType has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 5 (9 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.GLSL/Assembler.fs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcdfe1a79ce99f49118cb8b6a4c4ae09f59bc4552b5010ceb74b715d85ebc4fa"}},{"ruleId":"D2","level":"warning","message":{"text":"EffectModule.withDepthRange (cognitive 23): EffectModule.withDepthRange has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 3 (9 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Effect.fs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0cb91a865cedfb554de3c91755bd521c3fc2e08c227f806afac7e0853ec4d9e"}},{"ruleId":"D2","level":"warning","message":{"text":"Helpers.typeName (cognitive 23): Helpers.typeName has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (23 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/Libs/FShade.Imperative/Utilities.fs"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdaa51a06147afe1b095ecb0a1f2c8c0003fc609ce6e606fda3c4a350ffde2f5"}},{"ruleId":"D2","level":"warning","message":{"text":"Assembler.assembleStatementS (cognitive 23): Assembler.assembleStatementS has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 4 (7 pts) (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/Libs/FShade.GLSL/Assembler.fs"},"region":{"startLine":2010}}}],"partialFingerprints":{"codehealthFindingId/v1":"54786a7aef004dae263959228e856e3817797362292b391ed52c60096fa0e8ca"}},{"ruleId":"D2","level":"warning","message":{"text":"GLSLProgramInterface.GetUniformStages (cognitive 23): GLSLProgramInterface.GetUniformStages has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 7). 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/Libs/FShade.GLSL/UniformBufferLayout.fs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa22b780f5477c230b3709767303a764cfc60453cc255aa93e44ad0d07c2eec"}},{"ruleId":"D2","level":"warning","message":{"text":"EffectModule.tryReplaceGeometry (cognitive 22): EffectModule.tryReplaceGeometry has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (13 pts), loops 1 (4 pts), error handling 1 (2 pts), if/else 2, 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/Libs/FShade.Core/Effect.fs"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4eee2efa3fe2edb47d7eeca516e15467c09529e40fd1473e30b7c7a389febc"}},{"ruleId":"D2","level":"warning","message":{"text":"Shader.serializeInternal (cognitive 22): Shader.serializeInternal has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 10 (12 pts), loops 10 (nesting depth added 2). 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/Libs/FShade.Core/Serializer.fs"},"region":{"startLine":1961}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f7d6c207ac59540f2d3728b9453277d7dd5a235cfb98af3c86064908d74f7e"}},{"ruleId":"D2","level":"warning","message":{"text":"ComputeShaderModule.ofFunction (cognitive 21): ComputeShaderModule.ofFunction has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 3 (6 pts) (nesting depth added 12). 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/Libs/FShade.Core/ComputeShader.fs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f7c6a3efcd904cbe0164c57aa90bf91a689fd50ce5f20b5ab2944e54425213"}},{"ruleId":"D2","level":"warning","message":{"text":"EffectModule.compose2 (cognitive 20): EffectModule.compose2 has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (7 pts), loops 1 (5 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/Libs/FShade.Core/Effect.fs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbaa91341dd901c9d3174a2664fbfc219cd82a7deb87b1ac2470aeb289c6758"}},{"ruleId":"D2","level":"warning","message":{"text":"EffectModule.toModule (cognitive 19): EffectModule.toModule has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 4 (7 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Effect.fs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"39497810ed32bb0eeebfc624ab50487ccb2214825065c3e9495c63b8e1c75eec"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprExtensions.|Pipe|_| (cognitive 19): ExprExtensions.|Pipe|_| has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 3 (5 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Imperative/Utilities.fs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc26f3eb85d466142c1d0bc5518afbb1cb9547dd17acb1098b791108a08d8c8"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectHelpers.tryFindProjectLocation (cognitive 19): ProjectHelpers.tryFindProjectLocation has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), error handling 2 (5 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/Libs/FShade.Debug/Assembly.fs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"5673fcbefec56ba4da2eefd1cfa76f7825078b18a051d7c5dfca8f8faf22ed28"}},{"ruleId":"D2","level":"warning","message":{"text":"AssemblerStateModule.useTypeExtensions (cognitive 19): AssemblerStateModule.useTypeExtensions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 1 (2 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/Libs/FShade.GLSL/Assembler.fs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a26128e7d53a90db74f1d67305ea505c4b9f194bcc2c01aa3761cd2f1d92009"}},{"ruleId":"D2","level":"warning","message":{"text":"ShaderModule.inputsToUniforms (cognitive 18): ShaderModule.inputsToUniforms has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 3 (7 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Shader.fs"},"region":{"startLine":4065}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff37abbf80e09dd752c2a420f1e6873396009e89ca3df82781a757332e7aeeb0"}},{"ruleId":"D2","level":"warning","message":{"text":"ShaderModule.toEntryPoint (cognitive 18): ShaderModule.toEntryPoint has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8, match/switch 7 (8 pts), boolean chains 2 (nesting depth added 1). 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/Libs/FShade.Core/Shader.fs"},"region":{"startLine":4271}}}],"partialFingerprints":{"codehealthFindingId/v1":"089bca0da095710587ed9d39b565a65ed8fe5f6320488ad25b8a4b68fbf1d6ff"}},{"ruleId":"D2","level":"warning","message":{"text":"Inlining.isMutated (cognitive 18): Inlining.isMutated has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (12 pts), boolean chains 4, if/else 2 (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/Libs/FShade.Core/Optimizer.fs"},"region":{"startLine":2623}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32f27c6c7767d52a9bc0003c5dfde601b245161c7b83e019c420988c1df0abf"}},{"ruleId":"D2","level":"warning","message":{"text":"CompilerModule.asExternalS (cognitive 18): CompilerModule.asExternalS has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 6 (10 pts), if/else 6, boolean chains 2 (nesting depth added 4). 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/Libs/FShade.Imperative/Compiler.fs"},"region":{"startLine":1327}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e1d0ef0e3fdbaebc8b6580086502d8c9eabd89fdf06d2a8aa3baecfaf4ff53"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstructorsModule.custom (cognitive 18): ConstructorsModule.custom has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 7 (12 pts), if/else 3 (5 pts), boolean chains 1 (nesting depth added 7). 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/Libs/FShade.Imperative/Compiler.fs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"497c2b0191b27961e6081c79d90bc3d59072b1b6768480e8fb7baf04bc072474"}},{"ruleId":"D2","level":"warning","message":{"text":"Assembler.assembleTypeS (cognitive 18): Assembler.assembleTypeS has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 2 (3 pts) (nesting depth added 6). 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/Libs/FShade.GLSL/Assembler.fs"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"189eef6db9977727f5f967d00e293548d1870e6f87222a84013379e6ebc0ffaa"}},{"ruleId":"D2","level":"warning","message":{"text":"Assembler.assembleValueDef (cognitive 18): Assembler.assembleValueDef has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (14 pts), match/switch 2 (4 pts) (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/Libs/FShade.SpirV/Assembler.fs"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e97c98d179ec4e66a9e64eba9716478c8a17f809b504018f861228850c064d2"}},{"ruleId":"D2","level":"warning","message":{"text":"Composition.gsvs (cognitive 17): Composition.gsvs has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 6 (13 pts), if/else 4 (nesting depth added 7). 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/Libs/FShade.Core/Shader.fs"},"region":{"startLine":4623}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae10f797fd00c3485fcd9c68e0746b55df504853779779eff2d445c30a87cb8"}},{"ruleId":"D2","level":"warning","message":{"text":"Composition.vsgs (cognitive 17): Composition.vsgs has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 8 (12 pts), if/else 4, boolean chains 1 (nesting depth added 4). 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/Libs/FShade.Core/Shader.fs"},"region":{"startLine":5115}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7655aca6a1ec5fc1d6b346d8a1b8622d661a7ccb08aaede8c032f2eb7e7f26"}},{"ruleId":"D2","level":"warning","message":{"text":"CExprModule.visit (cognitive 17): CExprModule.visit has cognitive complexity 17 (threshold 15). Drivers by points: loops 7 (14 pts), match/switch 2 (3 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Imperative/Ast.fs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf9493d07b7c7bea2bf660849d44f461abbc7bec38745f7977d8c3234866799b"}},{"ruleId":"D2","level":"warning","message":{"text":"GeometryInfo.tryGetUpperBound (cognitive 16): GeometryInfo.tryGetUpperBound has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 8 (16 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. This shape REPEATS in the file: one other method here (GeometryInfo.tryGetLowerBound) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Shader.fs"},"region":{"startLine":3000}}}],"partialFingerprints":{"codehealthFindingId/v1":"4396891051b14404e68491355adbd465cd252bda5ab95f4ecc12eb7c67fc8a07"}},{"ruleId":"D2","level":"warning","message":{"text":"GeometryInfo.tryGetLowerBound (cognitive 16): GeometryInfo.tryGetLowerBound has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 8 (16 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. This shape REPEATS in the file: one other method here (GeometryInfo.tryGetUpperBound) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Shader.fs"},"region":{"startLine":3045}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc1b7b6002d492c38d9f997a61a7b2de9876d6cd460d2793f3e8317f6ff5285"}},{"ruleId":"D2","level":"warning","message":{"text":"Assembly.tryGetProjectData (cognitive 16): Assembly.tryGetProjectData has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (10 pts), loops 1 (5 pts), error handling 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Debug/Assembly.fs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"90786c780e1e4a9f65bc8c2c25bb03297a3454431ebf63075b4487b8a5c6fe25"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Core/SpirVInstructions.fs: FileTooLong \u2014 6530 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 49 functions. The bar is 500 significant lines; this is 6030 over it, 13.06\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/Libs/FShade.SpirV/Core/SpirVInstructions.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8608b9e55be10090c6a36fc97dcf544efc33d102ae05e8a2e549cab8037cdb9e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FShade.Core/Shader.fs: FileTooLong \u2014 3944 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3444 over it, 7.89\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/Libs/FShade.Core/Shader.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f632f2f3993dfa27a5119423f270c06989aa2581e426a5e8ec185a8b6717815"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FShade.Core/Optimizer.fs: FileTooLong \u2014 2855 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2355 over it, 5.71\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/Libs/FShade.Core/Optimizer.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2075e4fda50bb6a8fffca9d0db925bed595bf64a35b61a672dfe8c8b6a8e93"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FShade.GLSL/Assembler.fs: FileTooLong \u2014 2118 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1618 over it, 4.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/Libs/FShade.GLSL/Assembler.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2ff99b7462760676a83be4e85b8e541fd99b117959360fe88f73e471bbcd97"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FShade.Core/Serializer.fs: FileTooLong \u2014 1815 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1315 over it, 3.63\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/Libs/FShade.Core/Serializer.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5339e39a56644d626ec732faf9e23faabf9fbb90bde392fb278da6d30830a138"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FShade.GLSL/IntrinsicFunctions.fs: FileTooLong \u2014 1717 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1217 over it, 3.43\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/Libs/FShade.GLSL/IntrinsicFunctions.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0f58281dbd1b3912a9b932116ec7fb71cef3ec75212665f702693cb2d74887"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FShade.Imperative/Compiler.fs: FileTooLong \u2014 1692 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1192 over it, 3.38\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/Libs/FShade.Imperative/Compiler.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4fdb0998eee0d3c9927a1b2ce2a67011ff1265ad5fe72da593c88ee3c2cfdc6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FShade.GLSL/UniformBufferLayout.fs: FileTooLong \u2014 1610 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1110 over it, 3.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.GLSL/UniformBufferLayout.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60aa42194633a96105b102a03059fce90307a15aabb2fb90f4a6bd03ae45850e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FShade.Core/Samplers.fs: FileTooLong \u2014 1544 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1044 over it, 3.09\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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ab8545260cebcddc889c19c9dd005dde262502501e68dccee3f33d3f4b59d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FShade.SpirV/Assembler.fs: FileTooLong \u2014 1479 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 979 over it, 2.96\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/Libs/FShade.SpirV/Assembler.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed404b3332a9e6a333ff5a4f53d86d20f97b74efc79d31e3063ef35330313d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FShade.Imperative/Utilities.fs: FileTooLong \u2014 1036 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 42 functions. The bar is 500 significant lines; this is 536 over it, 2.07\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/Libs/FShade.Imperative/Utilities.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"944b8d708d18454b26da320068279e1836a6214b3ab97a4a7f69583c2462002f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FShade.Core/Effect.fs: FileTooLong \u2014 988 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 63 functions. The bar is 500 significant lines; this is 488 over it, 1.98\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/Libs/FShade.Core/Effect.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75243ba4fe5207a42dd8ea56b0f7e4115033e32bbc6ef6743f85f347fe13bd84"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FShade.Imperative/Ast.fs: FileTooLong \u2014 786 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 286 over it, 1.57\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/Libs/FShade.Imperative/Ast.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9817a92980c02b3577ddfce2107fdf6d447c5b5c0eb434045af2bb6a9af3ba30"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: OtherPatterns: TooManyFunctions \u2014 37 functions. The bar is 30 functions; this is 7 over it, 1.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/Libs/FShade.Core/Shader.fs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4ad70c6c3bea4f623ad944092ca1d6b2d6a9e7847762aab74aaca63e64fb06"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: ShaderModule: TooManyFunctions \u2014 32 functions. The bar is 30 functions; this is 2 over it, 1.07\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Shader.fs"},"region":{"startLine":3227}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed6bb5b657e8706981ebe631d36d6d993192fbcc3f8d96f1b08786fac32be80"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: ExpressionExtensions: TooManyFunctions \u2014 32 functions. The bar is 30 functions; this is 2 over it, 1.07\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Imperative/Frontend.fs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f090d735ac1de6dc33167ae8d940f84de7585917db3e00cafaa269839081591"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: Primitives: TooManyFunctions \u2014 31 functions. The bar is 30 functions; this is 1 over it, 1.03\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/Libs/FShade.Core/Frontend.fs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d813aa6431afa2ece36a9ff348f45860539b1e6ee6eb708b7eea2917700265"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (72 lines \u00D7 2): src/Libs/FShade.Core/Serializer.fs:1809-1880 | src/Libs/FShade.GLSL/UniformBufferLayout.fs:1423-1494 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Libs/FShade.Core/Serializer.fs:1809\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/Libs/FShade.Core/Serializer.fs"},"region":{"startLine":1809}}}],"partialFingerprints":{"codehealthFindingId/v1":"285b831f2d9a9b1f64dccef51d71fbcba3ada0552c0eca76d59f76c38e299f91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2): src/Libs/FShade.GLSL/Utilities.fs:16-57 | src/Libs/FShade.SpirV/Utilities.fs:133-174 \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. 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/Libs/FShade.GLSL/Utilities.fs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a188343a024c2ccd1bd91c45dd8b45a340f5ca15fd7ab2736c68432007a7c047"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37\u201338 lines \u00D7 2): src/Libs/FShade.Core/Shader.fs:3007-3043 | src/Libs/FShade.Core/Shader.fs:3052-3089 \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/Libs/FShade.Core/Shader.fs"},"region":{"startLine":3007}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a64cd801ae9d6f38147f56eaa19c0c3686eebaa422726650de4548d0eabe7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 2): src/Libs/FShade.Core/Effect.fs:1430-1456 | src/Libs/FShade.Core/Effect.fs:1489-1516 \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/Libs/FShade.Core/Effect.fs:1430\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/Libs/FShade.Core/Effect.fs"},"region":{"startLine":1430}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cee1041bb89a77ea36903bde36ad0cda531b934230d4af49294dc2efe74cc41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 8): src/Libs/FShade.Core/Samplers.fs:2350-2374 | src/Libs/FShade.Core/Samplers.fs:2401-2425 | src/Libs/FShade.Core/Samplers.fs:2545-2569 | src/Libs/FShade.Core/Samplers.fs:2593-2617 | src/Libs/FShade.Core/Samplers.fs:2788-2812 | src/Libs/FShade.Core/Samplers.fs:2839-2863 | src/Libs/FShade.Core/Samplers.fs:2983-3007 | src/Libs/FShade.Core/Samplers.fs:3031-3055 \u2014 all 8 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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":2350}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6dd8bc3dcc8085244b80eb15eabd36be2cf3a7a3d98e7c936ed89396e516321"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:2203-2227 | src/Libs/FShade.Core/Samplers.fs:2641-2665 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":2203}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d01b1407b0e142c4ffd5b3e7da8b825ffe8e1bee6e6c8f2744df11acd190409"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:2251-2275 | src/Libs/FShade.Core/Samplers.fs:2689-2713 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":2251}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7bf96f317c6b0c7fabea60171552da1ddbf0ef9177685b98e7dc74b0cb74126"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:2302-2326 | src/Libs/FShade.Core/Samplers.fs:2740-2764 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":2302}}}],"partialFingerprints":{"codehealthFindingId/v1":"645c1d555f1973d1d327a23ddf2159e70584a5f675d2cfb11ec53b98c7423526"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:2449-2473 | src/Libs/FShade.Core/Samplers.fs:2887-2911 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":2449}}}],"partialFingerprints":{"codehealthFindingId/v1":"6adc343213e633f288b34272403c6489544b7a99d0c2747dbfe3c76a794a67ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:2497-2521 | src/Libs/FShade.Core/Samplers.fs:2935-2959 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":2497}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2913330c96543653f721975f100e54902c42bee79688ad3d27da0c0623e7167"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 2): src/Libs/FShade.Core/Serializer.fs:1788-1807 | src/Libs/FShade.GLSL/UniformBufferLayout.fs:1400-1421 \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/Libs/FShade.Core/Serializer.fs"},"region":{"startLine":1788}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f5b42c02a9d5c41411b9b852c5d071ec363941ac5228b375b3cd7242869d03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/Libs/FShade.GLSL/IntrinsicParameters.fs:107-127 | src/Libs/FShade.GLSL/IntrinsicParameters.fs:134-154 \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/Libs/FShade.GLSL/IntrinsicParameters.fs:107\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/Libs/FShade.GLSL/IntrinsicParameters.fs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc677d7ce3889adddc157cf9c65b5e928f8cf6194dfe8790fa0f79423f4b35d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/Libs/FShade.Core/Effect.fs:1459-1477 | src/Libs/FShade.Core/Effect.fs:1519-1537 \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/Libs/FShade.Core/Effect.fs"},"region":{"startLine":1459}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa906a5d62e2cd1e705462b44fd2619a5d2e45f9123927905912aea8c18d64dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): src/Libs/FShade.Core/Shader.fs:3354-3370 | src/Libs/FShade.Core/Shader.fs:3377-3393 | src/Libs/FShade.Core/Shader.fs:3404-3420 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Libs/FShade.Core/Shader.fs:3354\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/Libs/FShade.Core/Shader.fs"},"region":{"startLine":3354}}}],"partialFingerprints":{"codehealthFindingId/v1":"7931a84a3a74455b06d13f6ff3ad6c94f8b1cbcfdffe2aeade150d7ae13d4a42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): src/Libs/FShade.GLSL/IntrinsicParameters.fs:80-96 | src/Libs/FShade.GLSL/IntrinsicParameters.fs:103-119 | src/Libs/FShade.GLSL/IntrinsicParameters.fs:130-146 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Libs/FShade.GLSL/IntrinsicParameters.fs:80\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/Libs/FShade.GLSL/IntrinsicParameters.fs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"6057015d7a9bdd9a7a16bf70552a3057b75a3e5cc105ee78a007b33bd2350910"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 4): src/Libs/FShade.GLSL/UniformBufferLayout.fs:1673-1688 | src/Libs/FShade.GLSL/UniformBufferLayout.fs:1695-1709 | src/Libs/FShade.GLSL/UniformBufferLayout.fs:1716-1730 | src/Libs/FShade.GLSL/UniformBufferLayout.fs:1742-1755 \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/Libs/FShade.GLSL/UniformBufferLayout.fs:1673\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.GLSL/UniformBufferLayout.fs"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ebdcd2de7b319bb8d97e7b1b008ae82df1d6a7bbdff8914e89eddaaa5bab25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): src/Libs/FShade.Core/Samplers.fs:60-75 | src/Libs/FShade.Core/Samplers.fs:714-729 | src/Libs/FShade.Core/Samplers.fs:1141-1156 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"0249e1b65d1e2d396b6789a985170a4d2147e2f9142f3d60e347c022d65d56bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): src/Libs/FShade.Core/Samplers.fs:165-180 | src/Libs/FShade.Core/Samplers.fs:767-782 | src/Libs/FShade.Core/Samplers.fs:1194-1209 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5f3d2fa7717ea3d44e4d52ea516604cc426c5d39f0f5bf47afe50ff4363200"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): src/Libs/FShade.Core/Samplers.fs:504-519 | src/Libs/FShade.Core/Samplers.fs:1002-1017 | src/Libs/FShade.Core/Samplers.fs:1429-1444 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebaf5648bfbcd7ad1ce032a1ddbe37ea0efe6150d4c56de07806dc1fb7f68b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:2039-2054 | src/Libs/FShade.Core/Samplers.fs:2138-2153 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":2039}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e952a907c437426c6951eb03dcb891863ea5126c41a09b6a68227efc43efda8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:2333-2348 | src/Libs/FShade.Core/Samplers.fs:2528-2543 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":2333}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4dda6b563c1d2c9c9fc3d1f7718d77ed27c79626726a5542af3035c1f4ba6f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:2771-2786 | src/Libs/FShade.Core/Samplers.fs:2966-2981 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":2771}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b6e44b7fd1e52f1cf68651e4bf55b96d72afd7b706bd465d8242495afff782"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): src/Libs/FShade.Core/Serializer.fs:1609-1623 | src/Libs/FShade.Core/Serializer.fs:1634-1649 \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/Libs/FShade.Core/Serializer.fs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa7b90c9de714dfe704f0252bf727ff5f91f1742c07db21baa5773ac3aa3c2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): src/Libs/FShade.GLSL/Assembler.fs:1032-1046 | src/Libs/FShade.GLSL/Assembler.fs:1059-1074 \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/Libs/FShade.GLSL/Assembler.fs:1032\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/Libs/FShade.GLSL/Assembler.fs"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b106f492c77d8fd8efadbd33da581f03e824908fcc64f32b90f1f289d038756"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/Libs/FShade.GLSL/Backends.fs:10-25 | src/Libs/FShade.GLSL/Backends.fs:31-46 \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/Libs/FShade.GLSL/Backends.fs:10\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/Libs/FShade.GLSL/Backends.fs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"677965db7c1d8a1ee78f71689535a2bbaa00f7a8a0e6f70dee3726931cf90c63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 6): src/Libs/FShade.Core/Samplers.fs:297-311 | src/Libs/FShade.Core/Samplers.fs:598-612 | src/Libs/FShade.Core/Samplers.fs:853-867 | src/Libs/FShade.Core/Samplers.fs:1062-1076 | src/Libs/FShade.Core/Samplers.fs:1280-1294 | src/Libs/FShade.Core/Samplers.fs:1489-1503 \u2014 all 6 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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4fe8f4e6e2a9d24d47a62ca16ed250dad79704eb1ad64fcb5ca81cd6dd1353"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 6): src/Libs/FShade.Core/Samplers.fs:440-454 | src/Libs/FShade.Core/Samplers.fs:675-689 | src/Libs/FShade.Core/Samplers.fs:938-952 | src/Libs/FShade.Core/Samplers.fs:1102-1116 | src/Libs/FShade.Core/Samplers.fs:1365-1379 | src/Libs/FShade.Core/Samplers.fs:1529-1543 \u2014 all 6 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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3186e16f0260ace3d686b93ccb4414d40d0a3cdbcc9861c87ffe843a243d5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:251-265 | src/Libs/FShade.Core/Samplers.fs:564-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/Libs/FShade.Core/Samplers.fs:268\u0060 calls \u0060Sample\u0060, \u0060SampleOffset\u0060 and \u0060src/Libs/FShade.Core/Samplers.fs:581\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4d1c0b6e7d96ba1e55e18dfa76ca320a8d1ec6965be9bd3d24b28a9d40486b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:382-396 | src/Libs/FShade.Core/Samplers.fs:638-652 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4c1622b88a05fa5c109c8a543ea488e5c33747a0dee27d8c24b4cb19d4c0a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/Libs/FShade.GLSL/UniformBufferLayout.fs:510-524 | src/Libs/FShade.GLSL/UniformBufferLayout.fs:555-569 \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/Libs/FShade.GLSL/UniformBufferLayout.fs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e23bd32c7ff31ba92658b23cb91eda9c9686177dbf8e694f2f331eb72ad3435"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/Libs/FShade.Core/ComputeShader.fs:317-330 | src/Libs/FShade.Core/RaytracingShader.fs:107-120 \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/Libs/FShade.Core/ComputeShader.fs:317\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/Libs/FShade.Core/ComputeShader.fs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"f400273f2a0703a475868c1767f7755ad426324ed7c51de69122340a90d3fe44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/Libs/FShade.Imperative/Compiler.fs:1577-1590 | src/Libs/FShade.Imperative/Compiler.fs:1648-1660 \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/Libs/FShade.Imperative/Compiler.fs"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f92c2cc563c0e9a927c2aea97f7000388421b9f045c92b41fe2942b5076d44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 5): src/Libs/FShade.Core/Frontend.fs:47-58 | src/Libs/FShade.Core/Frontend.fs:66-78 | src/Libs/FShade.Core/Frontend.fs:88-97 | src/Libs/FShade.Core/Frontend.fs:111-120 | src/Libs/FShade.Core/Frontend.fs:131-141 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/Libs/FShade.Core/Frontend.fs:81\u0060 calls \u0060PrimitiveIndex\u0060 and \u0060src/Libs/FShade.Core/Frontend.fs:61\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Frontend.fs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96b22bdaafcf14b4baaea738b7b0ff1b30b3a468d9f3545e6b0f226d5d617df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/Libs/FShade.Core/Optimizer.fs:643-655 | src/Libs/FShade.Core/Optimizer.fs:1039-1051 \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/Libs/FShade.Core/Optimizer.fs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b67e7f1033d4d7d91d3f5373219bf5f59c960dafe61f8d7bb721801bc0576b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/Libs/FShade.Core/Optimizer.fs:2234-2246 | src/Libs/FShade.Core/Optimizer.fs:2441-2452 \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/Libs/FShade.Core/Optimizer.fs"},"region":{"startLine":2234}}}],"partialFingerprints":{"codehealthFindingId/v1":"38832562743850911c72ee7a2764447bcec5f7398881976e617b48186ae7570e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/Libs/FShade.GLSL/IntrinsicFunctions.fs:924-936 | src/Libs/FShade.GLSL/IntrinsicFunctions.fs:1071-1083 \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/Libs/FShade.GLSL/IntrinsicFunctions.fs:924\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/Libs/FShade.GLSL/IntrinsicFunctions.fs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"a88df99145cbb9557996a52b9f78d9645d18df0bada7046973c4e6fa70c6b0c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): src/Libs/FShade.Core/Samplers.fs:2044-2055 | src/Libs/FShade.Core/Samplers.fs:2071-2082 | src/Libs/FShade.Core/Samplers.fs:2143-2154 | src/Libs/FShade.Core/Samplers.fs:2167-2178 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":2044}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc49e47e22017e6923cd13e6706d6c3fda25994fc5607d88defab6f3be41cf74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/Libs/FShade.Core/Reflection.fs:235-246 | src/Libs/FShade.Core/Reflection.fs:271-282 \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/Libs/FShade.Core/Reflection.fs:235\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/Libs/FShade.Core/Reflection.fs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64acce5c60e731d7f52d505e0e7d072a13ca0c0f848b2c109b3f7a9fca7be39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/Libs/FShade.Core/Serializer.fs:1535-1546 | src/Libs/FShade.Core/Serializer.fs:1563-1573 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/Libs/FShade.Core/Serializer.fs:1547\u0060 calls \u0060cnt\u0060 and \u0060src/Libs/FShade.Core/Serializer.fs:1574\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Serializer.fs"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"b833475ccfba25037de5d1091b6e8842f6992edb039c4cc0dbc7f491d99af0b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/Libs/FShade.GLSL/IntrinsicFunctions.fs:1854-1865 | src/Libs/FShade.SpirV/Assembler.fs:545-556 \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/Libs/FShade.GLSL/IntrinsicFunctions.fs"},"region":{"startLine":1854}}}],"partialFingerprints":{"codehealthFindingId/v1":"f503248104a71e1cde16fe9dc935d1ad14aeb66def70926712c3b608abcda27f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/Libs/FShade.Imperative/Utilities.fs:441-452 | src/Libs/FShade.Imperative/Utilities.fs:456-467 \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/Libs/FShade.Imperative/Utilities.fs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"69376f8caa794a5a34bf39ed7449d27aa718977a1cc5a470decdb42e6822443f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/Libs/FShade.SpirV/Assembler.fs:247-258 | src/Libs/FShade.SpirV/Assembler.fs:277-287 \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/Libs/FShade.SpirV/Assembler.fs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ef829a82c589c76b530da8cd2c2432b45f3d6553637ae01655a8ff73bd4b6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 9): src/Libs/FShade.Core/Samplers.fs:62-72 | src/Libs/FShade.Core/Samplers.fs:441-451 | src/Libs/FShade.Core/Samplers.fs:676-686 | src/Libs/FShade.Core/Samplers.fs:716-726 | src/Libs/FShade.Core/Samplers.fs:939-949 | src/Libs/FShade.Core/Samplers.fs:1103-1113 | src/Libs/FShade.Core/Samplers.fs:1143-1153 | src/Libs/FShade.Core/Samplers.fs:1366-1376 | src/Libs/FShade.Core/Samplers.fs:1530-1540 \u2014 all 9 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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e179ac8bda787733a7008910500db48ea4d831f866cd736078d0f6ca9de4b8b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 9): src/Libs/FShade.Core/Samplers.fs:298-308 | src/Libs/FShade.Core/Samplers.fs:506-516 | src/Libs/FShade.Core/Samplers.fs:599-609 | src/Libs/FShade.Core/Samplers.fs:854-864 | src/Libs/FShade.Core/Samplers.fs:1004-1014 | src/Libs/FShade.Core/Samplers.fs:1063-1073 | src/Libs/FShade.Core/Samplers.fs:1281-1291 | src/Libs/FShade.Core/Samplers.fs:1431-1441 | src/Libs/FShade.Core/Samplers.fs:1490-1500 \u2014 all 9 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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c03da33de83e629ba9fa56fb1b8f8088b9ef847e00c60102ea7ad82ea57b93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/Libs/FShade.Core/Samplers.fs:16-26 | src/Libs/FShade.Core/Samplers.fs:383-393 | src/Libs/FShade.Core/Samplers.fs:639-649 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff15a22db27e30d9a05a699de533aed20b9386a0c8c593b6e63dd77aaf514e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Libs/FShade.Core/Optimizer.fs:551-561 | src/Libs/FShade.Core/Optimizer.fs:824-834 \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/Libs/FShade.Core/Optimizer.fs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e33bbcd064e636ff52f27a0b36492441d1831fd4b4e19b97e03afd7d76005b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/Libs/FShade.Core/Serializer.fs:2159-2169 | src/Libs/FShade.Core/Serializer.fs:2175-2184 \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/Libs/FShade.Core/Serializer.fs"},"region":{"startLine":2159}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc38948b3e8cefa1257d5958a2f0ed53b2c7ce47a35f892c7c9405c2f02318c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Libs/FShade.GLSL/IntrinsicFunctions.fs:2240-2250 | src/Libs/FShade.GLSL/IntrinsicFunctions.fs:2271-2281 \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/Libs/FShade.GLSL/IntrinsicFunctions.fs"},"region":{"startLine":2240}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ce6bc4e170049cd8fbc5544b31c7319cf653f3bb5a4ef02f4b3e1ad7cf88b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/Libs/FShade.SpirV/Assembler.fs:308-318 | src/Libs/FShade.SpirV/Assembler.fs:329-338 \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/Libs/FShade.SpirV/Assembler.fs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"359b60a5922ad939f418b8487a1d275cab6baff7729e43ee14a1e0a84af29c81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/Libs/FShade.Core/Samplers.fs:17-26 | src/Libs/FShade.Core/Samplers.fs:63-72 | src/Libs/FShade.Core/Samplers.fs:717-726 | src/Libs/FShade.Core/Samplers.fs:1144-1153 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5bc9fea3b9276ba51234d97db620d1e1a7affc065a0a35dc89453f82384b70d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/Libs/FShade.Core/Samplers.fs:253-262 | src/Libs/FShade.Core/Samplers.fs:299-308 | src/Libs/FShade.Core/Samplers.fs:855-864 | src/Libs/FShade.Core/Samplers.fs:1282-1291 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"982df23f1e61182c9ca9f1224fed387bb5511c25e41f37efc5e97cd48ada2848"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/Libs/FShade.Core/Samplers.fs:566-575 | src/Libs/FShade.Core/Samplers.fs:600-609 | src/Libs/FShade.Core/Samplers.fs:1064-1073 | src/Libs/FShade.Core/Samplers.fs:1491-1500 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"05dab3c2e8d2603f7bb1c673e906d77a5f97ad5d06de2e14cf6367d9f6832a60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/Libs/FShade.Core/Samplers.fs:224-233 | src/Libs/FShade.Core/Samplers.fs:826-835 | src/Libs/FShade.Core/Samplers.fs:1253-1262 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"5810a1a1156c300290dc7f661de4637e9ffb0a6148fcb5292b09b4ff1c726fb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/Libs/FShade.Core/Samplers.fs:355-364 | src/Libs/FShade.Core/Samplers.fs:911-920 | src/Libs/FShade.Core/Samplers.fs:1338-1347 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5003746af1bbed6fbbd289ded7619ac4471b13418082a1f7c1c3c54d380385"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): src/Libs/FShade.Core/Effect.fs:499-508 | src/Libs/FShade.Core/Effect.fs:528-535 \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/Libs/FShade.Core/Effect.fs:499\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/Libs/FShade.Core/Effect.fs:535\u0060 calls \u0060ReadString\u0060 and \u0060src/Libs/FShade.Core/Effect.fs:508\u0060 does not \u2014 after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Effect.fs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2e63e60af8df285926d4fc39d8348d91a35651ab6e9ef45320e02c02e65ee3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/Libs/FShade.Core/Frontend.fs:407-416 | src/Libs/FShade.Core/Frontend.fs:485-494 \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/Libs/FShade.Core/Frontend.fs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"f026fd3e041568cfe323852d9087032642cae83b8786bba2739e4713778366bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/Libs/FShade.Core/Reflection.fs:151-160 | src/Libs/FShade.Core/Reflection.fs:192-201 \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/Libs/FShade.Core/Reflection.fs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"39216c578f8e345a8c63cc9972814bdd72304b05f3c46350f2fc704260d9458b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/Libs/FShade.GLSL/Assembler.fs:2832-2841 | src/Libs/FShade.GLSL/Assembler.fs:2844-2853 \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/Libs/FShade.GLSL/Assembler.fs"},"region":{"startLine":2832}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe02a834e78e814d2e57dfd41f80bca3b017a982a2e00eeab020e9e7a1caf54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/Libs/FShade.GLSL/UniformBufferLayout.fs:1110-1119 | src/Libs/FShade.GLSL/UniformBufferLayout.fs:1642-1651 \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/Libs/FShade.GLSL/UniformBufferLayout.fs:1642\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/Libs/FShade.GLSL/UniformBufferLayout.fs"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f673b44462996d853e5cc95a5ed9e428a830f8f06509d9671ccbb11c67d02a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 2): src/Libs/FShade.GLSL/UniformBufferLayout.fs:1118-1127 | src/Libs/FShade.GLSL/UniformBufferLayout.fs:1196-1202 \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/Libs/FShade.GLSL/UniformBufferLayout.fs"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5766886d52cf957a1b4e76e26d73a5bf90e65b3b15afcee06103a0318579eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): src/Libs/FShade.Core/Frontend.fs:31-40 | src/Libs/FShade.Core/Frontend.fs:47-56 | src/Libs/FShade.Core/Frontend.fs:66-76 | src/Libs/FShade.Core/Frontend.fs:88-96 | src/Libs/FShade.Core/Frontend.fs:111-119 | src/Libs/FShade.Core/Frontend.fs:131-140 \u2014 all 6 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/Libs/FShade.Core/Frontend.fs:58\u0060 calls \u0060PrimitiveIndex\u0060 and \u0060src/Libs/FShade.Core/Frontend.fs:42\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Frontend.fs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf267d9e2c1da007b39a76e07da5a9e2003553b00580f29705072eed41e2dbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): src/Libs/FShade.Core/Effect.fs:536-543 | src/Libs/FShade.Core/Effect.fs:1465-1473 | src/Libs/FShade.Core/Effect.fs:1525-1533 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Effect.fs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"914af7af649b7ac62b91ff975a5195be8d5ba69c72ce64985d2866825bb73f6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/Libs/FShade.GLSL/IntrinsicFunctions.fs:807-815 | src/Libs/FShade.SpirV/Assembler.fs:383-391 | src/Libs/FShade.SpirV/Assembler.fs:408-416 \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/Libs/FShade.GLSL/IntrinsicFunctions.fs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76c5d45b1de22ee2145c065bb4157c7e55fb08117ee0360ca90050419193f74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/Libs/FShade.GLSL/IntrinsicFunctions.fs:954-962 | src/Libs/FShade.SpirV/Assembler.fs:449-457 | src/Libs/FShade.SpirV/Assembler.fs:474-482 \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/Libs/FShade.GLSL/IntrinsicFunctions.fs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"437d58881ec2d71ada01f74e7b9c80e0322ff305d5e20f4d0c61fedad6fa2439"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Libs/FShade.Core/Optimizer.fs:693-701 | src/Libs/FShade.Core/Optimizer.fs:1089-1097 \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/Libs/FShade.Core/Optimizer.fs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ad756e32f4ec86e8326dcde82eff4c2a2c562670598dec50fab706d0137719"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Libs/FShade.Core/Optimizer.fs:977-985 | src/Libs/FShade.Core/Optimizer.fs:997-1005 \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/Libs/FShade.Core/Optimizer.fs"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0a8fac5ddff64c566668bbc687825cf1261e8ce361c2c7d500ee1634d3d94c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Libs/FShade.Core/Optimizer.fs:2318-2326 | src/Libs/FShade.Core/Optimizer.fs:2972-2980 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/Libs/FShade.Core/Optimizer.fs:2982\u0060 calls \u0060NewTuple\u0060 and \u0060src/Libs/FShade.Core/Optimizer.fs:2328\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Optimizer.fs"},"region":{"startLine":2318}}}],"partialFingerprints":{"codehealthFindingId/v1":"cedef898de8b64e83dd16dc1be7fe29a49a0bf69e5553c240bf2b191979b81f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Libs/FShade.Core/RaytracingEffect.fs:46-54 | src/Libs/FShade.Core/RaytracingEffect.fs:79-87 \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/Libs/FShade.Core/RaytracingEffect.fs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"8993936be7eb1d3271af9a1c6e3016cb7d6918f094f482d393c365564e87f1bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:218-226 | src/Libs/FShade.Core/Samplers.fs:290-298 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ddfac362321d03b5a78f629a7e8618e3ed29ce68d0bbb55c18afd60a5ad2cd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:349-357 | src/Libs/FShade.Core/Samplers.fs:433-441 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"2434047bed34aaae9348cad1265de0e6126946e64bda27623e251286758e0767"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:820-828 | src/Libs/FShade.Core/Samplers.fs:846-854 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"cacb8db8d8585187cafd015fca105fa59107a4efe4866dced23886fd37347981"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:905-913 | src/Libs/FShade.Core/Samplers.fs:931-939 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"63123f895f7803494d9ee652a2af14e0d0d10827d88872b23612b230a5676b2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:1247-1255 | src/Libs/FShade.Core/Samplers.fs:1273-1281 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9cd0212c1c43c782f7927cce95ead316000c393e1545208a3b68d555245b331"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:1332-1340 | src/Libs/FShade.Core/Samplers.fs:1358-1366 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf296e0010cb8efa39bbcfbef81107bf36cbf0d4222e84dfa555657275f16a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Libs/FShade.GLSL/IntrinsicFunctions.fs:615-623 | src/Libs/FShade.SpirV/Assembler.fs:302-310 \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/Libs/FShade.GLSL/IntrinsicFunctions.fs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ef3287629fd5a36710a2a23e4ecf8ab4d4853e5aa2a8f12696443fdeb40843"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Libs/FShade.Imperative/Utilities.fs:618-626 | src/Libs/FShade.Imperative/Utilities.fs:636-644 \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/Libs/FShade.Imperative/Utilities.fs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0193ae053e2d0a7862cf2fc65f8e3507be7b57244032af1765f902893d8efb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Libs/FShade.SpirV/Assembler.fs:969-977 | src/Libs/FShade.SpirV/Assembler.fs:980-988 \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/Libs/FShade.SpirV/Assembler.fs"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a7047c1e19113033c96780a0f17c381a63a7f89ba06a25b5bd81df6dc86230"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Libs/FShade.SpirV/Assembler.fs:1372-1380 | src/Libs/FShade.SpirV/Assembler.fs:1389-1397 \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/Libs/FShade.SpirV/Assembler.fs"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1545b5b1a4c5fc7b9aeebcaaff4d0dbb9c522a4cfc59bb2a8c594f3d7997da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5258-5266 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5268-5276 \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/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5258\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/Libs/FShade.SpirV/Core/SpirVInstructions.fs"},"region":{"startLine":5258}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0f3f5a8f1170923c02b4212d97bf4de727be42bd3f4629b44d6b664f903414"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 8): src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3978-3985 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4016-4023 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4054-4061 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4083-4090 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5400-5407 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5438-5445 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5476-5483 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5528-5535 \u2014 all 8 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/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3978\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/Libs/FShade.SpirV/Core/SpirVInstructions.fs"},"region":{"startLine":3978}}}],"partialFingerprints":{"codehealthFindingId/v1":"196fcc2cb507bfbf34160be3c63720cc7ac076ebce98332ff9b7ee375ad2ad43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 8): src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3997-4004 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4035-4042 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4064-4071 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4074-4081 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5419-5426 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5457-5464 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5486-5493 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5496-5503 \u2014 all 8 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/Libs/FShade.SpirV/Core/SpirVInstructions.fs"},"region":{"startLine":3997}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3d8a4150b2b622f2427ff52725f16bdec82f029c3e82ec48a75bf85d3013e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3987-3994 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4025-4032 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5409-5416 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5447-5454 \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/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3987\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/Libs/FShade.SpirV/Core/SpirVInstructions.fs"},"region":{"startLine":3987}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e50923ff40c38aa3b28d6dcb00f6d1957e6f0820bf1da550d5a17c6044a299"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/Libs/FShade.Core/ComputeShader.fs:309-317 | src/Libs/FShade.Core/RaytracingShader.fs:100-107 | src/Libs/FShade.Core/Shader.fs:4307-4314 \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 all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/ComputeShader.fs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ba925eb10290b1eb92d4a63b23c4491d83cb8a4a4c20e3a711a69bb0bd77bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/Libs/FShade.Core/Samplers.fs:2013-2020 | src/Libs/FShade.Core/Samplers.fs:2283-2290 | src/Libs/FShade.Core/Samplers.fs:2721-2728 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":2013}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97e5493aec38272f52b933cdf086255290d754e4da624fb5a29ced5ba041ee1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/Libs/FShade.Core/Samplers.fs:2064-2071 | src/Libs/FShade.Core/Samplers.fs:2382-2389 | src/Libs/FShade.Core/Samplers.fs:2820-2827 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":2064}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cfd06901fa7591a7909f55a886bfe7897233c349ce6c36daaff987e973bbb0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/Libs/FShade.Core/Samplers.fs:2341-2348 | src/Libs/FShade.Core/Samplers.fs:2536-2543 | src/Libs/FShade.Core/Samplers.fs:2584-2591 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":2341}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac7c2d143afa798989b072691dafe8b3df3b96fae2e263d65554e91d0e87c73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/Libs/FShade.Core/Samplers.fs:2779-2786 | src/Libs/FShade.Core/Samplers.fs:2974-2981 | src/Libs/FShade.Core/Samplers.fs:3022-3029 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":2779}}}],"partialFingerprints":{"codehealthFindingId/v1":"d489557d89ea1c92be1943afc18c49d9d24397596e356df79724766215d01ef6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/Libs/FShade.Core/Serializer.fs:1510-1517 | src/Libs/FShade.Core/Serializer.fs:1679-1686 | src/Libs/FShade.Core/Serializer.fs:1689-1696 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/Libs/FShade.Core/Serializer.fs:1518\u0060 calls \u0060Lambda\u0060 and \u0060src/Libs/FShade.Core/Serializer.fs:1688\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Serializer.fs"},"region":{"startLine":1510}}}],"partialFingerprints":{"codehealthFindingId/v1":"646f10b3510ab69a246d8afc0d171fcaa2c4ac105f4a3e56e766df80f0066443"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): src/Libs/FShade.GLSL/UniformBufferLayout.fs:1649-1655 | src/Libs/FShade.GLSL/UniformBufferLayout.fs:1846-1852 | src/Libs/FShade.GLSL/UniformBufferLayout.fs:1860-1867 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Libs/FShade.GLSL/UniformBufferLayout.fs:1649\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/Libs/FShade.GLSL/UniformBufferLayout.fs:1647\u0060 calls \u0060cnt\u0060 and \u0060src/Libs/FShade.GLSL/UniformBufferLayout.fs:1846\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.GLSL/UniformBufferLayout.fs"},"region":{"startLine":1649}}}],"partialFingerprints":{"codehealthFindingId/v1":"168285333397ecc55a1a608555f4f266e83391786324c66491cf9684a010e38b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5062-5069 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5259-5266 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5269-5276 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.SpirV/Core/SpirVInstructions.fs"},"region":{"startLine":5062}}}],"partialFingerprints":{"codehealthFindingId/v1":"8654535b9327551533f32d9056403e2c03ca2bc8d42d6d685c046aeafb9d4f27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/Libs/FShade.Core/Optimizer.fs:598-604 | src/Libs/FShade.Core/Optimizer.fs:990-997 \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/Libs/FShade.Core/Optimizer.fs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"68774934ea1d36644ba6db98070f13039ec79c26746353f0ae52c5232a0a0cda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Libs/FShade.Core/Optimizer.fs:2258-2265 | src/Libs/FShade.Core/Optimizer.fs:2875-2882 \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/Libs/FShade.Core/Optimizer.fs"},"region":{"startLine":2258}}}],"partialFingerprints":{"codehealthFindingId/v1":"34cbfa1ba04a03a47eea35f56dca9ecd1da312d39e01d5546c157fb7a45304be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:503-510 | src/Libs/FShade.Core/Samplers.fs:673-680 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30760fd4fc630d7383f855acbd78f424dc888c2379a6a63cdb0c7dcf88380af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:1001-1008 | src/Libs/FShade.Core/Samplers.fs:1100-1107 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d08068742d2369f712084a9307bf6c8434f99ed1c1aff79b745029e52c4c7ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:1428-1435 | src/Libs/FShade.Core/Samplers.fs:1527-1534 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":1428}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5df0dac6bc6a01b11ffdc87d640e4c5e05fbaa7b886ea7e61105d71caa5ba54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Libs/FShade.Core/Serializer.fs:1264-1271 | src/Libs/FShade.Core/Serializer.fs:1274-1281 \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/Libs/FShade.Core/Serializer.fs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6f0a76d1a4cdcc99c72c0a6fc96d201ecaff37b43264ee2621a0d09bee2725"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Libs/FShade.Core/Serializer.fs:1983-1990 | src/Libs/FShade.GLSL/UniformBufferLayout.fs:1056-1063 \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/Libs/FShade.Core/Serializer.fs"},"region":{"startLine":1983}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b0a139a79ae8f10b929e92b4b31478a4487bb77700d4cbf90e9c069ab6ec8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Libs/FShade.Core/Shader.fs:3826-3833 | src/Libs/FShade.Core/Shader.fs:3844-3851 \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/Libs/FShade.Core/Shader.fs"},"region":{"startLine":3826}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94be992ddd01237c8a1920f3b67487ff7e475af91ba5d204aa5e687445dad9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Libs/FShade.Core/Shader.fs:4469-4476 | src/Libs/FShade.Core/Shader.fs:4539-4546 \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/Libs/FShade.Core/Shader.fs"},"region":{"startLine":4469}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0043e2a888787574ff40fb61959bec83c2a8dcc99ab9dbe6cd90b277858db0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Libs/FShade.Imperative/ModuleCompiler.fs:45-52 | src/Libs/FShade.Imperative/ModuleCompiler.fs:344-351 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Imperative/ModuleCompiler.fs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa99b0abace5d3420dc1040e1cb7ff68fa801b2414637b95a8557ac21d1b72ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 35): src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3811-3817 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3922-3928 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3996-4002 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4006-4012 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4034-4040 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4044-4050 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4063-4069 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4073-4079 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4531-4537 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4741-4747 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4750-4756 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4758-4764 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5164-5170 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5173-5179 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5182-5188 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5193-5199 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5204-5210 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5213-5219 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5242-5248 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5250-5256 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5294-5300 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5303-5309 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5319-5325 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5329-5335 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5339-5345 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5348-5354 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5392-5398 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5418-5424 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5428-5434 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5456-5462 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5466-5472 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5485-5491 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5495-5501 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5561-5567 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5571-5577 \u2014 all 35 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/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3811\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/Libs/FShade.SpirV/Core/SpirVInstructions.fs"},"region":{"startLine":3811}}}],"partialFingerprints":{"codehealthFindingId/v1":"766eb71eaf7afbee0ac79613d8ea91d1d1a405a2d24980650381c5437419812c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 16): src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4857-4863 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4872-4878 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4881-4887 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4892-4898 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4903-4909 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4911-4917 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4919-4925 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4928-4934 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4937-4943 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4946-4952 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4955-4961 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4964-4970 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4973-4979 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4982-4988 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4991-4997 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5514-5520 \u2014 all 16 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/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4857\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/Libs/FShade.SpirV/Core/SpirVInstructions.fs"},"region":{"startLine":4857}}}],"partialFingerprints":{"codehealthFindingId/v1":"947e749bb083232ff3da4187bebab0e7662b4e9164e4d7e656f0830e1fdf1fa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 16): src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5100-5106 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5108-5114 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5116-5122 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5124-5130 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5132-5138 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5140-5146 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5148-5154 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5156-5162 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5647-5653 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5655-5661 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5663-5669 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5671-5677 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5679-5685 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5687-5693 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5695-5701 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5703-5709 \u2014 all 16 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/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5100\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/Libs/FShade.SpirV/Core/SpirVInstructions.fs"},"region":{"startLine":5100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c316c43033a37c9e33508e20e9b7d5d216492a0c1b862be7dcfa8665cd3351b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8): src/Libs/FShade.SpirV/Assembler.fs:1787-1793 | src/Libs/FShade.SpirV/Assembler.fs:1800-1806 | src/Libs/FShade.SpirV/Assembler.fs:1831-1837 | src/Libs/FShade.SpirV/Assembler.fs:1844-1850 | src/Libs/FShade.SpirV/Assembler.fs:1884-1890 | src/Libs/FShade.SpirV/Assembler.fs:1906-1912 | src/Libs/FShade.SpirV/Assembler.fs:1937-1943 | src/Libs/FShade.SpirV/Assembler.fs:1959-1965 \u2014 all 8 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/Libs/FShade.SpirV/Assembler.fs:1787\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/Libs/FShade.SpirV/Assembler.fs"},"region":{"startLine":1787}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f3e366a255d8136b410b43b6d403fe90b6f47188004c9d0565beddcced6a05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): src/Libs/FShade.Core/Optimizer.fs:596-602 | src/Libs/FShade.Core/Optimizer.fs:614-620 | src/Libs/FShade.Core/Optimizer.fs:988-994 | src/Libs/FShade.Core/Optimizer.fs:1008-1014 \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/Libs/FShade.Core/Optimizer.fs:596\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/Libs/FShade.Core/Optimizer.fs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9954c6923921fcfdfa3021ee32b0a5744f34376493554612f83df30d69bc290"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): src/Libs/FShade.Core/Samplers.fs:218-224 | src/Libs/FShade.Core/Samplers.fs:290-296 | src/Libs/FShade.Core/Samplers.fs:349-355 | src/Libs/FShade.Core/Samplers.fs:433-439 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b9b4c895c330385be8c3a217a51b3112df72cd90944828dd54f688f0c011e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): src/Libs/FShade.Core/Samplers.fs:820-826 | src/Libs/FShade.Core/Samplers.fs:846-852 | src/Libs/FShade.Core/Samplers.fs:905-911 | src/Libs/FShade.Core/Samplers.fs:931-937 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"a999b3e7a557bb75584606439758782f6c2321413f468993000f9f1895e98c8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): src/Libs/FShade.Core/Samplers.fs:1247-1253 | src/Libs/FShade.Core/Samplers.fs:1273-1279 | src/Libs/FShade.Core/Samplers.fs:1332-1338 | src/Libs/FShade.Core/Samplers.fs:1358-1364 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce00633343a878d95603232f6c45df43b6c233d1f3a9cc1d01a82b6988c4cfff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5061-5067 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5092-5098 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5258-5264 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5268-5274 \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/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5061\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/Libs/FShade.SpirV/Core/SpirVInstructions.fs"},"region":{"startLine":5061}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e47e11eab9a3a878f66e6a2f66f80b8f605aca971530a81b37c11287b470fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/Libs/FShade.GLSL/IntrinsicFunctions.fs:616-622 | src/Libs/FShade.SpirV/Assembler.fs:303-309 | src/Libs/FShade.SpirV/Assembler.fs:325-331 \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/Libs/FShade.GLSL/IntrinsicFunctions.fs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"de99b99267853583a230545be1c895d27a16616d978a320df32d5c39b11de79e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/Libs/FShade.GLSL/IntrinsicFunctions.fs:2242-2250 | src/Libs/FShade.GLSL/IntrinsicFunctions.fs:2275-2281 | src/Libs/FShade.GLSL/IntrinsicFunctions.fs:2294-2302 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.GLSL/IntrinsicFunctions.fs"},"region":{"startLine":2242}}}],"partialFingerprints":{"codehealthFindingId/v1":"519a40ae54661554964d53d1670d11542110ba34afd3f6ac329ba81473eddbd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Libs/FShade.Core/Optimizer.fs:587-593 | src/Libs/FShade.Core/Optimizer.fs:605-611 \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/Libs/FShade.Core/Optimizer.fs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"cccaaf2a4843d47d3720d58c99b18f0ac306f73f1965350f580c229f39aafc2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Libs/FShade.Core/Optimizer.fs:2328-2334 | src/Libs/FShade.Core/Optimizer.fs:2986-2992 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/Libs/FShade.Core/Optimizer.fs:2982\u0060 calls \u0060NewTuple\u0060 and \u0060src/Libs/FShade.Core/Optimizer.fs:2326\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Optimizer.fs"},"region":{"startLine":2328}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5106d50f0f5d9f170e9918ed7d8f954de263cda90dc4e84f77f8bcbf67bad80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:8-14 | src/Libs/FShade.Core/Samplers.fs:107-113 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a86fa534fdf9f46c0b307ead1984b81ad4804c80380c1d5262b05adb12b140"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:54-60 | src/Libs/FShade.Core/Samplers.fs:159-165 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"6572228545dfa11b28a81cb05f0693d1909b3f3c325cc6a08ac4640b1b23db6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:233-239 | src/Libs/FShade.Core/Samplers.fs:338-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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"04717ccddce5936bd47b97fdbe37c2f3c9bd9bc821aade27edff2b34f7e81cb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:244-250 | src/Libs/FShade.Core/Samplers.fs:375-381 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d835e8cc0a781ac45c216842582c6413e73bd0e3c49559aab51d26dc38fd6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:557-563 | src/Libs/FShade.Core/Samplers.fs:631-637 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69f7be296d7c60fa95bc91aaa23f5a04a182b08d4a0eff09cc5dcaa81ade588"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:591-597 | src/Libs/FShade.Core/Samplers.fs:668-674 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a1bc1bf091ef609f90eb8da1427dcf105438cd1710a0ef6c20c242eb4c16fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:708-714 | src/Libs/FShade.Core/Samplers.fs:761-767 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c46600786ad33f9273ab64837f8105c8d27a287739fdac016db146123e7cea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:835-841 | src/Libs/FShade.Core/Samplers.fs:894-900 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c04c57db286cec2814d53ccf3de218deeede3d2e4869dbf3c2aa0764c15bc82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:1055-1061 | src/Libs/FShade.Core/Samplers.fs:1095-1101 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"a030158aa24723bed3f798530a4e72e20d393b03de2d6e1fbed9f92d5b04fb3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:1135-1141 | src/Libs/FShade.Core/Samplers.fs:1188-1194 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b94a9febe1829437f79f4ba5c190fcf34799a55d3997eb6fd8b7926fcfaac88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:1262-1268 | src/Libs/FShade.Core/Samplers.fs:1321-1327 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"323dd811c5c7178d2bbedbb6f9b9857a2815d06232d450ac26732175e28810b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:1482-1488 | src/Libs/FShade.Core/Samplers.fs:1522-1528 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc404d57712ebf19c51ba92d2f07bdae6f1d499d1346c752035b6ff5239e3a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Libs/FShade.Core/Shader.fs:2602-2608 | src/Libs/FShade.Core/Shader.fs:2613-2619 \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/Libs/FShade.Core/Shader.fs"},"region":{"startLine":2602}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d95dc711e24bcdf2181a9611008f32392b283f91529835b9f4cc6fd6b8c386"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Libs/FShade.GLSL/Assembler.fs:593-599 | src/Libs/FShade.GLSL/Assembler.fs:629-635 \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/Libs/FShade.GLSL/Assembler.fs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e003a9c239bfcc4c65bf9b51e1f4d7d529fc192136033504f9056a02417ff67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Libs/FShade.SpirV/Assembler.fs:1309-1315 | src/Libs/FShade.SpirV/Assembler.fs:1320-1326 \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/Libs/FShade.SpirV/Assembler.fs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ea77f1fee3585ab99dd103be91a496dd428a4ac9b59b611a6ef5f8dc871e94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5278-5284 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5286-5292 \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/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5278\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/Libs/FShade.SpirV/Core/SpirVInstructions.fs"},"region":{"startLine":5278}}}],"partialFingerprints":{"codehealthFindingId/v1":"2092252e4b19f852292e9d65395df36da75d2e787ad6ca4b7b14f756218e1935"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 65): src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3915-3920 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3971-3976 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4118-4123 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4131-4136 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4259-4264 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4266-4271 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4273-4278 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4280-4285 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4287-4292 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4294-4299 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4301-4306 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4308-4313 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4315-4320 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4322-4327 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4329-4334 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4336-4341 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4343-4348 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4350-4355 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4357-4362 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4364-4369 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4371-4376 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4378-4383 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4385-4390 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4392-4397 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4399-4404 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4406-4411 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4413-4418 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4420-4425 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4427-4432 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4476-4481 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4483-4488 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4490-4495 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4497-4502 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4504-4509 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4511-4516 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4518-4523 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4539-4544 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4546-4551 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4553-4558 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4560-4565 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4567-4572 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4574-4579 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4581-4586 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4588-4593 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4595-4600 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4602-4607 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4609-4614 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4616-4621 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4623-4628 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4630-4635 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4637-4642 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4644-4649 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4651-4656 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4658-4663 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4665-4670 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4672-4677 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4679-4684 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4686-4691 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4693-4698 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4700-4705 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4707-4712 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4714-4719 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4721-4726 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4728-4733 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5640-5645 \u2014 all 65 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/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3915\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/Libs/FShade.SpirV/Core/SpirVInstructions.fs"},"region":{"startLine":3915}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2678315fa42c81eab7ff6dcd7187ea3bebcb70a4e6ff90f21e34591628e7e02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 62): src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3811-3816 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3859-3864 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3922-3927 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3951-3956 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3978-3983 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4266-4271 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4273-4278 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4280-4285 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4287-4292 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4294-4299 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4301-4306 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4308-4313 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4315-4320 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4322-4327 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4329-4334 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4336-4341 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4343-4348 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4350-4355 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4357-4362 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4364-4369 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4371-4376 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4378-4383 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4385-4390 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4392-4397 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4399-4404 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4406-4411 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4413-4418 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4420-4425 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4427-4432 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4483-4488 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4490-4495 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4497-4502 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4504-4509 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4511-4516 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4518-4523 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4546-4551 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4553-4558 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4560-4565 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4567-4572 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4574-4579 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4581-4586 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4588-4593 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4595-4600 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4602-4607 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4609-4614 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4616-4621 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4623-4628 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4630-4635 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4637-4642 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4644-4649 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4651-4656 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4658-4663 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4665-4670 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4672-4677 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4679-4684 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4686-4691 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4693-4698 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4700-4705 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4707-4712 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4714-4719 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4721-4726 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4728-4733 \u2014 all 62 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/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3811\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/Libs/FShade.SpirV/Core/SpirVInstructions.fs"},"region":{"startLine":3811}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6db9440931ec2083a1840158a404249b3503b79db00fcdd004602b37d9b12df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 40): src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3930-3935 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3987-3992 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3996-4001 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4006-4011 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4016-4021 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4025-4030 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4034-4039 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4044-4049 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4054-4059 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4063-4068 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4073-4078 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4083-4088 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4539-4544 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4750-4755 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4758-4763 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5164-5169 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5173-5178 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5182-5187 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5193-5198 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5204-5209 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5213-5218 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5250-5255 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5294-5299 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5303-5308 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5319-5324 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5329-5334 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5339-5344 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5348-5353 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5400-5405 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5409-5414 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5418-5423 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5428-5433 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5438-5443 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5447-5452 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5456-5461 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5466-5471 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5476-5481 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5485-5490 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5495-5500 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5571-5576 \u2014 all 40 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/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3930\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4012\u0060 calls \u0060ReadIdRef\u0060 and \u0060src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3993\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.SpirV/Core/SpirVInstructions.fs"},"region":{"startLine":3930}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee3573f00ddb5517b8dfac7194e71c2f913432b9c12759cdfc616508905afb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 39): src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3811-3816 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3922-3927 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3987-3992 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3996-4001 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4006-4011 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4025-4030 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4034-4039 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4044-4049 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4063-4068 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4073-4078 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4531-4536 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4741-4746 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4750-4755 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4758-4763 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5164-5169 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5173-5178 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5182-5187 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5193-5198 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5204-5209 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5213-5218 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5242-5247 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5250-5255 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5294-5299 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5303-5308 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5319-5324 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5329-5334 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5339-5344 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5348-5353 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5392-5397 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5409-5414 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5418-5423 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5428-5433 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5447-5452 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5456-5461 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5466-5471 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5485-5490 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5495-5500 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5561-5566 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5571-5576 \u2014 all 39 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/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3811\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4012\u0060 calls \u0060ReadIdRef\u0060 and \u0060src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3993\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.SpirV/Core/SpirVInstructions.fs"},"region":{"startLine":3811}}}],"partialFingerprints":{"codehealthFindingId/v1":"66cdeb1b048a155528edbb51edac8ba1b8a5055aa11d9893b047606bc0e15b6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 12): src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3859-3864 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3880-3885 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3930-3935 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3951-3956 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3978-3983 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4016-4021 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4054-4059 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4083-4088 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5400-5405 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5438-5443 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5476-5481 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5528-5533 \u2014 all 12 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/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3859\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/Libs/FShade.SpirV/Core/SpirVInstructions.fs"},"region":{"startLine":3859}}}],"partialFingerprints":{"codehealthFindingId/v1":"151b037039170fa4dd6f8f1354063cb2018c1e57ea419cdb7f0cc9fb3cc8d391"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): src/Libs/FShade.GLSL/IntrinsicFunctions.fs:846-851 | src/Libs/FShade.GLSL/IntrinsicFunctions.fs:854-859 | src/Libs/FShade.GLSL/IntrinsicFunctions.fs:862-867 | src/Libs/FShade.GLSL/IntrinsicFunctions.fs:870-875 | src/Libs/FShade.GLSL/IntrinsicFunctions.fs:878-883 | src/Libs/FShade.GLSL/IntrinsicFunctions.fs:886-891 \u2014 all 6 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/Libs/FShade.GLSL/IntrinsicFunctions.fs:846\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/Libs/FShade.GLSL/IntrinsicFunctions.fs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c3708811766984b7b9377645ceb02c18dcdf20845c1fba8c4945bbecbb402f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): src/Libs/FShade.GLSL/IntrinsicFunctions.fs:993-998 | src/Libs/FShade.GLSL/IntrinsicFunctions.fs:1001-1006 | src/Libs/FShade.GLSL/IntrinsicFunctions.fs:1009-1014 | src/Libs/FShade.GLSL/IntrinsicFunctions.fs:1017-1022 | src/Libs/FShade.GLSL/IntrinsicFunctions.fs:1025-1030 | src/Libs/FShade.GLSL/IntrinsicFunctions.fs:1033-1038 \u2014 all 6 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/Libs/FShade.GLSL/IntrinsicFunctions.fs:993\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/Libs/FShade.GLSL/IntrinsicFunctions.fs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe1a57f63ab7ad3dd4439016856e7aeca37e63a5218deb1a29e1d0c414ef3f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): src/Libs/FShade.Core/Effect.fs:509-514 | src/Libs/FShade.Core/Effect.fs:537-542 | src/Libs/FShade.Core/Effect.fs:1466-1472 | src/Libs/FShade.Core/Effect.fs:1526-1532 \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/Libs/FShade.Core/Effect.fs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d586cba3dade3266257eff7518df0a74c34efae778c857ae9be737fd7564c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): src/Libs/FShade.GLSL/IntrinsicFunctions.fs:808-813 | src/Libs/FShade.SpirV/Assembler.fs:384-389 | src/Libs/FShade.SpirV/Assembler.fs:409-414 | src/Libs/FShade.SpirV/Assembler.fs:426-431 \u2014 there are 4 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 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.GLSL/IntrinsicFunctions.fs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7e510a07090109e51a720db405deba8ffccbb096ed97438b4e7ccd57861d40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): src/Libs/FShade.GLSL/IntrinsicFunctions.fs:955-960 | src/Libs/FShade.SpirV/Assembler.fs:450-455 | src/Libs/FShade.SpirV/Assembler.fs:475-480 | src/Libs/FShade.SpirV/Assembler.fs:492-497 \u2014 there are 4 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 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.GLSL/IntrinsicFunctions.fs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d4b690be622f26cf2de13dd449941b14f8fcebf7cbf93189b7b936f14b0ec6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/Libs/FShade.Core/Raytracing.fs:56-61 | src/Libs/FShade.Core/Raytracing.fs:99-104 | src/Libs/FShade.Core/Raytracing.fs:143-148 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Raytracing.fs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca4c7ce90d5d6cebd53ad902966eb8bb3c175e5ac79cc12252a0e3dcb156f34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/Libs/FShade.Core/Serializer.fs:806-811 | src/Libs/FShade.Core/Serializer.fs:1537-1542 | src/Libs/FShade.Core/Serializer.fs:1564-1569 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Libs/FShade.Core/Serializer.fs:806\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/Libs/FShade.Core/Serializer.fs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"3026c7ce7df08542f6aa529d43d853270252eb5b82d9e842f6dc4eb3d96beda5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3797-3802 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3845-3850 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3852-3857 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3797\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/Libs/FShade.SpirV/Core/SpirVInstructions.fs"},"region":{"startLine":3797}}}],"partialFingerprints":{"codehealthFindingId/v1":"48330090d72129f273e2f5b677d8f6bebb19b1f05dcab20a656138d29c669125"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Libs/FShade.Core/Effect.fs:719-724 | src/Libs/FShade.Core/Effect.fs:760-765 \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/Libs/FShade.Core/Effect.fs:719\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Effect.fs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdbb39245ff539daed66ea25324dcd03dfa14957c258664ba72e7e1a0f471918"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): src/Libs/FShade.Core/Optimizer.fs:589-593 | src/Libs/FShade.Core/Optimizer.fs:981-986 \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/Libs/FShade.Core/Optimizer.fs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"495827ce3aed1f6ea931b7fe0f3ee13fd633eed56d82c12225d81f8e26a14e5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): src/Libs/FShade.Core/Optimizer.fs:607-611 | src/Libs/FShade.Core/Optimizer.fs:1001-1006 \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/Libs/FShade.Core/Optimizer.fs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b97f6af2cec907759d37f904777c307d80fccfb617e0367564e0b414678694a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:2009-2014 | src/Libs/FShade.Core/Samplers.fs:2036-2041 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":2009}}}],"partialFingerprints":{"codehealthFindingId/v1":"38837fb2978b266757b6a68f7a22a29bfaeff2ecc95bfd0cf501269f8878d809"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:2060-2065 | src/Libs/FShade.Core/Samplers.fs:2087-2092 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":2060}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c10873f94fc5987b6133b3bffc741e85def3327637bae7fb4e392d5a9e9660a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:2279-2284 | src/Libs/FShade.Core/Samplers.fs:2330-2335 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":2279}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45e9d9f7796957bb810bfa4f6428cc5b5c8c987efd6595233027039abbf2904"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:2378-2383 | src/Libs/FShade.Core/Samplers.fs:2429-2434 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":2378}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e2795eb11ceb9e24d3ae6f7400c9680f93be2c5c72107a1be7efcd3defac44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:2717-2722 | src/Libs/FShade.Core/Samplers.fs:2768-2773 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":2717}}}],"partialFingerprints":{"codehealthFindingId/v1":"a365665493e64c84fc2073850b43aabbad0b6fe6eebc9433022eb8631b730970"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:2816-2821 | src/Libs/FShade.Core/Samplers.fs:2867-2872 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":2816}}}],"partialFingerprints":{"codehealthFindingId/v1":"019f3125c4c9bac3ec6359ad1995a42cecf8ce3740c4b36919507ea139b4e315"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Libs/FShade.Core/Shader.fs:2878-2883 | src/Libs/FShade.Core/Shader.fs:2907-2912 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/Libs/FShade.Core/Shader.fs:2885\u0060 calls \u0060CallFunction\u0060, \u0060fold\u0060, \u0060m\u0060 and \u0060src/Libs/FShade.Core/Shader.fs:2915\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Shader.fs"},"region":{"startLine":2878}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fef48a4e2bdc6e6189694f367e235ccdfa0293dfe7d518f5599a2af842aea0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Libs/FShade.Imperative/Compiler.fs:75-80 | src/Libs/FShade.Imperative/UtilityFunction.fs:71-76 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Imperative/Compiler.fs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"b425407a0ed2e09a3dbca211dfc4a30a910e46db4a368123727f37372ee19726"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Libs/FShade.Imperative/Compiler.fs:686-691 | src/Libs/FShade.Imperative/Compiler.fs:708-713 \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/Libs/FShade.Imperative/Compiler.fs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d71f1622d88e2c744110f4102278517b2f54103bbf2e942a9a0165fd53f3b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5078-5083 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5085-5090 \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/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5078\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/Libs/FShade.SpirV/Core/SpirVInstructions.fs"},"region":{"startLine":5078}}}],"partialFingerprints":{"codehealthFindingId/v1":"54888dea6a5674bed32654eb8c2b4d06b4f1c7bc495396ac920fe2435ad324f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5085-5090 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5092-5097 \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/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5085\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/Libs/FShade.SpirV/Core/SpirVInstructions.fs"},"region":{"startLine":5085}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f94f4c60c88d481e74a4aa913f5fa570619d3e5d4de75c9fb82f9ab1ea8a963"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5222-5227 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5229-5234 \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/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5222\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/Libs/FShade.SpirV/Core/SpirVInstructions.fs"},"region":{"startLine":5222}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb3c545f1ad1a8050bbcfecb102565fd79e500aa321c73b9c5c8a49c0d69f62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5957-5962 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:6226-6231 \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/Libs/FShade.SpirV/Core/SpirVInstructions.fs"},"region":{"startLine":5957}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e5f9ee0c8c4d6eefdddfdf6f423e7f6ca7323560597bedaafca2959c58b2d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 25): src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3987-3991 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3996-4000 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4025-4029 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4034-4038 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4063-4067 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4750-4754 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4881-4885 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4928-4932 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4937-4941 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4946-4950 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4955-4959 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4964-4968 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4973-4977 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4982-4986 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4991-4995 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5173-5177 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5182-5186 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5213-5217 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5303-5307 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5348-5352 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5409-5413 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5418-5422 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5447-5451 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5456-5460 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5485-5489 \u2014 all 25 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/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3987\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4886\u0060 calls \u0060ReadIdScope\u0060, \u0060ReadIdMemorySemantics\u0060 and \u0060src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4001\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.SpirV/Core/SpirVInstructions.fs"},"region":{"startLine":3987}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e6c2d2698f78d32632aa61d07d393b9fc98154e67f3b3b2b239244a2d2d7e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 19): src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4006-4010 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4016-4020 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4044-4048 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4054-4058 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4073-4077 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4083-4087 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4892-4896 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4903-4907 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5193-5197 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5204-5208 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5319-5323 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5329-5333 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5339-5343 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5428-5432 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5438-5442 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5466-5470 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5476-5480 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5495-5499 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5571-5575 \u2014 all 19 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/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4006\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4897\u0060 calls \u0060ReadIdScope\u0060, \u0060ReadIdMemorySemantics\u0060 and \u0060src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4011\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.SpirV/Core/SpirVInstructions.fs"},"region":{"startLine":4006}}}],"partialFingerprints":{"codehealthFindingId/v1":"4965d0d43bad285d24ca7d188a3ec475b6a24bf0fd44b9623271e534e5102094"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): src/Libs/FShade.Core/Serializer.fs:808-812 | src/Libs/FShade.Core/Serializer.fs:1396-1400 | src/Libs/FShade.Core/Serializer.fs:1510-1515 | src/Libs/FShade.Core/Serializer.fs:1679-1684 | src/Libs/FShade.Core/Serializer.fs:1689-1694 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Core/Serializer.fs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c81202c10287c9098fe31938c2af148d3d92c27d7095a1c1af5f8fbb732ae9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): src/Libs/FShade.Core/Samplers.fs:2009-2013 | src/Libs/FShade.Core/Samplers.fs:2036-2040 | src/Libs/FShade.Core/Samplers.fs:2060-2064 | src/Libs/FShade.Core/Samplers.fs:2087-2091 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":2009}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e2002579cebe4755698885a38acf232284d5db6aab8407fb3e629e7cb85b4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): src/Libs/FShade.Core/Samplers.fs:2279-2283 | src/Libs/FShade.Core/Samplers.fs:2330-2334 | src/Libs/FShade.Core/Samplers.fs:2378-2382 | src/Libs/FShade.Core/Samplers.fs:2429-2433 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":2279}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea96369b1e2b004b2d2baf37090a52fcb51d5f68acf525ef65ababc35495d94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): src/Libs/FShade.Core/Samplers.fs:2717-2721 | src/Libs/FShade.Core/Samplers.fs:2768-2772 | src/Libs/FShade.Core/Samplers.fs:2816-2820 | src/Libs/FShade.Core/Samplers.fs:2867-2871 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":2717}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e886bd354a30b5141017bb24e9b15f0294188eaa7f80b3d243aeba727ed1ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3959-3963 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4100-4104 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:4766-4770 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5555-5559 \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/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3959\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/Libs/FShade.SpirV/Core/SpirVInstructions.fs"},"region":{"startLine":3959}}}],"partialFingerprints":{"codehealthFindingId/v1":"551796949f58e2669e867d7b7fa9f6432226a6828ac05a3bc8704e81b41a5ee6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/Libs/FShade.GLSL/IntrinsicFunctions.fs:596-600 | src/Libs/FShade.SpirV/Assembler.fs:253-257 | src/Libs/FShade.SpirV/Assembler.fs:282-286 \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/Libs/FShade.GLSL/IntrinsicFunctions.fs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9f7a8aa0192951b919f72f876c494ff7f523f0c4c28db454020773f60efb4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Libs/FShade.Core/Frontend.fs:250-254 | src/Libs/FShade.Core/Frontend.fs:258-262 \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/Libs/FShade.Core/Frontend.fs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae9f7198e16625782484ab5beb1836c188feea98978dbb309a436732e99c29e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:1961-1965 | src/Libs/FShade.Core/Samplers.fs:1985-1989 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":1961}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d09e4321a4faff7478e7a8b6e93faa13562ba039b298d6b17514709e4da48d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:2135-2139 | src/Libs/FShade.Core/Samplers.fs:2159-2163 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":2135}}}],"partialFingerprints":{"codehealthFindingId/v1":"39bc3039e8dab7684424c503a2aa15a720d1417cd884baec3ff5b357473e989f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:2183-2187 | src/Libs/FShade.Core/Samplers.fs:2231-2235 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":2183}}}],"partialFingerprints":{"codehealthFindingId/v1":"544fa2345745f6eb6a0580a3562bf6df0173a28bd87d0f7b1454b28f43f554d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:2525-2529 | src/Libs/FShade.Core/Samplers.fs:2573-2577 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":2525}}}],"partialFingerprints":{"codehealthFindingId/v1":"2621efe2f9ecf567b55596da4e81e1bed38e15a748abad2cb6fb2f18a3e65404"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:2621-2625 | src/Libs/FShade.Core/Samplers.fs:2669-2673 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":2621}}}],"partialFingerprints":{"codehealthFindingId/v1":"0387a441da79a68fc3bb1a425f39b1f78cc03734f96e452f16fb26eaa9f31cc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:2963-2967 | src/Libs/FShade.Core/Samplers.fs:3011-3015 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":2963}}}],"partialFingerprints":{"codehealthFindingId/v1":"e832d0d0b40475fabeee23ffd8bd30a4b5e4e5dcc075e02a62258ff0559b5aa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Libs/FShade.Core/Serializer.fs:1348-1352 | src/Libs/FShade.Core/Serializer.fs:1429-1433 \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/Libs/FShade.Core/Serializer.fs"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b67669a69b393430ebf50657821e0841f9cfbf1b3936ea8060ef296a735065c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Libs/FShade.Imperative/Compiler.fs:2175-2179 | src/Libs/FShade.Imperative/Compiler.fs:2190-2194 \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/Libs/FShade.Imperative/Compiler.fs:2175\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/Libs/FShade.Imperative/Compiler.fs"},"region":{"startLine":2175}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71b9340c336c7d59ea2ee4c36539e4e57e3551cfb55a913cef77f0967a67ad6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3735-3739 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3770-3774 \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/Libs/FShade.SpirV/Core/SpirVInstructions.fs:3735\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/Libs/FShade.SpirV/Core/SpirVInstructions.fs"},"region":{"startLine":3735}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2d609144f9d11948b3a0093f527f3308f2185ff9a96101e6b9e906a5dbc20d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5505-5509 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5537-5541 \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/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5505\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/Libs/FShade.SpirV/Core/SpirVInstructions.fs"},"region":{"startLine":5505}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69b1217853c025d707745b54075dafb25efa9eb308077d47cc2bd284a0d07a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5727-5731 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5992-5996 \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/Libs/FShade.SpirV/Core/SpirVInstructions.fs"},"region":{"startLine":5727}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6bd5be7552a4b73f8affed3759561259d467448148faeda5281bc35eff4a18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/Libs/FShade.GLSL/IntrinsicFunctions.fs:200-207 | src/Libs/FShade.GLSL/IntrinsicFunctions.fs:214-221 | src/Libs/FShade.GLSL/IntrinsicFunctions.fs:226-233 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Libs/FShade.GLSL/IntrinsicFunctions.fs:200\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/Libs/FShade.GLSL/IntrinsicFunctions.fs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"2523b742d355c13d751249c052cc0c9f7310a3677a69c6ee94b5845370e17237"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Libs/FShade.GLSL/IntrinsicFunctions.fs:1414-1421 | src/Libs/FShade.GLSL/IntrinsicFunctions.fs:1448-1455 \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/Libs/FShade.GLSL/IntrinsicFunctions.fs:1414\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/Libs/FShade.GLSL/IntrinsicFunctions.fs"},"region":{"startLine":1414}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae79dfd710e3c214ccbb6a839b9497db6e8ac70fa42a69caddaeadd95ee3ccf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): src/Libs/FShade.Core/Samplers.fs:2341-2348 | src/Libs/FShade.Core/Samplers.fs:2392-2399 | src/Libs/FShade.Core/Samplers.fs:2536-2543 | src/Libs/FShade.Core/Samplers.fs:2584-2591 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":2341}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6cc755186ee37076d40e1c6bc213540c298675435b43db5edf295605a241fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): src/Libs/FShade.Core/Samplers.fs:2779-2786 | src/Libs/FShade.Core/Samplers.fs:2830-2837 | src/Libs/FShade.Core/Samplers.fs:2974-2981 | src/Libs/FShade.Core/Samplers.fs:3022-3029 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":2779}}}],"partialFingerprints":{"codehealthFindingId/v1":"466fc1716df5a1ca5f27e563a955e51148866653f85801367f72aab850b6583f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Libs/FShade.Core/Shader.fs:812-818 | src/Libs/FShade.Core/Shader.fs:824-830 \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/Libs/FShade.Core/Shader.fs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"c172934c1f45d676403fadc5047b344f02d35a356936a09d8ab6a41f89e3d55c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Libs/FShade.Imperative/Compiler.fs:631-637 | src/Libs/FShade.Imperative/Compiler.fs:640-646 \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/Libs/FShade.Imperative/Compiler.fs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"273797af3c4386b71ce1532e6e8eb59238791c74162e32a77e64f034238c224b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): src/Libs/FShade.GLSL/IntrinsicFunctions.fs:1419-1425 | src/Libs/FShade.GLSL/IntrinsicFunctions.fs:1427-1433 | src/Libs/FShade.GLSL/IntrinsicFunctions.fs:1453-1459 | src/Libs/FShade.GLSL/IntrinsicFunctions.fs:1461-1467 \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/Libs/FShade.GLSL/IntrinsicFunctions.fs:1419\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/Libs/FShade.GLSL/IntrinsicFunctions.fs"},"region":{"startLine":1419}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95309a2ccc91a99f44ffc0c23a5f0f9a7c8d2733034ab4fedf1078fd626df1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): src/Libs/FShade.GLSL/IntrinsicFunctions.fs:1403-1408 | src/Libs/FShade.GLSL/IntrinsicFunctions.fs:1411-1416 | src/Libs/FShade.GLSL/IntrinsicFunctions.fs:1437-1442 | src/Libs/FShade.GLSL/IntrinsicFunctions.fs:1445-1450 \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/Libs/FShade.GLSL/IntrinsicFunctions.fs:1403\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/Libs/FShade.GLSL/IntrinsicFunctions.fs"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c16d0db43120ee30e9498f861437857e46d090e92dec2ad14356768ed794bb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Libs/FShade.GLSL/Assembler.fs:1400-1404 | src/Libs/FShade.GLSL/Assembler.fs:1405-1409 \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/Libs/FShade.GLSL/Assembler.fs"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7fc1e893bdfdc6e26c530faf738a7c065adce3c427e35545dc5213d7fbbec8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:923-927 | src/Libs/FShade.Core/Samplers.fs:988-992 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"5514c6a2a15ef746b59455ec27627a3cbc68c20de2f5007f2cdb612cdb22b267"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:1350-1354 | src/Libs/FShade.Core/Samplers.fs:1415-1419 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3fb7644c1fbb8c7d046f36e2be01ab58f9c298582732fbd02f4126357a99ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): src/Libs/FShade.Core/Shader.fs:1356-1360 | src/Libs/FShade.Core/Shader.fs:1365-1369 | src/Libs/FShade.Core/Shader.fs:1374-1378 | src/Libs/FShade.Core/Shader.fs:1383-1387 \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/Libs/FShade.Core/Shader.fs"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8369cc179292e33f3999c86fa66f8f0296f2a9b26cb5fd79a4119f25b4fbfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Libs/FShade.Core/Samplers.fs:367-371 | src/Libs/FShade.Core/Samplers.fs:490-494 \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/Libs/FShade.Core/Samplers.fs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"566309dc1ef20b041aeb1764e41f1dd6f122047e117f650b2f28395dfa619516"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Libs/FShade.Core/Effect.fs:1172-1177 | src/Libs/FShade.Core/Effect.fs:1183-1188 \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/Libs/FShade.Core/Effect.fs"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"c865c50e56e7d812ac3c7e9145e140cb018ab6651a497b60a16d7aec1c4f9483"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): src/Libs/FShade.Core/Raytracing.fs:261-267 | src/Libs/FShade.Core/Raytracing.fs:304-310 | src/Libs/FShade.Core/RaytracingSER.fs:103-109 | src/Libs/FShade.Core/RaytracingSER.fs:148-154 \u2014 there are 4 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 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Libs/FShade.Core/Raytracing.fs:261\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/Libs/FShade.Core/Raytracing.fs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"425697cb31a5891ce00177db126e3b0b414048d6b3478ba7462c5451decb6c0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Libs/FShade.Core/RaytracingSER.fs:194-198 | src/Libs/FShade.Core/RaytracingSER.fs:238-242 \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/Libs/FShade.Core/RaytracingSER.fs:194\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/Libs/FShade.Core/RaytracingSER.fs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"2450d9a6ae58d7654aeb2117445f067dd5654d25d4622d5b1afad778e93ed3cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Libs/FShade.GLSL/IntrinsicFunctions.fs:1957-1962 | src/Libs/FShade.SpirV/Assembler.fs:597-602 \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/Libs/FShade.GLSL/IntrinsicFunctions.fs"},"region":{"startLine":1957}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df6dbb64c532d7e4824cb0ad6177be613490754d7d812e4cd9e6ad557fc6abf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Libs/FShade.GLSL/IntrinsicFunctions.fs:1973-1979 | src/Libs/FShade.SpirV/Assembler.fs:608-614 \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/Libs/FShade.GLSL/IntrinsicFunctions.fs"},"region":{"startLine":1973}}}],"partialFingerprints":{"codehealthFindingId/v1":"b06d867428a12795ad71c07c1d5ec760f850b5cb1fe7f12397c17fe590eff701"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Libs/FShade.Imperative/Compiler.fs:599-604 | src/Libs/FShade.Imperative/Compiler.fs:609-614 \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/Libs/FShade.Imperative/Compiler.fs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3165873d060dea18cd50542e7d67ae25b5173b4cfa1c323ba7385c872151b0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/Libs/FShade.Imperative/Compiler.fs:667-671 | src/Libs/FShade.Imperative/Compiler.fs:672-676 | src/Libs/FShade.Imperative/Compiler.fs:677-681 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Libs/FShade.Imperative/Compiler.fs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f88971a8333d95f15b1d53b848ed9f1a639075bf8a272e4822a0db039e6afc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Libs/FShade.Imperative/Utilities.fs:937-944 | src/Libs/FShade.Imperative/Utilities.fs:947-954 \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/Libs/FShade.Imperative/Utilities.fs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"28011d16aa9af5d36a970eb723ca044a8f40d25e66a686ad1ce3dc609cb71a59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (147 lines \u00D7 2): src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5745-5891 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:6011-6157 \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/Libs/FShade.SpirV/Core/SpirVInstructions.fs"},"region":{"startLine":5745}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82e65f2595ee1d7bfe5ea86f9dc74f72d33640544df812cd362a87a41d786c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 2): src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:5892-5939 | src/Libs/FShade.SpirV/Core/SpirVInstructions.fs:6159-6206 \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/Libs/FShade.SpirV/Core/SpirVInstructions.fs"},"region":{"startLine":5892}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef06927bdd0ead1675351e104b08e356dd21a8408d57188470721f1308173f3"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 no coverage collector is wired up: Coverage NOT MEASURED: \u0060--collect:\u0022XPlat Code Coverage\u0022\u0060 names a data collector that ships in the \u0060coverlet.collector\u0060 package, and this repository wires up none \u2014 no test project references it and no runsettings declares one. The absence of coverage here is therefore not evidence about the suite or about our analyzer environment: without a collector, \u0060--collect\u0060 produces nothing even from a suite that builds and passes. Add a \u0060coverlet.collector\u0060 PackageReference to the test project(s) (or commit the Cobertura/OpenCover/lcov report your CI produces) and real coverage will be measured. It is excluded from the score rather than counted as a near-zero defect."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Libs/FShade.Core/Shader.fs: src/Libs/FShade.Core/Shader.fs changed 11 times in last 90 days, max cyclomatic complexity 126 in Preprocessor.preprocessNormalS at line 1865. 4 of those changes were fix/bug commits, and the other 7 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-25..2026-09-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-25 10:58:58 \u002B02:00\u0027 --until=\u00272026-09-23 10:58:58 \u002B02:00\u0027 --full-history --no-merges -- src/Libs/FShade.Core/Shader.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/Libs/FShade.Core/Shader.fs"},"region":{"startLine":1865}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5d86747c3b7fdf628a08442895311fb03bcc69d9e2860cf4d2d861084e6bad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Libs/FShade.Core/Optimizer.fs: src/Libs/FShade.Core/Optimizer.fs changed 8 times in last 90 days, max cyclomatic complexity 123 in ConstantFolding.evaluateConstantsS at line 1627. 4 of those changes were fix/bug commits, and the other 4 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-25..2026-09-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-25 10:58:58 \u002B02:00\u0027 --until=\u00272026-09-23 10:58:58 \u002B02:00\u0027 --full-history --no-merges -- src/Libs/FShade.Core/Optimizer.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/Libs/FShade.Core/Optimizer.fs"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1e28ed17cff2ba872c369ed3843afb8734881986dd5a307436073f8c14ecfb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Libs/FShade.Imperative/Compiler.fs: src/Libs/FShade.Imperative/Compiler.fs changed 6 times in last 90 days, max cyclomatic complexity 148 in HelpersModule.tryGetBuiltInMethod at line 507. 2 of those changes were fix/bug commits, and the other 4 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-25..2026-09-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-25 10:58:58 \u002B02:00\u0027 --until=\u00272026-09-23 10:58:58 \u002B02:00\u0027 --full-history --no-merges -- src/Libs/FShade.Imperative/Compiler.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/Libs/FShade.Imperative/Compiler.fs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee32a48bb8f5d449c945ce091d2497e4c34c300b434784166639be81c8813383"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Libs/FShade.GLSL/Assembler.fs: src/Libs/FShade.GLSL/Assembler.fs changed 9 times in last 90 days, max cyclomatic complexity 95 in Assembler.assembleExprS at line 1554. 4 of those changes were fix/bug commits, and the other 5 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-25..2026-09-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-25 10:58:58 \u002B02:00\u0027 --until=\u00272026-09-23 10:58:58 \u002B02:00\u0027 --full-history --no-merges -- src/Libs/FShade.GLSL/Assembler.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/Libs/FShade.GLSL/Assembler.fs"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef2960397ff1d642dd5aba373b2d77d1131628c8599faf6723bb44532ac9457"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Libs/FShade.Imperative/Utilities.fs: src/Libs/FShade.Imperative/Utilities.fs changed 5 times in last 90 days, max cyclomatic complexity 38 in ExprExtensions.Expr.TryEval.Static at line 718. 3 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-25..2026-09-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-25 10:58:58 \u002B02:00\u0027 --until=\u00272026-09-23 10:58:58 \u002B02:00\u0027 --full-history --no-merges -- src/Libs/FShade.Imperative/Utilities.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/Libs/FShade.Imperative/Utilities.fs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b0b8b5dbae3e43511519b6de7f7789667bed918e839fb6125a767b8101ec06"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Libs/FShade.Core/ComputeShader.fs: src/Libs/FShade.Core/ComputeShader.fs changed 5 times in last 90 days, max cyclomatic complexity 22 in ComputeShaderModule.ofExprInternal at line 93. 2 of those changes were fix/bug commits, and the other 3 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-25..2026-09-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-25 10:58:58 \u002B02:00\u0027 --until=\u00272026-09-23 10:58:58 \u002B02:00\u0027 --full-history --no-merges -- src/Libs/FShade.Core/ComputeShader.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/Libs/FShade.Core/ComputeShader.fs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b81a112b879c6dc512947f273617e224e4f38db862bb654ef3077363ccd9f51"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Libs/FShade.GLSL/UniformBufferLayout.fs: src/Libs/FShade.GLSL/UniformBufferLayout.fs changed 2 times in last 90 days, max cyclomatic complexity 36 in GLSLShaderInterfaceModule.serializeInternal at line 1015. 1 of those changes was a fix/bug commit, and the other 1 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-25..2026-09-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-25 10:58:58 \u002B02:00\u0027 --until=\u00272026-09-23 10:58:58 \u002B02:00\u0027 --full-history --no-merges -- src/Libs/FShade.GLSL/UniformBufferLayout.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/Libs/FShade.GLSL/UniformBufferLayout.fs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"04240c0070acc7cc38ed106184d6356c6b61a8c5a231786fbd0b97e1c87fdad8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Libs/FShade.Imperative/UtilityFunction.fs: src/Libs/FShade.Imperative/UtilityFunction.fs changed 4 times in last 90 days, max cyclomatic complexity 16 in UtilityFunctionModule.tryCreate\u0027 at line 49. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-25..2026-09-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-25 10:58:58 \u002B02:00\u0027 --until=\u00272026-09-23 10:58:58 \u002B02:00\u0027 --full-history --no-merges -- src/Libs/FShade.Imperative/UtilityFunction.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/Libs/FShade.Imperative/UtilityFunction.fs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4500eedc3d386361158c7681c0eb2fbd059a5b91469dc57209b0faf78249ca7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Libs/FShade.Imperative/ModuleCompiler.fs: src/Libs/FShade.Imperative/ModuleCompiler.fs changed 2 times in last 90 days, max cyclomatic complexity 26 in Helpers.flatten at line 166. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-25..2026-09-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-25 10:58:58 \u002B02:00\u0027 --until=\u00272026-09-23 10:58:58 \u002B02:00\u0027 --full-history --no-merges -- src/Libs/FShade.Imperative/ModuleCompiler.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/Libs/FShade.Imperative/ModuleCompiler.fs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c1a3558c42226d3c023d11950508d209161a3a0c4eb63a4ab55478e2db56c1"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 13 significant file(s) lose their only recent owner: src/Libs/FShade.Core/Optimizer.fs, src/Libs/FShade.GLSL/IntrinsicFunctions.fs, src/Libs/FShade.Imperative/Compiler.fs, src/Libs/FShade.SpirV/Assembler.fs, src/Libs/FShade.Imperative/Ast.fs, src/Libs/FShade.Core/RaytracingSER.fs, src/Libs/FShade.Core/Frontend.fs, src/Libs/FShade.Imperative/ModuleCompiler.fs (\u002B5 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"25da4caea5139a8f8706d9528f2dd5f31e4f6a5a0978859c07525c699ad8a24b"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no installation or build instructions: No install/build/usage instructions for FShade in the README. Add a short Install section covering how to get and build the package, and where to find examples."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa6bfcd5c6ae231d1b8ee99bced50b832d1f61cde9da6cbb533467b879a57db"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no project overview: The README is a single sentence (\u0027FShade is a library for writing Shaders in F# using code-quotations.\u0027) and does not explain what \u0027code-quotation\u0027 means or why this is useful. Expand the overview to define quotations, their role in shader writing, and compare them to alternatives."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66dbf18d06aa983c06246108610908ba99aae6784280b3aacd1a6655733d71be"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1542ac657294a7960a3ca68607ef7a17d9ed3d2457fb06dcd777067445c6a3cf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aa8ee490371acdad2b62b958843583a0e94f30a79a22194bc3bc46d8eab253e9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"77847d4d9e715398297c158f302f573115261fa4ec2a7243fa64534887cf387b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e7efc20376ca82d297e418b4690e33529d542653dba1b7d7d2bb15afc33b69a4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"801e60aed41b1830aa35670f62ac1a60a301a9b98f6d9a13478d3be3430260a0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eca0d79a5c8b32b1d32d17adeed54e8bf4045e3e5122f4a9479da6c4481f7387"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d89ff8be40979a750f71a1b1785d33a78ab956aa773c1a40e692751cfa2edca2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fcc53031fa987d6bc5a5b08489e3381c86035392521a66ecd56088c20fcbe155"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"47377aa8659f8aadcdd7c9ce0cea201eb0d99596c65fcff940d7ef089d615860"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0752d0df7434000fcabf1048e2de30a7a1a8b982b3db9a19898c4dec199856b4"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"}},{"ruleId":"M1","level":"note","message":{"text":"Thin README: The root README is 55 words, against a bar of 120. Of the three newcomer-critical sections this check looks for by heading, it found no a build/run or getting-started section, no a testing section, no an architecture or project-map section. Sections are matched on HEADING text only, so material written under a heading this check does not recognise \u2014 or with no heading at all \u2014 is not seen and this row may understate what the document covers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5fc8f78bec0b6b3daab9d9139ba49b687f61b54f8310b64c159df9616f47e38e"}},{"ruleId":"M1","level":"warning","message":{"text":"README may be stale: 21 code files changed in the last 6 months but the README was not touched \u2014 it may no longer reflect the system."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e973e7a8d5d866995cbf78b120250fe7f132bf928812d48ca62e69aba11b9910"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: README claims Aardvark.Rendering integration but no Aardvark project exists \u2014 searched for: \u0060Aardvark.Rendering\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":"a1ae8ffcc63f793940c82010c32ef83f7780d0781d97ac5511fdec7cf6be33fa"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: README claims a Shader Debugger wiki page but the repository contains no wiki \u2014 searched for: \u0060wiki\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":"0667ad90fdd66ffbe78830be77d7a90b8cf9cfc88a1da49645352d75feb4c43c"}},{"ruleId":"P12","level":"warning","message":{"text":"Test suite runs only after the merge: \u0060publish.yml\u0060 run(s) the test suite, but no workflow that runs tests is triggered by a pull request (or a merge queue) \u2014 so the suite reports on code that is already on the default branch. A red build there blocks nothing and the only remedy is a revert. Add the pull-request trigger to the workflow that runs your suite so the gate applies before the merge, not after it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"731ad560de6aa35d3e92103d5ad0fbec4c54f771b709281e852941847e03ef03"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add \u0060semgrep --config=auto\u0060 plus gitleaks for committed secrets (F# is not a CodeQL language and has no language-specific SAST engine) as a CI step. What was searched, so you can tell an absence from a miss: the 3614 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-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-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"CWE-353","shortDescription":{"text":"CWE-353"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"CWE-522","shortDescription":{"text":"CWE-522"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"CWE-829","shortDescription":{"text":"CWE-829"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":15,"secretScannerRunsExcluded":0}},"redactionTokens":["A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."]}]}