{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D18","name":"Solution Shape","shortDescription":{"text":"Solution Shape"},"helpUri":"https://codehealth.canine.dev/dimensions/D18"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"RegexNode.CanBeMadeAtomic (cyclomatic 82): RegexNode.CanBeMadeAtomic 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/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":1990}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ba2730a2778f6b6e45eb4bd9726e907805924c534783960c050df0daa85a76"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtendedRegexParser.ScanRegex (cyclomatic 75): ExtendedRegexParser.ScanRegex has cyclomatic complexity 75 (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/Resharp.Runtime/ExtendedRegexParser.cs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"45748702699d67a6891dcef5e8cd4ffa2d43585c5e37bb668e6b3bb9aab054fd"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtendedRegexParser.ScanGroupOpen (cyclomatic 73): ExtendedRegexParser.ScanGroupOpen has cyclomatic complexity 73 (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/Resharp.Runtime/ExtendedRegexParser.cs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f40ace1f8ed5bf5e41ed21e2e29e82ea8ffd632bb12220276bb1a72d1dae16"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtendedRegexParser.ScanCharClass (cyclomatic 62): ExtendedRegexParser.ScanCharClass has cyclomatic complexity 62 (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/Resharp.Runtime/ExtendedRegexParser.cs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"302c93a939d07bc06d5c9e1da77239b544c578594b970ce25170c4f4567919d0"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexBuilder\u00601.mkOr2 (cyclomatic 49): RegexBuilder\u00601.mkOr2 has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp/RegexBuilder.fs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed5e84beec4ebc24d522547a9f6df4a30fb84187b8f476b64806030341b6a95"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexNode.ValidateFinalTreeInvariants (cyclomatic 48): RegexNode.ValidateFinalTreeInvariants 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/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e68027c97eec891a7e2200fe6c1b899b5d255dd20acbea7deacd58b7abd3e3"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexBuilder\u00601.mkConcat2 (cyclomatic 48): RegexBuilder\u00601.mkConcat2 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/Resharp/RegexBuilder.fs"},"region":{"startLine":2060}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddba080e4181bd7eb88d5fb0b062832f0ab18af4c9aa6e077a88409cd14fafb5"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexNode.ReduceConcatenationWithAdjacentLoops (cyclomatic 47): RegexNode.ReduceConcatenationWithAdjacentLoops has cyclomatic complexity 47 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. 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/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"432c28499252f4ed0e23b9dc3c47640f605847781890d723247cef4b0589c1e4"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexBuilder\u00601.mkAnd (cyclomatic 46): RegexBuilder\u00601.mkAnd has cyclomatic complexity 46 (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/Resharp/RegexBuilder.fs"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3e768d2c9b7745e5949a5352fc679892d9bf215679f206bb443e116ff1e0f3"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexNode.Describe (cyclomatic 45): RegexNode.Describe has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":2735}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a7a6291dff3a27a760541176c98a626edc8d9ccaa259611e492f76618348af"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexNode.ComputeMaxLength (cyclomatic 43): RegexNode.ComputeMaxLength has cyclomatic complexity 43 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: RegexNode.ComputeMinLength (cyclomatic 44) 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/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":2292}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d414d11df3724fc5c3dedcddd5a2248e904c2a0dea621c72473fad3f0fe5ef"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtendedRegexParser.ScanBasicBackslash (cyclomatic 41): ExtendedRegexParser.ScanBasicBackslash has cyclomatic complexity 41 (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/Resharp.Runtime/ExtendedRegexParser.cs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"78143f0afdd2b5e64cb35432fe0ecab79cee76e5328d95e58b5ed8dcaa8752ad"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexCharClass.Canonicalize (cyclomatic 39): RegexCharClass.Canonicalize has cyclomatic complexity 39 (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/Resharp.Runtime/RegexCharClass.cs"},"region":{"startLine":1678}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dcb434515afa335efc0abd5f97b13db2033b52cc0adc6ea656ec17a5cfa1974"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexBuilder\u00601.mkOr (cyclomatic 38): RegexBuilder\u00601.mkOr has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp/RegexBuilder.fs"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b5ae7c86020303feed2a37ee327a351a2f16f6c1bc0ca8d9146c09cbd8fb8e"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexBuilder\u00601.mkAnd2 (cyclomatic 37): RegexBuilder\u00601.mkAnd2 has cyclomatic complexity 37 (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/Resharp/RegexBuilder.fs"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"78638dfffc52f1d0a73ce0c7a8ff3abcaea44bdc011dbf594a5f39fac0614bd3"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexNode.derivative (cyclomatic 36): RegexNode.derivative 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/Resharp/Algorithm.fs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ae8c7cf1d5aef5f3d5cdda34c6da83e645e76dc2fc48065673851714320f63"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtendedRegexParser.ScanBackslash (cyclomatic 35): ExtendedRegexParser.ScanBackslash has cyclomatic complexity 35 (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/Resharp.Runtime/ExtendedRegexParser.cs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4afe5f393c4a2239b7cd378f4f07fa7f3ecc40aa611c1668b0f92c5672e8c66"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtendedRegexParser.ScanDollar (cyclomatic 34): ExtendedRegexParser.ScanDollar has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/ExtendedRegexParser.cs"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a811bd85ebdaa7b6dea000693481798472941b20f5d34bb10c5ecdb1e14cbe"}},{"ruleId":"D1","level":"warning","message":{"text":"Helpers.printNode (cyclomatic 33): Helpers.printNode 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp/Types.fs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b209d7ed93860225df68baab876a8bd9bb66b882009f356f5258cde2f836ae4"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexNode.ReduceAtomic (cyclomatic 32): RegexNode.ReduceAtomic has cyclomatic complexity 32 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file\u0027s highest cyclomatic complexity: RegexNode.ComputeMinLength (cyclomatic 44) 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/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7fd8092f336f914e020987c7b738c4f7c5fe89535796ef33858d1eddee9ef47"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexNode.ReduceAlternation (cyclomatic 28): RegexNode.ReduceAlternation has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (RegexNode.ReduceAlternation::ExtractCommonPrefixOneNotoneSet, RegexNode.ReduceAlternation::ExtractCommonPrefixText) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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. This is NOT this file\u0027s highest cyclomatic complexity: RegexNode.ComputeMinLength (cyclomatic 44) 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/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ef4c6f3136179abecc59f8be9daef64d574287812fb05656c39091a83755a0"}},{"ruleId":"D1","level":"warning","message":{"text":"Optimizations.findInitialOptimizations (cyclomatic 28): Optimizations.findInitialOptimizations has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp/Optimizations.fs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d567e5360b181f200869fad6731999c5dd07ce06561c3ab8a531b6f258c792"}},{"ruleId":"D1","level":"warning","message":{"text":"CharSetSolver.ApplyBinaryOp (cyclomatic 27): CharSetSolver.ApplyBinaryOp has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/CharSetSolver.cs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade5e9b10f8cc7c84417124ca9155f6235abf3a7978b5c924e030bc0e59a314f"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexCharClass.DescribeSet (cyclomatic 27): RegexCharClass.DescribeSet has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexCharClass.cs"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c91d0cf97db261a34a9b1b9ade2c35e504a9ee26eb3e57faf6463fb98f51d82"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexNode.ReduceLoops (cyclomatic 27): RegexNode.ReduceLoops has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: RegexNode.ComputeMinLength (cyclomatic 44) 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/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0bedff245c6480bf7b8de76faeb92105654c8bda96bb344e9db9fe78f556d3"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtendedRegexParser.CountCaptures (cyclomatic 26): ExtendedRegexParser.CountCaptures has cyclomatic complexity 26 (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/Resharp.Runtime/ExtendedRegexParser.cs"},"region":{"startLine":1563}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca22e9277b930a4344aac1acace213b92a7645c28bf300ea145b9ba7a26d397"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexBuilder\u00601.mergeOrGroupedLoops (cyclomatic 26): RegexBuilder\u00601.mergeOrGroupedLoops has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp/RegexBuilder.fs"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b0a6cabe4b76dc7adf1be091906c76d62172cbf3698f6d5d798946b03a5f35"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexBuilder\u00601.mkConcat2_concatTailCase (cyclomatic 25): RegexBuilder\u00601.mkConcat2_concatTailCase has cyclomatic complexity 25 (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/Resharp/RegexBuilder.fs"},"region":{"startLine":2403}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64ba198fd06515be6124730d49888c8d4e7a790b23a2299082c17d070a4e502"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexBuilder\u00601.mkLoop (cyclomatic 25): RegexBuilder\u00601.mkLoop has cyclomatic complexity 25 (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/Resharp/RegexBuilder.fs"},"region":{"startLine":3132}}}],"partialFingerprints":{"codehealthFindingId/v1":"005a14cbdb104fbe7cc054451daa70953a66cec9acd63a485c1fdece4dab7d4c"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtendedRegexParser.ScanBlank (cyclomatic 24): ExtendedRegexParser.ScanBlank has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/ExtendedRegexParser.cs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ea2a1ba79c52ca56c1b52ffeda9864bffd6746bb29c0f7d2519a0ff153ab7c"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexCharClass.TryGetOnlyCategories (cyclomatic 24): RegexCharClass.TryGetOnlyCategories has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexCharClass.cs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b70ba31f9ced6fbb682612420ad6e1fd3fb60d943386b7fa562e9bbeace3106"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexBuilder\u00601.mkConcatChecked (cyclomatic 24): RegexBuilder\u00601.mkConcatChecked has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp/RegexBuilder.fs"},"region":{"startLine":2826}}}],"partialFingerprints":{"codehealthFindingId/v1":"5807d75b572f5a9d4793e267cbb5c8b580c7917e994dd4441d7309d464fc65c0"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexNode.EliminateEndingBacktracking (cyclomatic 23): RegexNode.EliminateEndingBacktracking has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file\u0027s highest cyclomatic complexity: RegexNode.ComputeMinLength (cyclomatic 44) 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/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"500d34f64fa2f8815743dfc4d54bf7b1147f03f6cb7ae82a5c2d56bae0fbada2"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexBuilder\u00601.attemptRewriteCommonLookahead (cyclomatic 23): RegexBuilder\u00601.attemptRewriteCommonLookahead 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/Resharp/RegexBuilder.fs"},"region":{"startLine":2702}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4f117408ef4560bb7eca6e11945895403355b651a340664ece6961e12d1641"}},{"ruleId":"D1","level":"warning","message":{"text":"Optimizations.getPrefixNodeCore (cyclomatic 22): Optimizations.getPrefixNodeCore 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/Resharp/Optimizations.fs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9d0ca807eef7e1e74db96f221efb18a04b9a30311557d06a0629b7604af018"}},{"ruleId":"D1","level":"warning","message":{"text":"Optimizations.attemptCompileFullDfa (cyclomatic 22): Optimizations.attemptCompileFullDfa has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp/Optimizations.fs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"111da066266a997fc36b3be177141216509f6bc07de02390c230f48857e8f067"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.computeMaxLength (cyclomatic 22): Node.computeMaxLength 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/Resharp/Info.fs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48a41aa502b48ff02895b6f7eaadd4f557e8abaaee0b4db9aa4bcebd3d683a6"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexNode.ReduceAlternation::ExtractCommonPrefixText (cyclomatic 21): RegexNode.ReduceAlternation::ExtractCommonPrefixText has cyclomatic complexity 21 (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 shape REPEATS in the file: 2 other methods here (RegexNode.ReduceAlternation, RegexNode.ReduceAlternation::ExtractCommonPrefixOneNotoneSet) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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. This is NOT this file\u0027s highest cyclomatic complexity: RegexNode.ComputeMinLength (cyclomatic 44) 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/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"a572213db8b6965e5b6830cfb97222dbe7aa46b21e8533c817ccec245aed92cb"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexNode.TryGetOrdinalCaseInsensitiveString (cyclomatic 21): RegexNode.TryGetOrdinalCaseInsensitiveString has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: RegexNode.ComputeMinLength (cyclomatic 44) 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/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":2424}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff7d963d2221639e45f3484c7aeda98a25af79b6d26aaedc4704622443dc0ae"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexBuilder\u00601.mkLookaround (cyclomatic 21): RegexBuilder\u00601.mkLookaround 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp/RegexBuilder.fs"},"region":{"startLine":2492}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d123edbb38096cca303a7fccfe02908747ace41675d5a48c9d212284cb5b8f"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.computeMinLength (cyclomatic 21): Node.computeMinLength 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp/Info.fs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"60bf34732727c9fe03b871936a0dc0f96d6e3603ed5107610ea2aeec3e31b906"}},{"ruleId":"D1","level":"warning","message":{"text":"BDD.prettyPrintBDD (cyclomatic 21): BDD.prettyPrintBDD has cyclomatic complexity 21 (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/Resharp/Common.fs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46dc034caf85447e15badb9d5a849557c06dee2b903ec1565ab4153edfad4d4"}},{"ruleId":"D1","level":"warning","message":{"text":"BDDRangeConverter.ToRangesFromOrdinal (cyclomatic 20): BDDRangeConverter.ToRangesFromOrdinal has cyclomatic complexity 20 (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/Resharp.Runtime/BDDRangeConverter.cs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba756e5eb289b5fca7792f134ca559eab10dc23744ae6b6bd423ce241d2b5873"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexCharClass.MayOverlap (cyclomatic 19): RegexCharClass.MayOverlap has cyclomatic complexity 19 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 9 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexCharClass.cs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac2790572c4445b3b827245197eec606fe896f6899b5455f5bb145f0901e12b"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexNode.ReduceAlternation::ExtractCommonPrefixOneNotoneSet (cyclomatic 19): RegexNode.ReduceAlternation::ExtractCommonPrefixOneNotoneSet has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 2 other methods here (RegexNode.ReduceAlternation, RegexNode.ReduceAlternation::ExtractCommonPrefixText) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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. This is NOT this file\u0027s highest cyclomatic complexity: RegexNode.ComputeMinLength (cyclomatic 44) 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/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3790bc737f7b8151875cd9a859711d1aff05f56642090971ea9552e5fab44a"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexNode.ReduceConcatenationWithAdjacentStrings (cyclomatic 18): RegexNode.ReduceConcatenationWithAdjacentStrings has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: RegexNode.ComputeMinLength (cyclomatic 44) 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/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2c1d7b4052b20ce4119e54fc7155ff5012a75c6eec009b4d95e4ef94b9a252"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexNode.isNullable (cyclomatic 18): RegexNode.isNullable has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp/Algorithm.fs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d805ef12bce2fd199d8b67537e0adc3784e2a54f22765c6768fea0017102c0"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexBuilder\u00601.stripPrefixSuffix (cyclomatic 18): RegexBuilder\u00601.stripPrefixSuffix has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp/RegexBuilder.fs"},"region":{"startLine":2622}}}],"partialFingerprints":{"codehealthFindingId/v1":"741623f59654629c4e9828f34dcda33690867ab8e4b6dec1231039e11dc71d92"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexNode.FindAndMakeLoopsAtomic (cyclomatic 17): RegexNode.FindAndMakeLoopsAtomic has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to one function item inside it that branches (ProcessNode). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: RegexNode.ComputeMinLength (cyclomatic 44) 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/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":1748}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b70634378e1ccfe51f672094c58462400c78e17d7c699de5bf11a3bac2f1d94"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexNode.rev (cyclomatic 17): RegexNode.rev 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/Resharp/Algorithm.fs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3762f16cb0a04ca99b74da88c945a6e6cc16fba72ae90370e48eb3a2761d44"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexNode.ReduceSet (cyclomatic 16): RegexNode.ReduceSet 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. This is NOT this file\u0027s highest cyclomatic complexity: RegexNode.ComputeMinLength (cyclomatic 44) 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/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"86beb1a9de7b744b3c9aeab409b439e54a2d21c25252be7021de5ab2531d8516"}},{"ruleId":"D1","level":"warning","message":{"text":"Optimizations.getFixedPrefixLength (cyclomatic 16): Optimizations.getFixedPrefixLength 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/Resharp/Optimizations.fs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a73347ff72f744346dffd10c8252e15c3042cf134f563cbd7624f759dfac499"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexBuilder\u00601.mkOr2 (cognitive 169): RegexBuilder\u00601.mkOr2 has cognitive complexity 169 (threshold 15). Drivers by points: if/else 26 (89 pts), match/switch 13 (76 pts), boolean chains 4 (nesting depth added 126). 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/Resharp/RegexBuilder.fs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b82a18db3d05ac7b2a4897e1ea6137fc74c7a2fd436b16d0fa2c1b7cf208b0"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtendedRegexParser.ScanGroupOpen (cognitive 166): ExtendedRegexParser.ScanGroupOpen has cognitive complexity 166 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/ExtendedRegexParser.cs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52b7a7277854e788aea7c36df5308132470b496b1a63e069323948b68bb5c54"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexBuilder\u00601.mkAnd (cognitive 158): RegexBuilder\u00601.mkAnd has cognitive complexity 158 (threshold 15). Drivers by points: match/switch 16 (85 pts), if/else 14 (42 pts), loops 5 (26 pts), boolean chains 5 (nesting depth added 118). 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/Resharp/RegexBuilder.fs"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d8116766be370b4127d91c24bf78a125ddd4291e49b9173b9870556ee1f08b"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexBuilder\u00601.mkConcat2 (cognitive 149): RegexBuilder\u00601.mkConcat2 has cognitive complexity 149 (threshold 15). Drivers by points: match/switch 20 (105 pts), if/else 11 (29 pts), boolean chains 8, loops 1 (7 pts) (nesting depth added 109). 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/Resharp/RegexBuilder.fs"},"region":{"startLine":2060}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f49031d03d8eab3444fbfdbbd3567f2fdf1a3e6cc8279b1c1e355c278530035"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtendedRegexParser.ScanRegex (cognitive 133): ExtendedRegexParser.ScanRegex has cognitive complexity 133 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/ExtendedRegexParser.cs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"36958f5849adab6b97978816a976fe55925f2fe59769b3c87fdbb4fd807cbc39"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtendedRegexParser.ScanCharClass (cognitive 123): ExtendedRegexParser.ScanCharClass has cognitive complexity 123 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/ExtendedRegexParser.cs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fa551981f014b7dddd72210fb1066a11f0e41735e131522f801c7ad7523963"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexBuilder\u00601.mkConcatChecked (cognitive 112): RegexBuilder\u00601.mkConcatChecked has cognitive complexity 112 (threshold 15). Drivers by points: match/switch 11 (60 pts), if/else 10 (39 pts), loops 2 (13 pts) (nesting depth added 89). 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/Resharp/RegexBuilder.fs"},"region":{"startLine":2826}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d7f93bdeef896fbaef9036a29e4ee68b87adb01a48b9e0ef7bb921f5b1e070"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexBuilder\u00601.mkOr (cognitive 105): RegexBuilder\u00601.mkOr has cognitive complexity 105 (threshold 15). Drivers by points: if/else 16 (49 pts), match/switch 9 (31 pts), loops 6 (21 pts), boolean chains 4 (nesting depth added 70). 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/Resharp/RegexBuilder.fs"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e2710213663dec78cd2555ff9f7d77e3e686cddb16a956c172fcbbdb74065f"}},{"ruleId":"D2","level":"warning","message":{"text":"Optimizations.findInitialOptimizations (cognitive 98): Optimizations.findInitialOptimizations has cognitive complexity 98 (threshold 15). Drivers by points: if/else 28 (68 pts), match/switch 7 (30 pts) (nesting depth added 63). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp/Optimizations.fs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d82504b1aa5ff840c547c747af1f990cc4550ac866d391e9759895c3c11319"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexBuilder\u00601.mkAnd2 (cognitive 93): RegexBuilder\u00601.mkAnd2 has cognitive complexity 93 (threshold 15). Drivers by points: if/else 22 (64 pts), match/switch 7 (23 pts), boolean chains 6 (nesting depth added 58). 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/Resharp/RegexBuilder.fs"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"3861ee95405a1f9f7d0ef18a4835af24f0d54d764d1c8b2973499eec66b5adde"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexNode.ReduceConcatenationWithAdjacentLoops (cognitive 87): RegexNode.ReduceConcatenationWithAdjacentLoops has cognitive complexity 87 (threshold 15). Of this number, 79 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. 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/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"3844345dbacfc7b2d9e699e3f9e0751eca0312133f3f3bf9c04b214e58b720c7"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexNode.derivative (cognitive 82): RegexNode.derivative has cognitive complexity 82 (threshold 15). Drivers by points: match/switch 11 (43 pts), if/else 12 (31 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 55). 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/Resharp/Algorithm.fs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"0611c59a09c0f734c7adde6a29ee7cf80332b1861c85d25a9373b8a9c030966d"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtendedRegexParser.ScanBasicBackslash (cognitive 78): ExtendedRegexParser.ScanBasicBackslash has cognitive complexity 78 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/ExtendedRegexParser.cs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6a398d63805ce96310037e1bab0a376692dcedfc48fea0effc45e16bfc59db"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexCharClass.Canonicalize (cognitive 75): RegexCharClass.Canonicalize has cognitive complexity 75 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexCharClass.cs"},"region":{"startLine":1678}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e893fd1b6f6ee75e2a3fa42241fe8b5b06e12f5df59619164444e9316a0b655"}},{"ruleId":"D2","level":"warning","message":{"text":"BDDRangeConverter.ToRangesFromOrdinal (cognitive 72): BDDRangeConverter.ToRangesFromOrdinal has cognitive complexity 72 (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/Resharp.Runtime/BDDRangeConverter.cs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd25dc4cb8ec8baed1e02883e45483dd4bb6125d37fd42ddb739adf4c0fbfaa2"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexNode.ReduceAtomic (cognitive 68): RegexNode.ReduceAtomic has cognitive complexity 68 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea314fa540c1a93ae515dc3c2717e49f942b7e5def60ad9a04af29a3c98c273"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtendedRegexParser.CountCaptures (cognitive 66): ExtendedRegexParser.CountCaptures has cognitive complexity 66 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/ExtendedRegexParser.cs"},"region":{"startLine":1563}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd26b184e66a7f98b5c17260e6b1e41ee4b9e135ae0c237c2c57b5fce92030a"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexNode.ReduceAlternation (cognitive 63): RegexNode.ReduceAlternation has cognitive complexity 63 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (RegexNode.ReduceAlternation::ExtractCommonPrefixOneNotoneSet, RegexNode.ReduceAlternation::ExtractCommonPrefixText) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3c6e89cedb565af7ff6306227837865596431f4cb9a138180f65125dba89f2"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexBuilder\u00601.mkConcat2_concatTailCase (cognitive 63): RegexBuilder\u00601.mkConcat2_concatTailCase has cognitive complexity 63 (threshold 15). Drivers by points: if/else 15 (33 pts), match/switch 9 (27 pts), boolean chains 3 (nesting depth added 36). 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/Resharp/RegexBuilder.fs"},"region":{"startLine":2403}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc48d0bc7e4802928fb0c25765fb0355ee2278acde3ee37a6bc9269042a5bb7a"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexNode.CanBeMadeAtomic (cognitive 61): RegexNode.CanBeMadeAtomic has cognitive complexity 61 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":1990}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c91743373baf7debd4a9521266ba0fc66298f08776f00add9cedcc87a0088dc"}},{"ruleId":"D2","level":"warning","message":{"text":"Optimizations.attemptCompileFullDfa (cognitive 60): Optimizations.attemptCompileFullDfa has cognitive complexity 60 (threshold 15). Drivers by points: if/else 11 (32 pts), loops 9 (24 pts), boolean chains 4 (nesting depth added 36). 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/Resharp/Optimizations.fs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"974160b17c729c303cf16e89ebfde2e61cef1063c4d201156d47d243a65517c4"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexCharClass.DescribeSet (cognitive 55): RegexCharClass.DescribeSet has cognitive complexity 55 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexCharClass.cs"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b17ef137391c536a65e17d8e0c3bf273c89a04a0ba145c5736755a0585ff89"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtendedRegexParser.ScanDollar (cognitive 52): ExtendedRegexParser.ScanDollar has cognitive complexity 52 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/ExtendedRegexParser.cs"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"170c3ecf4191257928097064c114a82b316cd3b1eefaf27ddf017204caa4384a"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexCharClass.TryGetOnlyCategories (cognitive 49): RegexCharClass.TryGetOnlyCategories has cognitive complexity 49 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexCharClass.cs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"22036feeac51cbf00aa3e32e3a5d52909f2c4ce27a2f1e0c9afc660e0e84d131"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexBuilder\u00601.stripPrefixSuffix (cognitive 47): RegexBuilder\u00601.stripPrefixSuffix has cognitive complexity 47 (threshold 15). Drivers by points: match/switch 6 (27 pts), if/else 9 (20 pts) (nesting depth added 32). 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/Resharp/RegexBuilder.fs"},"region":{"startLine":2622}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea516bd9e064f223fa188f348eb55629093ba7b4c98ef0d6a16ca78e7b53f8ff"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexNode.ReduceAlternation::ExtractCommonPrefixText (cognitive 46): RegexNode.ReduceAlternation::ExtractCommonPrefixText has cognitive complexity 46 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 4 (9 pts), ternaries 3 (6 pts), boolean chains 3 (nesting depth added 25). 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: 2 other methods here (RegexNode.ReduceAlternation, RegexNode.ReduceAlternation::ExtractCommonPrefixOneNotoneSet) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"faef46f50898ce31c10f614f8345450717d45ffc17e90342bf50e89f48ae209f"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexBuilder\u00601.mkLoop (cognitive 46): RegexBuilder\u00601.mkLoop has cognitive complexity 46 (threshold 15). Drivers by points: if/else 14 (33 pts), match/switch 4 (7 pts), boolean chains 6 (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/Resharp/RegexBuilder.fs"},"region":{"startLine":3132}}}],"partialFingerprints":{"codehealthFindingId/v1":"8251e34c8faf5528cf59a9d0be08eb9883a51629d1b3a62822bc7ab7d93bb358"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexBuilder\u00601.mergeOrGroupedLoops (cognitive 45): RegexBuilder\u00601.mergeOrGroupedLoops has cognitive complexity 45 (threshold 15). Drivers by points: match/switch 8 (24 pts), if/else 5 (15 pts), boolean chains 4, loops 2 (nesting depth added 26). 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/Resharp/RegexBuilder.fs"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f9a05a41378efdd757fa34cc99711cbc6b17b5d6f0f2005c46656a570a543f"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtendedRegexParser.ScanBlank (cognitive 44): ExtendedRegexParser.ScanBlank has cognitive complexity 44 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/ExtendedRegexParser.cs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d7769c35eeee2c8fef52f4f0a681cd1f53a43a24bd685e910669a98a58fe14"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtendedRegexParser.ScanBackslash (cognitive 42): ExtendedRegexParser.ScanBackslash has cognitive complexity 42 (threshold 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/ExtendedRegexParser.cs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d3f56ee5edd724927e8791c0c0833929a7fca645bd6a7ddf7b55282bab5dc8"}},{"ruleId":"D2","level":"warning","message":{"text":"Optimizations.getPrefixNodeCore (cognitive 41): Optimizations.getPrefixNodeCore has cognitive complexity 41 (threshold 15). Drivers by points: match/switch 7 (24 pts), if/else 2 (7 pts), loops 2 (7 pts), boolean chains 3 (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/Resharp/Optimizations.fs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"c175833ffe30e94eaca234676538f5182c79b8c0ae2f5adeebfb97c8b10efefa"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexBuilder\u00601.mkLookaround (cognitive 41): RegexBuilder\u00601.mkLookaround has cognitive complexity 41 (threshold 15). Drivers by points: match/switch 9 (30 pts), if/else 8 (9 pts), boolean chains 2 (nesting depth added 22). 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/Resharp/RegexBuilder.fs"},"region":{"startLine":2492}}}],"partialFingerprints":{"codehealthFindingId/v1":"792e1ff0f63e37f3b4bcce596adddf7a5b1fe0ec0ceb4a99a38af78fcb7f9c29"}},{"ruleId":"D2","level":"warning","message":{"text":"CharSetSolver.ApplyBinaryOp (cognitive 40): CharSetSolver.ApplyBinaryOp has cognitive complexity 40 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/CharSetSolver.cs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90ac492f7513330f470aaad7245837282827c10b1711fa38b61a00ea37697de"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexNode.ReduceConcatenationWithAdjacentStrings (cognitive 40): RegexNode.ReduceConcatenationWithAdjacentStrings has cognitive complexity 40 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e83b79d6a1de68c2c34761f024355663e6e65d8d87da753478aea0a44476bf"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexNode.ReduceLoops (cognitive 39): RegexNode.ReduceLoops has cognitive complexity 39 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7ec6836de28b6702d4ac0be6465886b3c0147ca9eace3aa88781bca0c006e6"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexNode.Describe (cognitive 35): RegexNode.Describe has cognitive complexity 35 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":2735}}}],"partialFingerprints":{"codehealthFindingId/v1":"45417ac2992a59b40d749ff332ea7506183e74da5654c9475ae3ff33a571bc2e"}},{"ruleId":"D2","level":"warning","message":{"text":"ResharpRegexNodeConverter.Compute (cognitive 35): ResharpRegexNodeConverter.Compute has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (28 pts), loops 3 (7 pts) (nesting depth added 16). 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/Resharp/RegexBuilder.fs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e7be60dcce8ff91dd98574f9d01457a6d63fe0542040bfd373f700a758b501"}},{"ruleId":"D2","level":"warning","message":{"text":"Helpers.printNode (cognitive 34): Helpers.printNode has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (19 pts), match/switch 6 (11 pts), boolean chains 4 (nesting depth added 9). 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/Resharp/Types.fs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5d3fda9fb02864ad16ebb38e0d00fd83dbf49c8bda6aca067dcd974ffaf675"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexNode.ComputeMaxLength (cognitive 32): RegexNode.ComputeMaxLength has cognitive complexity 32 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":2292}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c46971a5cccfae74a923218502b7e96d6a9153b7eaffb6ab0cbf097fca14266"}},{"ruleId":"D2","level":"warning","message":{"text":"BDD.prettyPrintBDD (cognitive 32): BDD.prettyPrintBDD has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (26 pts), match/switch 3 (6 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/Resharp/Common.fs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a67bc33d6eef7b0eb2fb925ca89aac47b877571b55b470707624aa74f652552"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.computeMaxLength (cognitive 31): Node.computeMaxLength has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 5 (11 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 17). 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/Resharp/Info.fs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"451cbe3e84f7ce713343c74fef919d8f96938813b3239f7f0ad375fe72aea89c"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexNode.FindAndMakeLoopsAtomic (cognitive 30): RegexNode.FindAndMakeLoopsAtomic has cognitive complexity 30 (threshold 15). Most of this is not in the body itself: 7 of the 30 points are its own statements and the rest belongs to one function item inside it that branches (ProcessNode). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":1748}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c07c72566e34377ccf76f6438edee9561f896d997475e38b1dbf19fa0e1673b"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexBuilder\u00601.mergeOrIntersections (cognitive 30): RegexBuilder\u00601.mergeOrIntersections has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 4 (7 pts), match/switch 2 (7 pts), boolean chains 1 (nesting depth added 18). 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/Resharp/RegexBuilder.fs"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"629f30972f2e7a321d17432ff810145dbcec0033cb68261826f6b22001d2c412"}},{"ruleId":"D2","level":"warning","message":{"text":"BDD.SerializeToBytes (cognitive 27): BDD.SerializeToBytes has cognitive complexity 27 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/BDD.cs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"17123e04889e516f2282c84086b73c1c2d7eae0949622cba80c4920d7e8c91bd"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtendedRegexParser.AssignNameSlots (cognitive 27): ExtendedRegexParser.AssignNameSlots has cognitive complexity 27 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/ExtendedRegexParser.cs"},"region":{"startLine":1692}}}],"partialFingerprints":{"codehealthFindingId/v1":"accbcdd9df3dbbed918734570d4ff555e3b454c9e3c043c328740565c41964ef"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.computeMinLength (cognitive 27): Node.computeMinLength has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 5 (11 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp/Info.fs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a4504f90bc354ff2e66d20fe24eb38a25dc06f586af95763f9127867d00238"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexBuilder\u00601.attemptRewriteCommonLookahead (cognitive 25): RegexBuilder\u00601.attemptRewriteCommonLookahead has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 8 (16 pts), if/else 4 (6 pts), boolean chains 3 (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/Resharp/RegexBuilder.fs"},"region":{"startLine":2702}}}],"partialFingerprints":{"codehealthFindingId/v1":"3613a1976c35e94caa4345e1c01b489445ba5646a075abc07b3cc1d375857f62"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexCharClass.CharInCategory (cognitive 24): RegexCharClass.CharInCategory has cognitive complexity 24 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexCharClass.cs"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8bacb56e0e1edea84c1a277b14a93d3e21f238b3156e32143d0e1e24b70ba37"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexNode.TryGetOrdinalCaseInsensitiveString (cognitive 24): RegexNode.TryGetOrdinalCaseInsensitiveString has cognitive complexity 24 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":2424}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab743495109b3245b694458e43e70c24a626d5d2ea1d535e9f9fce83f08c799"}},{"ruleId":"D2","level":"warning","message":{"text":"Accelerators.trySkipToWeightedSetCharRev (cognitive 23): Accelerators.trySkipToWeightedSetCharRev has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (5 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp/Accelerators.fs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"813c30eb69b313b28e0c70577b47fa8dc274593d4ff289b92818e9669eabc4f8"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexNode.EliminateEndingBacktracking (cognitive 22): RegexNode.EliminateEndingBacktracking has cognitive complexity 22 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"8654141d4dfdf8a7a9966bfa4279eb61b8608a659722563fdb0b9accb00670d9"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexNode.ReduceSet (cognitive 22): RegexNode.ReduceSet has cognitive complexity 22 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"95fa63774621d80017e09e3c8f47872dda559be7dacf2887ef660db5e2b00ba2"}},{"ruleId":"D2","level":"warning","message":{"text":"BDD.IsEssentiallyBoolean (cognitive 21): BDD.IsEssentiallyBoolean has cognitive complexity 21 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/BDD.cs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"7824cc138ae24c72f770e419a1743197ce09d09d965177600905155811583be5"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexNode.isNullable (cognitive 21): RegexNode.isNullable has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (6 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp/Algorithm.fs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93c1ea0206493dcaed5c887594fa809afbf3d1198204fb034fba7abd8f2367c"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexNode.ReduceAlternation::ExtractCommonPrefixOneNotoneSet (cognitive 20): RegexNode.ReduceAlternation::ExtractCommonPrefixOneNotoneSet has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (6 pts), boolean chains 2, match/switch 1 (2 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. This shape REPEATS in the file: 2 other methods here (RegexNode.ReduceAlternation, RegexNode.ReduceAlternation::ExtractCommonPrefixText) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2ffea4994d88fd6d37abae0dae443d1b1e4ada445ee2c4d7997974a50c9be3"}},{"ruleId":"D2","level":"warning","message":{"text":"BDD.TopologicalSort (cognitive 19): BDD.TopologicalSort has cognitive complexity 19 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/BDD.cs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5868f2603e6c54f43ebb33ac0958ebccf42eb5debfb6c21193c402645d2e49"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexCharClass.MayOverlap (cognitive 19): RegexCharClass.MayOverlap has cognitive complexity 19 (threshold 15). Most of this is not in the body itself: 9 of the 19 points are its own statements and the rest belongs to 2 function items inside it that branch (MayOverlapByEnumeration, KnownDistinctSets). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexCharClass.cs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b7a00048dc92f186e3379777d6d7dec5f65b7cd646021888d6460f27a43cb8"}},{"ruleId":"D2","level":"warning","message":{"text":"Optimizations.isTooCommon (cognitive 19): Optimizations.isTooCommon has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (6 pts), loops 2 (6 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp/Optimizations.fs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a313248826a60962a14f0e86d59cece49bec62238771caca084ccb60250736"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexNode.rev (cognitive 19): RegexNode.rev has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 6 (13 pts), loops 3 (6 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/Resharp/Algorithm.fs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e9ab26d92164faacf9b4d1405a38fa50579ecbf39f98f55e088dabb5124f06"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexBuilder\u00601.stripSuffixes (cognitive 19): RegexBuilder\u00601.stripSuffixes has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (17 pts), if/else 2 (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/Resharp/RegexBuilder.fs"},"region":{"startLine":2584}}}],"partialFingerprints":{"codehealthFindingId/v1":"232a656eb73344fbb6a2a08c7efb355ece036ceec227b545f3e743f37754c5b1"}},{"ruleId":"D2","level":"warning","message":{"text":"Optimizations.inferLengthLookup (cognitive 17): Optimizations.inferLengthLookup has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (12 pts), boolean chains 3, if/else 2 (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/Resharp/Optimizations.fs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad71a655f6f107b1c860c13f81fbce815da7734e81f944ce27fcad1a4178328"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexCharClass.AddCaseEquivalences (cognitive 16): RegexCharClass.AddCaseEquivalences has cognitive complexity 16 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexCharClass.cs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"0605bb891cdf17f25a2cf33a7dbe52bffd879b5641cee9c3900819ff8b792ad5"}},{"ruleId":"D2","level":"warning","message":{"text":"Optimizations.calcPotentialMatchStart (cognitive 16): Optimizations.calcPotentialMatchStart has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (10 pts), if/else 4 (5 pts), boolean chains 1 (nesting depth added 8). 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/Resharp/Optimizations.fs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab783d6b10b731b1888ff529ba884deeb827478d5bbf051f2b9e31c07fcf247"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexBuilder\u00601.mergeOrLookaheads (cognitive 16): RegexBuilder\u00601.mergeOrLookaheads has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (8 pts), loops 3 (7 pts), if/else 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp/RegexBuilder.fs"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"222819a966201fdb30ad670a551cfb1b696d4444f2eaacdff975d326c62f737b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Resharp/RegexBuilder.fs: FileTooLong \u2014 2492 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1992 over it, 4.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/Resharp/RegexBuilder.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e8f84604cac823b54c202bc3b9d8940ed8808a9b1611f4d54fb1307b5784ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Resharp.Runtime/RegexNode.cs: FileTooLong \u2014 1369 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 869 over it, 2.74\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/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8800f6683fd46584b7ec71198b9a386f924192137333aa8417ddcec5bef4e9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ExtendedRegexParser: TooManyMethods \u2014 1265 significant lines (blank, comment-only and punctuation-only lines excluded), 81 methods. The bar is 30 methods; this is 51 over it, 2.70\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/ExtendedRegexParser.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5cd5d653b026db3dc5726d0abaeffc8d1fe234154727cc26b66578e4b0f5991"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Resharp.Runtime/ExtendedRegexParser.cs: FileTooLong \u2014 1274 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 774 over it, 2.55\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/Resharp.Runtime/ExtendedRegexParser.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2760fb9e05eafc5816b301b4cb3a85dd6e90c6e1dadb3a4c4b23e63e17229c9e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RegexNode.ReduceAlternation: MethodTooLong \u2014 ReduceAlternation runs 220 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 120 over it, 2.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"255f743fd724bee2066cde20ac8e2a2a51861c38e613872707134a85db98b4a4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RegexCharClass: TooManyMethods \u2014 999 significant lines (blank, comment-only and punctuation-only lines excluded), 63 methods. The bar is 30 methods; this is 33 over it, 2.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexCharClass.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfa07f0bb72082eacfe4f4ed5a26800c7126a8ba7ec4a72a50a2d41d3133323"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Resharp.Runtime/RegexCharClass.cs: FileTooLong \u2014 1017 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 517 over it, 2.03\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/Resharp.Runtime/RegexCharClass.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1ee1f1e344d0eefc34781a300042684a1258ca9ab8ae85822259dd5a80f92b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RegexBuilder\u00601: TooManyMethods \u2014 55 methods. The bar is 30 methods; this is 25 over it, 1.83\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp/RegexBuilder.fs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"8722c40374c31de9b4c7e3de174bf8b749879f053f5cc1a606d1e8e02efb9925"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExtendedRegexParser.ScanRegex: MethodTooLong \u2014 ScanRegex runs 177 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/ExtendedRegexParser.cs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f51fd0f25433d2adffd8923753f1a929310d8e26d0c59a8e370d294660528e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Resharp/Optimizations.fs: FileTooLong \u2014 796 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 296 over it, 1.59\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/Resharp/Optimizations.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c611ee243654390b09fc66fd58e0c1f57a9584cc63ce83dd9e5e20d661fceb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RegexNode: TooManyMethods \u2014 1352 significant lines (blank, comment-only and punctuation-only lines excluded), 47 methods. The bar is 30 methods; this is 17 over it, 1.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6095a274a489d0befbdd209ab26d968894b36c646b20eec0802016c72e115caf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExtendedRegexParser.ScanGroupOpen: MethodTooLong \u2014 ScanGroupOpen runs 142 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/ExtendedRegexParser.cs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bed3308c8845d76ff900fd5bb6374ea4c74b1eb13f38d5d99b6042eb42bb259"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Resharp/fsil.fs: FileTooLong \u2014 611 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 34 functions. The bar is 500 significant lines; this is 111 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp/fsil.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9dcd561207a564bbe995d6f388a1f77875b2651d43ae56c70d3cd13c800105"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RegexNode.CanBeMadeAtomic: MethodTooLong \u2014 CanBeMadeAtomic runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":1990}}}],"partialFingerprints":{"codehealthFindingId/v1":"c928b843563a70b007b6291a47b0beb2f10f8e05c3d1d351c5332f885944df18"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExtendedRegexParser.ScanCharClass: MethodTooLong \u2014 ScanCharClass runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/ExtendedRegexParser.cs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c769af6beafcad59f4918b92b4f890ce69eb4eab8522d3f9f2f6034fc7aa79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/Resharp.Runtime/BDD.cs:515-540 | src/Resharp.Runtime/BDD.cs:543-570 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/BDD.cs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"c875d2af7854e4fde96a12561874b7b871dc26433ff02b30d72e9b2c44503080"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/Resharp.Runtime/BitVector.cs:90-103 | src/Resharp.Runtime/BitVector.cs:107-120 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/BitVector.cs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"b605b9b46ec846c8ff3216696764cce3aa4b7b389dacd78c44c07f2148fd6e9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/runtime-local/HexConverter.cs:74-80 | lib/runtime-local/HexConverter.cs:84-90 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/HexConverter.cs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f0512bd0208dbb7ce461e68436f757fde7df78c7fd0bf0cfe75f5243b365c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/Resharp.Runtime/RegexCharClass.cs:1218-1230 | src/Resharp.Runtime/RegexCharClass.cs:1234-1250 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexCharClass.cs"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e060e3798a68f55d1a7f921b9b6267fdb81deb0c9605418d706e04224a3ec3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/runtime-local/ValueStringBuilder.cs:224-236 | lib/runtime-local/ValueStringBuilder.cs:239-252 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/ValueStringBuilder.cs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb582a10d6594e29e0b1bd3405c50990ff15491216eeb19044d6dd9a6515b709"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/Resharp.Runtime/BitVectorSolver.cs:73-91 | src/Resharp.Runtime/UInt64Solver.cs:93-111 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/BitVectorSolver.cs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db36c05885c5b8aec56a15d13f2d39bcf8ec58baa5dd08cdef320b9b618ce2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/runtime-local/ValueStringBuilder.cs:135-145 | lib/runtime-local/ValueStringBuilder.cs:148-169 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/ValueStringBuilder.cs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f098a9535010675936edf447f10fb1eb7ceac549fb93b8321a0b7cf098ffe9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/Resharp.Runtime/BitVectorSolver.cs:55-68 | src/Resharp.Runtime/UInt64Solver.cs:62-76 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/BitVectorSolver.cs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0cddfecb7186f960a5eba72db7d2fadb2c1163d5ca2e68e2b5b6bb2cb13893d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/runtime-local/ValueListBuilder.cs:45-59 | lib/runtime-local/ValueStringBuilder.cs:173-185 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/ValueListBuilder.cs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a1367bf227f2368c3971c1d1d70f6d17dddafd61d3edaa458a69051eef8f3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/Resharp.Runtime/BDD.cs:516-539 | src/Resharp.Runtime/BDD.cs:546-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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/BDD.cs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05bcad9f8b714de40fc2ed0fcc2b1c8c732db4d5b9015cc5dbec1379c95b4ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/Resharp.Runtime/RegexNode.cs:945-965 | src/Resharp.Runtime/RegexNode.cs:1514-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/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"c489d5245ba2f3dcd79ff8907a7baaa47566b3bd737902ed25b6137ae571448e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/Resharp/Minterms.fs:21-41 | src/Resharp/Minterms.fs:81-101 \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/Resharp/Minterms.fs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b468534fb8454e3dc1c74c7c644637de87bdc69aaa6f97e87fb393ba8f4b339"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/Resharp/RegexBuilder.fs:2941-2961 | src/Resharp/RegexBuilder.fs:2992-3012 \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/Resharp/RegexBuilder.fs"},"region":{"startLine":2941}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82af4c639bf3d316b5c808883ab6c38a08b70af2b2607c3ea8a3a848bf36f09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/Resharp/RegexBuilder.fs:1774-1793 | src/Resharp/RegexBuilder.fs:1799-1818 \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/Resharp/RegexBuilder.fs"},"region":{"startLine":1774}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7592ff425125bf1b538c414f5c8baf45b0d50052858af6a900670fb9228157"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201320 lines \u00D7 2): src/Resharp/RegexBuilder.fs:2072-2086 | src/Resharp/RegexBuilder.fs:2261-2280 \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/Resharp/RegexBuilder.fs"},"region":{"startLine":2072}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a7fa96f25f8a299794d4361a18f076badd48a2d7abdc2a123fb0fdab01d243"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 2): src/Resharp.Runtime/RegexNode.cs:2256-2273 | src/Resharp.Runtime/RegexNode.cs:2386-2400 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":2256}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ba4b87462b741147c85623eca79d8dcf1b2949d28509a9e3073ec4d73007bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): src/Resharp/RegexBuilder.fs:384-401 | src/Resharp/RegexBuilder.fs:428-444 \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/Resharp/RegexBuilder.fs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ad5920478a3a1893c0fa2f429487a89d49ffaaed4019f021debe42468c37a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/Resharp/Optimizations.fs:479-495 | src/Resharp/Optimizations.fs:518-534 \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/Resharp/Optimizations.fs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"77021dae70a1cee704556af1837d02382ded598510edb28c0f355134517afcfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/Resharp/RegexBuilder.fs:990-1006 | src/Resharp/RegexBuilder.fs:1015-1031 \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/Resharp/RegexBuilder.fs"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"10798463199f794985b1e9f140dd894d1c4e841e64b8acb800c3aefacfc0cc9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/Resharp/RegexBuilder.fs:404-419 | src/Resharp/RegexBuilder.fs:447-462 \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/Resharp/RegexBuilder.fs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"1246cf792986896ed38042d3a8e1f14f7f1b97d7b6769f5e177a7e49c607450a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): src/Resharp/RegexBuilder.fs:2646-2660 | src/Resharp/RegexBuilder.fs:2662-2674 \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/Resharp/RegexBuilder.fs"},"region":{"startLine":2646}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4ed97ac0068c28b5b289081df9e5d82bbe53e4e1a1f1378aedea09652af46f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/Resharp/RegexBuilder.fs:3163-3177 | src/Resharp/RegexBuilder.fs:3179-3193 \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/Resharp/RegexBuilder.fs"},"region":{"startLine":3163}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d8c32cbe247ce82f8a19b642064e08f7e8eee1217fe957233931bea899d849"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/Resharp/fsil.fs:150-164 | src/Resharp/fsil.fs:177-191 \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/Resharp/fsil.fs:150\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/Resharp/fsil.fs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"a814a8bef4b0f8fc5c0430d222c80d5a0d4fd56abb6f990f9e0d1314a19df21c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/Resharp/RegexBuilder.fs:405-418 | src/Resharp/RegexBuilder.fs:448-461 | src/Resharp/Types.fs:343-356 \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/Resharp/RegexBuilder.fs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa295c057e139fb929d21dd484a68a6b69cdee29869a1e8d0f09b24e021acef6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): src/Resharp.Runtime/RegexNode.cs:1042-1051 | src/Resharp.Runtime/RegexNode.cs:1169-1182 \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/Resharp.Runtime/RegexNode.cs:1042\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a10963f31a13321cd217a2fdc06757f77072b20025787bc82a461e330b36d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/Resharp/Regex.fs:773-786 | src/Resharp/Regex.fs:818-831 \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/Resharp/Regex.fs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d5161b5e52b69e0ea90d61b0a9ccfd1ef045797bc233760a7dc7d1005d2e8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/Resharp.Runtime/RegexNode.cs:871-882 | src/Resharp.Runtime/RegexNode.cs:891-903 \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/Resharp.Runtime/RegexNode.cs:871\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa504326889147c0070d2eef5446aba24336766842687f822cb5c75132ffbb88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/Resharp/Info.fs:14-26 | src/Resharp/Info.fs:53-64 \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/Resharp/Info.fs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"74557ba6cef9d20f468c73f00a0d2830e62a96eb1bea2cb6aee41a807d8f234e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/Resharp/Regex.fs:1369-1381 | src/Resharp/Regex.fs:1399-1411 \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/Resharp/Regex.fs:1369\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/Resharp/Regex.fs"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e89deedf7b2d7231990aa093e3805bf4936367feaba84fe07fbf5d799be2a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/Resharp/RegexBuilder.fs:950-962 | src/Resharp/RegexBuilder.fs:967-979 \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/Resharp/RegexBuilder.fs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"415939506d5b225f40db9e5b8afffcee58ebc7a4443bdffc91a00b43638eb5fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/Resharp/fsil.fs:123-134 | src/Resharp/fsil.fs:136-148 \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/Resharp/fsil.fs:136\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/Resharp/fsil.fs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"530bf279f2358c56d706536abee1dd0012a164b3d19d2cdceeb8d0b9ad61ce92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Resharp/RegexBuilder.fs:1571-1581 | src/Resharp/RegexBuilder.fs:1747-1757 \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/Resharp/RegexBuilder.fs"},"region":{"startLine":1571}}}],"partialFingerprints":{"codehealthFindingId/v1":"97bfe3e1d9c999f9f6c9c20961b230bb3d35e7c6ba7876f694ac17df7dda62a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Resharp.Runtime/BitVector.cs:91-98 | src/Resharp.Runtime/BitVector.cs:108-115 \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/Resharp.Runtime/BitVector.cs:91\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/Resharp.Runtime/BitVector.cs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"f138caa4b96b0b00e47793ddc458a7e5c98c568811443e6d75d69408b8093df5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): src/Resharp/RegexNodeConverter.fs:265-274 | src/Resharp/RegexNodeConverter.fs:279-286 \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/Resharp/RegexNodeConverter.fs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab836cf794208e653d9194cbe6212067417fad8deebc7b508cd0fb7fc597f60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Resharp/Minterms.fs:54-62 | src/Resharp/Minterms.fs:108-116 \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/Resharp/Minterms.fs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"1038a435cf0d8780b728f4553f9b0d40b8b7802b1a78be2f8bf9a62f8b80d8cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Resharp/Patterns.fs:105-113 | src/Resharp/Patterns.fs:127-135 \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/Resharp/Patterns.fs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ddc9b1c96312d5c2abc2fc3f1b23ac31d5656469cf3667e101a4f76ccf94349"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Resharp/RegexBuilder.fs:1585-1593 | src/Resharp/RegexBuilder.fs:1761-1769 \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/Resharp/RegexBuilder.fs"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9b80aed759dc464c89c350d84a86cd0fceffa51cef0c66143b9945dffdd5b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/Resharp/RegexBuilder.fs:1601-1609 | src/Resharp/RegexBuilder.fs:1643-1650 \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/Resharp/RegexBuilder.fs"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ebfbb833f7c92bed168cea76a9843a1959130de8dd4a9bb4b6ace238f74489"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Resharp/Types.fs:430-438 | src/Resharp/Types.fs:446-454 \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/Resharp/Types.fs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b965cccda55f6ccf16f8827a5472a48e5f5fd6bb2deee3461071e569a8a35ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Resharp/RegexBuilder.fs:913-920 | src/Resharp/RegexBuilder.fs:1152-1159 \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/Resharp/RegexBuilder.fs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fce39f3f4b760387d996aa3bd76e3e5fd4ebff8c8143a6761e98194a12e9dde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Resharp/RegexBuilder.fs:923-930 | src/Resharp/RegexBuilder.fs:1162-1169 \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/Resharp/RegexBuilder.fs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"199667b61515153cccc888c4e21b024a26001178e87dbf10d13ae801ea054a51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Resharp/Patterns.fs:117-123 | src/Resharp/Patterns.fs:139-145 \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/Resharp/Patterns.fs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c3a43d0ad1ae1de7d6ee48d79fd83e215fa3b4ba83b06b5178f9c9f808fbd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Resharp/RegexBuilder.fs:915-921 | src/Resharp/RegexBuilder.fs:925-931 \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/Resharp/RegexBuilder.fs:915\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/Resharp/RegexBuilder.fs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf7432d8892d9d693b0ab32a11ad7a57c06d9b9f9128dd5ea41a7d7ad237cf2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Resharp/RegexBuilder.fs:1154-1160 | src/Resharp/RegexBuilder.fs:1164-1170 \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/Resharp/RegexBuilder.fs:1154\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/Resharp/RegexBuilder.fs"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"4518f8ca049f06bd4e847eab083233221dd5aa8f0cebb678c1ec63594335f1b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Resharp/RegexBuilder.fs:2598-2604 | src/Resharp/RegexBuilder.fs:2638-2644 \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/Resharp/RegexBuilder.fs"},"region":{"startLine":2598}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b99e599e9ade59577484201e5eb4a0864839fa1d4dccc5be32e16607a9408f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): src/Resharp/RegexBuilder.fs:915-920 | src/Resharp/RegexBuilder.fs:925-930 | src/Resharp/RegexBuilder.fs:1154-1159 | src/Resharp/RegexBuilder.fs:1164-1169 \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/Resharp/RegexBuilder.fs:915\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/Resharp/RegexBuilder.fs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f212395e8b62ea28c792cfe113a16285d55290cc2efa3e219ed6063ff44117"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/Resharp/Patterns.fs:10-15 | src/Resharp/Patterns.fs:34-39 | src/Resharp/Patterns.fs:42-47 \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/Resharp/Patterns.fs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"33015dd455ec5fa511a00dd27ddfd43680cc264dff3f8f4592c6125e1595697f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Resharp/Info.fs:27-32 | src/Resharp/Info.fs:72-77 \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/Resharp/Info.fs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51e0a4db462786cae1b8ff0b2661fee2a8eea9f03126c2e0848ac80f948d86d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Resharp/RegexBuilder.fs:983-988 | src/Resharp/RegexBuilder.fs:1008-1013 \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/Resharp/RegexBuilder.fs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6680602ac41fb7a31d1204ca7e44f1ce1b7a1eef9bf7d0aecbf77a6009db614"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/Resharp/Patterns.fs:111-115 | src/Resharp/Patterns.fs:117-121 | src/Resharp/Patterns.fs:139-143 \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/Resharp/Patterns.fs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9435febf438b7a5b6ab631ca285e738c0794ea9b2fb4475387514add79c9d2"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: lib/runtime-local/HexConverter.cs: 0.0% line coverage (0/108)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/HexConverter.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe864ec1ce504ec85543b7e15cb9f88ca69352c090bc5afb61d2ec620dbae630"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: lib/runtime-local/StackHelper.cs: 8.3% line coverage (3/36)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91df0d5359689d37e402cc2bff61a55dae64b4e4fe3f5f1f5862a42ac87370ec"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: lib/runtime-local/HashtableExtensions.cs: 0.0% line coverage (0/8)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/HashtableExtensions.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3f194676d94e2d5098703ed9c0891ab02c19095083cbcb58261cb7a9220572"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: lib/runtime-local/ValueListBuilder.cs: 20.2% line coverage (22/109)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/ValueListBuilder.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30e391073129cd45ae4e911d69b1e9705b023beb2eca024ce92f7060a111b56"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: lib/runtime-local/ValueStringBuilder.cs: 17.3% line coverage (34/196)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/ValueStringBuilder.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c5c0e2f235ed193fc407893e0b1db9c3adfc30278d49662ffd7492f223590e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: lib/runtime-local/StructListBuilder.cs: 0.0% line coverage (0/30)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StructListBuilder.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc67a6ec0e0b9dc52b8acd148d4643c9fcd6939d7bd22e3951761c97fe7919f9"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/Resharp.Runtime/Stubs.cs: 0.0% line coverage (0/5)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/Stubs.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"672ffe2b4f656354385bb530b9b6e2615c007bf2b38be1ffe843e41152d129da"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: lib/runtime-local/RegexParseException.cs: 0.0% line coverage (0/11)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/RegexParseException.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1692a06cd37876166b7d58207766dbb388510effa1a4585955200ea59d1fb8f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/Resharp.Runtime/BDD.cs: 48.5% line coverage (79/163)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/BDD.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e28d7c73b9b8c6ae6bca74926db86ae40254ef4f9e8c7171396fb970cacb940"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/Resharp.Runtime/BitVector.cs: 0.0% line coverage (0/97)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/BitVector.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"522aab80973e9d58c1486baa1b4d60a8daa2c8aac9a72d3e4f64374c8c9f6a87"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/Resharp.Runtime/BitVectorSolver.cs: 0.0% line coverage (0/49)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/BitVectorSolver.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab84069156162e7957a3d3e9d165bddf6e13d33bc1fc882cef6144a056f9ae1"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/Resharp.Runtime/ExtendedRegexParser.cs: 42.0% line coverage (604/1439)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/ExtendedRegexParser.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c297322f2be7e975e8f2105da9d24552e2902339dc6e5ec3e84044ee4646ce2"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/Resharp.Runtime/RegexCaseEquivalences.cs: 0.0% line coverage (0/57)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexCaseEquivalences.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32645e08f275e6a91c265488d73a913730889ebd757c7e6d019bbee25029dac"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/Resharp.Runtime/RegexCharClass.cs: 31.9% line coverage (373/1169)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexCharClass.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"295c7d81d2e0383f282140ea9b85af5719a465eea9deab886865caebcac5bb1f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/Resharp.Runtime/RegexNode.cs: 32.1% line coverage (428/1333)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b54cb6ba2c343489818581373b17bf08ddafb1d87d290fdf3461c95fe6f64c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/Resharp.Runtime/UnicodeCategoryRanges.cs: 30.8% line coverage (20/65)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/UnicodeCategoryRanges.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa093e398f7cd609b55dfac0a88988aaf0ef296a64f2976c95808d22497ae654"}},{"ruleId":"D8","level":"warning","message":{"text":"CRAP 2186: RegexNode.CanBeMadeAtomic: Cyclomatic 82 with 32.1% file coverage \u2014 too complex for how untested it is (CRAP = CC\u00B2\u00B7(1\u2212cov)\u00B3 \u002B CC; \u226530 needs tests or simplification)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":1990}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d8bb1c8ce530718f865b0c8e608e8f5406316686c7c381b26ff2cde36fb7b4"}},{"ruleId":"D8","level":"warning","message":{"text":"CRAP 1741: RegexNode.ReduceAlternation: Cyclomatic 73 with 32.1% file coverage \u2014 too complex for how untested it is (CRAP = CC\u00B2\u00B7(1\u2212cov)\u00B3 \u002B CC; \u226530 needs tests or simplification)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"201943d3167d3729284384436f9b9d41b338bc3004fce63238ee3c1376c4378e"}},{"ruleId":"D8","level":"warning","message":{"text":"CRAP 1174: ExtendedRegexParser.ScanRegex: Cyclomatic 75 with 42.0% file coverage \u2014 too complex for how untested it is (CRAP = CC\u00B2\u00B7(1\u2212cov)\u00B3 \u002B CC; \u226530 needs tests or simplification)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/ExtendedRegexParser.cs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"09795509402f01b38c0baf518bd3100e8d0ac545c3ea17a79dd2b47e10904740"}},{"ruleId":"D8","level":"warning","message":{"text":"CRAP 1114: ExtendedRegexParser.ScanGroupOpen: Cyclomatic 73 with 42.0% file coverage \u2014 too complex for how untested it is (CRAP = CC\u00B2\u00B7(1\u2212cov)\u00B3 \u002B CC; \u226530 needs tests or simplification)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/ExtendedRegexParser.cs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"130a715a51bb395e731a248838fbf3758f33202edc1ca8c0ac5c7f5040fc9217"}},{"ruleId":"D8","level":"warning","message":{"text":"CRAP 813: ExtendedRegexParser.ScanCharClass: Cyclomatic 62 with 42.0% file coverage \u2014 too complex for how untested it is (CRAP = CC\u00B2\u00B7(1\u2212cov)\u00B3 \u002B CC; \u226530 needs tests or simplification)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/ExtendedRegexParser.cs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f5d480379025193a589f0be01fe0805bab39d73a1bb25414afd3ea8b1522ed"}},{"ruleId":"D8","level":"warning","message":{"text":"CRAP 769: RegexNode.ValidateFinalTreeInvariants: Cyclomatic 48 with 32.1% file coverage \u2014 too complex for how untested it is (CRAP = CC\u00B2\u00B7(1\u2212cov)\u00B3 \u002B CC; \u226530 needs tests or simplification)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed7ecdeaf6c1e70ab4fc93f41f5732cd10b3cc08d685d73c82c7a499df6fa17"}},{"ruleId":"D8","level":"warning","message":{"text":"CRAP 738: RegexNode.ReduceConcatenationWithAdjacentLoops: Cyclomatic 47 with 32.1% file coverage \u2014 too complex for how untested it is (CRAP = CC\u00B2\u00B7(1\u2212cov)\u00B3 \u002B CC; \u226530 needs tests or simplification)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"277c06cbbd3e26475094c315cbaa5be251245ccc6b974217363316b910888432"}},{"ruleId":"D8","level":"warning","message":{"text":"CRAP 679: RegexNode.Describe: Cyclomatic 45 with 32.1% file coverage \u2014 too complex for how untested it is (CRAP = CC\u00B2\u00B7(1\u2212cov)\u00B3 \u002B CC; \u226530 needs tests or simplification)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":2735}}}],"partialFingerprints":{"codehealthFindingId/v1":"0384a9099e7a995e551da1fc41d204be4e37c36f94af1a464e5dd550f4d8d2cb"}},{"ruleId":"D12","level":"note","message":{"text":"Outdated: coverlet.collector: coverlet.collector 6.0.2 \u2192 10.1.0 available (referenced by Resharp.Test)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Directory.Packages.props"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3233e35c9af91a23826c2b9c32dd3eb3674bd1f0fa7f30f4742ae3349d69e42d"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: xunit: xunit 2.8.1 \u2014 Legacy \u2014 the publisher\u0027s replacement is \u0060xunit.v3\u0060; that is the next major line under a new package id, so the move is a breaking rename rather than a version bump \u2014 budget for API changes in the code that uses it, not only the reference swap."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Directory.Packages.props"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37c8c0e8046c9e8358e976373216abfb78e9fdef63ed53d3edcaa7d2238edcd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Resharp/Optimizations.fs: src/Resharp/Optimizations.fs changed 2 times in last 90 days, max cyclomatic complexity 28 in Optimizations.findInitialOptimizations at line 669. 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-07-05..2026-10-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-05 20:28:47 \u002B03:00\u0027 --until=\u00272026-10-03 20:28:47 \u002B03:00\u0027 --full-history --no-merges -- src/Resharp/Optimizations.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/Resharp/Optimizations.fs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff38360946de26dd6bb826a51f68d4c51a93d957cfa49475f67a1524a499c36"}},{"ruleId":"D17","level":"warning","message":{"text":"CommentedOutCode: 4 consecutive commented-code lines"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/HexConverter.cs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ee3be8c7719082114deb9d3bb8d34bdd9ec9fc849fbf57b4e6eafeb77d28e6"}},{"ruleId":"D17","level":"warning","message":{"text":"CommentedOutCode: 4 consecutive commented-code lines"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/ExtendedRegexParser.cs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fca6524d497b6c4b2deaae004d44f5a6ab9596903d514bf6ac0e573e152fd4"}},{"ruleId":"D17","level":"warning","message":{"text":"CommentedOutCode: 4 consecutive commented-code lines"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/ExtendedRegexParser.cs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc6aa9f2729f103e61287ed65c33fd15e27492da43618aa7b09d220cd35dfc7"}},{"ruleId":"D17","level":"warning","message":{"text":"DeadPreprocessorBranch: #if SYSTEM_PRIVATE_CORELIB \u2014 no definition of that symbol was found anywhere this analysis looks: not in a \u003CDefineConstants\u003E in any project file, props or targets under any condition, not on a build script\u0027s command line, not in a #define, and not in a project-template manifest; nor is it one the compiler or SDK defines itself. On that evidence the condition is decided the same way in every configuration this repository can build, and the code on the dead side of it never compiles \u2014 including the part a reader will assume is what ships. Either define the symbol in the configuration that is supposed to have it, or delete the branch and keep the behaviour you are actually shipping. If some other mechanism binds it, that mechanism is outside the list above and this row is a gap in what we read, not a fact about your code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/HexConverter.cs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5bfc3af631d9a73d46aff305296e08650b272692b3800dcf54e68b99566060f"}},{"ruleId":"D17","level":"warning","message":{"text":"DeadPreprocessorBranch: #if SYSTEM_PRIVATE_CORELIB \u2014 no definition of that symbol was found anywhere this analysis looks: not in a \u003CDefineConstants\u003E in any project file, props or targets under any condition, not on a build script\u0027s command line, not in a #define, and not in a project-template manifest; nor is it one the compiler or SDK defines itself. On that evidence the condition is decided the same way in every configuration this repository can build, and the code on the dead side of it never compiles \u2014 including the part a reader will assume is what ships. Either define the symbol in the configuration that is supposed to have it, or delete the branch and keep the behaviour you are actually shipping. If some other mechanism binds it, that mechanism is outside the list above and this row is a gap in what we read, not a fact about your code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/HexConverter.cs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb31b16ed590677cf74236043954111fb2019fb3039b3b91194524fc2c06d59d"}},{"ruleId":"D17","level":"warning","message":{"text":"DeadPreprocessorBranch: #if SYSTEM_PRIVATE_CORELIB \u2014 no definition of that symbol was found anywhere this analysis looks: not in a \u003CDefineConstants\u003E in any project file, props or targets under any condition, not on a build script\u0027s command line, not in a #define, and not in a project-template manifest; nor is it one the compiler or SDK defines itself. On that evidence the condition is decided the same way in every configuration this repository can build, and the code on the dead side of it never compiles \u2014 including the part a reader will assume is what ships. Either define the symbol in the configuration that is supposed to have it, or delete the branch and keep the behaviour you are actually shipping. If some other mechanism binds it, that mechanism is outside the list above and this row is a gap in what we read, not a fact about your code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/HexConverter.cs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72cc6377a4df539a9f3ecde7d05297d30cea9a51dd0100932f34c333346d815"}},{"ruleId":"D17","level":"warning","message":{"text":"DeadPreprocessorBranch: #if SYSTEM_PRIVATE_CORELIB \u2014 no definition of that symbol was found anywhere this analysis looks: not in a \u003CDefineConstants\u003E in any project file, props or targets under any condition, not on a build script\u0027s command line, not in a #define, and not in a project-template manifest; nor is it one the compiler or SDK defines itself. On that evidence the condition is decided the same way in every configuration this repository can build, and the code on the dead side of it never compiles \u2014 including the part a reader will assume is what ships. Either define the symbol in the configuration that is supposed to have it, or delete the branch and keep the behaviour you are actually shipping. If some other mechanism binds it, that mechanism is outside the list above and this row is a gap in what we read, not a fact about your code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/HexConverter.cs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"8631a58441ab724a662519862f4219b3ffb0a29ee362bd3d61d9a03c92c9a55a"}},{"ruleId":"D17","level":"warning","message":{"text":"DeadPreprocessorBranch: #if SYSTEM_PRIVATE_CORELIB \u2014 no definition of that symbol was found anywhere this analysis looks: not in a \u003CDefineConstants\u003E in any project file, props or targets under any condition, not on a build script\u0027s command line, not in a #define, and not in a project-template manifest; nor is it one the compiler or SDK defines itself. On that evidence the condition is decided the same way in every configuration this repository can build, and the code on the dead side of it never compiles \u2014 including the part a reader will assume is what ships. Either define the symbol in the configuration that is supposed to have it, or delete the branch and keep the behaviour you are actually shipping. If some other mechanism binds it, that mechanism is outside the list above and this row is a gap in what we read, not a fact about your code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/HexConverter.cs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe7d720ebb09708263a3722940f1879d434b4d655e1a36aef24d4383367aa16"}},{"ruleId":"D17","level":"warning","message":{"text":"DeadPreprocessorBranch: #if SYSTEM_TEXT_REGULAREXPRESSIONS \u2014 no definition of that symbol was found anywhere this analysis looks: not in a \u003CDefineConstants\u003E in any project file, props or targets under any condition, not on a build script\u0027s command line, not in a #define, and not in a project-template manifest; nor is it one the compiler or SDK defines itself. On that evidence the condition is decided the same way in every configuration this repository can build, and the code on the dead side of it never compiles \u2014 including the part a reader will assume is what ships. Either define the symbol in the configuration that is supposed to have it, or delete the branch and keep the behaviour you are actually shipping. If some other mechanism binds it, that mechanism is outside the list above and this row is a gap in what we read, not a fact about your code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/RegexParseError.cs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24edc4b874453c5138cb68ac68c92065d5d371ed85426e8c16d7296d74ef327"}},{"ruleId":"D17","level":"warning","message":{"text":"DeadPreprocessorBranch: #if SYSTEM_TEXT_REGULAREXPRESSIONS \u2014 no definition of that symbol was found anywhere this analysis looks: not in a \u003CDefineConstants\u003E in any project file, props or targets under any condition, not on a build script\u0027s command line, not in a #define, and not in a project-template manifest; nor is it one the compiler or SDK defines itself. On that evidence the condition is decided the same way in every configuration this repository can build, and the code on the dead side of it never compiles \u2014 including the part a reader will assume is what ships. Either define the symbol in the configuration that is supposed to have it, or delete the branch and keep the behaviour you are actually shipping. If some other mechanism binds it, that mechanism is outside the list above and this row is a gap in what we read, not a fact about your code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/RegexParseException.cs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6bc79276db8a5f90185534fd7d96b0266dad485fa32bf2c7099d8b1206d984"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: implement optimizations for negations \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"585a7759702702cdf794a2392e68544f88e76f4a909a2ab530f186e9bab29042"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: figure out what to do with negations \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"649d98ff55897c86b35aba49f8ebc803c25b921fa4ec02099401d7534ee7cb72"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: figure out what to do with negations in concats \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"258ef1e1e1db83911960320985d1df5cbc7bb1ec0b9bd28f8a701bb2ed7f09a9"}},{"ruleId":"D17","level":"warning","message":{"text":"CoverageExclusion: method ToString \u2014 this shipped code is lifted out of the coverage measurement, so it is not that the code is reported as untested: it is not reported at all. The excluded lines leave the denominator, which means the percentage the team publishes goes UP when code stops being covered, and the gap is invisible in the artefact that would otherwise disclose it. Nothing here is written by a compiler or a build \u2014 the attribute is only ever typed by an author \u2014 so it is a standing decision, and the only record of it is this line. Test what it covers and delete the attribute; where the code genuinely cannot be exercised (a debugger display, a platform branch this build cannot reach), narrow the exclusion to the smallest declaration that is really untestable rather than the type around it, so members added later are not silently excluded too. If it is correct as it stands, say why \u2014 in the attribute\u0027s own Justification, or in a comment above it: that is what turns it from unexplained debt into a recorded decision, and it clears this row."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":2702}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c1f44cc9cd7c5b4d379e39f526bb9b5cb02692fd0e5cd9d0575062dea0bc68"}},{"ruleId":"D17","level":"warning","message":{"text":"CoverageExclusion: method Describe \u2014 this shipped code is lifted out of the coverage measurement, so it is not that the code is reported as untested: it is not reported at all. The excluded lines leave the denominator, which means the percentage the team publishes goes UP when code stops being covered, and the gap is invisible in the artefact that would otherwise disclose it. Nothing here is written by a compiler or a build \u2014 the attribute is only ever typed by an author \u2014 so it is a standing decision, and the only record of it is this line. Test what it covers and delete the attribute; where the code genuinely cannot be exercised (a debugger display, a platform branch this build cannot reach), narrow the exclusion to the smallest declaration that is really untestable rather than the type around it, so members added later are not silently excluded too. If it is correct as it stands, say why \u2014 in the attribute\u0027s own Justification, or in a comment above it: that is what turns it from unexplained debt into a recorded decision, and it clears this row."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":2735}}}],"partialFingerprints":{"codehealthFindingId/v1":"7250fe5d7f17a5a7b1ff577fd4d8e2217afc47f913a872a39cc27d459bdb6a0e"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: CS0436 \u2014 this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or \u2014 if some occurrences really are legitimate \u2014 narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/Resharp.Runtime.csproj"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b81c4adaa8834f3c30b98a6f182d1cfeb3073df37e495468116909d7d8d646"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: CS8500 \u2014 this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or \u2014 if some occurrences really are legitimate \u2014 narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/Resharp.Runtime.csproj"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3421d01c473e1cb2159382517486ac5b7cc3ae8b05f8594622d2a6c4b0d9b3"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060GetMintermID\u0060 spells \u0060ID\u0060 where 59 names in the project spell it \u0060Id\u0060: 59 of 60 names in project Resharp.Runtime spell the token \u0060Id\u0060 (59 of 60; unit: names in project Resharp.Runtime containing \u0060Id\u0060). Peers: Obsoletions.SystemTextEncodingUTF7DiagId (lib/runtime-local/Obsoletions.cs:16); Obsoletions.PrincipalPermissionAttributeDiagId (lib/runtime-local/Obsoletions.cs:19); Obsoletions.CodeAccessSecurityDiagId (lib/runtime-local/Obsoletions.cs:22); Obsoletions.ConstrainedExecutionRegionDiagId (lib/runtime-local/Obsoletions.cs:25); Obsoletions.GlobalAssemblyCacheDiagId (lib/runtime-local/Obsoletions.cs:28). Rename to \u0060GetMintermId\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/MintermClassifier.cs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"3962385fdb5063b61676c338d60cfaa87ab98f35ee97063d2df9459fb1616f7d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022same as Array.MaxLength\u0022 repeats the code it sits on: 3 of its 3 words (array, max, length) are already in \u0060const int ArrayMaxLength = 0x7FFFFFC7; // same as Array.MaxLength\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/ValueListBuilder.cs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d380439617db5929b401e2f52cc9e35aa285ed331dfb79b2172cff7bde7129"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022same as Array.MaxLength\u0022 repeats the code it sits on: 3 of its 3 words (array, max, length) are already in \u0060const uint ArrayMaxLength = 0x7FFFFFC7; // same as Array.MaxLength\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/ValueStringBuilder.cs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90c02fe9ad922f8f22cca2cfe6be5a42cfa0e76e866a642024cfdc616c08042"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060Resharp.Runtime(net8.0)\u0060 overshoots its size bounds (11136 LoC, 49 public types across 23 namespaces). 1 of 2 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. Review these for cohesion \u2014 draw the boundary inside the assembly first (group each responsibility into its own namespace/folder and keep the cross-boundary members internal), since splitting a published assembly moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/Resharp.Runtime.csproj"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dcc6f07412803a9ba94fa1ea75abc78c64d3636ea6d866f172d1a90d564390f"}},{"ruleId":"D27","level":"note","message":{"text":"Scattered collaborators: 92 % of calls cross a namespace and only 39 % of collaborators are co-located \u2014 group each feature\u0027s code into a vertical slice so a call\u0027s collaborators sit together."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5aad4a4530bac3928d3a065a664be89d023ecfc865f9bf79ac05754b3bffe322"}},{"ruleId":"D28","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":"94359362860f3e7c8fea98c89c47e807fc8c99ba0f57406fc20069a7bd8cda3b"},"properties":{"commitSha":"b399ad87c5a71b4c616cd31e7bb32d0791ee5924"}},{"ruleId":"D28","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":"a7e9777d82551034249ba560c1877cf4e0ee87dae78225d3a9dd005189d9f359"},"properties":{"commitSha":"b399ad87c5a71b4c616cd31e7bb32d0791ee5924"}},{"ruleId":"D28","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":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"IC1","level":"warning","message":{"text":"Bound check compiled out of the shipping build: The only thing establishing that \u0060bytes\u0060 is long enough before it is indexed is a \u0060Debug.Assert\u0060, which is \u0060[Conditional(\u0022DEBUG\u0022)]\u0060 \u2014 the compiler deletes the call from Release, so the build your users install indexes \u0060bytes\u0060 with no length check at all and throws at the indexer instead of failing diagnosably. \u0060bytes\u0060 comes from outside this method, so its length is a contract, not something this code can see. Bound it with a check that ships (\u0060if (bytes.Count \u003C n) throw \u2026\u0060, or \u0060ArgumentOutOfRangeException.ThrowIfLessThan\u0060), and keep the assert for the invariant you believe holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/BDD.cs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a337231fedb9651beffed2c5f8dbc6892417cd39c4c0a15a23d9fe4b6520dd"}},{"ruleId":"IC1","level":"warning","message":{"text":"Bound check compiled out of the shipping build: The only thing establishing that \u0060twoChars\u0060 is long enough before it is indexed is a \u0060Debug.Assert\u0060, which is \u0060[Conditional(\u0022DEBUG\u0022)]\u0060 \u2014 the compiler deletes the call from Release, so the build your users install indexes \u0060twoChars\u0060 with no length check at all and throws at the indexer instead of failing diagnosably. \u0060twoChars\u0060 comes from outside this method, so its length is a contract, not something this code can see. Bound it with a check that ships (\u0060if (twoChars.Count \u003C n) throw \u2026\u0060, or \u0060ArgumentOutOfRangeException.ThrowIfLessThan\u0060), and keep the assert for the invariant you believe holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexCharClass.cs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"79601c66a41b1fda7205cd27255983c28a952ef1305bfb94b723b75a07662dd7"}},{"ruleId":"IC1","level":"note","message":{"text":"Commented-out code: A line of code has been commented out rather than removed \u2014 dead weight that rots and confuses. Delete it (version control remembers)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/HexConverter.cs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1b1a0db83d06837576fc5a5440dc68fb03bfed2baa9b40d7e1f1e2af9e3d91"}},{"ruleId":"IC1","level":"note","message":{"text":"Commented-out code: A line of code has been commented out rather than removed \u2014 dead weight that rots and confuses. Delete it (version control remembers)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/HexConverter.cs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0a04a596ced33e121117284ff1b7ee3f94a1142f35ddda3147856e63d01e75"}},{"ruleId":"IC1","level":"note","message":{"text":"Commented-out code: A line of code has been commented out rather than removed \u2014 dead weight that rots and confuses. Delete it (version control remembers)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/HexConverter.cs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"008890fb1e4d0d96ac37338b01290d7cf23e1d4b5d40ac156bce41ef988f4441"}},{"ruleId":"IC1","level":"note","message":{"text":"Commented-out code: A line of code has been commented out rather than removed \u2014 dead weight that rots and confuses. Delete it (version control remembers)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/HexConverter.cs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"16bb6dc95eb96dc0cd790005a3dd620a97aadd4683aa52bc9663b53d9e9c5fa5"}},{"ruleId":"IC1","level":"note","message":{"text":"Commented-out code: A line of code has been commented out rather than removed \u2014 dead weight that rots and confuses. Delete it (version control remembers)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/ExtendedRegexParser.cs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"75afea803a3bc75e49869de5d67b6dc4f34e7edaacd95d29289c2b5c4d65cf84"}},{"ruleId":"IC1","level":"note","message":{"text":"Commented-out code: A line of code has been commented out rather than removed \u2014 dead weight that rots and confuses. Delete it (version control remembers)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/ExtendedRegexParser.cs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ced399a9fb33b0fd5ed3f12d3192b94b363faa6458dd7bfe7fb0a98994d01f"}},{"ruleId":"IC1","level":"note","message":{"text":"Commented-out code: A line of code has been commented out rather than removed \u2014 dead weight that rots and confuses. Delete it (version control remembers)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8da50ee4649a4291c525e8de9cebc77b14701d34a5c10f8f95b041164c7ec68"}},{"ruleId":"IC1","level":"note","message":{"text":"Commented-out code: A line of code has been commented out rather than removed \u2014 dead weight that rots and confuses. Delete it (version control remembers)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexTree.cs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e43b30a3e139ae5b47c74c9d22d73e5e294ee625cda5b1e2a1debb09403d03b"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"P1","level":"warning","message":{"text":"No CI pipeline: No CI workflow found (.github/workflows, azure-pipelines.yml, .gitlab-ci.yml, \u2026) \u2014 changes aren\u0027t gated by an automated build/test."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"44f01af96e50474fba2df84d95ddf4f7e1d34c29c307830b9efc9057daa6b670"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add CodeQL\u0027s csharp pack, or a .NET security analyzer package (or \u0060semgrep --config=auto\u0060, which runs on any language) \u2014 this repository has no CI pipeline yet, so run it locally to clear the existing findings, then make it a step of the first workflow you add so a regression fails the build. What was searched, so you can tell an absence from a miss: the 0 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060Directory.Packages.props\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Directory.Packages.props"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"132ddc29b0ce983131ec605b63b624864af81c7452690d92419c7655d5dbaa7f"}},{"ruleId":"P6","level":"note","message":{"text":"Changelog looks stale/thin: The changelog this check read carries 1 versioned entry, against a bar of 3. Counted as either the distinct \u0060x.y.z\u0060 versions it names (a link\u0027s target is not counted) or its version-shaped section headings (\u0060## [1.2.0]\u0060, \u0060## V14.x.x\u0060, \u0060## Updates in 8.0.x\u0060), whichever is the larger \u2014 so a log sectioned by minor series counts its sections, not its individual patch numbers. Entries recorded somewhere this check does not read \u2014 release notes generated at tag time from a generator config it did not recognise, or a log kept outside the repository \u2014 are not counted here, and this row is about what is re-findable in the tree rather than about how often you release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c9a74c249fe67853238d9c15085f7f97d31f51bb82455046aa10c2cef82f67b8"}},{"ruleId":"PF1","level":"note","message":{"text":"Benchmarks don\u0027t track allocations: A BenchmarkDotNet suite exists but no [MemoryDiagnoser] \u2014 allocations (the main way hot code pressures the GC) aren\u0027t being measured."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5f9fed18e89835499003434961acf480b8e8012b3bcbeb02e6e62db64ca75aa9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: 22 blocking call(s) on async work (.Wait()/.GetAwaiter().GetResult()) \u2014 these waste a thread and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2dedb76432d7d4f359386b5c37564c0f3de368182a77e31aa8af9ba73f9a4def"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5a4acda9c40ef017ea6b640ddae060ecaf5f64995e9d38cfccb1bb31df3c4f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee7d22fa9dd8ada722f71c1cc52a2064915d70d4f669c0cc08c977c4c9a705f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9b69ddb0a038cee8d333f181a639ce416ca2d2d68a87ccfbd8bf8f6838ed84"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c96f91f16b19e8722efcc6a3bd013d9d79ad7f9e8eadbd577ecc80a2f77370"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8c0c974a6b81c78e327bf77afb3cc4cd33bc09078272d1bf7c2a41cd1d4034"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb5beb9b1ee16c7be956099e4d0c92f9cd33ff3b96c21bc21221e855279e432"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2dad695e05eaae8acd3a9e8b551fd6a93bb7bc00dd32780671362aa509fa062"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72972d4a2393a7b551312276e649de505be3ac0e95430cd1b7a2b7c3b327e12"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"de19286f916e9a059c9aebf3f45b16cd4f7f2d6481ac379d12c6ce821c16cdde"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"413c6792ff6efebee40699c1b06e336e2785201945fe8b05ff89239d7f0a43e8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"737f29819769a530aaacfab254cb702f370868ea7e9e40ff6ecc3b1a3078e057"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a339f36b94cee8c7ddfb7de754afdbe737382a4c20d8f6960dd43f4b6053aca"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d9ac99dd62d32ac6b174d7775c043c3a9621ed26aa6aec48d6f9abc9ad06fa"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16def853082f9c671b8b9ed7e7ae47d72b770b8e216ccd79befa7677dc5d6ed"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5693fbc595951df853c2b8c55f25abd47af89173d167b29dfc19a17f21dca3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8e190ce0500657558037850e73845002c44b91dec4ba3ff0ab92cc2e9a3293"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1343f03f2c29698bf32d33f16dd10f419d7d93259bb0c25820cc2e1393ed59a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8af231f49b472773aaccd6132334ef284377b53d700a3e6446394f45ea177b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b13d7ff3933fc082388673f56895a6b69bb1bded2c2955cce8962bab41d91cb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d54e77912257c154c18e5067dbcdcabe54400869fc0857f4289c3b49fda3acd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d711755a1c2a0bb8cb4dc0b8f27588656b827abbeffdb1f4a3c0c7fc5c86759"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76b9d47183b1cf246a948c317e654185a3ebbd4563916748b1835c32cc4affc"}},{"ruleId":"X1","level":"warning","message":{"text":"Sync-over-async (deadlock risk): Blocking on a Task with \u0060.Wait()\u0060/\u0060.GetAwaiter().GetResult()\u0060 can deadlock (and wastes a thread). Prefer awaiting it: make the caller \u0060async\u0060 and \u0060await\u0060 instead. Where a synchronous entry point must stay \u2014 a public sync API you cannot break, or a process entry point that must not return until the work finishes \u2014 the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5ec9fea5510d1b31b79a9b4a9478080ec5c7db57ae8d64557a95e7f1db69fd"}},{"ruleId":"X1","level":"warning","message":{"text":"Sync-over-async (deadlock risk): Blocking on a Task with \u0060.Wait()\u0060/\u0060.GetAwaiter().GetResult()\u0060 can deadlock (and wastes a thread). Prefer awaiting it: make the caller \u0060async\u0060 and \u0060await\u0060 instead. Where a synchronous entry point must stay \u2014 a public sync API you cannot break, or a process entry point that must not return until the work finishes \u2014 the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ad749c869b7dae9d7070c03e95d98c3d35c93be339c5be84cc72117f015b03"}},{"ruleId":"X1","level":"warning","message":{"text":"Sync-over-async (deadlock risk): Blocking on a Task with \u0060.Wait()\u0060/\u0060.GetAwaiter().GetResult()\u0060 can deadlock (and wastes a thread). Prefer awaiting it: make the caller \u0060async\u0060 and \u0060await\u0060 instead. Where a synchronous entry point must stay \u2014 a public sync API you cannot break, or a process entry point that must not return until the work finishes \u2014 the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"c237b876cb1131144b2d175b5d2fce06b1e8667f207e54bdefc2eac629c0ee33"}},{"ruleId":"X1","level":"warning","message":{"text":"Sync-over-async (deadlock risk): Blocking on a Task with \u0060.Wait()\u0060/\u0060.GetAwaiter().GetResult()\u0060 can deadlock (and wastes a thread). Prefer awaiting it: make the caller \u0060async\u0060 and \u0060await\u0060 instead. Where a synchronous entry point must stay \u2014 a public sync API you cannot break, or a process entry point that must not return until the work finishes \u2014 the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"352103f0d585930c40d8f0dbc96ab0cf1c006688dd43ad5ba00c7c816b0ea55f"}},{"ruleId":"X1","level":"warning","message":{"text":"Sync-over-async (deadlock risk): Blocking on a Task with \u0060.Wait()\u0060/\u0060.GetAwaiter().GetResult()\u0060 can deadlock (and wastes a thread). Prefer awaiting it: make the caller \u0060async\u0060 and \u0060await\u0060 instead. Where a synchronous entry point must stay \u2014 a public sync API you cannot break, or a process entry point that must not return until the work finishes \u2014 the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fc2f586bad577ed8ec9fcbd49849d312dede8cacda22b4cd0856202a5826e7"}},{"ruleId":"X1","level":"warning","message":{"text":"Sync-over-async (deadlock risk): Blocking on a Task with \u0060.Wait()\u0060/\u0060.GetAwaiter().GetResult()\u0060 can deadlock (and wastes a thread). Prefer awaiting it: make the caller \u0060async\u0060 and \u0060await\u0060 instead. Where a synchronous entry point must stay \u2014 a public sync API you cannot break, or a process entry point that must not return until the work finishes \u2014 the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"aecceaccdd2e523cf1586028f530473ce93992564414abfe3babf1a13a19ca01"}},{"ruleId":"X1","level":"warning","message":{"text":"Sync-over-async (deadlock risk): Blocking on a Task with \u0060.Wait()\u0060/\u0060.GetAwaiter().GetResult()\u0060 can deadlock (and wastes a thread). Prefer awaiting it: make the caller \u0060async\u0060 and \u0060await\u0060 instead. Where a synchronous entry point must stay \u2014 a public sync API you cannot break, or a process entry point that must not return until the work finishes \u2014 the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3418b014ba371ecce7e5c053675f94ccbe1e5bba05edce91d8cac881d789b9"}},{"ruleId":"X1","level":"warning","message":{"text":"Sync-over-async (deadlock risk): Blocking on a Task with \u0060.Wait()\u0060/\u0060.GetAwaiter().GetResult()\u0060 can deadlock (and wastes a thread). Prefer awaiting it: make the caller \u0060async\u0060 and \u0060await\u0060 instead. Where a synchronous entry point must stay \u2014 a public sync API you cannot break, or a process entry point that must not return until the work finishes \u2014 the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"7094a850b1a1a3468dc6b67870829401d31b53c633ad6c99a5637227649ac65d"}},{"ruleId":"X1","level":"warning","message":{"text":"Sync-over-async (deadlock risk): Blocking on a Task with \u0060.Wait()\u0060/\u0060.GetAwaiter().GetResult()\u0060 can deadlock (and wastes a thread). Prefer awaiting it: make the caller \u0060async\u0060 and \u0060await\u0060 instead. Where a synchronous entry point must stay \u2014 a public sync API you cannot break, or a process entry point that must not return until the work finishes \u2014 the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbad006d7e1a9f9100f38f6542c505631e0610d22758b09e88d88ea2c8195ab7"}},{"ruleId":"X1","level":"warning","message":{"text":"Sync-over-async (deadlock risk): Blocking on a Task with \u0060.Wait()\u0060/\u0060.GetAwaiter().GetResult()\u0060 can deadlock (and wastes a thread). Prefer awaiting it: make the caller \u0060async\u0060 and \u0060await\u0060 instead. Where a synchronous entry point must stay \u2014 a public sync API you cannot break, or a process entry point that must not return until the work finishes \u2014 the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08d6ac59359c4d3627f096a4b38b44ddcd5fc38d1bc128da8b65eff615b74d0"}},{"ruleId":"X1","level":"warning","message":{"text":"Sync-over-async (deadlock risk): Blocking on a Task with \u0060.Wait()\u0060/\u0060.GetAwaiter().GetResult()\u0060 can deadlock (and wastes a thread). Prefer awaiting it: make the caller \u0060async\u0060 and \u0060await\u0060 instead. Where a synchronous entry point must stay \u2014 a public sync API you cannot break, or a process entry point that must not return until the work finishes \u2014 the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc4eaa4eb23a787d27ccbcd4601faf26fcda4087d3b7db6d061da9d78676877"}},{"ruleId":"X1","level":"warning","message":{"text":"Sync-over-async (deadlock risk): Blocking on a Task with \u0060.Wait()\u0060/\u0060.GetAwaiter().GetResult()\u0060 can deadlock (and wastes a thread). Prefer awaiting it: make the caller \u0060async\u0060 and \u0060await\u0060 instead. Where a synchronous entry point must stay \u2014 a public sync API you cannot break, or a process entry point that must not return until the work finishes \u2014 the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"2350b16cf4ea9667e7e0014a1b761b51dbfbf7225d5c1fe5ccc251bc672c3dfc"}},{"ruleId":"X1","level":"warning","message":{"text":"Sync-over-async (deadlock risk): Blocking on a Task with \u0060.Wait()\u0060/\u0060.GetAwaiter().GetResult()\u0060 can deadlock (and wastes a thread). Prefer awaiting it: make the caller \u0060async\u0060 and \u0060await\u0060 instead. Where a synchronous entry point must stay \u2014 a public sync API you cannot break, or a process entry point that must not return until the work finishes \u2014 the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a70914e4e86e2528460825c6270320f46445c8760c05559c812e9a5424967b5"}},{"ruleId":"X1","level":"warning","message":{"text":"Sync-over-async (deadlock risk): Blocking on a Task with \u0060.Wait()\u0060/\u0060.GetAwaiter().GetResult()\u0060 can deadlock (and wastes a thread). Prefer awaiting it: make the caller \u0060async\u0060 and \u0060await\u0060 instead. Where a synchronous entry point must stay \u2014 a public sync API you cannot break, or a process entry point that must not return until the work finishes \u2014 the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee7d6c18f305ec109266a4f7c795b25af3becd442f3e9bdecc0c81d3163c549"}},{"ruleId":"X1","level":"warning","message":{"text":"Sync-over-async (deadlock risk): Blocking on a Task with \u0060.Wait()\u0060/\u0060.GetAwaiter().GetResult()\u0060 can deadlock (and wastes a thread). Prefer awaiting it: make the caller \u0060async\u0060 and \u0060await\u0060 instead. Where a synchronous entry point must stay \u2014 a public sync API you cannot break, or a process entry point that must not return until the work finishes \u2014 the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a03be35c75fc6fedd316a21f0df8042a4c61f422082e47241ce4158c4e8cd7"}},{"ruleId":"X1","level":"warning","message":{"text":"Sync-over-async (deadlock risk): Blocking on a Task with \u0060.Wait()\u0060/\u0060.GetAwaiter().GetResult()\u0060 can deadlock (and wastes a thread). Prefer awaiting it: make the caller \u0060async\u0060 and \u0060await\u0060 instead. Where a synchronous entry point must stay \u2014 a public sync API you cannot break, or a process entry point that must not return until the work finishes \u2014 the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"c181dd687a7128ae36e8307bf10e3bc02bc73657c297fd8ec7c3865af1befc08"}},{"ruleId":"X1","level":"warning","message":{"text":"Sync-over-async (deadlock risk): Blocking on a Task with \u0060.Wait()\u0060/\u0060.GetAwaiter().GetResult()\u0060 can deadlock (and wastes a thread). Prefer awaiting it: make the caller \u0060async\u0060 and \u0060await\u0060 instead. Where a synchronous entry point must stay \u2014 a public sync API you cannot break, or a process entry point that must not return until the work finishes \u2014 the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92647018ab01e0986c8b0e6dd421a12fc805d6e2ac0a67b44e779586db2bd8e"}},{"ruleId":"X1","level":"warning","message":{"text":"Sync-over-async (deadlock risk): Blocking on a Task with \u0060.Wait()\u0060/\u0060.GetAwaiter().GetResult()\u0060 can deadlock (and wastes a thread). Prefer awaiting it: make the caller \u0060async\u0060 and \u0060await\u0060 instead. Where a synchronous entry point must stay \u2014 a public sync API you cannot break, or a process entry point that must not return until the work finishes \u2014 the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a4a7e4419de95aa6b4d05d0739bd9604a8ef12fa61355d583c1dbf6d241cf2"}},{"ruleId":"X1","level":"warning","message":{"text":"Sync-over-async (deadlock risk): Blocking on a Task with \u0060.Wait()\u0060/\u0060.GetAwaiter().GetResult()\u0060 can deadlock (and wastes a thread). Prefer awaiting it: make the caller \u0060async\u0060 and \u0060await\u0060 instead. Where a synchronous entry point must stay \u2014 a public sync API you cannot break, or a process entry point that must not return until the work finishes \u2014 the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c6917cb6d464c301837fc8c6894cce101250a3c41940d3adfe5515a0999574"}},{"ruleId":"X1","level":"warning","message":{"text":"Sync-over-async (deadlock risk): Blocking on a Task with \u0060.Wait()\u0060/\u0060.GetAwaiter().GetResult()\u0060 can deadlock (and wastes a thread). Prefer awaiting it: make the caller \u0060async\u0060 and \u0060await\u0060 instead. Where a synchronous entry point must stay \u2014 a public sync API you cannot break, or a process entry point that must not return until the work finishes \u2014 the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2c0843ebac4b7089947a3c8d2d4df1b577fee1f093a691aad08912d061fe54"}},{"ruleId":"X1","level":"warning","message":{"text":"Sync-over-async (deadlock risk): Blocking on a Task with \u0060.Wait()\u0060/\u0060.GetAwaiter().GetResult()\u0060 can deadlock (and wastes a thread). Prefer awaiting it: make the caller \u0060async\u0060 and \u0060await\u0060 instead. Where a synchronous entry point must stay \u2014 a public sync API you cannot break, or a process entry point that must not return until the work finishes \u2014 the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb1c8479739b4b6b0839e13193017b602e3f83a02b9c55c0eb92739c5353d81"}},{"ruleId":"X1","level":"warning","message":{"text":"Sync-over-async (deadlock risk): Blocking on a Task with \u0060.Wait()\u0060/\u0060.GetAwaiter().GetResult()\u0060 can deadlock (and wastes a thread). Prefer awaiting it: make the caller \u0060async\u0060 and \u0060await\u0060 instead. Where a synchronous entry point must stay \u2014 a public sync API you cannot break, or a process entry point that must not return until the work finishes \u2014 the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d090158b17e4996320dc51bb5242a35cff4079c0b191e3ff5423056bef2cfbf"}},{"ruleId":"X5","level":"note","message":{"text":"Null-forgiving operator (\u0060!\u0060) suppressions override nullable warnings: ~1.3 \u0060!\u0060 suppressions per 1k syntax nodes \u2014 135 suppression(s) across the 104728 syntax node(s) in code where nullable warnings are ENABLED, which is the only code a \u0060!\u0060 can suppress anything in (a \u0060!\u0060 under \u0060#nullable disable\u0060 is inert and is not counted, and its file\u0027s nodes are not in the denominator). Each one tells the compiler to trust you about null, suppressing the very safety NRTs provide. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4ae9a4afaefbfeb512a0b9a87d1bd44cd285ab1e804e4b89c8cf80f255687dfd"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":3,"secretScannerRunsExcluded":0}},"redactionTokens":["A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."]}]}