{"$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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"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":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D39","name":"IL Efficiency","shortDescription":{"text":"IL Efficiency"},"helpUri":"https://codehealth.canine.dev/dimensions/D39"}]}},"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":"RegexNode.ReduceAlternation (cyclomatic 73): RegexNode.ReduceAlternation 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/RegexNode.cs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ef4c6f3136179abecc59f8be9daef64d574287812fb05656c39091a83755a0"}},{"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":"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":2050}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddba080e4181bd7eb88d5fb0b062832f0ab18af4c9aa6e077a88409cd14fafb5"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexBuilder\u00601.mkOr2 (cyclomatic 48): RegexBuilder\u00601.mkOr2 has cyclomatic complexity 48 (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":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed5e84beec4ebc24d522547a9f6df4a30fb84187b8f476b64806030341b6a95"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexNode.ReduceConcatenationWithAdjacentLoops (cyclomatic 47): RegexNode.ReduceConcatenationWithAdjacentLoops has cyclomatic complexity 47 (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":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":1194}}}],"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."},"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":1813}}}],"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":1063}}}],"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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/RegexNode.cs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7fd8092f336f914e020987c7b738c4f7c5fe89535796ef33858d1eddee9ef47"}},{"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":663}}}],"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."},"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":1586}}}],"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":2393}}}],"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":3122}}}],"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":2816}}}],"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."},"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":2692}}}],"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":433}}}],"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.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."},"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":2482}}}],"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). 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.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."},"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":2612}}}],"partialFingerprints":{"codehealthFindingId/v1":"741623f59654629c4e9828f34dcda33690867ab8e4b6dec1231039e11dc71d92"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexNode.FindAndMakeLoopsAtomic (cyclomatic 17): RegexNode.FindAndMakeLoopsAtomic has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/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."},"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":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a73347ff72f744346dffd10c8252e15c3042cf134f563cbd7624f759dfac499"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexBuilder\u00601.mkOr2 (cognitive 168): RegexBuilder\u00601.mkOr2 has cognitive complexity 168 (threshold 15). Drivers by points: if/else 89, match/switch 76, boolean chains 3 (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":807}}}],"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 85, if/else 42, loops 26, 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":1194}}}],"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 105, if/else 29, boolean chains 8, loops 7 (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":2050}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f49031d03d8eab3444fbfdbbd3567f2fdf1a3e6cc8279b1c1e355c278530035"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexNode.ReduceAlternation (cognitive 142): RegexNode.ReduceAlternation has cognitive complexity 142 (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":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3c6e89cedb565af7ff6306227837865596431f4cb9a138180f65125dba89f2"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtendedRegexParser.ScanRegex (cognitive 133): ExtendedRegexParser.ScanRegex has cognitive complexity 133 (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":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 60, if/else 39, loops 13 (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":2816}}}],"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 49, match/switch 31, loops 21, 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":1813}}}],"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 68, match/switch 30 (nesting depth added 63). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp/Optimizations.fs"},"region":{"startLine":663}}}],"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 64, match/switch 23, 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":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"3861ee95405a1f9f7d0ef18a4835af24f0d54d764d1c8b2973499eec66b5adde"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexNode.ReduceConcatenationWithAdjacentLoops (cognitive 87): RegexNode.ReduceConcatenationWithAdjacentLoops has cognitive complexity 87 (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":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 43, if/else 31, loops 6, 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":"RegexBuilder\u00601.mkConcat2_concatTailCase (cognitive 63): RegexBuilder\u00601.mkConcat2_concatTailCase has cognitive complexity 63 (threshold 15). Drivers by points: if/else 33, match/switch 27, 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":2393}}}],"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 32, loops 24, 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":433}}}],"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, 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":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 27, if/else 20 (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":2612}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea516bd9e064f223fa188f348eb55629093ba7b4c98ef0d6a16ca78e7b53f8ff"}},{"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 33, match/switch 7, 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":3122}}}],"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 24, if/else 15, 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":1586}}}],"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, 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":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 24, if/else 7, loops 7, 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 30, if/else 9, 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":2482}}}],"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, 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":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 28, loops 7 (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":59}}}],"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 19, match/switch 11, 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":"Optimizations.inferLengthLookup (cognitive 33): Optimizations.inferLengthLookup has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 29, boolean chains 2, if/else 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/Optimizations.fs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad71a655f6f107b1c860c13f81fbce815da7734e81f944ce27fcad1a4178328"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexNode.ComputeMaxLength (cognitive 32): RegexNode.ComputeMaxLength has cognitive complexity 32 (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":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 26, match/switch 6 (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 15, match/switch 11, loops 4, 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). 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":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 15, loops 7, match/switch 7, 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":1442}}}],"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, 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":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 11, match/switch 11, loops 4, 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 16, if/else 6, 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":2692}}}],"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, 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":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 13, loops 5, match/switch 3, 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 11, loops 6, boolean chains 2, match/switch 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp/Algorithm.fs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93c1ea0206493dcaed5c887594fa809afbf3d1198204fb034fba7abd8f2367c"}},{"ruleId":"D2","level":"warning","message":{"text":"_17_ThreadSafetyTests.concurrent access with complement and intersection (cognitive 20): _17_ThreadSafetyTests.concurrent access with complement and intersection has cognitive complexity 20 (threshold 15). Drivers by points: loops 8, error handling 7, if/else 3, match/switch 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.Test/_17_ThreadSafetyTests.fs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"32663d6d549b67852f28b8a92339e27c855b627a1c8deaa7b28bd78eb369a554"}},{"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). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. 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":"c5b7a00048dc92f186e3379777d6d7dec5f65b7cd646021888d6460f27a43cb8"}},{"ruleId":"D2","level":"warning","message":{"text":"Optimizations.isTooCommon (cognitive 19): Optimizations.isTooCommon has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6, loops 6, match/switch 6, 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":626}}}],"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 13, loops 6 (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 17, 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":2574}}}],"partialFingerprints":{"codehealthFindingId/v1":"232a656eb73344fbb6a2a08c7efb355ece036ceec227b545f3e743f37754c5b1"}},{"ruleId":"D2","level":"warning","message":{"text":"_17_ThreadSafetyTests.concurrent FirstEnd and LongestEnd (cognitive 17): _17_ThreadSafetyTests.concurrent FirstEnd and LongestEnd has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7, loops 6, error handling 4 (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.Test/_17_ThreadSafetyTests.fs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb97960c2e1616bfdfe1d3e80024e02911c62ab60ad0b77ec932a3e02953453"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexCharClass.AddCaseEquivalences (cognitive 16): RegexCharClass.AddCaseEquivalences has cognitive complexity 16 (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":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 10, if/else 5, 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":381}}}],"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 8, loops 7, 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":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"222819a966201fdb30ad670a551cfb1b696d4444f2eaacdff975d326c62f737b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Resharp/RegexBuilder.fs: FileTooLong \u2014 2484 significant lines (blank, comment-only and punctuation-only lines excluded). To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/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). 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. 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). 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":"TooManyMethods: RegexCharClass: TooManyMethods \u2014 999 significant lines (blank, comment-only and punctuation-only lines excluded), 63 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/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). 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. 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":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"8722c40374c31de9b4c7e3de174bf8b749879f053f5cc1a606d1e8e02efb9925"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Resharp/Optimizations.fs: FileTooLong \u2014 828 significant lines (blank, comment-only and punctuation-only lines excluded). To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/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. 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":"FileTooLong: Resharp/fsil.fs: FileTooLong \u2014 611 significant lines (blank, comment-only and punctuation-only lines excluded). To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp/fsil.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9dcd561207a564bbe995d6f388a1f77875b2651d43ae56c70d3cd13c800105"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AbstractModule: TooManyMethods \u2014 34 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp/fsil.fs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"61cbc01bde69a60a44168874380e4e50e6b52829f367865a1324a2f915d72ffd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): src/Resharp/Optimizations.fs:934-962 | src/Resharp/Optimizations.fs:978-1006 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp/Optimizations.fs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"894308e729ef0c2d1c185b73d5df697e8bd9c344274cb736b8ef0304d68ad586"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/Resharp.Runtime/BDD.cs:516-535 | src/Resharp.Runtime/BDD.cs:546-565 \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/BDD.cs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"de45e1beed0b11c9037a855edbc3648cb677757753b06e9d2a51c83e29bba5b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/Resharp/RegexBuilder.fs:2932-2951 | src/Resharp/RegexBuilder.fs:2983-3002 \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":2932}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fdbbc6aeaf31bdab31455c672055fb81a479e2c2947fbfd97fe407a13a55de4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/Resharp.Runtime/RegexNode.cs:951-965 | src/Resharp.Runtime/RegexNode.cs:1520-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Resharp.Runtime/RegexNode.cs:951\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.Runtime/RegexNode.cs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"567bee96079db450c40af8cade08cdcddcdd0e41d94171f8e4c4b79557fe5371"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/runtime-local/StackHelper.cs:63-77 | lib/runtime-local/StackHelper.cs:158-173 \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":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"744478468206d8a53626711110aa63e849359fc9b3257f6fa3a43db73729b9e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/Resharp/Types.fs:343-356 | src/Resharp/RegexBuilder.fs:398-411 | src/Resharp/RegexBuilder.fs:441-454 \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/Types.fs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"82834b7e72cf96be511a15fa2475730453680ea8f1e3fbdba62010a0ec4e4cb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/Resharp/fsil.fs:150-163 | src/Resharp/fsil.fs:177-190 \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":"8faf220127ba4e49927c6bb25fd7c19643f2a930474ea43b972ce4d4e0050b47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/Resharp/RegexBuilder.fs:941-954 | src/Resharp/RegexBuilder.fs:958-971 \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":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"581da2d99f3f36288573cf8212c59469d2efda0e786ed33bf44efb4dbb1acb65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/Resharp/Optimizations.fs:473-486 | src/Resharp/Optimizations.fs:512-525 \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":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f256131c9df552c828dbe942d8230fb8a924061243538c13f1fddd4678f5c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/runtime-local/StackHelper.cs:50-62 | lib/runtime-local/StackHelper.cs:144-157 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"lib/runtime-local/StackHelper.cs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"39459a867dff2183e83582a6c267fa11338d153c82db340602a7dd6845d3db51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/Resharp/fsil.fs:123-135 | src/Resharp/fsil.fs:136-149 \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. 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/fsil.fs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"8396b1c24197179f9526c6190bdf273b218c3faab28e346160548a3fd7070d1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/Resharp/RegexBuilder.fs:380-392 | src/Resharp/RegexBuilder.fs:424-435 \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":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa366a38b293dc3190cbc7001ac8d63a63eaaf406b7b2f61b947413265a74e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/Resharp/RegexBuilder.fs:985-996 | src/Resharp/RegexBuilder.fs:1010-1021 \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":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd5226f6e074be8d3068d521dc9d9d664c10c3aff3318788747eb4549d25017"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/Resharp/RegexBuilder.fs:2064-2075 | src/Resharp/RegexBuilder.fs:2253-2268 \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":2064}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a6f9223d8161fafd38856419ef1c413b36c8f41bb8271a48ebfeea44216fef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Resharp.Runtime/RegexNode.cs:871-881 | src/Resharp.Runtime/RegexNode.cs:891-902 \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":"6c5d6ad852511f56a9710b9e22f1325a26a7aa30bcfc3f6bf5dcb13a7efcbc73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Resharp/RegexBuilder.fs:2639-2649 | src/Resharp/RegexBuilder.fs:2653-2663 \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":2639}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7dc5e5303fcf3f951ac8d29438274d0643c6da79e894853ad7afa31cf74060f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Resharp/Regex.fs:775-785 | src/Resharp/Regex.fs:820-830 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp/Regex.fs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"146eba18383c6bb31709c09e3dafab11caf4afbcc8436a603a5b855ff1b5f026"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/Resharp/RegexBuilder.fs:1561-1570 | src/Resharp/RegexBuilder.fs:1737-1746 \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":1561}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4115a4f4e282d7184154c25ffc284f05562e876b415d164fb68a768ad3e877a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/Resharp/RegexBuilder.fs:1773-1782 | src/Resharp/RegexBuilder.fs:1798-1807 \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":1773}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b7831a113adcfe545a32a7e049858323b0e043d970fae13d968152816c8df9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/Resharp/RegexBuilder.fs:3153-3162 | src/Resharp/RegexBuilder.fs:3170-3179 \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":3153}}}],"partialFingerprints":{"codehealthFindingId/v1":"4412509f51e0e70aa1eae8792f4fcf8e957f7b02a191583b6ff3faad64893c40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Resharp.Runtime/BitVector.cs:90-98 | src/Resharp.Runtime/BitVector.cs:107-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:90\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":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df4da3425f08cd92232f5fab1064ea212ab37da5b7c2fc6197cc7328a939a4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Resharp/Info.fs:15-23 | src/Resharp/Info.fs:53-61 \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":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5dda64e5695e4f81a3f5a9b2a50d96ade4d3d4bc37d0f0c38db642077021c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Resharp/RegexBuilder.fs:1575-1583 | src/Resharp/RegexBuilder.fs:1751-1759 \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":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a42c0277b0ebbc0f2f1c60c9e436a9f31575088ddb77cbf9ccc4273eeed68e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Resharp/Types.fs:431-438 | src/Resharp/Types.fs:447-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":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"53dc18d3418226b3ac0a5bd82d07de270f4382ab02fa348ff4cca10af32844eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Resharp/Patterns.fs:106-113 | src/Resharp/Patterns.fs:128-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":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2aabdd6631f4cdc599d43ec124f7931e2df090d80e6db4a7619409c02ead71c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Resharp/RegexBuilder.fs:904-911 | src/Resharp/RegexBuilder.fs:1143-1150 \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":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff42738607b7e62124bf7f0c596ad4e696c16b244fd18c21b334c62ddd6fee6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Resharp/RegexBuilder.fs:914-921 | src/Resharp/RegexBuilder.fs:1153-1160 \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":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42515b100822209fb424bac89c499308a8f9d9ae2d70df64382a338661e1b15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 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":"e03450c7aa30e8f38200fa6b4aed45f3c29f3284d7179b7121a44f560444aef0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Resharp/Minterms.fs:57-66 | src/Resharp/Minterms.fs:111-118 \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/Minterms.fs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"52982c95668014ae4e44f8be7adf76f9052d7d38af226bfba36720fa78dfc42f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/Resharp/Patterns.fs:10-16 | src/Resharp/Patterns.fs:34-40 | src/Resharp/Patterns.fs:42-48 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp/Patterns.fs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b19bbb7e05b7a0935ba8f2a3792f920a9b6a49f72b8a9f55d2f40cf7a46bd3"}},{"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":"01c0aea270e3407d8611944ef483b71b77e00d1b90e9012dfc418a0bcd8d9a34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Resharp/RegexBuilder.fs:973-979 | src/Resharp/RegexBuilder.fs:998-1004 \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":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85966f22f51cf90bcc0323bcc21de5ea8fe1a0ad2540736a3ed5483112e7690"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Resharp/RegexBuilder.fs:1144-1150 | src/Resharp/RegexBuilder.fs:1154-1160 \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:1144\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":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"297facfeed4920fac7c6798d7a07e52f843778134946d0d62c304e0f6a69b194"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Resharp/RegexBuilder.fs:2588-2594 | src/Resharp/RegexBuilder.fs:2628-2634 \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":2588}}}],"partialFingerprints":{"codehealthFindingId/v1":"274482558e7de6c1649c6ed19dd6a673a4e91b96dba07156fd5ec2883a4ee44d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Resharp/Minterms.fs:21-27 | src/Resharp/Minterms.fs:81-87 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp/Minterms.fs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"98371a7cc204230b83afc3f461ec5170bf2f3ef7f258bdfdfa757bd4b97aaab0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Resharp/RegexBuilder.fs:1591-1597 | src/Resharp/RegexBuilder.fs:1633-1638 \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":1591}}}],"partialFingerprints":{"codehealthFindingId/v1":"444b239b4c44558b81b703baf4b80bddb61720328bf3a8c2052af95480342c9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Resharp/RegexBuilder.fs:893-897 | src/Resharp/RegexBuilder.fs:898-902 \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":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9a0fe8d307e98df63218f1b44397c6c086b61f0ee8b60ca9269d9b2352c81c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Resharp/RegexBuilder.fs:2172-2177 | src/Resharp/RegexBuilder.fs:2399-2403 \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":2172}}}],"partialFingerprints":{"codehealthFindingId/v1":"f885ef55277eadf6073c309ef7f128ce2d57cd9a63e3d8409200d4d05e0d408b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: 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: 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: 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: 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: 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: StructListBuilder.cs: 0.0% line coverage (0/31)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/StructListBuilder.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc67a6ec0e0b9dc52b8acd148d4643c9fcd6939d7bd22e3951761c97fe7919f9"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: 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: 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: 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: 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: 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: ExtendedRegexParser.cs: 41.1% line coverage (591/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: 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: RegexCharClass.cs: 31.7% line coverage (370/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: RegexNode.cs: 30.5% line coverage (406/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: 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 2343: RegexNode.CanBeMadeAtomic: Cyclomatic 82 with 30.5% 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":"dbe936e699e4a22b66982dfbe4a6ca51edc44d0ddaafac624f179e1b444d8f93"}},{"ruleId":"D8","level":"warning","message":{"text":"CRAP 1865: RegexNode.ReduceAlternation: Cyclomatic 73 with 30.5% 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":"b9772c7fcd02aa4de5494c13bea75ac805ddd21a415505ec73030b458591585a"}},{"ruleId":"D8","level":"warning","message":{"text":"CRAP 1226: ExtendedRegexParser.ScanRegex: Cyclomatic 75 with 41.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/ExtendedRegexParser.cs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"724800ca63174957a8318cd09575e0b785c91dfb8c0042d074b0353aa5d3d4c8"}},{"ruleId":"D8","level":"warning","message":{"text":"CRAP 1164: ExtendedRegexParser.ScanGroupOpen: Cyclomatic 73 with 41.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/ExtendedRegexParser.cs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3ca0164ee8a224c9bd11043bf4cbb37b4995ed2e2d185c50a76ac5a7d7c3f8"}},{"ruleId":"D8","level":"warning","message":{"text":"CRAP 849: ExtendedRegexParser.ScanCharClass: Cyclomatic 62 with 41.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/ExtendedRegexParser.cs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"293a81bb6f38e36653e49fb0c0a218e5b1471b2bd5bf0ea6956c46c7a49905d5"}},{"ruleId":"D8","level":"warning","message":{"text":"CRAP 823: RegexNode.ValidateFinalTreeInvariants: Cyclomatic 48 with 30.5% 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":"f332ea8c778a395fe11a67de151dc749176117a56e5487887bf581ab4d7bd6f9"}},{"ruleId":"D8","level":"warning","message":{"text":"CRAP 790: RegexNode.ReduceConcatenationWithAdjacentLoops: Cyclomatic 47 with 30.5% 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":"c6ad933e032359d1bcd280784aa2e1626736e08dc239ee707831c4c66f505ede"}},{"ruleId":"D8","level":"warning","message":{"text":"CRAP 726: RegexNode.Describe: Cyclomatic 45 with 30.5% 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":"3dc5faea94f65e2bbe99f0f7caf12d2a620850802ca676cc9d582f80e1c55eaa"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: xunit: xunit 2.8.1 \u2014 Legacy \u2014 the publisher\u0027s replacement is \u0060xunit.v3\u0060; migrate the reference to it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d37c8c0e8046c9e8358e976373216abfb78e9fdef63ed53d3edcaa7d2238edcd"}},{"ruleId":"D13","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":"b1419509ca93d6c0ab67a547597cbbfbaf71b7eb69f5692212e26a5c44d45284"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Resharp/Optimizations.fs: src/Resharp/Optimizations.fs changed 2 times in last 90 days, max complexity 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, behind tests written first."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp/Optimizations.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff38360946de26dd6bb826a51f68d4c51a93d957cfa49475f67a1524a499c36"}},{"ruleId":"D16","level":"warning","message":{"text":"single-maintainer \u2014 knowledge-concentration (bus factor) risk: single-maintainer \u2014 knowledge-concentration (bus factor) risk (1 author(s) across 32 commit(s) sampled)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b4b49d961df742f0e507f4cc5c8094fb077ba0391a27fd015d18320865187719"}},{"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":"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":"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":"D19","level":"warning","message":{"text":"Low XML-doc coverage: Resharp.Benchmarks: Resharp.Benchmarks: 0 % XML-doc coverage (0/16)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Benchmarks/Resharp.Benchmarks.csproj"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e691742bc4221673e889084583178ed3354ca14e9997ebb2c0e06cfe686d86"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Keep new const identifiers above this comment.\u0022 \u2014 keep but only if it records why the const was added."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-local/Obsoletions.cs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b2d5ba8dccc8ab81d39e9c02033ff1362f2671a2b83a3c1cb444aad9ef5666"}},{"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":"627f43f80644d060f5f9596465ea5fe8344881a8133c879e26a7a4d725b8e5e4"}},{"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":"64995fb03d27c9654740311766451aced2ea19df6b625e1996ddbe8b351e3f1f"}},{"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":"2162edda7e585fb98261b27155473b9854c7045da26e9efe0bfc4ed6afa6d629"}},{"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":"db3a58df5edf5056f7ec5e3ab9350078674840198844ea3986868fe6c2da5b80"}},{"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":"8bdf5a8404e2fa22a768c651e53259ef9a238aad12fb43465b64a06240f4696d"}},{"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":"fb0ddcb8128e5ea2af0e58ab90cb533a7b5e0adff28e04f8f9654190b96f3d24"}},{"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":"d0a6c57229380d93e588da5faa8a99a4aaedb557f1e45ed08689b083429e310a"}},{"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":"D39","level":"note","message":{"text":"IL efficiency: 10 authored method(s) exceed the IL budget: 10 of 409 first-party methods compile to oversized IL bodies (\u003E 250 instructions); worst: Resharp.Runtime.ExtendedRegexParser.ScanRegex @ src/Resharp.Runtime/ExtendedRegexParser.cs:226, 605 IL instructions; large bodies don\u0027t JIT-inline, which pulled this dimension to 9.5/10; splitting the hottest bodies recovers the most."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Resharp.Runtime/ExtendedRegexParser.cs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b485b83ea9c0f54ea3bcc39388ed0cd3cf0ef6502d4c3da1f721e578dcfc6de"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":9,"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."]}]}